Curate Before You Connect: Identity and Ontology Tagging in a Production Knowledge Graph

• URL: http://arxiv.org/abs/2608.10644v1
• Date: Tue, 11 Aug 2026 08:30:37 GMT
• Title: Curate Before You Connect: Identity and Ontology Tagging in a Production Knowledge Graph
• Abstract summary: This paper describes the ingestion and ontology-tagging layer that turns a validated extraction stream into a knowledge graph.<n>We describe a record-identity ladder that decides sameness from identifier columns, name columns, display names and type-scoped position rather than from name similarity.<n>We quantify the graph's conformance debt, show secondary classifications compensating for a mis-parented primary class, and describe a curation queue grown to 48,403 pending proposals against 775 human decisions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Extraction produces candidate entities and relationships; writing them into a graph is where identity is decided, and identity decisions are destructive in a way extraction errors are not. A wrong type can be corrected later, but two records merged under one identity cannot be separated once their properties have been combined, and the merge leaves no error behind. This paper describes the ingestion and ontology-tagging layer that turns a validated extraction stream into a knowledge graph of 537,157 entities and 2,198,567 relationships drawn from 98,795 government documents. We describe a record-identity ladder that decides sameness from identifier columns, name columns, display names and type-scoped position rather than from name similarity. The ladder governs de-duplication within parsed tables, while the graph write applies a coarser canonical-name key, so records sharing a canonical name merge automatically on exact equality. We argue rather than demonstrate that this is where the automation line belongs: no identity benchmark is reported, and the over-merges the key permits are undetectable by construction. That policy, under which entity resolution only ever flags candidates, followed an incident in which two surface forms of one name were merged, corrupting a correct record and deleting eight entities from an unrelated document. We then describe multi-class ontology tagging and an evidence asymmetry we did not anticipate: an entity name is an instance label rather than a type assertion, so matching name fragments against a class index invents classifications. Requiring anchored evidence cut role assignments on an enriched sample from 36 to 4, all confirmed correct. We quantify the graph's conformance debt, show secondary classifications compensating for a mis-parented primary class, and describe a curation queue grown to 48,403 pending proposals against 775 human decisions.

Related papers

• Separating Disclosure from Authorization: Field-Tier Minimization for Agent Action Mediation [0.0]
  We show that a system that authorizes an action must see enough of it to decide, and a system that attests to its decision must record enough to be audited.<n>We classify each parameter field, not each action class, into three tiers.<n>The central property is that the ledger's commitment is a canonical digest of the full, unminimized parameters.
  arXiv  Detail & Related papers  (2026-08-26T07:45:05Z)
• Operational Identity: A Finite Audit of Declared and Implemented Rules of Sameness [0.0]
  A system can apply consistently and with every record individually correct, a rule of sameness that no artifact declares.<n>A declared identity regime partitions a finite record domain into co-reference classes.<n>A disclosed mechanism induces an operational identity partition of the same domain.
  arXiv  Detail & Related papers  (2026-07-22T21:02:37Z)
• An Ontology-Guided, Deduplication-Aware Extraction Layer for Knowledge Graph Construction from Heterogeneous Documents [0.0]
  This paper presents the design, implementation, and empirical refinement of a production extraction layer that converts a live document stream into a validated knowledge graph aligned to a formal ontology.<n>The relevant slice of a curated ontology is retrieved live from a graph database by embedding similarity and injected into the extraction prompt.<n>Extracted results then pass through a refinement pipeline of five stages: deterministic cleaning, merging across chunks, a second pass for relationships, six deduplication algorithms that require no model inference, and an embedding resolution subsystem whose conflict guard no similarity score can override.
  arXiv  Detail & Related papers  (2026-07-22T09:45:26Z)
• From ambiguous utterances to governed reuse classes: canonicalization, quotient invariance, and conditional decidability [0.0]
  Reuse should operate on a mathematically characterized quotient of resolved conversational demands.<n> Reuse identity licenses the governed query key and its certified answer space.<n>The supporting layer is stated at exactly the strength proved.
  arXiv  Detail & Related papers  (2026-07-11T01:49:04Z)
• Beyond Inference Intervention: Identity-Decoupled Diffusion for Face Anonymization [55.29071072675132]
  Face anonymization aims to conceal identity information while preserving non-identity attributes.<n>We propose textbfIDsuperscript2Face, a training-centric anonymization framework.<n>We show that IDtextsuperscript2Face outperforms existing methods in visual quality, identity suppression, and utility preservation.
  arXiv  Detail & Related papers  (2025-10-28T09:28:12Z)
• AmbigDocs: Reasoning across Documents on Different Entities under the Same Name [46.33718186200757]
  Handling confusing entity mentions is a crucial skill for language models (LMs) We introduce a new benchmark, AmbigDocs, to test this ability. We generate questions containing an ambiguous name and their corresponding sets of answers.
  arXiv  Detail & Related papers  (2024-04-18T18:12:01Z)
• Disambiguation of Company names via Deep Recurrent Networks [101.90357454833845]
  We propose a Siamese LSTM Network approach to extract -- via supervised learning -- an embedding of company name strings. We analyse how an Active Learning approach to prioritise the samples to be labelled leads to a more efficient overall learning pipeline.
  arXiv  Detail & Related papers  (2023-03-07T15:07:57Z)
• Unsupervised Text Deidentification [101.2219634341714]
  We propose an unsupervised deidentification method that masks words that leak personally-identifying information. Motivated by K-anonymity based privacy, we generate redactions that ensure a minimum reidentification rank.
  arXiv  Detail & Related papers  (2022-10-20T18:54:39Z)
• Generating automatically labeled data for author name disambiguation: An iterative clustering method [5.094623170336122]
  This paper shows that labeled training data can be automatically generated using email address, coauthor names, and cited references. High-precision rules for matching name instances on each feature are decided using an external-authority database. Tested on 26,566 instances out of the population of 228K author name instances, this iterative clustering produced accurately labeled data with pairwise F1 = 0.99.
  arXiv  Detail & Related papers  (2021-02-05T16:24:25Z)
• Autoregressive Entity Retrieval [55.38027440347138]
  Entities are at the center of how we represent and aggregate knowledge. The ability to retrieve such entities given a query is fundamental for knowledge-intensive tasks such as entity linking and open-domain question answering. We propose GENRE, the first system that retrieves entities by generating their unique names, left to right, token-by-token in an autoregressive fashion.
  arXiv  Detail & Related papers  (2020-10-02T10:13:31Z)
• Few-shot Slot Tagging with Collapsed Dependency Transfer and Label-enhanced Task-adaptive Projection Network [61.94394163309688]
  We propose a Label-enhanced Task-Adaptive Projection Network (L-TapNet) based on the state-of-the-art few-shot classification model -- TapNet. Experimental results show that our model significantly outperforms the strongest few-shot learning baseline by 14.64 F1 scores in the one-shot setting.
  arXiv  Detail & Related papers  (2020-06-10T07:50:44Z)
• Unsupervised Person Re-identification via Multi-label Classification [55.65870468861157]
  This paper formulates unsupervised person ReID as a multi-label classification task to progressively seek true labels. Our method starts by assigning each person image with a single-class label, then evolves to multi-label classification by leveraging the updated ReID model for label prediction. To boost the ReID model training efficiency in multi-label classification, we propose the memory-based multi-label classification loss (MMCL)
  arXiv  Detail & Related papers  (2020-04-20T12:13:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.