{"as_of":"2026-08-22T23:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ce1b6350aae8c6ce0046c21fc910e43240caf5d09d4f67b3bf2d0e17e5b94d7","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T01:51:21.377403Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2607.29606/citation-record","integrity":"/paper/2607.29606/integrity","json":"/paper/2607.29606/citation-record.json","paper":"/paper/2607.29606"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:51:15.149861Z","title":"IVF-PQ index,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:15.149861Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:6c7f12db4a20f91a52ddf7b8c5c96a474a502f74240a6bf5b37cd116835f91b6","observation_id":"3abbaea9-4958-4e29-87cc-eabaa805dcb7","resolution":{"observed_at":"2026-08-03T01:51:15.149861Z","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-03T01:51:15.263228Z","title":"Guidelines to choose an index,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:15.263228Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:0e3a573a39008031baefeb80aeebcbd1858cac3b890cdd0c12b7f835f9293ad7","observation_id":"53f96abc-2ad7-496a-9914-2312a82534f6","resolution":{"observed_at":"2026-08-03T01:51:15.263228Z","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-03T01:51:15.575358Z","title":"Choose the k-NN algorithm for your billion- scale use case with OpenSearch,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:15.575358Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:677d457a18d59946d3dffdccc475a273de383bad33ec0597acc125f630920d34","observation_id":"d30fb8b0-f7d9-4211-a9e0-6a488b6b8986","resolution":{"observed_at":"2026-08-03T01:51:15.575358Z","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-03T01:51:15.794069Z","title":"Improving approximate nearest neighbor search through learned adaptive early termination,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:15.794069Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:985f8227686c93d49195c07fc89baef5265f688b218ff23825fee921991466de","observation_id":"5b534e9f-81ff-4d75-a566-fd3c8b10ac1a","resolution":{"observed_at":"2026-08-03T01:51:15.794069Z","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-03T01:51:16.010592Z","title":"Quake: Adaptive indexing for vector search,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:16.010592Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:07e6bebe2e309e4f8c015906ce1ae8e05aa530e064df304b1d18eec644112d8e","observation_id":"72f1fc5b-8430-41d7-9fbe-9e1042a4c88b","resolution":{"observed_at":"2026-08-03T01:51:16.010592Z","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-03T01:51:16.137283Z","title":"Vista: Vector indexing and search for large-scale imbalanced datasets,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:16.137283Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:f10628bf33597ea8effc99ad4efdcba93b35a92d6ab81369e756a68e613676f8","observation_id":"2b369e36-084e-4a31-b8e9-425c07f6efb8","resolution":{"observed_at":"2026-08-03T01:51:16.137283Z","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-03T01:51:16.300015Z","title":"Boosting accuracy and efficiency for vector retrieval with local scaling graph,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:16.300015Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:dbc723a563b201acdcf4a590c5497c3ad6d177437c01e4d89312ecf897838d45","observation_id":"62d9c080-94dd-4af9-a88e-4c9651e70328","resolution":{"observed_at":"2026-08-03T01:51:16.300015Z","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-03T01:51:16.453993Z","title":"Scaling laws for nearest neighbor search,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:16.453993Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:02173d4c4d581e871a8861d453479c11817505204869c306646ab20fc1af8beb","observation_id":"62184ba5-3dc9-4fcf-b961-92d1ffdcf215","resolution":{"observed_at":"2026-08-03T01:51:16.453993Z","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-03T01:51:16.560962Z","title":"Ap- proximate nearest neighbor searching in multimedia databases,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:16.560962Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:a141efbfd44161728e91d3023f18050fa0e544852fb736938efa5a2ee7efbba3","observation_id":"ad054d37-ca08-4020-b6c5-ecc078a033c5","resolution":{"observed_at":"2026-08-03T01:51:16.560962Z","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-03T01:51:16.707202Z","title":"Vq-index: An index struc- ture for similarity searching in multimedia databases,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:16.707202Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:3762a152f08992c86cfb7e64019aa89c7fa2a0b95adeda36b718abaae1eee34f","observation_id":"99a82a8f-827e-4272-9453-733c8b030f53","resolution":{"observed_at":"2026-08-03T01:51:16.707202Z","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-03T01:51:16.880656Z","title":"Product quantization for nearest neighbor search,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:16.880656Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:f847cce6b4f6f89e5d6170171788d5abbadc76e9c9eec2b4c4f45d481728f0de","observation_id":"14467af8-aa4a-4f94-bd4c-a8fa570c7bce","resolution":{"observed_at":"2026-08-03T01:51:16.880656Z","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-03T01:51:16.962028Z","title":"Spann: Highly-efficient billion-scale approximate nearest neighbor search,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:16.962028Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:9c07264b941215f492cf16670421154f18fafeb8365ac024faf0318540318d44","observation_id":"ed2eb455-6ac9-46c9-8a1b-75e8ba9dd91f","resolution":{"observed_at":"2026-08-03T01:51:16.962028Z","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-03T01:51:17.018539Z","title":"Parlayann: Scalable and deterministic parallel graph-based approximate nearest neighbor search algorithms,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.018539Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:e1c1913bbd41f179c1d1b452ade3333fb0d97fc888a4feb78fe1e57b4ef43dec","observation_id":"19c05c7f-13dc-4c16-8dcf-5cdd26136911","resolution":{"observed_at":"2026-08-03T01:51:17.018539Z","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-03T01:51:17.139287Z","title":"Vexless: A serverless vector data management system using cloud functions,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.139287Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:3348789ecbf08c65cf9551201ca9162b3c63064a35c316b2f3997dec96c36e88","observation_id":"942610a8-22cd-409e-a7f3-6b0a7b0ea93b","resolution":{"observed_at":"2026-08-03T01:51:17.139287Z","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-03T01:51:17.230739Z","title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.230739Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:ecda8d6e897d7b1f5172a3a6aeda9522f294b1f15730d1f2ba7afe7151717e08","observation_id":"43b7921d-9cca-4619-aead-049e27960143","resolution":{"observed_at":"2026-08-03T01:51:17.230739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01528","last_updated":"2025-02-03T17:08:26Z","snapshot_observed_at":"2026-08-17T12:56:16.316010Z","submitted_at":"2025-02-03T17:08:26Z","title":"SQUASH: Serverless and Distributed Quantization-based Attributed Vector Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01528","snapshot_observed_at":"2026-08-03T01:51:17.300935Z","title":"SQUASH: Serverless and dis- tributed quantization-based attributed vector similarity search,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.300935Z"},"links":{"cited_paper":"/paper/2502.01528","citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:62a86481c2b875d1dc28eff297b325ae91d6ed7c10f90010f194e3c4257e695b","observation_id":"de62fc3b-c8b2-4ba5-a8e9-850d89e1793c","resolution":{"observed_at":"2026-08-03T01:51:17.300935Z","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-03T01:51:17.360788Z","title":"On the consistency of ordinal regression methods,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.360788Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:2430e8a1b5057b970ceb328fbb0d931beab1c4196057c20a05f7b6f2518f7bd4","observation_id":"eef3450d-762e-497e-bd16-87d881950e3d","resolution":{"observed_at":"2026-08-03T01:51:17.360788Z","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-03T01:51:17.435990Z","title":"On embeddings for numer- ical features in tabular deep learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.435990Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:b7bb6fd44214175709f14bfddc79145667073b76fa0d6f47237d05a1d152dfea","observation_id":"cde22806-ee34-42f3-a970-4c2cc2afbab7","resolution":{"observed_at":"2026-08-03T01:51:17.435990Z","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-03T01:51:17.491908Z","title":"Tabular data: Deep learning is not all you need,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.491908Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:744c208b25b8fa74bb5da59e761f363fe13b448dd3e8de4307b3aca455c78f1f","observation_id":"4f7b2aa5-a34e-4fe2-8922-cc83ab331faf","resolution":{"observed_at":"2026-08-03T01:51:17.491908Z","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-03T01:51:17.541384Z","title":"Darth: Declara- tive recall through early termination for approximate nearest neighbor search,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.541384Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:e1e43da7d2324d4f6bd88eac81478e41b40f9e5cb9930d8819320c64598d89c8","observation_id":"5406ad9b-0fc9-43e3-bc8e-8e901bfe3e9c","resolution":{"observed_at":"2026-08-03T01:51:17.541384Z","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-03T01:51:17.571323Z","title":"Revisiting batch normal- ization for practical domain adaptation,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.571323Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:220afeb3f19de70255019e8c7ec2e16154e3c2736723165058b327a812c02f85","observation_id":"f015b203-d686-4613-840f-fd7b3713b44c","resolution":{"observed_at":"2026-08-03T01:51:17.571323Z","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-03T01:51:17.636723Z","title":"The role of local dimensionality mea- sures in benchmarking nearest neighbor search,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.636723Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:7451aa9cd162595481dbe771aa9be8b2344db3c1aa1c070642842cdaffa61a5f","observation_id":"debcb999-848c-4a76-940b-533e7d5f4af8","resolution":{"observed_at":"2026-08-03T01:51:17.636723Z","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-03T01:51:17.749017Z","title":"On self-organizing sequential search heuristics,","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.749017Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:29f7904acdc9de86b6e2bea07cc4eab6c874bda87f1b0e7a9c85da2e5371048d","observation_id":"a37dba86-6b0c-40dc-b8f2-00d55332edf8","resolution":{"observed_at":"2026-08-03T01:51:17.749017Z","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-03T01:51:17.860952Z","title":"Convergence of stochastic processes,","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:17.860952Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:c9e42b90c8516ba02acb1b75a4929d0874a8d76caecd2e121a16cf7ee334463e","observation_id":"036f8e0b-8659-4bec-ab44-3d25b68b4bc8","resolution":{"observed_at":"2026-08-03T01:51:17.860952Z","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-03T01:51:18.015074Z","title":"Institute of Mathematical Statistics, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:18.015074Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:80be7d612203eb153cc23fffec005ea3c82cad16d1b21e9cd4b2e7e0fdf3ed8c","observation_id":"947a12e4-238e-4930-9b8c-d2248e4c7ea5","resolution":{"observed_at":"2026-08-03T01:51:18.015074Z","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-03T01:51:18.098308Z","title":"Learn- ability and the vapnik-chervonenkis dimension,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:18.098308Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:10f15a3be60f5eb77562952fd9929f7ba565219270eeb56df9c4e8eb736141ac","observation_id":"081265d2-4108-4ab0-84d7-dfa47d569dda","resolution":{"observed_at":"2026-08-03T01:51:18.098308Z","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-03T01:51:18.252774Z","title":"A pac approach to application-specific algorithm selection,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:18.252774Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:3b2978c316e512c4ea4ca51e686db7b9a18a4a6c0423ededcf21c93f3a72b9ef","observation_id":"d29eab86-a313-4a20-99d7-5ba2890a5b13","resolution":{"observed_at":"2026-08-03T01:51:18.252774Z","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-03T01:51:18.434816Z","title":"Data-driven algorithm design,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:18.434816Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:7aaf6eb518313495a95f938839a8311a456fd9e3cc2369936929004a028f8aac","observation_id":"fe8f49c9-20bc-4c38-bc7b-4335878cecb7","resolution":{"observed_at":"2026-08-03T01:51:18.434816Z","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-03T01:51:18.598891Z","title":"On the uniform convergence of relative frequencies of events to their probabilities,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:18.598891Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:8cf97cca5142397611d631b6fc7675a1bd215ca3eb219f51b5bbd37081b3092f","observation_id":"2511f5fb-92dc-46fe-a23e-78af8174a6f3","resolution":{"observed_at":"2026-08-03T01:51:18.598891Z","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-03T01:51:18.718993Z","title":"Anthony and P","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:18.718993Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:94301fdd7752e07df4649fcc2372524a5931b0e0be10a4afd8e19d0636d17b14","observation_id":"ee8c47c1-fb00-42c6-b9c9-a63d702aa129","resolution":{"observed_at":"2026-08-03T01:51:18.718993Z","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-03T01:51:18.822310Z","title":"Vapnik-chervonenkis dimension of neural nets,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:18.822310Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:cbea8a24cb093df8dd067b3efb5c1e4c8b993d749cf805ae95f64ac14056fcc6","observation_id":"6e1303bf-e246-4e65-a422-b9b62a2a8c2a","resolution":{"observed_at":"2026-08-03T01:51:18.822310Z","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-03T01:51:18.946317Z","title":"Bounding the vapnik-chervonenkis dimension of concept classes parameterized by real numbers,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:18.946317Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:7811c73d4416e1e42225b05908424131de0df3179a8e9131c209d71ed013bb7a","observation_id":"31d72d1d-f06a-45de-95d9-678c8c09a323","resolution":{"observed_at":"2026-08-03T01:51:18.946317Z","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-03T01:51:19.115549Z","title":"Polynomial bounds for vc dimension of sigmoidal and general pfaffian neural networks,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:19.115549Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:4d4e3cdafd52ff1718cedd6396a51435b587d069e3b50f4101c5f85bf58fefd7","observation_id":"bbcba22a-7b2c-48d9-b48d-b79cc7fb8c81","resolution":{"observed_at":"2026-08-03T01:51:19.115549Z","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-03T01:51:19.309585Z","title":"Cover trees for nearest neighbor,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:19.309585Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:a50d1ff93bb9d31dc4ecc0720e0468a5a554027d3eb5c53a15bd9e1cd6203ecd","observation_id":"c3bdba21-0e8e-4e13-bf7f-3720ff139e8d","resolution":{"observed_at":"2026-08-03T01:51:19.309585Z","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-03T01:51:19.420007Z","title":"Multidimensional binary search trees used for associative searching,","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:19.420007Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:6ed4298031db66e11706ef923da98b9f52a9ac7b21d3d185d16d53960e5cdbb0","observation_id":"09f2ae52-63b6-4768-89e3-fc20cc3b649a","resolution":{"observed_at":"2026-08-03T01:51:19.420007Z","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-03T01:51:19.569216Z","title":"Five balltree construction algorithms,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:19.569216Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:9b27b21a2f40f2d98efc03ef1eb1b41568083afae21578eb9d9e75417c91b2bd","observation_id":"d9fc47a2-7041-441c-9a96-3bed742561fa","resolution":{"observed_at":"2026-08-03T01:51:19.569216Z","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-03T01:51:19.684509Z","title":"Approximate similarity retrieval with m-trees,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:19.684509Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:1bb1e5fca2bd60c727ba0602f4d59d79428e6ec1d9bd9e52c86066591c75f68a","observation_id":"218e1f96-4515-4d84-a70f-eee2dee0cdc9","resolution":{"observed_at":"2026-08-03T01:51:19.684509Z","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-03T01:51:19.782522Z","title":"Vector- approximation based indexing for non-uniform high dimensional data sets,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:19.782522Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:7fb98f14bdc7ed21eb446c6691302c1d6cdd111170a05107615da3c6a79fcf42","observation_id":"48c9ef82-ead6-467e-a572-767a0ee3ddb3","resolution":{"observed_at":"2026-08-03T01:51:19.782522Z","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-03T01:51:19.885909Z","title":"Configure index parameters,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:19.885909Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:c98251cf2c4eac3ac6fab78c8211ceef255880e7aa3217a9c1e12480c8865ca8","observation_id":"bedd587a-59ca-4647-816c-8807e3f4449f","resolution":{"observed_at":"2026-08-03T01:51:19.885909Z","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-03T01:51:19.969505Z","title":"Autotune example,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:19.969505Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:f5dbc4114178066994c64b656c1fce022036c256a38895ce81afa4feda1a8c66","observation_id":"4754a77d-adf9-4721-9b62-d2bee5f80d30","resolution":{"observed_at":"2026-08-03T01:51:19.969505Z","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-03T01:51:20.087913Z","title":"Efficient and robust approxi- mate nearest neighbor search using hierarchical navigable small world graphs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:20.087913Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:0d8ad6ccf1bff7c31a74fb462bbc14a4d790bac4c22764b19c91f0e302180958","observation_id":"c0245272-12f0-425a-bb85-39baab26a3a5","resolution":{"observed_at":"2026-08-03T01:51:20.087913Z","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-03T01:51:20.204178Z","title":"Distribution-aware exploration for adaptive HNSW search,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:20.204178Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:7fb04bde089648538e846763304798318be4c496a230f116bd6cf5b975848864","observation_id":"2e08e437-27b3-4fb6-926c-7f552e8bff45","resolution":{"observed_at":"2026-08-03T01:51:20.204178Z","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-03T01:51:20.286122Z","title":"Learned probing cardinality estimation for high-dimensional approximate NN search,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:20.286122Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:06aefd96a1a8e4afd1a9fe0dedfc09c57ebf1fcd2332835bade322c71df94eaf","observation_id":"25b4ddac-a0b7-4a71-a2cb-c9ae4039ea1f","resolution":{"observed_at":"2026-08-03T01:51:20.286122Z","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-03T01:51:20.395151Z","title":"Distinctive image features from scale-invariant keypoints,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:20.395151Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:b33a5b8e3937c2a20c38f860417e3b88cc759ee8f4aacea6c65c22c73aa8e0a1","observation_id":"d7b49944-4c8e-4b53-95c9-cd5ee74102e3","resolution":{"observed_at":"2026-08-03T01:51:20.395151Z","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-03T01:51:20.476593Z","title":"Gradient-based learning applied to document recognition,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:20.476593Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:bb295a80947a53bf8ed5dc0bb93b72d7713d70f7b72e589c549fc7a9bc49e188","observation_id":"980e6ded-2af1-4f73-8bb1-22b30e4b9847","resolution":{"observed_at":"2026-08-03T01:51:20.476593Z","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-03T01:51:20.602885Z","title":"Modeling the shape of the scene: A holistic representation of the spatial envelope,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:20.602885Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:2002c0c1383fe1976b65f96e6780d71217be36d5599aed0e81806b3b729806c6","observation_id":"a6f44cf2-5643-46bf-a3ab-c8d4f8fd7f35","resolution":{"observed_at":"2026-08-03T01:51:20.602885Z","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-03T01:51:20.773083Z","title":"Efficient indexing of billion-scale datasets of deep descriptors,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:20.773083Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:f4b39308597dcc4bb5a3bfa89703f96fc79d09b89ecdaddb909e3830da6d2ae8","observation_id":"72a8f878-63be-4ba0-a454-4cbaf3e1ba49","resolution":{"observed_at":"2026-08-03T01:51:20.773083Z","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-03T01:51:20.937078Z","title":"Glove: Global vectors for word representation,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:20.937078Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:7a8eaf53c94da86f6d346a360a33b17755bcfbb092fc204e6938638cece3120a","observation_id":"d0c57293-3440-4e90-9f9e-469faf0ccd8f","resolution":{"observed_at":"2026-08-03T01:51:20.937078Z","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-03T01:51:21.094971Z","title":"Microsoft coco: Common objects in context,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:21.094971Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:e5f823d1a247052c242f917c7a90d3f4c3d4816d96e0a1d3c0e93348f897a821","observation_id":"cbbd4965-cfab-4692-b2b8-33aca08ab49a","resolution":{"observed_at":"2026-08-03T01:51:21.094971Z","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-03T01:51:21.154770Z","title":"Deep learning using rectified linear units (relu),","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:21.154770Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:fec75cc6a786469b639e3e4daa0a689c84f96695392d9b7c865b4e46abffc33f","observation_id":"aecb41dd-ad63-4a1b-af49-39fb0bf64909","resolution":{"observed_at":"2026-08-03T01:51:21.154770Z","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-03T01:51:21.226794Z","title":"k-means++: the advantages of careful seeding,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:21.226794Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:3cdfcd32fa95dcbd8134b082f6d00196e56217458baba45a9bcb0d1921e819f6","observation_id":"68109658-29cd-4b5d-9de5-de5f915fc47c","resolution":{"observed_at":"2026-08-03T01:51:21.226794Z","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-03T01:51:21.377403Z","title":"A unified approach to interpreting model predictions,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T01:51:21.377403Z"},"links":{"citing_paper":"/paper/2607.29606"},"observation_digest":"sha256:6e41a9ce49dc9883a374ea29721254e7ccf421b275f0c0f9f0fbb3e0d4abc3c8","observation_id":"cfcb2b68-8dc3-44d3-b2e8-566c687b1933","resolution":{"observed_at":"2026-08-03T01:51:21.377403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.29606","last_updated":"2026-07-31T16:38:47Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-18T20:48:12.560940Z","submitted_at":"2026-07-31T16:38:47Z","title":"QASP: Query-Adaptive Robust Vector Search Policy"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":52},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2607.29606."}