{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VU6RAMR57QIDFKRS2CEVTV5WDN","short_pith_number":"pith:VU6RAMR5","canonical_record":{"source":{"id":"1806.10928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-06-26T19:26:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6fb852dbac5e2148fc7350df9bf9b187d49c01a778a34f4ac16015d334ce2d96","abstract_canon_sha256":"88bae510c7a182649303d41d834bb914fc5db7061ef2a20add05709426083566"},"schema_version":"1.0"},"canonical_sha256":"ad3d10323dfc1032aa32d08959d7b61b5266b7dd805494728644c0ecd8e3d2d7","source":{"kind":"arxiv","id":"1806.10928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10928","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10928v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10928","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"VU6RAMR57QID","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VU6RAMR57QIDFKRS","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VU6RAMR5","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VU6RAMR57QIDFKRS2CEVTV5WDN","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-06-26T19:26:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6fb852dbac5e2148fc7350df9bf9b187d49c01a778a34f4ac16015d334ce2d96","abstract_canon_sha256":"88bae510c7a182649303d41d834bb914fc5db7061ef2a20add05709426083566"},"schema_version":"1.0"},"canonical_sha256":"ad3d10323dfc1032aa32d08959d7b61b5266b7dd805494728644c0ecd8e3d2d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:07.547792Z","signature_b64":"ZNkyzDXujr5jsz9XOMdAobORhYWWvnp3U+osYhbFLzXIJb7hEChFGmwlLdECcDqN1RB4rAHszCjqieEtw87iDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad3d10323dfc1032aa32d08959d7b61b5266b7dd805494728644c0ecd8e3d2d7","last_reissued_at":"2026-05-18T00:12:07.547073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:07.547073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10928","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"doyQ3iA467lSXVfgtdjnjlkhCrCCXFahbt2GDP2+yNKey72JZ/Bv89mE5TLkZlIgMBxYuE8KbVG9nqvO1+dlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:20:14.111579Z"},"content_sha256":"6e833c44d21d4a65de88383f0461c78d29b21b7e78905e040151b1fa009bf2e3","schema_version":"1.0","event_id":"sha256:6e833c44d21d4a65de88383f0461c78d29b21b7e78905e040151b1fa009bf2e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VU6RAMR57QIDFKRS2CEVTV5WDN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Record Linkage to Match Customer Names: A Probabilistic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Bahare Fatemi, David Poole, Seyed Mehran Kazemi","submitted_at":"2018-06-26T19:26:47Z","abstract_excerpt":"Consider the following problem: given a database of records indexed by names (e.g., name of companies, restaurants, businesses, or universities) and a new name, determine whether the new name is in the database, and if so, which record it refers to. This problem is an instance of record linkage problem and is a challenging problem because people do not consistently use the official name, but use abbreviations, synonyms, different order of terms, different spelling of terms, short form of terms, and the name can contain typos or spacing issues. We provide a probabilistic model using relational "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10928","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MI1+keoO99NJy5tcM3ylrBV6LJSqqKAusEOkxz9rdLKkw0JoXKd2utS/1QbopMAZEkY3O03hsz4pVIVHuAiCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:20:14.111983Z"},"content_sha256":"72d79f55a667c62246e6292fc1e517cb151c2e73b4edcb01499e4659d8972647","schema_version":"1.0","event_id":"sha256:72d79f55a667c62246e6292fc1e517cb151c2e73b4edcb01499e4659d8972647"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VU6RAMR57QIDFKRS2CEVTV5WDN/bundle.json","state_url":"https://pith.science/pith/VU6RAMR57QIDFKRS2CEVTV5WDN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VU6RAMR57QIDFKRS2CEVTV5WDN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T14:20:14Z","links":{"resolver":"https://pith.science/pith/VU6RAMR57QIDFKRS2CEVTV5WDN","bundle":"https://pith.science/pith/VU6RAMR57QIDFKRS2CEVTV5WDN/bundle.json","state":"https://pith.science/pith/VU6RAMR57QIDFKRS2CEVTV5WDN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VU6RAMR57QIDFKRS2CEVTV5WDN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VU6RAMR57QIDFKRS2CEVTV5WDN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"88bae510c7a182649303d41d834bb914fc5db7061ef2a20add05709426083566","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-06-26T19:26:47Z","title_canon_sha256":"6fb852dbac5e2148fc7350df9bf9b187d49c01a778a34f4ac16015d334ce2d96"},"schema_version":"1.0","source":{"id":"1806.10928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10928","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10928v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10928","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"VU6RAMR57QID","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VU6RAMR57QIDFKRS","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VU6RAMR5","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:72d79f55a667c62246e6292fc1e517cb151c2e73b4edcb01499e4659d8972647","target":"graph","created_at":"2026-05-18T00:12:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Consider the following problem: given a database of records indexed by names (e.g., name of companies, restaurants, businesses, or universities) and a new name, determine whether the new name is in the database, and if so, which record it refers to. This problem is an instance of record linkage problem and is a challenging problem because people do not consistently use the official name, but use abbreviations, synonyms, different order of terms, different spelling of terms, short form of terms, and the name can contain typos or spacing issues. We provide a probabilistic model using relational ","authors_text":"Bahare Fatemi, David Poole, Seyed Mehran Kazemi","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-06-26T19:26:47Z","title":"Record Linkage to Match Customer Names: A Probabilistic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10928","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e833c44d21d4a65de88383f0461c78d29b21b7e78905e040151b1fa009bf2e3","target":"record","created_at":"2026-05-18T00:12:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"88bae510c7a182649303d41d834bb914fc5db7061ef2a20add05709426083566","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-06-26T19:26:47Z","title_canon_sha256":"6fb852dbac5e2148fc7350df9bf9b187d49c01a778a34f4ac16015d334ce2d96"},"schema_version":"1.0","source":{"id":"1806.10928","kind":"arxiv","version":1}},"canonical_sha256":"ad3d10323dfc1032aa32d08959d7b61b5266b7dd805494728644c0ecd8e3d2d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad3d10323dfc1032aa32d08959d7b61b5266b7dd805494728644c0ecd8e3d2d7","first_computed_at":"2026-05-18T00:12:07.547073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:07.547073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZNkyzDXujr5jsz9XOMdAobORhYWWvnp3U+osYhbFLzXIJb7hEChFGmwlLdECcDqN1RB4rAHszCjqieEtw87iDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:07.547792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e833c44d21d4a65de88383f0461c78d29b21b7e78905e040151b1fa009bf2e3","sha256:72d79f55a667c62246e6292fc1e517cb151c2e73b4edcb01499e4659d8972647"],"state_sha256":"503f75dbd9bcf9a6afe15491ffc44cc0db98df0a76346a18bd0ec0a7c8fbfdb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7/mj2Mwt1voeL0vB2RXLGGDLMRfIBymZkenQxD+xeAck1ZBHvN6aaffpnGmJNPg8vbqFlwLg79RyY8g/KXlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:20:14.115611Z","bundle_sha256":"8ca496a66fb836885943b178275e966bf3b255db318cab8d1a4c579665786449"}}