{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6PO32W5SFJWYNSY23P4ISKQDVO","short_pith_number":"pith:6PO32W5S","schema_version":"1.0","canonical_sha256":"f3ddbd5bb22a6d86cb1adbf8892a03ab9cb4be3470acba60ca2a25968cd3b1dc","source":{"kind":"arxiv","id":"1710.10558","version":2},"attestation_state":"computed","paper":{"title":"Practical Bayesian Inference for Record Linkage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Brendan S. McVeigh, Jared S. Murray","submitted_at":"2017-10-29T03:41:35Z","abstract_excerpt":"Probabilistic record linkage (PRL) is the process of determining which records in two databases correspond to the same underlying entity in the absence of a unique identifier. Bayesian solutions to this problem provide a powerful mechanism for propagating uncertainty due to uncertain links between records (via the posterior distribution). However, computational considerations severely limit the practical applicability of existing Bayesian approaches. We propose a new computational approach, providing both a fast algorithm for deriving point estimates of the linkage structure that properly acco"},"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":"1710.10558","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-29T03:41:35Z","cross_cats_sorted":[],"title_canon_sha256":"f3f6c0ec37ff708c72ee24ede47982b541299f1bf21cd7fbebe0642c0b745d30","abstract_canon_sha256":"268959df4f92b11101335cde6a3e114eebfda53c511eeec851ca80fb659dfb3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:05.416451Z","signature_b64":"zYcV+enKA3FIsXEgQ4e21hGxw/dxQXLTPZMHvg8iZmsjz0Fkw51ZXHFfVqWY+vzVdCHD0XRQ9swNaAH7MMZnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3ddbd5bb22a6d86cb1adbf8892a03ab9cb4be3470acba60ca2a25968cd3b1dc","last_reissued_at":"2026-05-18T00:29:05.415732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:05.415732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Bayesian Inference for Record Linkage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Brendan S. McVeigh, Jared S. Murray","submitted_at":"2017-10-29T03:41:35Z","abstract_excerpt":"Probabilistic record linkage (PRL) is the process of determining which records in two databases correspond to the same underlying entity in the absence of a unique identifier. Bayesian solutions to this problem provide a powerful mechanism for propagating uncertainty due to uncertain links between records (via the posterior distribution). However, computational considerations severely limit the practical applicability of existing Bayesian approaches. We propose a new computational approach, providing both a fast algorithm for deriving point estimates of the linkage structure that properly acco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10558","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.10558","created_at":"2026-05-18T00:29:05.415855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10558v2","created_at":"2026-05-18T00:29:05.415855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10558","created_at":"2026-05-18T00:29:05.415855+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PO32W5SFJWY","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PO32W5SFJWYNSY2","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PO32W5S","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6PO32W5SFJWYNSY23P4ISKQDVO","json":"https://pith.science/pith/6PO32W5SFJWYNSY23P4ISKQDVO.json","graph_json":"https://pith.science/api/pith-number/6PO32W5SFJWYNSY23P4ISKQDVO/graph.json","events_json":"https://pith.science/api/pith-number/6PO32W5SFJWYNSY23P4ISKQDVO/events.json","paper":"https://pith.science/paper/6PO32W5S"},"agent_actions":{"view_html":"https://pith.science/pith/6PO32W5SFJWYNSY23P4ISKQDVO","download_json":"https://pith.science/pith/6PO32W5SFJWYNSY23P4ISKQDVO.json","view_paper":"https://pith.science/paper/6PO32W5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10558&json=true","fetch_graph":"https://pith.science/api/pith-number/6PO32W5SFJWYNSY23P4ISKQDVO/graph.json","fetch_events":"https://pith.science/api/pith-number/6PO32W5SFJWYNSY23P4ISKQDVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PO32W5SFJWYNSY23P4ISKQDVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PO32W5SFJWYNSY23P4ISKQDVO/action/storage_attestation","attest_author":"https://pith.science/pith/6PO32W5SFJWYNSY23P4ISKQDVO/action/author_attestation","sign_citation":"https://pith.science/pith/6PO32W5SFJWYNSY23P4ISKQDVO/action/citation_signature","submit_replication":"https://pith.science/pith/6PO32W5SFJWYNSY23P4ISKQDVO/action/replication_record"}},"created_at":"2026-05-18T00:29:05.415855+00:00","updated_at":"2026-05-18T00:29:05.415855+00:00"}