Source Records
Citation Graph
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.
Render honesty note
Honesty note: jurisdiction US; as of 2026-06-24; not legal advice; code encodes the stated-rule interpretation for this lesson.
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.
Edges supply the example data
The authored data supplies 3 directed edges: hypo to rule, hypo to statute, and rule to statute.
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.
Diagram note
The graph is a neighborhood metric only. It makes no authority-weight claim.
Jurisdiction: US; as of 2026-06-24; not legal advice; Code encodes the stated-rule interpretation.