{"as_of":"2026-08-10T20:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58994a6acab640d6bbc49a8253749e4f5d896e19a5db1e9dd0a5994e5fd5d659","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-10T06:31:04.303077+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-10T17:07:38.361125Z","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:a4ab3a0426df0243784b4924bd3f731890b5673a6b91e8a4b5143a1db194e167","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-10T17:07:38.361125Z","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:7c149c8123d3c8c0f671639fdeb87a07ac52c879853658b03320d36d28a1c958","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-10T17:07:38.361125Z","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:5af5ed52821f8a1b16e6d33de859f8577cfcdeb127ce0c165ec7f42855bf7c1f","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-10T17:07:38.361125Z","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:767071cb9c526d827febe61d26bf4bf63bc1de76297cb17db57d88842ac0d0cb","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:7dfdf5ed3f33907138649b39dddec56a88e22a275ffd95e3b9ed6100cdbd9fa5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:21f9dad19842f4b6bf1f9f856e9eec838e87571d3ae38538f42a4a6edc4fdbdc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:e03f6e2fba558edc34353f2370a1844a5191cd61066f9a6a858e6872e7513b9b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:57dc2bd73bd2c205f0519205c07985e15a348d6d92c3daac327b9932b1df63c3","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-10T17:07:38.361125Z","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:8e8c85159424105d7afd3fe89ff51a5d50525fcc541eb117b39f050f055f42ea","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:8033cd0635641a67a10a5b2ceee2d68115fcfa7dcb9172d1bb4118084941e424","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:a72d5a6a42693f88a4b98b09ae4ca415b19b811405fd2f11f785375624f64901","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:a55a5cadbdd5810a53bf7f0e5f054b76150bcb9cc20c52c6312cad5b550b5b11","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:75e0ea9bf57c2ff537262a34c33928c34028b1ec5463f3a477c840c20c23273d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sp.2017.44","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","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-10T17:07:38.361125Z","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:a1d6ecf17e5bb12de163518a34ad133cd3c91c7e76b5a5b84e17cbd8badc7ba8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:4fa327cb897bf2de06c9e193a942fa136575c2006889cc1a71171a2eece2db0f","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-10T17:07:38.361125Z","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:7b5cd7186df239c5d97740c76dd360a33d4c4936fdea65873c63beda10f48f13","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:571d7828c9f1276cd2eb5caa9c11eef4a7732cc46b181192b4bec56184581f2d","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-10T17:07:38.361125Z","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:71cf3b1133e1bd1229cb4dbd62713f3c73e538a62bddaf1f469404550c950139","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:e2cc07fa5f0e00453e78aa918682a386209061ded2a94147036b6c1fc6e86fdf","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-10T17:07:38.361125Z","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:da0f25418f6e2724e441756bc078aea043f0a90d77b5186fe0d1fe51cd272b88","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-10T17:07:38.361125Z","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:8362937d678ba6e0bab6c916039774f455cb12c26cfad0b7a4125206c2605560","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-10T17:07:38.361125Z","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:65ecb04816b3a28ffab8842d063215fcd6e9f05afeafa603349497b42a8c1d5c","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-10T17:07:38.361125Z","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:aa9453a06f8f87c3383ad04936e5d7e072dfec833a6eea777b05225b6cff8442","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-10T17:07:38.361125Z","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:959b9c1864675f8eaa2bcf3440f39636eff85ffb06b798f36ceb0b90e771d369","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-10T17:07:38.361125Z","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:599e016b07161058460d946b2451d9464c58998d5516f7723df686362b552614","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:6326225d4cbc14aac41bed1b50157a706fed6b4cfe5712cf06265d4755839867","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-10T17:07:38.361125Z","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:45acc97bc4f30e9b3af50eb890c7c302385b675601b991515c19e40def1963fa","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-10T17:07:38.361125Z","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:5ee52d5aac8f171d4bf33154cbe457d372510d35bb732b068957dd1912e5546c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:ab1c4a511d71d0b7b7693b1649476738efa26c32c2c003381a098455354d89dd","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-10T17:07:38.361125Z","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:376301604337cb6e1a1039d45646829c81e81ef47e9421c3076c67a3130eb54a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:5061b10661aea609a9cda862d0ea78bf5a19233e3e7a73f8b9c500f3651219e3","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-10T17:07:38.361125Z","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:1c595e1be42d0bb026f332a77c205a66224b245d1024448c99aab3d389880949","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:c4e49ba5caa8b23705314610b073f1b157cdc475d5ed9164cb163fe3d46a7884","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sp.2013.38","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","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-10T17:07:38.361125Z","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:e866b7f658895806e6fea9ce2f42ba366a0335b3286f61cd57c0e3e27f80e9df","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:629c72c8db7020861e2a9cfde079b3f2cff8067ed5e430ef829879bc1052f983","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-10T17:07:38.361125Z","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:1c2fce674def3626b269b95b7ef610ee7a67f7d791a1da111e07c3c4bffae181","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:5ddbf4d3dcd8b1c9e51c2614d7ff955c3791dd540aeb4e4a8022112d672c00e3","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-10T17:07:38.361125Z","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:f4b3313dfda5b271ac568ff9e3791b8652baf19bb794cf234d633fca46570cbc","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-10T17:07:38.361125Z","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:2c5076635520276b743fec1d402128800baae15d91013a841dae814cf9054870","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:fc76ac46ef0b5a448b960b8f5785105265f176de42a681b272eaea5a2a84c299","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:c48b7e43592a3c605779670ca8c2d57bfb2bfa23cc2affb827a37388f8e9d352","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:3c2af31d4bfe49c4586e85a8d7b4a2dfeb96f178ee2e77ed01e97396863ecc58","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T18:07:44.797883Z","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-10T17:07:38.361125Z","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:49503dfccf606f28b75c94b62b8805e640bdbf83ce7f886ab2ddc3247ae94b6d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:7117193e6c36e7e4bbc2887fd56594cde07411a682a93425b193c45a104d0b98","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:6a9aab227ba0705d72371edc33ce87efcbc3ef596edcf75ea268ed176845a754","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-10T17:07:38.361125Z","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:93e82027cd37541e1a05b3e7a0cffeac476b06f2269928cb77744db67d4aea3c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:bead2ebfba3b84f2d4e6f3f93076f4cf2c1a2c10458ce79a196c7e4d4f8d5c7a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T17:07:38.361125Z","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:68e3878979bc1b064df737a6cc6d66a52d4d7728320f409a70baff7142e48b56","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-10T17:07:38.361125Z","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:ef7ae695011724c058035b19366ca251959d9f846634ec399c650e5b12b4ecba","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-10T17:07:38.361125Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2608.01192."}