{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XSITIEI6AQKYXNKSLB5G27EZ2J","short_pith_number":"pith:XSITIEI6","schema_version":"1.0","canonical_sha256":"bc9134111e04158bb552587a6d7c99d24662dbebb2c8aa426bdbe0a23a63275e","source":{"kind":"arxiv","id":"2104.12589","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Transitivity Constraints for Entity Matching in Knowledge Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DL","cs.SI"],"primary_cat":"cs.AI","authors_text":"Ad Feelders, Jurian Baas, Mehdi Dastani","submitted_at":"2021-04-22T10:57:01Z","abstract_excerpt":"The goal of entity matching in knowledge graphs is to identify entities that refer to the same real-world objects using some similarity metric. The result of entity matching can be seen as a set of entity pairs interpreted as the same-as relation. However, the identified set of pairs may fail to satisfy some structural properties, in particular transitivity, that are expected from the same-as relation. In this work, we show that an ad-hoc enforcement of transitivity, i.e. taking the transitive closure, on the identified set of entity pairs may decrease precision dramatically. We therefore prop"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2104.12589","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-22T10:57:01Z","cross_cats_sorted":["cs.DL","cs.SI"],"title_canon_sha256":"a35aa47a33136005e4e3c07cc6c9ee9a0b993ce907f2e6587a35e6eda0e41b6c","abstract_canon_sha256":"74b8a9ae27227f8797c799ee764a4a88f8ae09161195f89b0878e4650760e81c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:58.320734Z","signature_b64":"zOxtQPgVw367qiUf+SrxNdlrnm8z97Efaqqo0yDgEpk0gVTxG5HVVpIzDtDN/CmuxNSrGY3B/9z0Q+qZ3qLSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc9134111e04158bb552587a6d7c99d24662dbebb2c8aa426bdbe0a23a63275e","last_reissued_at":"2026-07-05T02:34:58.320338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:58.320338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Transitivity Constraints for Entity Matching in Knowledge Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DL","cs.SI"],"primary_cat":"cs.AI","authors_text":"Ad Feelders, Jurian Baas, Mehdi Dastani","submitted_at":"2021-04-22T10:57:01Z","abstract_excerpt":"The goal of entity matching in knowledge graphs is to identify entities that refer to the same real-world objects using some similarity metric. The result of entity matching can be seen as a set of entity pairs interpreted as the same-as relation. However, the identified set of pairs may fail to satisfy some structural properties, in particular transitivity, that are expected from the same-as relation. In this work, we show that an ad-hoc enforcement of transitivity, i.e. taking the transitive closure, on the identified set of entity pairs may decrease precision dramatically. We therefore prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.12589","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.12589/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2104.12589","created_at":"2026-07-05T02:34:58.320401+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.12589v1","created_at":"2026-07-05T02:34:58.320401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.12589","created_at":"2026-07-05T02:34:58.320401+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSITIEI6AQKY","created_at":"2026-07-05T02:34:58.320401+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSITIEI6AQKYXNKS","created_at":"2026-07-05T02:34:58.320401+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSITIEI6","created_at":"2026-07-05T02:34:58.320401+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08892","citing_title":"A Symmetric Layer-Union Audit of Component Collapse in Hierarchical Procedural Corpora","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XSITIEI6AQKYXNKSLB5G27EZ2J","json":"https://pith.science/pith/XSITIEI6AQKYXNKSLB5G27EZ2J.json","graph_json":"https://pith.science/api/pith-number/XSITIEI6AQKYXNKSLB5G27EZ2J/graph.json","events_json":"https://pith.science/api/pith-number/XSITIEI6AQKYXNKSLB5G27EZ2J/events.json","paper":"https://pith.science/paper/XSITIEI6"},"agent_actions":{"view_html":"https://pith.science/pith/XSITIEI6AQKYXNKSLB5G27EZ2J","download_json":"https://pith.science/pith/XSITIEI6AQKYXNKSLB5G27EZ2J.json","view_paper":"https://pith.science/paper/XSITIEI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.12589&json=true","fetch_graph":"https://pith.science/api/pith-number/XSITIEI6AQKYXNKSLB5G27EZ2J/graph.json","fetch_events":"https://pith.science/api/pith-number/XSITIEI6AQKYXNKSLB5G27EZ2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSITIEI6AQKYXNKSLB5G27EZ2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSITIEI6AQKYXNKSLB5G27EZ2J/action/storage_attestation","attest_author":"https://pith.science/pith/XSITIEI6AQKYXNKSLB5G27EZ2J/action/author_attestation","sign_citation":"https://pith.science/pith/XSITIEI6AQKYXNKSLB5G27EZ2J/action/citation_signature","submit_replication":"https://pith.science/pith/XSITIEI6AQKYXNKSLB5G27EZ2J/action/replication_record"}},"created_at":"2026-07-05T02:34:58.320401+00:00","updated_at":"2026-07-05T02:34:58.320401+00:00"}