{"as_of":"2026-08-07T07:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:688be549ec9690b57495920a554f3a83a6d48bd965dc99925f1bbd24ffab7806","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:32:39.196603Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"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/2608.01192/citation-record","integrity":"/paper/2608.01192/integrity","json":"/paper/2608.01192/citation-record.json","paper":"/paper/2608.01192"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:32:33.202636Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:33.202636Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:a13fe33f90ac91bc4ccca0885c6e72b621bce4868aca2cbb19aed3122135e82d","observation_id":"d6be3fb0-0174-495e-90c6-d875b14f2382","resolution":{"observed_at":"2026-08-06T00:32:33.202636Z","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-08-06T00:32:33.274750Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:33.274750Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:0ba78000bc08132fe953dfedf4357feb51a095e302eeaf0b7283b9a2c0fecf6e","observation_id":"4c85e636-add1-4db6-8b78-eac094fc3bc7","resolution":{"observed_at":"2026-08-06T00:32:33.274750Z","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-08-06T00:32:33.397887Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:33.397887Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:e93732b7ab87492443d43d0b827fa99ede0bfd00ca4e045174671286b19858b5","observation_id":"887588c2-9466-4b31-8645-f87c80932c3a","resolution":{"observed_at":"2026-08-06T00:32:33.397887Z","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-06T00:32:46.768680Z","title":null,"venue":null,"work_id":"dcf542f4-e341-42be-92b0-7f0cb2dd1c50","year":1994},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:33.464751Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:82b9a92639bde75df683cdda7834eab228ac8a049ad0d49acec5d7a392a98243","observation_id":"b2597cd9-7cc3-452a-ad8b-5fbbaa601737","resolution":{"observed_at":"2026-08-06T00:32:46.774305Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2538.79254","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:32:41.720680Z","title":null,"venue":null,"work_id":"f1e6889f-6be9-46ed-a8e7-cead238f1834","year":2003},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:33.574844Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:6403003c5ef060597a824e3dfe3bdcd4f2529a971036d2f75de010199c3dc33f","observation_id":"01e873b3-06e7-4b54-ad0b-2eaf4f67df6f","resolution":{"observed_at":"2026-08-06T00:32:41.816173Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-06T00:32:46.721630Z","title":null,"venue":null,"work_id":"10fa9906-97d9-49cf-b225-55961ed0fc60","year":2009},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:33.674755Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:e3c13aa74086620329e3871b4a5b95e33791ab764d98ca6f97baab6e90861176","observation_id":"63020c50-2ee7-43e6-916c-a23b6e6d04fe","resolution":{"observed_at":"2026-08-06T00:32:46.727451Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2502.13060","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:32:41.268950Z","title":null,"venue":null,"work_id":"ce1460d8-942f-475d-b39a-460d1869f821","year":2026},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:33.850999Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:f7ec4d929a5ebe7c68b17003c4c2780e2b3b2dc945a183e8563008e275c0ed9b","observation_id":"6b7f8928-06b6-496b-bb2f-503ead0f41eb","resolution":{"observed_at":"2026-08-06T00:32:41.384748Z","resolver_source":"raw_fallback","status":"verified_exact"},"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-06T00:32:33.947153Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:33.947153Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:2b1379f6a99c2dae0cf1e235b3387649a18f1df30f51dc2f37601f4c6f4a5549","observation_id":"e21757ff-e2f9-4cb4-8a59-abffc06dd3f1","resolution":{"observed_at":"2026-08-06T00:32:33.947153Z","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-06T00:32:46.670907Z","title":null,"venue":null,"work_id":"c4969ab6-c85e-42fb-a846-e6a10d28e1db","year":2018},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:34.024764Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:64fed772860a175b10f4359a64fe9180c48e4c0f54e75ce6bfdecf2a2c44c61d","observation_id":"bdc14cef-b98d-45d6-9b06-e38495833536","resolution":{"observed_at":"2026-08-06T00:32:46.684266Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:32:46.544913Z","title":null,"venue":null,"work_id":"20866c6e-ef67-47c2-b922-1aadeec14753","year":2012},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:34.240891Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:6576da080868556e42fc8a40b0920d595edff0b165d387e5ddb2f9fe1be33f9a","observation_id":"f8306bf6-fd98-407b-8301-91cd7a27a668","resolution":{"observed_at":"2026-08-06T00:32:46.594750Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:32:46.443578Z","title":null,"venue":null,"work_id":"a6c563e5-42bf-40a1-a2e3-7b2a6250a88b","year":2020},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:34.404751Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:b20af8d3cadab736e76af852654819c25e0c7feb98ea311ee895dc478ccbd5ce","observation_id":"fa7b27b3-c873-4974-b3f6-32e22aeefafa","resolution":{"observed_at":"2026-08-06T00:32:46.450402Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:32:46.385153Z","title":null,"venue":null,"work_id":"11fab3fa-6f49-498d-b64f-96f18952d221","year":1979},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:34.564754Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:ea1d7f55774ae4265d3beb1611ed88a9284c275a0ba7b7e47593ee5adc655711","observation_id":"65b675a7-9ddc-4355-90f3-698e6e313cfb","resolution":{"observed_at":"2026-08-06T00:32:46.421289Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:32:46.105354Z","title":null,"venue":null,"work_id":"b24cb59b-44fd-4bfe-977f-2e219e9a5b2e","year":2021},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:34.666839Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:c9bd6d4789701afc67cfd46c6a358d526663605749ca48b16817db0265b492ce","observation_id":"f4d9079a-12e8-4f1c-a581-ff286ebea561","resolution":{"observed_at":"2026-08-06T00:32:46.286400Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"10.1109/sp.2017.44","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:32:39.603696Z","title":null,"venue":null,"work_id":"e5204c6b-ddb3-40fc-bd7b-256fff24dfcc","year":2017},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:34.814761Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:b728877fcc087bfb5a526d4dd925fa7fe15cf7848bc96d4fed8c0207fe533cdd","observation_id":"f9be10e4-9281-405b-b609-072a6a8f465c","resolution":{"observed_at":"2026-08-06T00:32:39.684882Z","resolver_source":"doi","status":"verified_exact"},"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-06T00:32:34.904751Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:34.904751Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:be068b2e13be93346a79e6417e408cd00e58a7795677fa7ceffd17034acaf931","observation_id":"1d4da0d4-1bc5-403b-9398-130bc0f6eaa3","resolution":{"observed_at":"2026-08-06T00:32:34.904751Z","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-06T00:32:45.846577Z","title":"Hong, Henry Corrigan-Gibbs, Sarah Meik- lejohn, and Vinod Vaikuntanathan","venue":null,"work_id":"6f15c621-97dd-48df-b985-018fc28a667e","year":2023},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:35.054760Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:8649f11d7cf8390004405787411f659d7be6da351690dca634d5b6ea38e144a3","observation_id":"719bca2b-7e4c-4974-8708-ee7492fa891d","resolution":{"observed_at":"2026-08-06T00:32:45.931304Z","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-06T00:32:35.204743Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:35.204743Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:26a55b93158052ab79b979752d834154847e6b7572ea9ff39b8477f892f00576","observation_id":"63bfb094-8a27-4b9f-aff7-17a770c721bb","resolution":{"observed_at":"2026-08-06T00:32:35.204743Z","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-06T00:32:45.488290Z","title":null,"venue":null,"work_id":"01fed323-69d1-494d-b3b1-e463df89c50d","year":2019},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:35.334881Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:cc625a7a5197029d2f0545a200382a46da13b655e09acbb1cc671440ed0fbef4","observation_id":"03ff0daf-5ffa-4b93-9cf7-cc67e7691f9b","resolution":{"observed_at":"2026-08-06T00:32:45.644829Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:32:35.459253Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:35.459253Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:0264f0222d387ba65ef72cb808d9d7f6d7de90edf1e1cff1fef41db67c5b15e7","observation_id":"d46b504c-c9b7-4db3-8b44-03fbed92b7e9","resolution":{"observed_at":"2026-08-06T00:32:35.459253Z","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-08-06T00:32:35.505136Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:35.505136Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:3068108566b34cefa50dcce31de169bc97c56db97d51d2a5f9e9f89f2269d88d","observation_id":"5af1b6d5-b154-4b6a-a6f0-b45a0352145b","resolution":{"observed_at":"2026-08-06T00:32:35.505136Z","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-08-06T00:32:35.609178Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:35.609178Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:613cbd4ed05dfefccf559a6b4702ffcfcd5ee7a912a736f5e140b7935041e05d","observation_id":"3c0b4981-e3dc-417e-a435-2d73c4eed29c","resolution":{"observed_at":"2026-08-06T00:32:35.609178Z","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-08-06T00:32:35.728733Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:35.728733Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:6983434b7e64cfbe3d8a73ff493f5be8da28328b59e2ee5ca8bbbc435859348c","observation_id":"ebe090d2-f003-4c6c-a055-b45de5d0fc4b","resolution":{"observed_at":"2026-08-06T00:32:35.728733Z","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-08-06T00:32:35.795095Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:35.795095Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:1ac85c6d043beb48c92a3f329bc1c98d09047c2ac9e9879464d8bdaee17def0d","observation_id":"8c7ed702-d195-4354-9ef5-0c39e1b3b255","resolution":{"observed_at":"2026-08-06T00:32:35.795095Z","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-08-06T00:32:35.923977Z","title":"Malkov and D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:35.923977Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:553286432ad7b36c1fe58a8ffdd36f3b1107a49627afd48dcd2d1fe48add389e","observation_id":"e0428a84-5287-47fc-a07a-95bbd9aaddc6","resolution":{"observed_at":"2026-08-06T00:32:35.923977Z","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-06T00:32:45.103502Z","title":null,"venue":null,"work_id":"105518d6-d528-4282-8b14-8e8b26b62338","year":null},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:36.071474Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:a9bf98b9724fbdc2034682e087778e27710c4d912e66e2c21fc134e25c5ee45d","observation_id":"36c00b9a-e41f-4fe4-b869-b2790f50d651","resolution":{"observed_at":"2026-08-06T00:32:45.254744Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:32:36.254748Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:36.254748Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:4c2853991b9ad9534d3e07ab3b85517f26be8e01feb4096d141a3c050bfc6a67","observation_id":"4fea5145-b059-47b2-b553-7df87d7a9df0","resolution":{"observed_at":"2026-08-06T00:32:36.254748Z","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-08-06T00:32:36.454298Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:36.454298Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:efc035547f4a89e733bf485dc4280b2ddc0a90ecbb4d0f3c903b29ef9015f9d0","observation_id":"d7327e7e-902a-49cd-9834-073d1be2b72f","resolution":{"observed_at":"2026-08-06T00:32:36.454298Z","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-06T00:32:44.798408Z","title":null,"venue":null,"work_id":"181a5550-9346-4b83-88f2-b684ec67af18","year":1997},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:36.637090Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:9f8ba5339da3e2cfe92548b05a4fca33673171defb078d0943b783b10ac2a807","observation_id":"bf0153f8-01b0-47a7-93a5-a67768b0efc9","resolution":{"observed_at":"2026-08-06T00:32:44.938957Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"1611.09268","last_updated":"2018-10-31T14:46:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-11-28T18:14:11Z","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09268","snapshot_observed_at":"2026-08-06T00:32:36.814495Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:36.814495Z"},"links":{"cited_paper":"/paper/1611.09268","citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:4b1e0bea15461e227bb89b442dbb68c5f68aae8e47c4fc40b4dbfd2a1229b090","observation_id":"f4909ca7-5638-477c-9bc0-67d044dde28d","resolution":{"observed_at":"2026-08-06T00:32:36.814495Z","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-06T00:32:44.596711Z","title":null,"venue":null,"work_id":"c011cf7f-1950-49ff-bce0-2989369e55c1","year":2026},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:37.005865Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:034a77ab39e0a2f7c9e5a17a0aee588385bf10892ea2831ede5d57efe8186877","observation_id":"0602477a-fc80-4810-9f13-8fcbe86fd7be","resolution":{"observed_at":"2026-08-06T00:32:44.668098Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:32:37.083136Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:37.083136Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:81da0528d0bcaad9959e80ec025327897c701b6b1c3895515cba3b3a246c72cb","observation_id":"434040ea-9112-4953-8f39-1034afaa6bd9","resolution":{"observed_at":"2026-08-06T00:32:37.083136Z","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-06T00:32:44.353189Z","title":null,"venue":null,"work_id":"af348fdb-6460-4d6d-953a-785ab8f2f244","year":2012},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:37.253641Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:62d4df1d2fb32a600dc9bb90867445e4e085c9d1cb726b089c058be81e77f051","observation_id":"0f138cb7-939a-4856-8038-2e8c17130177","resolution":{"observed_at":"2026-08-06T00:32:44.472758Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:32:44.284639Z","title":null,"venue":null,"work_id":"9866a3df-45db-4154-b3c5-430554badec2","year":2026},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:37.418841Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:1c16b9333a5740d7e5fecd0a6fbd7c121b78c5bb9577fc56a3c249aad40e08d2","observation_id":"5c545e11-f57e-4fb2-bb66-d2b053ac88a5","resolution":{"observed_at":"2026-08-06T00:32:44.329167Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"10.1109/sp.2013.38","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:32:39.331880Z","title":"Li, and Nickolai Zeldovich","venue":null,"work_id":"44de1a75-1930-4b44-a3ea-87109747b964","year":2013},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:37.520253Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:ec665c111623e17e2e1676d3362637e8e0069f1cd80eccd9ac460c7ea2ef6153","observation_id":"69202484-a3d6-4a85-9f25-3bcbbdc7e31d","resolution":{"observed_at":"2026-08-06T00:32:39.427983Z","resolver_source":"doi","status":"verified_exact"},"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-06T00:32:37.643400Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:37.643400Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:f19e0c3b576f6f6f8fc154361d93865f89297f3a5a1c6bb5ba7de88699ad8620","observation_id":"dcef3cc9-9aab-40fd-9efb-a126f0c91a49","resolution":{"observed_at":"2026-08-06T00:32:37.643400Z","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-06T00:32:43.827524Z","title":null,"venue":null,"work_id":"4ee5c7c0-d831-42d5-9c23-456e28483668","year":2023},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:37.836995Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:9938187225e8a7ccbaa48cbe7775c36c546db7ca4bdb85cdfae53e3d81866a64","observation_id":"601ec1b7-3b9c-4b37-a2f6-085ce1d0fb47","resolution":{"observed_at":"2026-08-06T00:32:44.036359Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:32:37.976490Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:37.976490Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:db42d72f9d61b590fae1300303e21b2ee71216621faf49d352980a096e5c1ec3","observation_id":"8d206443-eb65-4ed2-ad13-a7154493d468","resolution":{"observed_at":"2026-08-06T00:32:37.976490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-07-06T08:17:05.681370Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-06T00:32:38.110332Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:38.110332Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:206bd650ac17f5325b34e2c6c87c3d7176c6ea2d0176149695a8d754aeeb47d9","observation_id":"5ae6ea52-d4fb-4e6c-8ce3-12762b54edad","resolution":{"observed_at":"2026-08-06T00:32:38.110332Z","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-06T00:32:43.494963Z","title":null,"venue":null,"work_id":"54ea28f7-8fe4-4665-8180-4e07f044f131","year":2022},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:38.198028Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:c2aa1cb20943d3e7b3111153ca22af09ecea2f95f79d503290bb828f796c775b","observation_id":"36ccfca6-f0ad-48dd-9998-19c38f321c08","resolution":{"observed_at":"2026-08-06T00:32:43.688317Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2003.12386","last_updated":"2020-03-26T13:43:25Z","snapshot_observed_at":"2026-08-04T19:26:45.111534Z","submitted_at":"2020-03-26T13:43:25Z","title":"A New Gene Selection Algorithm using Fuzzy-Rough Set Theory for Tumor Classification","version":1},"cited_work":{"arxiv_id":"2003.12386","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.12386","snapshot_observed_at":"2026-08-06T00:32:40.425251Z","title":"A New Gene Selection Algorithm using Fuzzy-Rough Set Theory for Tumor Classification","venue":"cs.LG","work_id":"ab96ef17-c825-447f-a3e0-76a7f0d37253","year":2020},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:38.284397Z"},"links":{"cited_paper":"/paper/2003.12386","citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:ccdf1ae196b4a4e4619e8a0dc3b92cfd9352aca0e15f837f83fb570ae617ce7d","observation_id":"3a855a05-fb5f-460d-8b85-d4c1f1949b58","resolution":{"observed_at":"2026-08-06T00:32:40.542898Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-06T00:32:43.211665Z","title":null,"venue":null,"work_id":"87d38610-ca86-45f5-bc96-0ba17ee911dc","year":2020},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:38.425132Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:55fc30f7d8f5d96f6a0c22a7500cd8bacb382c8b31d3e69d20d2280985edca3d","observation_id":"d0f047f0-a23d-45d0-83aa-f6027d3d2c2f","resolution":{"observed_at":"2026-08-06T00:32:43.343068Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T00:32:42.976961Z","title":null,"venue":null,"work_id":"081bcc6b-18e9-4eff-aa47-f48d57cec21f","year":2026},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:38.582047Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:d6d103ec3cbefe2052a8c9da5f127463416ebe441c4fe99ab90d94ba389beb19","observation_id":"5372c3ab-6414-40fd-8b99-90df1952e6ac","resolution":{"observed_at":"2026-08-06T00:32:43.102015Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2502.13065","last_updated":"2025-04-22T17:51:42Z","snapshot_observed_at":"2026-07-06T20:38:42.817060Z","submitted_at":"2025-02-18T17:08:59Z","title":"Improving Algorithmic Efficiency using Cryptography","version":2},"cited_work":{"arxiv_id":"2502.13065","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.13065","snapshot_observed_at":"2026-08-06T00:32:40.033828Z","title":"Improving Algorithmic Efficiency using Cryptography","venue":"cs.CR","work_id":"401cf422-e378-4e15-9d9a-4c1f173bfec3","year":2025},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:38.725408Z"},"links":{"cited_paper":"/paper/2502.13065","citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:38a3ceb9c3c6142d9d58291fa74869f2f5ce9582cef0cda8fac67ee1483cdda0","observation_id":"0305e758-7a19-4184-b236-45b7a7f200a2","resolution":{"observed_at":"2026-08-06T00:32:40.181403Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-06T00:32:42.728433Z","title":null,"venue":null,"work_id":"a0ea73f5-60ff-464d-9d82-f590d1fa9f3c","year":2017},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:38.894754Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:3aa4feeeba3027556c297b28ec034bd7563359007709452c4f10a7bd7aeac1b3","observation_id":"c039576a-ac3d-4f2b-9a28-39e543531991","resolution":{"observed_at":"2026-08-06T00:32:42.865078Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2212.03533","last_updated":"2024-02-22T06:21:51Z","snapshot_observed_at":"2026-07-06T14:27:46.217000Z","submitted_at":"2022-12-07T09:25:54Z","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.03533","snapshot_observed_at":"2026-08-06T00:32:38.966446Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:38.966446Z"},"links":{"cited_paper":"/paper/2212.03533","citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:0e6eb44d182250ad1b3d670541ffc477b7c67252df76de69e6167bdd572e3350","observation_id":"d56b3b73-76a4-46c8-84ac-fa2eb4e1f27b","resolution":{"observed_at":"2026-08-06T00:32:38.966446Z","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-06T00:32:42.494748Z","title":"Beekman, Raluca Ada Popa, Joseph E","venue":null,"work_id":"7a24e8fb-00cc-495e-b561-f8ad2a6b2b9c","year":2017},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:39.100646Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:a4280ad9a5d85461ded0fb429dbeb6b7e6d12b2de50ffa29039219a45f84c76e","observation_id":"9269e79a-26b5-4410-830d-45f09ccb623f","resolution":{"observed_at":"2026-08-06T00:32:42.584747Z","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-06T00:32:42.131846Z","title":"how aggressive does the probe set need to be to reach 𝑋 %recall","venue":null,"work_id":"670070a9-8d8e-43ff-8571-3276b0ca561e","year":2024},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:39.196603Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:fbb716269127f2d3ab4671c09c144e381c2ebc17907e20f561a65181e05d1b6e","observation_id":"241588bf-1dee-4987-a521-1e76bbfefe87","resolution":{"observed_at":"2026-08-06T00:32:42.363435Z","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-06T00:32:36.167711Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:36.167711Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:541a4de413de7daa9a94f5f8dbc126ee1beb8e86aff9ccadd6590c39e0dd12fa","observation_id":"22052d05-7696-4867-8dec-f4901393a077","resolution":{"observed_at":"2026-08-06T00:32:36.167711Z","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-08-06T00:32:37.738642Z","title":"In International conference on machine learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T00:32:37.738642Z"},"links":{"citing_paper":"/paper/2608.01192"},"observation_digest":"sha256:cba80161684fda77215e8f1e2540ec2c718b2a90b37e283f006db8045fa80c77","observation_id":"5fe5319a-e38d-4200-8b11-2035450a3e1f","resolution":{"observed_at":"2026-08-06T00:32:37.738642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.01192","last_updated":"2026-08-02T12:16:01Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-06T23:26:05.907380Z","submitted_at":"2026-08-02T12:16:01Z","title":"A Unified Benchmark for Privacy-preserving Vector Search"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":40,"verified_exact":5,"verified_fuzzy":3},"total_outbound_references":49},"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 7 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2608.01192."}