{"as_of":"2026-08-10T18:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e9ea769c341e8fb0df4beae4bf43210280db57e36bd6d9d3e13c4254b9e1286","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-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/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-09T17:27:27.578939Z","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:6faeb2d8adbe74585b52e328f945e58dc9adc5b6629aecbd90361fcdeed636bb","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-09T17:27:27.578939Z","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:39e008ebfd34f69c72bf7019e7c1b3bdbd5a53182da8a35ec94d3f0df0d53d1c","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-09T17:27:27.578939Z","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:c5217fca76e580e3cd4ce3d7b51761bfcdc16ee4463408e5992a8f4b96cc8499","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-09T17:27:27.578939Z","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:56cbf70ca52d8207fd4f71ca6fa0132e2cca5a3aef0e5434ff31de286658cb47","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-09T17:27:27.578939Z","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:cc781ad61ffb0d751e212c99d26d0819c52782470f3c2fc1fc7e2b3513fe6087","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-09T17:27:27.578939Z","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:bd1d25862223bbee4770441c9c9bd112a3f4290dc39e75fedca0b62f32d9995a","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-09T17:27:27.578939Z","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:92a3ab1f7a98bc5a035178099bfe7791d7869cf26bbff63e6cedb853cfa55a92","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-09T17:27:27.578939Z","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:d299a27c2154f77f0b973a085eb71af21d1098308454202015dc732f35722cbf","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-09T17:27:27.578939Z","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:5ffb305107fbbc198e372ba5ac686841b45d596e83be840bfb2e7f7b442b9e32","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-09T17:27:27.578939Z","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:978a31dbf8b91aa5f75cf011722195b1c7168bea2c31277edab33ab65eaa270d","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-09T17:27:27.578939Z","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:d474e30b27c75ff3404315da69758e2c49fc698892afc1e158aeecd2aa22abff","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-09T17:27:27.578939Z","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:3ac2fd288942f294ab1d5ebc5468b37375966b5f54a378315c6adf58c9e5a67b","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-09T17:27:27.578939Z","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:20427b71d0feef2154a18e6b1f258c69685b7ee2c1d290275032382ac9129b19","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-09T17:27:27.578939Z","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:55a9153d3c311a1ffdf86a562301da67ceff0af5b22ae7824602161aaff7dd4b","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-09T17:27:27.578939Z","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:50e7056bd4f5e0c5f35adfa2de48868a9fa6b03d91fe05a4a701610812a3b06b","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-10T18:21:34.871049Z","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-09T17:27:27.578939Z","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:99f89e134c88eb8b5e47a92be400ae9d341423d35c4081388c36385518428ffd","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-09T17:27:27.578939Z","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:68f757e7ae302ef239f9897af830f2d124ff06263b7d6e90123040424ba2444c","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-09T17:27:27.578939Z","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:daa085ae26ac399a9afb975baa839fa33b8cb62565ea751996b6884a80f2e499","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-09T17:27:27.578939Z","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:b13fd518f9f3a9d65b6959d6e7d83347aa213070fc4e722819f2d470537123f1","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-09T17:27:27.578939Z","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:fb138579e0657550f6cd3e3003b6974112578062cf2187f3f28eae830cf53f4a","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-09T17:27:27.578939Z","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:b9ce6d780746da1b51ab9fbe973f3602bfb053ad387ec9468b66b5265b7547fd","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-09T17:27:27.578939Z","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:2324be135fa07853392935ae73a606d93182588d95bf84545a3c5137f3f589c6","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-09T17:27:27.578939Z","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:64891803a0be74dd11d017e4951d04941edf7ecee3bda75c9d1ca577e32ab626","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-09T17:27:27.578939Z","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:027ce218d766fd7b7fa07e4d178c44357d97c48d42e5301465adfd8778c92239","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-09T17:27:27.578939Z","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:a11fdb4abb6936d85a94be77d73775fb297d7b8c60aadb544bd41b67e8092110","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-09T17:27:27.578939Z","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:7d8e3dd5d97a70e156f89594b6a3dff8141c3fea9cc537a808f0b734e424e28b","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-09T17:27:27.578939Z","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:b8890b4594b84e4a6eb3dc719a3f27909c7f8636b41ca52f5eec413037d166c8","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-09T17:27:27.578939Z","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:a6a2167a3ce2a8a5be3e944c7ad6a4705ce484945fe9408f569b89e8ee8ae2a7","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-09T17:27:27.578939Z","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:11c3a408d56d300b9ccd92d4775b2bb48b95e922db8d291be29e538c1897b3a5","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-09T17:27:27.578939Z","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:002f5bd7fa1b599196d0c531830e7346bbb3ca72ab135b5ab7b28cc90281325b","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-09T17:27:27.578939Z","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:40dc96d278ec62200cf9977172346c1b5943d7b8be7828d69d4d5cabe30a06fb","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-09T17:27:27.578939Z","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:b0c51ce0d09bc3a512fdf1c26e421a601a06ffb047e0451a13ef39d05125b321","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-09T17:27:27.578939Z","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:bbdd327fc44dbce9325db8d29666a028d384bf6e710399dff857b4dd5783e1e4","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-09T17:27:27.578939Z","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:6d20f259ea0db670ab5072e1998619422e10e4df5d5387bb599a70f3d4d58ef9","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-09T17:27:27.578939Z","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:c2821456606d463f31c1add79030f2913b9d1fb51e7f015a14aaa1d32a06b39f","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-09T17:27:27.578939Z","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:584d6f68fc1c0f3601b6e955bd0f02f9518bde6ddb0629df755bb268e78265f5","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-09T17:27:27.578939Z","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:af51106661be9e6b0721d4f2a069f07eaaa9527913a5e5dd8712959254bd1e77","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-09T17:27:27.578939Z","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:00f03dd53ec08853a9a81cef10277ecc0d946e0a8c05ade8a9cc1836a5375d5f","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-09T17:27:27.578939Z","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:8fe6745e684ba062438523a0bc084d433dc0435858db343a7e651cd384ea38f5","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-09T17:27:27.578939Z","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:f941f2e417471df74f5fcc5f6f596ee8dbc34647334a0758400158a7183d3aba","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-09T17:27:27.578939Z","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:1305aaa2efde8191c8ad80cd29f64af0ba2fadefba3a46faef825ab6c5205929","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-09T17:27:27.578939Z","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:2195be5ac3115e2682147a89f172843db91da9e6a985fd69bc49badb18d6f654","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-09T17:27:27.578939Z","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:9515de2970ab651c6c0b32349755e93e97060b790bc25e4e4b595003dc9b4813","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-09T17:27:27.578939Z","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:02f4559b5de193aa82c6f479d64d056e45410b6006364bd3f1015c375aa644d9","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-09T17:27:27.578939Z","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:aed384e7cb90f03bd8c1dfaf8bfa57d93bf524d1d19edf7c68cd23422bf89f23","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-09T17:27:27.578939Z","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:5acacbad209ed5d6eb580a1e45df6113b034fff3264a5688110e8143d9c7b5e6","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-09T17:27:27.578939Z","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:321a8193eca1e8da5021bf9f5ed0b41f34cee1ec86515e95048fc8c63f52ebf5","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-09T17:27:27.578939Z","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:4b5fe0c70b5b9429fc4f023df28beb8279707cc60cfe794cae161fd735614604","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-09T17:27:27.578939Z","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:f2171061c275c719dc78fa95033b18c2fb0aafa03ba39f937cd149ebd93e642a","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-09T17:27:27.578939Z","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:3fda5d6f7ee7dd45d830a62a98227acb7bcaa9c7855293c3d5efb8910669c6ff","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-09T17:27:27.578939Z","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:61de097d22cc998ce8769f0f1fe30a49ac7d04c8a614498f3a2b989729fdee89","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-09T17:27:27.578939Z","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:5320434b651be8da5b9e2a2d76a44a7ad51f48a21ff0bdab04c28f21fe94a715","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-09T17:27:27.578939Z","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-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 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2607.29606."}