Cases as nodes. Relationships as edges.
Anchor · DCC Test
Pike v. Bruce Church
1970 · U.S. Supreme Court
Hughes v. Oklahoma
1979 · U.S. Supreme Court
City of Philadelphia v. NJ
1978 · U.S. Supreme Court
Granholm v. Heald
2005 · U.S. Supreme Court
Each edge carries the exact quote that triggered the signal, scanner confidence, and char span in the source opinion. Locked at P2.4 / P3.6.
Pre-empt —
"You wrote the edges to fit the answer." → Scanners are deterministic regex extractors at the law-Mode-A implementation layer (citation formats are strict). Outputs version-controlled. Human overrides flow through needs_human.html and are themselves logged.
Scope (3 layers, see uom-whitepaper.md §4): (1) Extraction PROB — substrate NER, syllogism, embeddings, edge inference. The law-Mode-A regex scanners above are a narrower deterministic case of this layer. (2) Justification J(n) — DET — graph predicate over the edge types listed (§4.2). Same graph → same J(n). No PROB step. (3) Score (F,T,A,C) — DET* — sort key over the justified set (§5). Deterministic given frozen weights. The substrate's DET claim lives at layer 2, not layer 1.