{"as_of":"2026-08-09T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96f385c50aafc708dca2c9dab676dff68a8be4cc34f9e970d83fd8cf2d3c2013","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T16:50:52.170021Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.26882/citation-record","integrity":"/paper/2605.26882/integrity","json":"/paper/2605.26882/citation-record.json","paper":"/paper/2605.26882"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Towards distribution-aware query answer- ing in data markets,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:e4a307a4d6dcb654e0253aceeb26944f884118e87380e6faac9585cdf0c72018","observation_id":"7a064dba-8d71-4592-9426-dcd2438fffc2","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Deeper: A data enrichment system powered by deep web,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:47fd20562b9c587ee465d35145e6a70ba8a938c065fd5e48d3ec55b7aa2f55f0","observation_id":"930190bd-8768-440d-ae41-2b507aa8172b","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.10677","last_updated":"2017-11-29T04:29:29Z","snapshot_observed_at":"2026-07-06T06:11:44.900667Z","submitted_at":"2017-11-29T04:29:29Z","title":"Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption","version":1},"cited_work":{"arxiv_id":"1711.10677","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.10677","snapshot_observed_at":"2026-07-03T04:47:38.137515Z","title":"Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption","venue":"cs.LG","work_id":"3292aa71-baf3-4a3d-8525-9b270aed30cd","year":2017},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"cited_paper":"/paper/1711.10677","citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:ed6b830da95901eb4a2b2e0cc97e93bd5c98ee4d4625bc81d7e3645b15b783d1","observation_id":"29bc930b-87e2-4a8e-abd6-a1d2f14b8ad7","resolution":{"observed_at":"2026-06-29T16:53:40.655537Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"The impact of record linkage on learning from feature partitioned data,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:14aa6d2266b0edf69027b21d24206ba994b7664c87d635f726b480cc2e3ea4c8","observation_id":"e7b9da9a-3ad4-4e54-8375-e9cb1c2c8a60","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Fincom, modernizing banking technologies - real time aml sanctions screening & entity resolution,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:5d74ee2825679e4cafe6e07595ec7b584d96678f0e7d119515e8ad3675eabaf3","observation_id":"385747c1-ea4a-4f0b-9351-271868ccd828","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Cohort profile: the swiss childhood cancer survivor study,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:2351c536cff936ed7889dc0b85801f5c8e769d84b22adc7e3108720dc3b1698c","observation_id":"d68720de-2b77-4a67-848a-2e397aa19815","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Datavant match: High accuracy, fit-for-purpose record linkage for any research need,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:48bb5f36c5c434a1427ffda3fcb5ebde1e44318856cd2d76c1e761752296d2d6","observation_id":"8ec37d3f-3f01-4291-a3ab-c0dea2272265","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Amazon publisher service,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:a0dbf78c3a0d003d698b33f71dc2c50140af09b06b93a79541ddc7587f30cfb3","observation_id":"8c5bcb8a-3ec5-469e-ab2b-8d11bab7263a","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Unlock data insights across multi-party datasets using aws entity resolution on aws clean rooms without sharing underlying data,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:84e1b736cc8405f5ff70185a0ddb9320b2d13f51327211f6fa081221e5e03b69","observation_id":"e19161a9-164c-41fc-b7c4-c79a2ec732a1","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Datavant - a data platform company for healthcare,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:826a8b39b5ecf66ce2ace9e2358326963db84c802817c30ec78503ff832590e7","observation_id":"bdbc8e6e-61d6-4fa6-9549-57cd7931c571","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Datavant connect: Linkage solutions,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:9b7074bf6817efe0c3462b434c2c6edab06afc2fe1fc175ee9c419d9a8f8a942","observation_id":"364bd5bc-273b-4292-a7b1-da4248a9981a","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Datavant - data and analytics thought leader: Paul petraro, boehringer ingelheim,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:81ddfa7c4604075303b1f255c14bada17cca5f66800b9ffca533a7cf2ae04fae","observation_id":"d90ae7ce-6ccc-4bb8-94ee-ace614b383e4","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Privacy- preserving record linkage for cardinality counting,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:bdc731ae0e38f3e2a864ea77d42fbf4bb4be3cf8280d06636c48e3f19b830702","observation_id":"69b62652-9e2b-4792-a5ff-ec73c4dab6f6","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Privacy-preserving similarity coefficients for binary data,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:753a27f2b67ce30aba9f949d5820c19d811e62c71bf950d0fb002b4ffd3bd01a","observation_id":"75f04fa0-0181-42f6-8fef-ad1697adbaad","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Secure approximate string matching for privacy-preserving record linkage,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:d2d10d092092093232c24795719091b947161decbd5f644ccf8e0b49d30bfeb5","observation_id":"3dd83f3a-800b-494d-9f36-6ed563b6eb64","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Resilient identity crime detection,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:9c70191b9df2c87329d9dfebf45758a6c555a89ba31401061b18ab532086f85a","observation_id":"12e869ee-d474-458b-877e-783cbf7a1848","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Modern privacy-preserving record linkage techniques: An overview,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:e0942b2a8c379a729c57077a88f88f9d4bd627db29f2e700633ac4871627d505","observation_id":"74dd8dda-d9e5-4a1f-a9e9-aad51fd6b18d","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Sfour: a protocol for cryptographi- cally secure record linkage at scale,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:0e196dc5d6cd54bc12cb1d4e885befad1feeafd857bdbc353cc846f17eb2700f","observation_id":"7a08de75-7b7d-414f-904b-660e41b280c3","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Privacy-preserving record linkage using local sensitive hash and private set intersection,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:df38eb9fdfbdd25ad763447e7a65d85c8b56230a341b5ca88691a49512ae683e","observation_id":"1b7ba881-08f9-45e0-a5a0-61b1a8a81ac9","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Cryptographically secure private record linkage using locality-sensitive hashing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:3d194488176a17212c7c8a3b78a7a47d2f9a082cb72f64c2287adc3a5ab8c304","observation_id":"7d052cf2-772e-492a-9640-508595d5251f","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Composing differential privacy and secure computation: A case study on scaling private record linkage,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:2579e45dc6aff393a181dace082ba246016b383cf838ab6ab7edfd22fdff61c7","observation_id":"af143ee9-80aa-48ed-bc1b-fb72826367b1","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Efficient circuit- based psi with linear communication,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:9751322f36842158bef1aaacd69dfeeea7c2c80d251ad7e517b62301ef0431f3","observation_id":"345c6302-3cf6-4e04-8956-a9fc717a2686","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Circuit-psi with linear complexity via relaxed batch opprf,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:37ae7dded4c9e456788da29b7b5e328b3fb36a661b4490dbbfa4dc2dd7b510c0","observation_id":"f99c9b28-d90a-4bcb-8e85-af06f4cb50ff","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"V ole-psi: fast oprf and circuit-psi from vector-ole,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:c5a24c32dd5ae821907ce09b25ba9ce6e531240c43cadd3edab01c32791945eb","observation_id":"d34878ec-42c6-4c2e-958c-8b4dae1b03cc","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"How to hide circuits in mpc an efficient framework for private function evaluation,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:600669519ccd6e9380a884fc87f037fb8d02ee84f7b74f43246bfb72073c3875","observation_id":"22e62b1d-aee9-4866-8c0a-b10d85c0f631","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"An analysis of one-to-one matching algorithms for entity resolution,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:2ab2b9634a9e9ad4dd7d83456e5d6e3c7639f5d8e84a5c5346e81d6941652ad8","observation_id":"dd7206cb-9b0b-4e1a-8b05-5436da4a4760","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Benchmarking filtering techniques for entity resolution,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:71538e0fed98fad8e252ee5bc535c8836d4c6058b4b5b058420286e847273001","observation_id":"41f773c3-99ed-48e5-b2c5-650899e0adae","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Approximate nearest neighbors: towards removing the curse of dimensionality,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:bcc6d103027d82220f00be7f242e0daae20ff85a025a9a33f6424df879bcf9da","observation_id":"39d00eda-8dc5-4ae3-8ea2-28f40efb5621","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Practical and optimal lsh for angular distance,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:26a2a015da0d7343f40a0aafd9293c04fdcd4a8f37f4c5c8fa0f444754a3cc54","observation_id":"6cd5faa6-3774-4ab4-8315-2763b03318c1","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Goldreich,The Foundations of Cryptography - Volume 2: Basic Applications","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:ecc8d1dc0a2697ec7b46fa68a2fb5304f1be71427949df9847f5cca44246372e","observation_id":"c3d8eab2-154e-46bc-be8d-0a61e9cf30cb","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"How to exchange secrets by oblivious transfer,","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:c2afa37b135bff20b59fd198f9bfda4f47035b08c7c7bf57c7c32faa76e4484e","observation_id":"c3b48fa7-573c-428e-92ce-8ec608391998","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Aby-a framework for efficient mixed-protocol secure two-party computation","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:9bc2025992957fb8b99c2a54c73a08c9c4a46115fbd9241ed15d3ec2efa737a7","observation_id":"5cd9c63a-2bef-42a2-a565-bb38277c525d","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Efficient multiparty protocols using circuit randomization,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:be3168868da3fea86e18320e075146d14e4ce08e314e3f33f9a9b1c875ee6595","observation_id":"d2aeb950-6bd7-4349-a713-bde20d2f5293","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Cryptflow2: Practical 2-party secure inference,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:88e9ac3b6d6103ae95fcccd18f80aa8972dd2eab9066b9ce0955861254c49e66","observation_id":"c932af91-7a24-42d0-8ea2-19f528346a43","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Secret-shared shuffle,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:73804f415a19f41c37a842627a41eb3213c3faf6db6908c4674d200868d0d898","observation_id":"40fb57ca-9e64-4582-a7ab-fee5120177d7","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Large-scale secure xgb for vertical federated learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:171031562911b4ff003d68e4fed28f55af7b4736f9780b165a106f8a2ae3c350","observation_id":"9e8ca5b6-e9af-4335-a315-f788911ae526","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Cheetah: Lean and fast secure{two-party}deep neural network inference,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:46cb591628eeb250be17c6c5688adba0ce7b80c47a619bb45366cc90e971b42b","observation_id":"f50b1a65-5418-4231-99c0-ecf065108da9","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Shuffle-based private set union: Faster and more secure,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:678d14efd2428edaa21403dea44f90f7ea789ade68d62eabf5f5b880d6659a9a","observation_id":"5bbe0389-53c2-4f01-a35f-420ed3f301f0","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Private set operations from oblivious switching,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:1f905832db73a1a7bd18cdd7907a5e09ece5de988724185c2466f3af253c9351","observation_id":"6b94ba34-2bba-4394-858a-4396c89060cc","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"iDASH Privacy & Security Workshop. Se- cure genome analysis competition,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:48029943f4a3f5c276990e939382fcda13aadb6018406abebd083f3f6b614345","observation_id":"10ae3986-150d-4221-b6ab-486e60076dbf","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Evaluation of entity resolution approaches on real-world match problems,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:0e17325a2afee4951657e4887dba1f79af166443ee97e7c05c009b427dcebec3","observation_id":"c045d4c3-391a-4e9e-b6ad-9293d5677011","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Github - gpapadis/continuousfilteringbenchmark: Continuous benchmark of filtering methods for entity resolution,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:6d4ee2c8f3e63e40b9bba9e70e5577fedf0e529480c2378ca2907efd4f0f53ff","observation_id":"0ccc510b-62db-48fe-b457-250d07f0b301","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"British national bibliography,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:1c00cd280e2355b00e01ecd57afa5064613cba74704988e289812c436d1c535f","observation_id":"d1541970-4666-48ca-9473-c68589ea5056","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"The toronto public library open dataset,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:06ed8531ca01ac9a9246b5096f03f6b719ffc2dcb1126cb81a784181eeb8bade","observation_id":"a6d33c2b-0af0-4114-9165-0a56b0de4553","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Strengthening privacy- preserving record linkage using diffusion,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:80f634e363a010e7f1a5114792c32282b695056c79c6ae151361d5c836626cfa","observation_id":"315438c4-ff81-4066-b133-04d0687c9b7c","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Github - youzheheng/2022 popets: Strengthening privacy- preserving record linkage using diffusion,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:c9fa1bd93a43aa3e67f9262d84ff3eab66a0479044519f30cadab64f63c5de2c","observation_id":"42430f63-dd39-4704-a751-a27598fc3626","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Perfectly secure and efficient two-party electronic-health-record linkage,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:49f73925e8581f664096f5ddc1a385385ebde78aeeb77b71dbb0c11324f6d0df","observation_id":"26ceb2de-aa0d-4846-9243-ba73dc318fb2","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Private record matching using differential privacy,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:16e56117bcc3700cb3d5bf48f02076f07a1cfd6e7d0cc8618fb55dba6b194877","observation_id":"5eff646a-b22b-4ab6-8778-5a7f85d7180c","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"A hybrid private record linkage scheme: Separating differentially private synopses from matching records,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:80cfe6d034b776e3a8a015c66771c714f3fc5397221912ae42cdc40586cfbe73","observation_id":"ab041f3a-c240-4ca0-80c5-c7cfe2456657","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Efficient privacy-aware record integration,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:a1295ec2cd0e780efb3a177b83a245b964b1420d296d4dff0d69c6f99746bec5","observation_id":"80fea9f8-f8c2-45c7-8392-e8870afd115c","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Hybrid private record linkage: Separating differentially private synopses from matching records,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:5816f4654153e59db43b4e36db572b6b5e660060f02e0ab55a6732eb58f01355","observation_id":"a80843c3-82b2-49e5-879f-69097801c036","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Privacy-preserving record linkage using bloom filters,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:01065f2e760dc6eac67d4531a9697c08e68f958ecda73e07147e4e6ab68e4e42","observation_id":"206e63d2-e220-4148-8da7-ad6817627daf","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Application of privacy- preserving techniques in operational record linkage centres,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:ff5e42fa6106b1e27fe125d5be31a95af9bc220b258b30be62bd18952841136f","observation_id":"636ca49f-6307-4d2d-9e04-c3c2089add86","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"A constraint satisfaction cryptanalysis of bloom filters in private record linkage,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:417cd94d00ac38d05be6b34cf3254ab394282c41a8c6fc8ccae64f3f25b09e32","observation_id":"5dd5380e-9ef6-4e1e-9f6a-667710011f99","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Cryptanalysis of basic bloom filters used for privacy preserving record linkage,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:b2478fdf0f84b1dd153e6658cf35a40fc0d50142338fed384801cbeae7385004","observation_id":"1029295c-c263-49a7-8610-4e5f95776614","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Efficient pattern mining based cryptanalysis for privacy-preserving record link- age,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:7bd2e136e113bf554b3d12d16eaf69a774c1adc0fd638be2414efe00f45fc115","observation_id":"cb5e716c-bc28-40e4-b5b6-ebd78f3b4184","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"A graph matching attack on privacy-preserving record linkage,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:31b9670450dfa52192a179b2a2aeacdad4567e5c11e925b404dbf29a22345b25","observation_id":"2c330aeb-c7f4-4f01-a109-d89a3982d315","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Linking sensitive data,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:5dbacbe1252b5ca7ff5da45a497fb94e1d9ac59501453d006906178b403c559a","observation_id":"e322ebf1-26a0-4783-81ca-7a4077eea638","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Securing bloom filters for privacy- preserving record linkage,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:c5ac21c9c98d0f5a78888010717b6652de8e34b08b518158b2830d748075e7b0","observation_id":"8eb0f37c-2f3b-48b4-b9ff-a894227f2e3e","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Evaluation of hardening techniques for privacy-preserving record linkage","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:53ffd94ecd9cb248430587aab4fafd60d9ed9000c9f27866545a3a721261118e","observation_id":"c4506e9a-ee73-425f-924d-342a062153e9","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"A taxonomy of privacy- preserving record linkage techniques,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:af29f218532b0889ab48a56d374ac2e7c3d59151f92047817ee6474d36215e36","observation_id":"bf016c86-b27e-4f11-bba3-38605158f9a6","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:50:52.170021Z","title":"Privacy-preserving record linkage for big data: Current approaches and research challenges,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-29T16:50:52.170021Z"},"links":{"citing_paper":"/paper/2605.26882"},"observation_digest":"sha256:ded5f25ea310718b0b5ea32ca11a2169386cb4852fff4c88bf30992117902742","observation_id":"76efd55d-f4f8-44f0-9c39-bf26704a7c41","resolution":{"observed_at":"2026-06-29T16:50:52.170021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.26882","last_updated":"2026-05-26T11:43:29Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-07-06T23:36:39.472687Z","submitted_at":"2026-05-26T11:43:29Z","title":"Privacy-Preserving Screening for Record Linkage"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":61,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":62},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 0 inbound Pith citation observations for arXiv:2605.26882."}