G04 — Entity resolution and reconciliation graph · Graph systems

174 words. Researched design, reviewed 2026-09-12: a library view or proposed design with its sources stated; not a deployed system, a live audit or a provider requirement. Source: Graph/G04-entity-resolution-and-reconciliation-graph.md. Graph systems, shelf 5 of 8; library release 2026.09.12-g40.

Status: NEW RESEARCHED DESIGN; not deployed
Reviewed: 2026-09-12
Nature: library analytical view
Priority: P0
Accountability: R11, R14, R21

Question

Which mentions or imported records refer to the same entity?

Nodes

Mention; Candidate entity; Identifier; Source record; Resolution decision

Relationship sketch

mention → candidate
candidate → supporting identifier
decision → accepted/rejected match

Evidence inputs

Names, identifiers, profile URLs, contextual attributes, conflicts, and reviewer decisions.

Implementation

Generate candidates without merging them. Require corroboration, keep rejected alternatives and confidence rationale, and support reversible merges. Give human reviewers ambiguous cases.

Acceptance checks

Known same-name people remain separate in negative tests
Reversing a merge restores source associations
All accepted matches retain provenance

Do not infer

Vector similarity or identical names are not sufficient evidence of identity.

Publication boundary

Private resolution records; only approved identity references become public.

Source basis

S04, S10, S12. See Research/sources.json. Sources support the primitives or named technology. The organization, labels, actions, and acceptance contracts in this catalog are this library's design, not claimed provider requirements.