{"as_of":"2026-08-08T05:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a99087ceb09653996a49d8d4123ab973c5e3523adce3005500dfc94e65124170","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:13:16.686599Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.00566/citation-record","integrity":"/paper/2506.00566/integrity","json":"/paper/2506.00566/citation-record.json","paper":"/paper/2506.00566"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:21.188544Z","title":"Multi-party private set intersection in vertical fed- erated learning,","venue":null,"work_id":"b45e9556-3344-4109-91e6-610839ef3e8b","year":2020},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:11.848530Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:0dfef4a5ad5916ba14deb24b5e4e8cae6164ab5780b734371e0c0e44c684b3a3","observation_id":"5155866e-8b9e-4e28-91c7-bfd74593368b","resolution":{"observed_at":"2026-08-07T12:13:21.271509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:20.952765Z","title":"Privacy-preserving integration of medical data: a practical multiparty private set intersection,","venue":null,"work_id":"063cbfb4-6c43-4339-a5b4-c71279f1402f","year":2017},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:11.946799Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:d2d2c5dc70993653c74340843afa9f82073fbc1e99b10ff83271790f8a0b427b","observation_id":"38636e29-6928-49b3-aff7-1fd4625a282d","resolution":{"observed_at":"2026-08-07T12:13:21.052675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:20.769299Z","title":"Practical multi-party private set intersection from symmetric-key tech- niques,","venue":null,"work_id":"e56604af-1ebf-4c72-a1a6-21d9824044e6","year":2017},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.031941Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:ccca34870caa7f004db376b20147d2e9a62c591a37df986c213d79ad357479f1","observation_id":"6d1d0ced-cb94-478d-9b37-633eb6e66b5e","resolution":{"observed_at":"2026-08-07T12:13:20.878774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:20.627928Z","title":"Efficient scalable multiparty private set-intersection via garbled bloom filters,","venue":null,"work_id":"9a6d92d4-e704-4c2d-9110-7e6133490049","year":2018},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.170701Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:011245decab8c0a56557b1b761bf3daf62cc663f134e766d89d9020ff286f92a","observation_id":"d51e02fe-43e7-4a81-8b20-f003bb0b0a65","resolution":{"observed_at":"2026-08-07T12:13:20.686095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:20.514495Z","title":"Sok: Collusion-resistant multi-party private set intersections in the semi-honest model,","venue":null,"work_id":"d6223dfd-9618-4ca0-b42c-a64b9fd33af8","year":2023},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.253894Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:e5548a0757a256079c80f49d111831948c7cd20e72b8f5609391da109901c91c","observation_id":"be75c8f0-86df-49f7-936c-9928115337fc","resolution":{"observed_at":"2026-08-07T12:13:20.566274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:20.365899Z","title":"Multi-party private set inter- section protocols for practical applications,","venue":null,"work_id":"bb667fd8-cd6f-468d-9f7f-027b05b852f0","year":2021},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.357253Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:7a515cf77b9726499d132df4effd384ee84f0662e185f78d12978689c84b030d","observation_id":"9038a53d-0e78-41b6-8dc5-245f30075ad5","resolution":{"observed_at":"2026-08-07T12:13:20.429526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:20.241145Z","title":"Practical multi-party private set intersection protocols,","venue":null,"work_id":"ab95b2ee-af3e-41a9-b6de-46d77d827366","year":2021},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.455982Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:33e0da431e76fe2672165989126032df1d4bcdf43c9b01579c509d81abb3c19e","observation_id":"4642f0ef-307d-4e58-8100-a50985800953","resolution":{"observed_at":"2026-08-07T12:13:20.280803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:20.130328Z","title":"Fast multi-party private set operations in the star topology from secure ands and ors,","venue":null,"work_id":"0f126321-5ef8-4112-b1c5-95aa7931f8c1","year":2022},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.550203Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:91aa0d839a1b9bd2e5bed2b4bf20e2b8c41dc07b4ff85005742b8832684efa51","observation_id":"a6287b63-6d8c-47b0-88dc-36939c596f60","resolution":{"observed_at":"2026-08-07T12:13:20.178572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:20.061879Z","title":"Efficient linear multiparty psi and extensions to cir- cuit/quorum psi,","venue":null,"work_id":"3337975f-e85b-4d07-836e-29ced3c55a87","year":2021},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.659107Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:b545074cd3b17246589697cec7c1f990c08aa502e0e80eb474b8f9f8c387718c","observation_id":"80bda7df-dfb1-40a6-be89-944d1d8ca851","resolution":{"observed_at":"2026-08-07T12:13:20.093611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T12:13:12.735666Z","title":"Obliv- ious key-value stores and amplification for private set intersection,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.735666Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:c31ea361abda8861fcb5aad1a9e09370c6f0636f63e923a237c56edab8fc9821","observation_id":"d959a2bb-3e3e-4e7b-8746-c7ede73f72ae","resolution":{"observed_at":"2026-08-07T12:13:12.735666Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:19.936468Z","title":"Simple, fast malicious multiparty private set intersection,","venue":null,"work_id":"08412133-2588-4aae-9cfa-3ef300531916","year":2021},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.813224Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:8ad950d58793f1ebe98402e70f28783da4ac70799c276726ae73ce53aee1e8da","observation_id":"4086288c-1069-4688-8dc5-076efa36c2c3","resolution":{"observed_at":"2026-08-07T12:13:19.988907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:19.817545Z","title":"Efficient scalable multi-party private set intersection using oblivious prf,","venue":null,"work_id":"ef358f0d-4ec3-4d47-a411-8370595e356b","year":2021},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.893767Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:68e4cac94cb14c9919a80c7c7df03bacc55f512a4e48e0fb51ca809670826629","observation_id":"1a7b9544-8d7a-4094-b844-340737d7c5ba","resolution":{"observed_at":"2026-08-07T12:13:19.874142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:19.688159Z","title":"Efficient batched oblivious prf with applications to private set intersection,","venue":null,"work_id":"d2bffec5-a28a-49d7-b885-8a20ff5ea06b","year":2016},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.925180Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:f29578c467b2a3d16a16c9fd5e8032c37425287af4b0d22399fbf6d3531b9cc8","observation_id":"8590b039-ab25-4eae-930c-1a1d44bff354","resolution":{"observed_at":"2026-08-07T12:13:19.740728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:19.546883Z","title":"A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party,","venue":null,"work_id":"8ab410c8-b2c8-40d1-90f7-78cbb85cad73","year":1986},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:12.989566Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:9abcba011344cd683b5e33c7920bf3e736f09b2f6c54bbc204323c019cd7eb67","observation_id":"b4b8f079-e2e0-45d3-a600-1e8172f32860","resolution":{"observed_at":"2026-08-07T12:13:19.598472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:19.405175Z","title":"Spot-light: lightweight private set intersection from sparse ot extension,","venue":null,"work_id":"2b6c03e0-c154-4046-ae0d-95617b4893a1","year":2019},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.084304Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:dc5ba4cb7fe2bad1e44075fcc29df1e7f4edb8efb208bc5de9a7e6d311ce95eb","observation_id":"a80d6f1f-6d30-4224-9a60-3f07ab206c0c","resolution":{"observed_at":"2026-08-07T12:13:19.464134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:19.209357Z","title":"Private set intersection in the internet setting from lightweight oblivious prf,","venue":null,"work_id":"a65195c0-32d0-410e-a78b-1df18db25e50","year":2020},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.155385Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:3bb2dc3a9bcd4d2c8e7d06492a852be7d426fe8966efc08d59618d9042b14a03","observation_id":"b3b4dea8-1899-4119-9d48-41308b0ba2e6","resolution":{"observed_at":"2026-08-07T12:13:19.307155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:19.082107Z","title":"V ole-psi: fast oprf and circuit-psi from vector-ole,","venue":null,"work_id":"76259572-f560-4fff-96ed-9f13f1ea0afa","year":2021},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.244349Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:a0da6a4f5238e39699ade0ca1dadad50ca0a4a2071e7f0146eb9b8815cc9fff3","observation_id":"3b829ad8-4a42-4e10-9cf8-5c09efa5a971","resolution":{"observed_at":"2026-08-07T12:13:19.147025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T12:13:13.341343Z","title":"Blazing fast psi from improved okvs and subfield vole,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.341343Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:ecda570be8dafa5e25539fd0fb9661c1ab6f02779b42f817cbbdd81dab0380c9","observation_id":"cd319105-c1cf-4d1a-be30-c672377f4fa4","resolution":{"observed_at":"2026-08-07T12:13:13.341343Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.949246Z","title":"Private set intersection from pseudorandom correlation generators","venue":null,"work_id":"16da6477-404a-41ec-88e4-741fff680d96","year":2022},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.406486Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:8ab344500d0459bb3b2d2f426101db4fb99254fb24d481c21a03d22aa6c5afac","observation_id":"4e8585e1-d258-4ae7-aa19-84cee5246afa","resolution":{"observed_at":"2026-08-07T12:13:19.005112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.878309Z","title":"Keyword search and oblivious pseudorandom functions,","venue":null,"work_id":"dd6223a3-a596-4724-bb8f-6737d66f165a","year":2005},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.505304Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:8b9805ae264ea20cf78a685b5fb9144f5438badd064cbbec3c86ffa664f6bc69","observation_id":"bae711cd-8391-4fec-900e-6e8261a1b848","resolution":{"observed_at":"2026-08-07T12:13:18.905156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.791844Z","title":"Privacy-preserving set operations,","venue":null,"work_id":"79d7483a-0a9b-431b-84c4-acfcf16371fa","year":2005},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.567327Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:c70339682ac248a4a055076842358827178bf1855b649f6cb4ad8e062dc61b24","observation_id":"e0ac98d3-6310-4c1c-b4f7-848750064829","resolution":{"observed_at":"2026-08-07T12:13:18.830869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.735204Z","title":"An unconditionally secure protocol for multi-party set intersection,","venue":null,"work_id":"e8c57855-f0b1-44c6-992d-c3242de3840a","year":2007},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.636153Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:02999eb6f8375357fa80ce753e4c05d35605bce062efd48c0e208b1132e46065","observation_id":"abc14a2b-ec61-4451-be34-4fcf8532ce1e","resolution":{"observed_at":"2026-08-07T12:13:18.761344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.649194Z","title":"Information theoretically secure multi party set intersection re-visited,","venue":null,"work_id":"a002f826-1fa2-4667-80e6-d29bc7fbc3a1","year":2009},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.732974Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:092509acabaa8d4eeaa3a12e29026a033f3b3673a132ebbe0e3194e6c6f0279f","observation_id":"b5d7b2a9-e577-423d-a543-1c56fc04fa80","resolution":{"observed_at":"2026-08-07T12:13:18.690170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.575067Z","title":"Round efficient unconditionally secure mpc and multiparty set intersection with optimal resilience,","venue":null,"work_id":"5599404d-178b-4a74-892f-fd5482971bfd","year":2009},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.794645Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:003d36192983268525e5d60c7c5024f54aa41d13585d54faa21f41f8f471e94d","observation_id":"513e160a-ce4c-4702-b4cd-b12c7352d1be","resolution":{"observed_at":"2026-08-07T12:13:18.609018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.516336Z","title":"New approach to set representation and practical private set-intersection protocols,","venue":null,"work_id":"ba59d9db-6997-4962-81f8-7e03feb02a19","year":2019},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.852570Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:6dba3287091a7f96ac1236666c9a04be10f2807ebbfdf4ccfcaf56b989630b8a","observation_id":"4dc1948e-5116-4d97-bc82-6fcee704799c","resolution":{"observed_at":"2026-08-07T12:13:18.532750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T12:13:13.935656Z","title":"When private set intersection meets big data: an efficient and scalable protocol,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:13.935656Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:4c5aa674a9728d30d2f6faa7d98ede24057787def93560f322705e760b0ef784","observation_id":"940f6ffa-7791-47d7-a8d1-d76ca0afe213","resolution":{"observed_at":"2026-08-07T12:13:13.935656Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.437653Z","title":"Psimple: Practical multiparty maliciously-secure private set inter- section,","venue":null,"work_id":"23b5f3cb-2407-4ff7-a722-6116bd6fac4d","year":2022},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.003805Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:020e4282232e53ad19b0617e839d311a6c5cf152315fe1bc32522e48fe5ce689","observation_id":"1f8b076b-122f-43aa-9af5-e6decbb446e8","resolution":{"observed_at":"2026-08-07T12:13:18.469531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T12:13:14.094721Z","title":"Efficient private matching and set intersection,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.094721Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:e33c2aa66efab69740d8e355f357ea91cf6c317ac1d19bf7132a802e03d2c3a3","observation_id":"38d409e1-0d9c-4895-a14f-2b908d5c85e7","resolution":{"observed_at":"2026-08-07T12:13:14.094721Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.310674Z","title":"The communication complexity of thresh- old private set intersection,","venue":null,"work_id":"1ce8e56d-14a0-4811-a2e8-09088a064951","year":2019},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.161218Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:fa2489f0dfbd9681047f69f75a1a051a85a061014debd452068199c6500347cf","observation_id":"0156cc8a-a3f9-45e2-aa26-9103bb5599e8","resolution":{"observed_at":"2026-08-07T12:13:18.352829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.208151Z","title":"Multi- party threshold private set intersection with sublinear communica- tion,","venue":null,"work_id":"4f5b13ba-76f3-4cb1-ab42-d9f02bb1bf28","year":2021},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.260861Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:67f6b086c93e6fa259b76d698db0142cb33834ac11e9c8b2f5035e95b720d308","observation_id":"c8572517-806d-4473-a36a-4d16cc3de969","resolution":{"observed_at":"2026-08-07T12:13:18.242579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.157853Z","title":"Efficient multiparty probabilistic threshold private set intersection,","venue":null,"work_id":"72d86b6f-9e80-4bbf-9113-63d2f869f82a","year":2023},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.350140Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:687e6055d2db06868139fb6f127ba7eee8e9b99b643d3fab32d125e3ccb8eea7","observation_id":"b122dcc6-670d-48ac-915b-be97e8c2ccf7","resolution":{"observed_at":"2026-08-07T12:13:18.187743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:18.054256Z","title":"Fast database joins and psi for secret shared data,","venue":null,"work_id":"19a6a9f9-1ddb-4e49-a01b-4f6e37d690b2","year":2020},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.424240Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:3c38542c4311c8fd8de545504548fc39d0ee10eaa093410d33d188af33f55eb0","observation_id":"052746f8-e4eb-4121-90e9-6e3c2f0af241","resolution":{"observed_at":"2026-08-07T12:13:18.104349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:17.956985Z","title":"Secure and efficient multiparty private set intersection cardinality","venue":null,"work_id":"641687c0-9282-4b63-a376-15faa7c07184","year":2021},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.501213Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:8062fa8b157a6df87db3d8a87f320b36e154957a012c1f240b163e0f38eb6040","observation_id":"8ea22c3f-2e55-4e0f-98a6-b8ae3f9571e8","resolution":{"observed_at":"2026-08-07T12:13:18.000117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:17.879978Z","title":"Accountable private set cardinality for distributed measurement,","venue":null,"work_id":"75eb3409-07da-41be-9d7d-f8fe3285637e","year":2022},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.600830Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:af90e021c22fa3cc9dc021cecb4b14d81cd565739e23855be069d5a3d1764edf","observation_id":"b67aa0c7-7bf9-4bea-8ab3-39c53175227d","resolution":{"observed_at":"2026-08-07T12:13:17.913083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:17.795147Z","title":"Multiparty private set intersection cardinality and its applications","venue":null,"work_id":"ea019ea1-b6d4-455c-9a1f-05605b8c3c56","year":2022},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.667655Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:925c473fbaa4dbb3af9e7abc4fca1108139bf35883b5f1a2151990e6478eb0a0","observation_id":"dc130277-2e37-4640-976b-1ae0010482d0","resolution":{"observed_at":"2026-08-07T12:13:17.839826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:17.677356Z","title":"Empsi: Efficient multiparty private set intersection (with cardinality),","venue":null,"work_id":"0fa3eac8-1a24-48ba-b85e-2b26017de4fd","year":2024},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.750206Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:d635deb772d3a80127494b7eb3487633e9f9fab2cca761638be7f2b36b0fada4","observation_id":"9c26b7d6-855c-4950-aafd-00db1ea7d6d6","resolution":{"observed_at":"2026-08-07T12:13:17.735585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:17.585819Z","title":"How to exchange secrets with oblivious transfer,","venue":null,"work_id":"31a39156-d1cf-4c5b-a008-a59938a254e5","year":2005},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:14.859457Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:24f3fb5c3f02eea45aafaef486874d41b379c0dcb79a752b2c0938d5d7972aa5","observation_id":"441fa110-4f9d-4c41-9c16-c29effba86f7","resolution":{"observed_at":"2026-08-07T12:13:17.616475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:17.483162Z","title":"Efficient oblivious transfer protocols","venue":null,"work_id":"8cb3fed5-1f6c-4be3-b91a-81db1f808566","year":2001},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:15.220011Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:d1d3ff35d7136be14b9c575b68d6a013d87067977653e54355545084414d6805","observation_id":"b174ee4b-8d13-490f-90d3-af72f4649bd3","resolution":{"observed_at":"2026-08-07T12:13:17.522271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:17.256210Z","title":"Efficient multiparty protocols using circuit random- ization,","venue":null,"work_id":"eedd9bad-d63d-45f8-94a4-dd9156d5b134","year":1992},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:16.064466Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:de6a7364dca5d3a7a1e01e1874a1224038727f58d0d6dd81e5e84b8c27ae9b7c","observation_id":"97aa1295-98f0-4588-abee-5b2d3c342516","resolution":{"observed_at":"2026-08-07T12:13:17.354137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:17.071120Z","title":"Efficient multi-party private set intersection against malicious adversaries,","venue":null,"work_id":"3f300bfe-4235-41c5-9191-faa880cdeb67","year":2019},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:16.598124Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:ea7abef1850633cb6b3713b33552e6de66c0fe22a7401010d148f9a18beb72b6","observation_id":"81cd3598-8720-44b9-8b76-09136ba73313","resolution":{"observed_at":"2026-08-07T12:13:17.160611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:13:16.811884Z","title":"Efficient delegated pri- vate set intersection on outsourced private datasets,","venue":null,"work_id":"0aaa6cf8-6c64-42bb-a714-05bc04368e4c","year":2017},"citing_paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:16.686599Z"},"links":{"citing_paper":"/paper/2506.00566"},"observation_digest":"sha256:06d0de0e0fcb65daaae24264a87fd45c8de086c45abf4146d347d400c06d38a3","observation_id":"ca072bdb-0e5e-4a16-abd3-5e2d4ff0b851","resolution":{"observed_at":"2026-08-07T12:13:16.945446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.00566","last_updated":"2025-05-31T13:50:40Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-07T17:59:15.880564Z","submitted_at":"2025-05-31T13:50:40Z","title":"Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":37},"total_outbound_references":41},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2506.00566."}