Skip to content

Record Reconciliation

Core Idea

Matching records from one naming system to entities in another and declaring, per pair, a typed sameness verdictequivalent, near-match with stated loss, ambiguous, or no-match — paired with an explicit statement of what the match preserves and loses. The payload is the persistent, citable, typed claim of cross-system sameness; the mapping is the joint, not the merge, so each system keeps its own granularity.

How would you explain it like I'm…

Same Kid, Two Lists?

Imagine you have two boxes of name tags for the same group of kids, but each box spells the names a little differently. You go through and match up which tag in one box means the same kid as a tag in the other box. Record Reconciliation is making that list of which name goes with which, and writing down when you're sure, when you're guessing, and when there's no match.

Which One Is the Same?

Two different systems each have their own names or ID numbers for some of the same things — like one school calling a student 'Robert Smith' and another calling him 'Bob Smith, ID 4471.' Record reconciliation is the job of matching them up and writing down, for each one, exactly how they match. The answer isn't just 'matched' — it's a specific type: the same thing, a close-enough match but some details don't carry over, too unclear to pick just one, or no match at all. You also write down what each match keeps and what it loses, and you save this matching as a real document people can look up and review, not just a guess made in someone's head.

Typed-Match With Named Loss

Record Reconciliation is the pattern of matching records or names from one system to entities in another, declaring which pairs refer to the same thing, and making that mapping queryable and auditable with explicit notes about what is preserved and what is lost. Two systems each carry their own naming scheme over partly overlapping things, and the reconciler asks, for each record on one side, 'what, if anything, on the other side is the same?' — giving a typed answer: equivalent (genuinely the same), near match with stated loss (aligned enough for a purpose, but some attributes don't carry across and the loss is named), ambiguous (several candidates match, so it refuses to pick or escalates), or no match (nothing corresponds, with the reason recorded). The real payload isn't the comparing; it's the lasting, citable, reviewable claim of cross-system sameness with the conditions made explicit. It's a joint, not a merge: each system keeps its own granularity and history, and the mapping just records how they correspond — without forcing them to become one.

 

Record Reconciliation is the structural pattern of matching records or names from one system to entities in another, declaring which pairs refer to the same thing, and making the resulting mapping queryable and auditable with explicit conditions of preservation and loss. Two systems each carry their own naming or identifier scheme over partially overlapping referents; the reconciler asks, for each candidate record on one side, 'what, if anything, on the other side is the same?' and produces a typed answer: equivalent, where the records refer to the same entity in a way the systems agree counts as identity; near match with stated loss, where they align well enough for a purpose but specified attributes do not carry across, the loss named rather than hidden; ambiguous, where multiple candidates plausibly match and the reconciler refuses a single binding or escalates; and no match, where nothing corresponds, with the reason recorded. The structural payload is not the act of comparison but the persistent, citable, reviewable assertion of cross-system sameness with its conditions made explicit. The pattern composes a small role-set: two naming systems with overlapping but not identical referents, a per-record decision from a finite typed vocabulary, an explicit preservation-and-loss clause for each non-equivalent match, a persistent mapping artifact rather than ad-hoc inference, and an update discipline for when either system changes. The force is the typing of the sameness claim together with its named loss: by refusing a single undifferentiated 'matched' verdict, the pattern controls exactly the inference downstream consumers may draw. The mapping is the joint, not the merge — each system keeps its own granularity and history, and the reconciliation records how they correspond without forcing convergence.

Broad Use

  • Cultural heritage: catalog entries reconciled to authority files so differently-spelled names resolve to one entity.
  • Scholarly identity: publication records reconciled to person identifiers across disambiguation pipelines.
  • Bioinformatics: gene names across registries reconciled, the mapping table with its one-to-many cases the load-bearing artifact.
  • Customer and patient data: master-data management reconciling heterogeneous source records into one canonical identity.
  • Trade and clinical coding: shipment descriptions reconciled to harmonized codes, narrative diagnoses to code sets.
  • Cross-jurisdictional law: a foreign judgment or marriage reconciled to a domestic legal category with explicit carry-across.

Clarity

Forces an explicit distinction between three otherwise-conflatable claims — that two records are the same, can be used as the same for a purpose, or share enough to link but not identify — so systems stop propagating identity claims they cannot defend.

Manages Complexity

Turns distributed, repeated, error-prone matching into one inspectable, updatable artifact whose errors are typed and visible rather than scattered and silent, while letting each system keep its own internal logic.

Abstract Reasoning

Makes the typing of the claim the central reasoning act, because the match type bounds the inference a consumer may draw — and predicts the pathologies: untyped matches collapse distinctions, hidden cardinality merges referents, unstated loss lets consumers over-claim.

Knowledge Transfer

  • Authority control → genomics: the role-set (source record, target entity, match type, preservation conditions) lets a practitioner read a gene-mapping table with the same questions used for a bibliographic crosswalk.
  • Finance: a customer record reconciled against a sanctions list mirrors a museum specimen reconciled against taxonomic registries.
  • Across the family: the discipline — type every match, name the loss, make ambiguous cases visible, define an update discipline — transfers within reference-system practice.

Example

A local catalog's author records are reconciled against a global author-identifier registry: equivalent where dates and affiliations agree, near-match-with-loss where the registry conflates two pseudonyms the catalog keeps separate, ambiguous where three entries share a name (escalated rather than guessed), and no-match for a regional author absent from the registry.

Relationships to Other Primes

One-hop neighborhood: parents above, mutual partners to the right, children below.Record Reconciliationcomposition: Equivalence RelationEquivalenceRelation

Parents (1) — more general patterns this builds on

  • Record Reconciliation presupposes, typical Equivalence Relation — A typed cross-system sameness verdict (equivalent/near-match-with-loss/ambiguous/no-match) that deliberately BLOCKS the transitive closure an equivalence_relation enjoys; presupposes the equivalence machinery precisely to control where it must not apply across two sets. (Owner may prefer parentless.)

Path to root: Record ReconciliationEquivalence Relation

Not to Be Confused With

  • Record Reconciliation is not Provenance because provenance records intra-system lineage (where a record came from), whereas reconciliation records a cross-system sameness claim between two records in different regimes.
  • Record Reconciliation is not an Equivalence Relation because an equivalence relation is transitive identity within a set, whereas reconciliation is a partial, typed claim across two sets where transitivity is precisely the failure mode to block.
  • Record Reconciliation is not Native-Category Flattening because flattening is the failure mode of imposing one system's partition on another's data, whereas reconciliation is the positive discipline whose absence produces it.