A citation graph derives degree and reachability from directed edges. Honesty note: jurisdiction US; the pinned first step states the as-of date; not legal advice; code encodes the stated-rule interpretation.

highlighted = computed this step

Render honesty note

Honesty note: jurisdiction US; as of 2026-06-24; not legal advice; code encodes the stated-rule interpretation for this lesson.

US as of 20260624\text{US as of }2026-06-24

A citation graph starts with nodes

The toy graph has source nodes for an FRCP rule, a statute section, and a worked hypo. The compiled graph has 3 nodes.

nodes=3\text{nodes}=3

Edges supply the example data

The authored data supplies 3 directed edges: hypo to rule, hypo to statute, and rule to statute.

edges=3\text{edges}=3

Degree and reachability are recomputed

For the worked hypo, degree is 2 and the reachable-node count is 2. Both values are recomputed from edges, not authored as sidecars.

degree=2,reach=2\text{degree}=2,\quad \text{reach}=2

Diagram note

The graph is a neighborhood metric only. It makes no authority-weight claim.

graph metrics only\text{graph metrics only}

Jurisdiction: US; as of 2026-06-24; not legal advice; Code encodes the stated-rule interpretation.

Citation graphhypo->frcp6 applieshypo->usc1332 appliesfrcp6->usc1332 cross_refsWorked hypoid hypo in0 out2 deg2 reach2FRCP sixid frcp6 in1 out1 deg2 reach1Section thirteen thirty twoid usc1332 in2 out0 deg2 reach0