{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RTH6Q4JOJS73AZCNSUV4KKSYLP","short_pith_number":"pith:RTH6Q4JO","canonical_record":{"source":{"id":"1701.01232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-05T07:57:55Z","cross_cats_sorted":[],"title_canon_sha256":"03c5fcb41e24cdfceddb2ae5b33946131c47c1c282b7816c43c45037bc4c6f16","abstract_canon_sha256":"0fce795d0766f6fc3369ac0f2d549fc04d70f9e374ea077746e66e1876e27848"},"schema_version":"1.0"},"canonical_sha256":"8ccfe8712e4cbfb0644d952bc52a585bd67fa3c92de78e80073459399f5a68fb","source":{"kind":"arxiv","id":"1701.01232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01232","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01232v1","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01232","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"RTH6Q4JOJS73","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTH6Q4JOJS73AZCN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTH6Q4JO","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RTH6Q4JOJS73AZCNSUV4KKSYLP","target":"record","payload":{"canonical_record":{"source":{"id":"1701.01232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-05T07:57:55Z","cross_cats_sorted":[],"title_canon_sha256":"03c5fcb41e24cdfceddb2ae5b33946131c47c1c282b7816c43c45037bc4c6f16","abstract_canon_sha256":"0fce795d0766f6fc3369ac0f2d549fc04d70f9e374ea077746e66e1876e27848"},"schema_version":"1.0"},"canonical_sha256":"8ccfe8712e4cbfb0644d952bc52a585bd67fa3c92de78e80073459399f5a68fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:20.107684Z","signature_b64":"afct6IR9zOfDAhtX3UK3njtegRDBvFZjNIsSgadlbDIXqtWgxgWAKVmWZxAN20CWuRVQnUWaU0j92zzpMLfZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ccfe8712e4cbfb0644d952bc52a585bd67fa3c92de78e80073459399f5a68fb","last_reissued_at":"2026-05-18T00:53:20.107262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:20.107262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.01232","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:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z96ZfJXK7pZXmNMMIqOmMp1is/NcoiWAtKlYLfh5BWXL3KxxIi8ltCBFp61+ElZiyij8KvjVeZPEOI1PiymYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:18:22.637624Z"},"content_sha256":"945f48ae7b0736894ee69f6d473f66ced72bf815496a0f15d1226e3af4ebeaee","schema_version":"1.0","event_id":"sha256:945f48ae7b0736894ee69f6d473f66ced72bf815496a0f15d1226e3af4ebeaee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RTH6Q4JOJS73AZCNSUV4KKSYLP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Multi-Database Privacy-Preserving Record Linkage using Counting Bloom Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dinusha Vatsalan, Erhard Rahm, Peter Christen","submitted_at":"2017-01-05T07:57:55Z","abstract_excerpt":"Privacy-preserving record linkage (PPRL) aims at integrating sensitive information from multiple disparate databases of different organizations. PPRL approaches are increasingly required in real-world application areas such as healthcare, national security, and business. Previous approaches have mostly focused on linking only two databases as well as the use of a dedicated linkage unit. Scaling PPRL to more databases (multi-party PPRL) is an open challenge since privacy threats as well as the computation and communication costs for record linkage increase significantly with the number of datab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01232","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:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2r+h7tXy6TtYhoSvuGyadFLysmdwOkhxJ1IOYdhykkr1GWG2hSBxDsrMvRyZJMu91vRxgGZIUQm8wPIz+AFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:18:22.637969Z"},"content_sha256":"8fc6a0c76894a3c53479d31d3711a0bb9ef0cc3d011e6cdf55734d357ed80600","schema_version":"1.0","event_id":"sha256:8fc6a0c76894a3c53479d31d3711a0bb9ef0cc3d011e6cdf55734d357ed80600"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTH6Q4JOJS73AZCNSUV4KKSYLP/bundle.json","state_url":"https://pith.science/pith/RTH6Q4JOJS73AZCNSUV4KKSYLP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTH6Q4JOJS73AZCNSUV4KKSYLP/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-24T19:18:22Z","links":{"resolver":"https://pith.science/pith/RTH6Q4JOJS73AZCNSUV4KKSYLP","bundle":"https://pith.science/pith/RTH6Q4JOJS73AZCNSUV4KKSYLP/bundle.json","state":"https://pith.science/pith/RTH6Q4JOJS73AZCNSUV4KKSYLP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTH6Q4JOJS73AZCNSUV4KKSYLP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RTH6Q4JOJS73AZCNSUV4KKSYLP","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":"0fce795d0766f6fc3369ac0f2d549fc04d70f9e374ea077746e66e1876e27848","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-05T07:57:55Z","title_canon_sha256":"03c5fcb41e24cdfceddb2ae5b33946131c47c1c282b7816c43c45037bc4c6f16"},"schema_version":"1.0","source":{"id":"1701.01232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01232","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01232v1","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01232","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"RTH6Q4JOJS73","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTH6Q4JOJS73AZCN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTH6Q4JO","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:8fc6a0c76894a3c53479d31d3711a0bb9ef0cc3d011e6cdf55734d357ed80600","target":"graph","created_at":"2026-05-18T00:53:20Z","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":"Privacy-preserving record linkage (PPRL) aims at integrating sensitive information from multiple disparate databases of different organizations. PPRL approaches are increasingly required in real-world application areas such as healthcare, national security, and business. Previous approaches have mostly focused on linking only two databases as well as the use of a dedicated linkage unit. Scaling PPRL to more databases (multi-party PPRL) is an open challenge since privacy threats as well as the computation and communication costs for record linkage increase significantly with the number of datab","authors_text":"Dinusha Vatsalan, Erhard Rahm, Peter Christen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-05T07:57:55Z","title":"Scalable Multi-Database Privacy-Preserving Record Linkage using Counting Bloom Filters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01232","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:945f48ae7b0736894ee69f6d473f66ced72bf815496a0f15d1226e3af4ebeaee","target":"record","created_at":"2026-05-18T00:53:20Z","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":"0fce795d0766f6fc3369ac0f2d549fc04d70f9e374ea077746e66e1876e27848","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-05T07:57:55Z","title_canon_sha256":"03c5fcb41e24cdfceddb2ae5b33946131c47c1c282b7816c43c45037bc4c6f16"},"schema_version":"1.0","source":{"id":"1701.01232","kind":"arxiv","version":1}},"canonical_sha256":"8ccfe8712e4cbfb0644d952bc52a585bd67fa3c92de78e80073459399f5a68fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ccfe8712e4cbfb0644d952bc52a585bd67fa3c92de78e80073459399f5a68fb","first_computed_at":"2026-05-18T00:53:20.107262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:20.107262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"afct6IR9zOfDAhtX3UK3njtegRDBvFZjNIsSgadlbDIXqtWgxgWAKVmWZxAN20CWuRVQnUWaU0j92zzpMLfZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:20.107684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:945f48ae7b0736894ee69f6d473f66ced72bf815496a0f15d1226e3af4ebeaee","sha256:8fc6a0c76894a3c53479d31d3711a0bb9ef0cc3d011e6cdf55734d357ed80600"],"state_sha256":"a6d4cd3561fc39fd1da2aa6bcddef2273e3725c3475af2e173a537f5b8fcfaa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5/J9HWrvualYUrZvlbiVi5o+jsi/Zmsla1iUIbI9HwIiS+j+EfjTnAl+GfUAJRxyQcnnXYGVw0r5I3SUm6gBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:18:22.639950Z","bundle_sha256":"c897fd1cdb7752426e3786f8384fba8d513046d1841d34c52a804027654cbada"}}