{"as_of":"2026-08-08T14:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:38f85e1cd7c850601a0df5b319c00d35c544a3764117f086cb09b01fc98ead7e","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:23:42.197962Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:23:28.808922Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T02:57:34.465391Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15636","snapshot_observed_at":"2026-08-06T16:23:28.808922Z","title":"Distance adaptive beam search for provably accurate graph-based nearest neighbor search","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.14060","last_updated":"2025-07-18T16:41:21Z","snapshot_observed_at":"2026-08-06T23:00:34.638416Z","submitted_at":"2025-07-18T16:41:21Z","title":"Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:28.808922Z"},"links":{"cited_paper":"/paper/2505.15636","citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:36e86288f40e200895c2b3da1ea5702d0dbdd2a3518e4739beaba193b31010b7","observation_id":"1dd9da83-726d-4af4-813c-b8918cdd2a73","resolution":{"observed_at":"2026-08-06T16:23:28.808922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2505.15636","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.15636","snapshot_observed_at":"2026-07-03T02:57:34.465391Z","title":null,"venue":null,"work_id":"cff12aa5-aff0-4603-bd2f-472edd9579fd","year":2025},"citing_paper":{"arxiv_id":"2607.02338","last_updated":"2026-07-05T02:09:42Z","snapshot_observed_at":"2026-08-02T19:20:45.091703Z","submitted_at":"2026-07-02T15:44:43Z","title":"HNSW with Accuracy Guarantees Using Graph Spanners","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-03T02:55:42.606201Z"},"links":{"cited_paper":"/paper/2505.15636","citing_paper":"/paper/2607.02338"},"observation_digest":"sha256:b5a4cdda1885bb206311fb520b4880ef76f8cd3084314c5ad2e7ace6a404d7da","observation_id":"2609c361-2282-464e-880e-da76969c106b","resolution":{"observed_at":"2026-07-03T02:57:34.467037Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15636","snapshot_observed_at":"2026-07-12T08:12:08.041225Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02338","last_updated":"2026-07-05T02:09:42Z","snapshot_observed_at":"2026-08-02T19:20:45.091703Z","submitted_at":"2026-07-02T15:44:43Z","title":"HNSW with Accuracy Guarantees Using Graph Spanners","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T08:12:08.041225Z"},"links":{"cited_paper":"/paper/2505.15636","citing_paper":"/paper/2607.02338"},"observation_digest":"sha256:6b83f1ddf6c008ff5c32e4592252af7dc1962e1e15d0b0ef382091a78a1d7dc7","observation_id":"3f6573eb-fe33-4eb4-9b7e-91f3600daf15","resolution":{"observed_at":"2026-07-12T08:12:08.041225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.15636/citation-record","integrity":"/paper/2505.15636/integrity","json":"/paper/2505.15636/citation-record.json","paper":"/paper/2505.15636"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.13336","last_updated":"2025-02-18T23:31:37Z","snapshot_observed_at":"2026-08-07T18:07:01.471280Z","submitted_at":"2025-02-18T23:31:37Z","title":"Graph-Based Algorithms for Diverse Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13336","snapshot_observed_at":"2026-08-07T15:23:35.926768Z","title":"Raykar, Kirankumar Shiragur, and Haike Xu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:35.926768Z"},"links":{"cited_paper":"/paper/2502.13336","citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:2d299703786c669c5b89eeae637bc3ef1c781ae317cf5ed00b263324d30184fe","observation_id":"fe3fa77a-6c5f-42ea-b905-1d282d49b50e","resolution":{"observed_at":"2026-08-07T15:23:35.926768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:51.156148Z","title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions.Commun","venue":null,"work_id":"da53611c-862e-4b2f-85e6-a34cec95fb58","year":2008},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:36.040355Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:6447bca66a25a746621a987230812e0cd3e0ecac8911c1fa8a34a752f9fbf3e6","observation_id":"d52bc35f-6de4-4806-8c93-48b39e90a070","resolution":{"observed_at":"2026-08-07T15:23:51.239953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:50.949292Z","title":"Practical and optimal LSH for angular distance","venue":null,"work_id":"bd3eaef7-664c-41e2-af46-9105ff72d6f5","year":2015},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:36.214168Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:8a954e4420008c73f7f5fb03eaa470346b00c2eb762614eed6a108cec3de4faf","observation_id":"7c1e191e-9f7f-4a4f-8e34-10a14f252d51","resolution":{"observed_at":"2026-08-07T15:23:50.984047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:50.846169Z","title":"Nguyen, and Ilya Razenshteyn","venue":null,"work_id":"a262e314-ae86-430b-b011-0b03925605a4","year":2014},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:36.385261Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:169e83db0eb7370a8402a52e32ade969bf309605e446ad76d916cc6e5b6c586f","observation_id":"4b76ca49-d198-4e31-b919-bf573bf33f2e","resolution":{"observed_at":"2026-08-07T15:23:50.936390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:50.760149Z","title":null,"venue":null,"work_id":"97f0dbd5-5683-4c05-990e-659d1697eb93","year":1993},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:36.614662Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:a10f7a02707bf4856b590fa0dbe900799196b0c918ee662a3108787f38560b09","observation_id":"721d482f-7387-49f7-9916-d2fe5f3edf67","resolution":{"observed_at":"2026-08-07T15:23:50.787289Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:50.608018Z","title":"ANN-Benchmarks: A bench- marking tool for approximate nearest neighbor algorithms.Information Systems, 87, 2020","venue":null,"work_id":"af368e46-a345-4173-b3d0-320c7c241ed8","year":2020},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:36.730383Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:4c68bb8fbf6d8674d17d42020ccc4c0abadc62a404f0a176dc8d1df8d5eaae60","observation_id":"b98a367f-650d-4acf-8c75-ca38d18c8ab6","resolution":{"observed_at":"2026-08-07T15:23:50.663854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:50.492403Z","title":"Efficient indexing of billion-scale datasets of deep descriptors","venue":null,"work_id":"70659355-1706-454a-91a4-0e55b534f133","year":2016},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:36.885634Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:c052a13f7099236e98908a575ed12db4b11cf71933043841945f85248f50c23c","observation_id":"6078358e-5a5a-4d62-9056-aabe3242a8ca","resolution":{"observed_at":"2026-08-07T15:23:50.538193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:50.379360Z","title":"Cover trees for nearest neighbor","venue":null,"work_id":"1732a8cb-80be-49d6-b9f9-1b784abc9315","year":2006},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:37.040043Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:a0c963f327f6aa4f8b5ca346ead880dc849d6311d3e2ecf7bf33eb0fb93a6ff4","observation_id":"a930acad-bf1a-4215-b825-3e0e91efd9f5","resolution":{"observed_at":"2026-08-07T15:23:50.427784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:50.242199Z","title":"Springer, 2024","venue":null,"work_id":"c7cc6f1f-5ecb-4617-94ba-f412abc0bb42","year":2024},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:37.160134Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:69a82b581d043bf107f695e2938665f05b43246d4560ee09d6e5e166c923a62a","observation_id":"e6e61c48-e048-454a-8ca2-14d9b20dbc8a","resolution":{"observed_at":"2026-08-07T15:23:50.294682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:50.100971Z","title":"Kernel density estimation through density constrained near neighbor search","venue":null,"work_id":"1ee5e45e-00a0-4080-a18f-cf89c5c7783e","year":2020},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:37.377783Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:5336d462124ea92999d61e95096288aecb3494169dd741bd02f00815a1985853","observation_id":"9cfce629-0a68-467f-b867-feb2d102e625","resolution":{"observed_at":"2026-08-07T15:23:50.170488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:37.555760Z","title":"BERT: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:37.555760Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:749b34efdbcc7b0c10cddc0a3af82dace3874449d22434068ac3b182a43f5391","observation_id":"5dd2b5a6-1f1b-491c-b6e6-4b59fbb78804","resolution":{"observed_at":"2026-08-07T15:23:37.555760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:49.962126Z","title":"Navigable graphs for high-dimensional nearest neighbor search: Constructions and limits","venue":null,"work_id":"232cceb5-9d4a-4543-bb02-b212475b13ca","year":2024},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:37.728942Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:a402002fd48cfa18ba3066acf84d8ed57cf4ccb60f38a4614f2fca13936bb283","observation_id":"04e7a8bf-7788-4abe-8db0-30726ffb71e9","resolution":{"observed_at":"2026-08-07T15:23:50.020387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:49.833828Z","title":"SPLADE: sparse lexical and expansion model for first stage ranking","venue":null,"work_id":"2e95a94e-f268-460e-a6c8-858362fd14ec","year":2021},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:37.860475Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:f825bf04de95e3b8ca95bb3a6a95f6cba86186053f002897b6667aba37aff516","observation_id":"328df005-ecf2-4cd7-9804-8c16abeedbbe","resolution":{"observed_at":"2026-08-07T15:23:49.881294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-07-06T05:11:54.219180Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-07T15:23:37.997614Z","title":"EFANNA: An extremely fast approximate nearest neighbor search algorithm based on kNN graph.arXiv:1609.07228, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:37.997614Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:541464dd0b001dbd63b8e275ef3d0391d0538b74fae0d60f118d599b16603fae","observation_id":"3fa0206c-90c3-4658-a5b2-23deb6296c74","resolution":{"observed_at":"2026-08-07T15:23:37.997614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:49.693898Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph.Proceedings of the VLDB Endowment, 12(5):461–474,","venue":null,"work_id":"6cc9e8f9-1318-4a0f-b1b2-58d44a369d64","year":null},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:38.159967Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:83662703ce5019b1e75507cbd1ed660fec2d92a6eed50e1aea6eea032f810902","observation_id":"202d4fe2-0870-41dc-9272-d3e7c4e5f211","resolution":{"observed_at":"2026-08-07T15:23:49.755831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:49.386628Z","title":"Fast k nearest neighbor search using GPU","venue":null,"work_id":"fdcc2d1c-fb5e-4de6-becb-d741b9ae1298","year":2008},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:38.483727Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:05a0eb89f9eed615ca1862e98676fb00e3335f016b512aa36f6d403e77ed5b38","observation_id":"2df24dca-523d-4718-8e1e-e89e102b59cb","resolution":{"observed_at":"2026-08-07T15:23:49.449826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:49.232524Z","title":"Filtered-DiskANN: Graph algorithms for approximate nearest neighbor search with filters","venue":null,"work_id":"c7957b7e-0efb-48b9-986f-d25337a307b7","year":2023},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:38.645759Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:03aefbcdb01f6b0376c61e665e2b7e668793c888ae15cb7e9fc6ee0174507d78","observation_id":"e43ce0f0-c9b7-4608-8226-bfb75e33e9e1","resolution":{"observed_at":"2026-08-07T15:23:49.308364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:49.040929Z","title":"Approximate nearest neighbors: towards removing the curse of dimensionality","venue":null,"work_id":"c47a9399-e47d-4a0b-86a4-df686eb9098c","year":1998},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:38.788172Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:7c04851681682619f20d1136f48b678a8c8757f28ec5b9492b6ad48111cc7c02","observation_id":"80fa2c31-7c30-4037-a9e9-ea0cd2c998dc","resolution":{"observed_at":"2026-08-07T15:23:49.155586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:48.828153Z","title":"Worst-case performance of popular approximate nearest neighbor search implementations: Guarantees and limitations","venue":null,"work_id":"2dd5bdbf-12c8-47e4-b3e3-ba85024b6be8","year":2023},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:38.929720Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:553a9a23261f9bbdfb05ee820bbfe413e00757a06c714d5b2945d18f3f316569","observation_id":"abae3db0-bb1c-4bd1-9439-d9aedb6913b5","resolution":{"observed_at":"2026-08-07T15:23:48.903079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:48.679089Z","title":"MUVERA: Multi-vector retrieval via fixed dimensional encoding","venue":null,"work_id":"3235fc7f-decb-4f8d-9ede-4546d6c764ef","year":2024},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.029350Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:c83ab01a2263e1a66b9b718ddf6e5f82685ea381db6a5ef7dc1ee9b19ba5a5bd","observation_id":"643e3479-66ba-49c2-9dc7-4e0a2e71d3a7","resolution":{"observed_at":"2026-08-07T15:23:48.738611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:48.518225Z","title":"Product quantization for nearest neighbor search.IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(1):117–128, 2011","venue":null,"work_id":"ca8155aa-b44c-44d6-bbc7-31935485d990","year":2011},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.115735Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:950c4a8a1ae133d91eabe32c0e8348a6dfe849f66b20566d511da4e76593a395","observation_id":"ccc8faf4-6879-47b8-a3df-4af367fbc78d","resolution":{"observed_at":"2026-08-07T15:23:48.581163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:48.355416Z","title":"Billion-scale similarity search with GPUs","venue":null,"work_id":"4f7889ab-b73a-421c-bd86-0b8212c74429","year":2021},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.200945Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:e276ea06a5e078a8199daa91984aa74db68249be0232d5e35bdda6c6ec750482","observation_id":"9e80c638-dd36-44f7-8f9a-17eee42fc5e7","resolution":{"observed_at":"2026-08-07T15:23:48.435317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:48.227131Z","title":"DEANN: Speeding up kernel-density estimation using approximate nearest neighbor search","venue":null,"work_id":"5af46222-2d85-434d-9963-e31e5ef97410","year":2022},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.316307Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:a2a37184aa817a2f79b61a8e472acf1548e2bc44eb25a62abc7ceecf697d4b7f","observation_id":"043db366-ac95-4e80-9d58-e2c190d0796d","resolution":{"observed_at":"2026-08-07T15:23:48.275291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:48.030343Z","title":"Reformer: The efficient transformer","venue":null,"work_id":"11b47ac9-4e58-4e03-b920-a949343f381f","year":2020},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.410483Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:bd841b9096b8e6a387c9cb4e49bb8729903789778fd2dac5a3cb71a9ff9207ce","observation_id":"05182746-2633-4479-a9a2-c0a5357495ed","resolution":{"observed_at":"2026-08-07T15:23:48.121866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:47.827391Z","title":"Kleinberg","venue":null,"work_id":"7fa2ff08-3628-49d4-921e-f696f1dca7ae","year":1997},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.468389Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:31af805a664dd5d01d98452330ccc4a5af460d750b01ab79eb283da0ac553001","observation_id":"ba5a9c25-7a74-456e-9df8-01a293d7bc0a","resolution":{"observed_at":"2026-08-07T15:23:47.940543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:47.624118Z","title":"Kleinberg","venue":null,"work_id":"ae41a0b8-d929-4e06-b15d-663db5d3acc4","year":2000},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.572744Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:9638c1bfd827350af614c90f7d04a5516e2c6b6864cf23f6abc7ee6f211f327f","observation_id":"1e0e47b8-6f93-454b-889b-72cea3c5fb05","resolution":{"observed_at":"2026-08-07T15:23:47.723930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:47.458398Z","title":"Kleinberg","venue":null,"work_id":"69119baa-68b3-475a-9a3d-535cb69cd691","year":2000},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.688718Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:1021c63f79bb9ace7604f35288cb9a567100bb85379ee412f5add6e1a97149ce","observation_id":"4c1496c2-6155-4df0-a6dc-d8297dee56f8","resolution":{"observed_at":"2026-08-07T15:23:47.545143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:47.190607Z","title":"The diskann library: Graph-based indices for fast, fresh and filtered vector search.IEEE Data Eng","venue":null,"work_id":"5af65423-4382-4ad0-a28c-5079901c47fa","year":2024},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.779360Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:ae01a1390e0d0b63ae0d10bd1f350e21ddbd39e5abc3d037df9e8b992fb94306","observation_id":"99245caf-883c-4c46-be65-97922e13355e","resolution":{"observed_at":"2026-08-07T15:23:47.315791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:46.920925Z","title":"Efficient search for approximate nearest neighbor in high dimensional spaces","venue":null,"work_id":"75696120-9688-4f0e-9f71-51b9c3baa351","year":1998},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.867859Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:b2d3091469e311d105a65c57d9de208485a70cf75b27b9c1d85b31fb78a97820","observation_id":"0f2dba88-4a00-4b08-826b-692b1d915117","resolution":{"observed_at":"2026-08-07T15:23:47.050543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:46.678146Z","title":"Graph-based time-space trade-offs for approximate near neighbors","venue":null,"work_id":"6c48d8a4-5153-4ad2-867c-b4bb189b2a4f","year":2018},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:39.916231Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:b9c228fedf916e57880f59837ce4bf5b4c73f3d7dc5367e1a81035cc5700c363","observation_id":"aa2e2a26-5a6f-438d-9512-2073a94c2858","resolution":{"observed_at":"2026-08-07T15:23:46.786324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:46.466397Z","title":"Gradient-based learning applied to document recognition.Proceedings of the IEEE, 86(11):2278–2324, 1998","venue":null,"work_id":"4417dfb4-7e4a-44c7-bad0-e0bf31bb38f8","year":1998},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.010382Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:3d625255a9c2a5e3b9dfe043d4fc2e31627bf391b32de1391b6844fc4eb7b633","observation_id":"78034577-ee25-4ee4-aac5-a11db57d727d","resolution":{"observed_at":"2026-08-07T15:23:46.552393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:46.281638Z","title":"Retrieval-augmented generation for knowledge-intensive NLP tasks","venue":null,"work_id":"f1891236-768a-4dcd-b5d0-37ec6e3a98cd","year":2020},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.094620Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:1f50454d4a10172967cb570645a5a8d97e34ab19a52898efa819106154af8db1","observation_id":"7fccf354-1a59-44b9-926f-dc325765aa1f","resolution":{"observed_at":"2026-08-07T15:23:46.401097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:46.063552Z","title":"Improving approximate nearest neighbor search through learned adaptive early termination","venue":null,"work_id":"caf1b4cd-0d8f-44f9-b2be-65accaa368b2","year":2020},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.150697Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:08eddaeb5f95a6aad0309d0f890f4ae17e52f73289a491bc4941be91caa8f30c","observation_id":"7ad94ce5-0623-47bb-bcd1-061d8a46a4a0","resolution":{"observed_at":"2026-08-07T15:23:46.193069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:45.878192Z","title":null,"venue":null,"work_id":"ed5a6f98-e1b2-4622-8678-0f64f3d1b9aa","year":2018},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.201209Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:2a34d0053167af14db071241ea6a07e538d1bf59d5ad4f011aaaff5370e012c9","observation_id":"70b42256-25e2-40cc-b9b8-3b41fafd90a5","resolution":{"observed_at":"2026-08-07T15:23:45.979492Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:45.631537Z","title":"ROSE: Robust caches for amazon product search","venue":null,"work_id":"324b0923-b0f0-4f3a-a7e5-a5d858b9ac54","year":2022},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.252116Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:08c0e191aa5874f2811c2f7f91b5e52f86fabc8a09768eacf82b120f64645c15","observation_id":"b5b12377-8ded-456b-a79b-c74fa83c15ca","resolution":{"observed_at":"2026-08-07T15:23:45.746576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:45.403542Z","title":"Multi-probe LSH: efficient indexing for high-dimensional similarity search","venue":null,"work_id":"8e355d9c-e889-4194-a97f-c36db90ff0ff","year":2007},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.288119Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:5f03274608324e66532d38d786388befedcb2f10cc0b0d70f37b269d003c8d76","observation_id":"d0be54e2-f1f7-4a6b-9f35-b78960889bf5","resolution":{"observed_at":"2026-08-07T15:23:45.529612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:45.169712Z","title":"Approximate nearest neighbor algorithm based on navigable small world graphs.Information Systems, 45:61–68, 2014","venue":null,"work_id":"8240e33f-91d2-4716-9546-905386449373","year":2014},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.350311Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:14bade4c75772660b78113862db396d90101378fe5e81ee7d7b0d89f75d9de18","observation_id":"2b293841-70f7-4ca6-b8b8-7f6a542e0f26","resolution":{"observed_at":"2026-08-07T15:23:45.290775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:44.944936Z","title":"Malkov and D","venue":null,"work_id":"550e873a-fc7a-494c-ab35-6e859915f958","year":2020},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.418490Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:203961d2fc918fb3d774fb1d55dfc9e93d22dee01ba7b6a47ccc7fea4331e7b0","observation_id":"87d1756d-5079-4fbf-ad05-d2712fadafd4","resolution":{"observed_at":"2026-08-07T15:23:45.062325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13245","last_updated":"2025-09-10T01:44:42Z","snapshot_observed_at":"2026-08-07T18:07:19.585317Z","submitted_at":"2025-02-18T19:18:01Z","title":"Range Retrieval with Graph-Based Indices","version":3},"cited_work":{"arxiv_id":"2502.13245","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.13245","snapshot_observed_at":"2026-08-07T15:23:42.351985Z","title":"Range Retrieval with Graph-Based Indices","venue":"cs.IR","work_id":"7d28aae5-e19f-4e52-ae5c-c0373dc95feb","year":2025},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.500700Z"},"links":{"cited_paper":"/paper/2502.13245","citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:e87cf2f3e7fcdaefa783303d20594c36b80fae85760aaf1cc95d5faed2bdf563","observation_id":"4864ce11-cf61-4cb3-88f8-b892cbef2ef9","resolution":{"observed_at":"2026-08-07T15:23:42.396520Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:44.749430Z","title":"ParlayANN: Scalable and deterministic parallel graph- based approximate nearest neighbor search algorithms","venue":null,"work_id":"41c17e50-42d1-4f6c-917d-9f771f8eea7f","year":2024},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.588886Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:c55f7ec58ff88a3b39c03c2a1f36a63807b2872e50c667ca7994643e35835b67","observation_id":"30647543-3921-4e2c-9e44-3f26ffd40fe6","resolution":{"observed_at":"2026-08-07T15:23:44.839837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:44.540052Z","title":"Augmented language models: a survey.Transactions on Machine Learning Research, 2023","venue":null,"work_id":"453897c4-d1ff-4941-a49f-78305fb4b629","year":2023},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.677242Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:82575700bbf7f51f6b2303fcbf4990e9bd2b1d58bc25c0a0a8f23443eaf73ae4","observation_id":"8587a87f-5e8f-4f2a-a87e-34c77fa1c3f5","resolution":{"observed_at":"2026-08-07T15:23:44.632540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:44.257762Z","title":"The small world problem.Psychology Today, 2(1):60–67, 1967","venue":null,"work_id":"93282607-e3b9-44d6-b726-c501596fa25b","year":1967},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.806197Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:df18576a3de0a8d6cc559b10adb7c2453c2b1cbaa18af7bee2ab050de6469f01","observation_id":"c14ab085-1d1d-4df1-a4c4-5cdf7e3db90d","resolution":{"observed_at":"2026-08-07T15:23:44.392086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:44.046297Z","title":"An introduction to neural information retrieval.Foundations and Trends® in Information Retrieval, 13(1):1–126, 2018","venue":null,"work_id":"134325ef-c2fa-4e9b-baea-fc12d32438b9","year":2018},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:40.913380Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:04c1236d9d4a892e11e77095ae62cfd18a934a603f8687b578f3f34d74446976","observation_id":"c2df1dec-732d-465b-8b97-603d261b454d","resolution":{"observed_at":"2026-08-07T15:23:44.131226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:43.779386Z","title":null,"venue":null,"work_id":"b643027e-bc4e-4a00-87ce-37f809a637a5","year":2014},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.002411Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:45ba371ca8956f8085cfd3161df389f4a013826985d61b7015c50643535dde58","observation_id":"951043dc-85ed-4fd1-8e69-ddf478c211eb","resolution":{"observed_at":"2026-08-07T15:23:43.906510Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:43.544104Z","title":"Modeling the shape of the scene: A holistic representation of the spatial envelope.International journal of computer vision, 42:145–175, 2001","venue":null,"work_id":"9c1057e3-d10f-410f-9ede-5b1f32542cc4","year":2001},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.083804Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:7061d67ab4ddacfe3ca8a546ae6aa01e830038e40c68eaa2cb1d04219bdd6ea8","observation_id":"b074af12-1418-4a44-bba8-da49ac90ddaa","resolution":{"observed_at":"2026-08-07T15:23:43.662081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:43.368329Z","title":"Papadopoulos and Yannis Manolopoulos.Nearest Neighbor Search:: A Database Perspective","venue":null,"work_id":"114fe14a-013e-4f01-a13e-e612cf01ccec","year":2005},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.193180Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:d89196c02b154e824b9a0fe371e00e0600cedb5480e6750fdb57ade99e69c9fe","observation_id":"9546f1d8-4384-4a3d-97a8-e8ee5fdd19c5","resolution":{"observed_at":"2026-08-07T15:23:43.453155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:43.262745Z","title":null,"venue":null,"work_id":"d4d709a1-d801-4811-93b6-aa0596fadb4b","year":2014},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.293555Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:432425cb9c9002f5e648739cae9575ddc79f6b61f20fc296626d15bb018c1fc0","observation_id":"ffcaf56e-1173-418a-b860-1aa7b552ed8e","resolution":{"observed_at":"2026-08-07T15:23:43.312157Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:43.153852Z","title":"Graph-based nearest neighbor search: From practice to theory","venue":null,"work_id":"10a32607-21c9-4c14-bbd6-85f63bd3ca01","year":2020},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.378546Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:25d4a0321b01bd085b8fd709c5d02e209c290bf5c93ca0487e6d7f206d115939","observation_id":"a0f8e051-6a30-4974-be49-6181249d759c","resolution":{"observed_at":"2026-08-07T15:23:43.216465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17424","last_updated":"2024-09-25T23:24:56Z","snapshot_observed_at":"2026-08-02T09:28:14.540794Z","submitted_at":"2024-09-25T23:24:56Z","title":"Results of the Big ANN: NeurIPS'23 competition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17424","snapshot_observed_at":"2026-08-07T15:23:41.471610Z","title":"Results of the Big ANN: NeurIPS’23 competition.arXiv:2409.17424, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.471610Z"},"links":{"cited_paper":"/paper/2409.17424","citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:9ac61eb20dd4900f4e430eae5297f4c3b1d971f5811087cc49fcbb7a12e506ff","observation_id":"f7aa83ad-6f17-4025-bbab-d1389cbd7728","resolution":{"observed_at":"2026-08-07T15:23:41.471610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:43.039929Z","title":"Results of the NeurIPS’21 challenge on billion-scale approximate nearest neighbor search","venue":null,"work_id":"9d512847-e35b-4f0c-a6ff-823717314270","year":2021},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.578886Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:3de996a46095103da429bbf552d2a5b5219f77dc87bf3dd54c841fba9e2af3a6","observation_id":"8a64a0d2-e391-4c4e-8d5f-525e7c0b3f95","resolution":{"observed_at":"2026-08-07T15:23:43.083812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09613","last_updated":"2021-05-20T09:17:13Z","snapshot_observed_at":"2026-08-07T07:51:37.438902Z","submitted_at":"2021-05-20T09:17:13Z","title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09613","snapshot_observed_at":"2026-08-07T15:23:41.683431Z","title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search.arXiv:2105.09613, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.683431Z"},"links":{"cited_paper":"/paper/2105.09613","citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:6fcaf66dd1f0edfcbb69e901bcfe7c414e2479b2a45afdcc80bb955567726095","observation_id":"09a3bccb-c8ac-4469-bd51-691a280f3d3d","resolution":{"observed_at":"2026-08-07T15:23:41.683431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:42.938917Z","title":"Scalable and sustainable deep learning via randomized hashing","venue":null,"work_id":"299320b4-1ba6-4721-ab15-6fe27139e4d7","year":2017},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.777495Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:e9ed7f14ca93daf1a03c14182dba9f908d17bf4a9ef7103fd80e63fcf65652df","observation_id":"77195487-baee-4f17-92d5-abf49c3e5310","resolution":{"observed_at":"2026-08-07T15:23:43.001269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:42.836349Z","title":"DiskANN: Fast accurate billion-point nearest neighbor search on a single node","venue":null,"work_id":"7a43cb0f-1f12-464c-a8bb-188ac733ebbc","year":2019},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.827748Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:67376df415a79988fd314fc7fdd291dacbafdcac9c508cdc2e0330f28008562c","observation_id":"59fe8d68-47fc-4930-b2c9-d0ca03b9feda","resolution":{"observed_at":"2026-08-07T15:23:42.880714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:42.734467Z","title":"Gonçalves, Zanoni Dias, and Ricardo da S","venue":null,"work_id":"81864962-5807-49b6-8cbd-17134cab57ee","year":2019},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.871655Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:ecb1adc0c636a4a9d7903a61eb438754383e3c2676ec755626571d82f1cadbb2","observation_id":"131e48ad-dcc5-4fcb-8153-79799cb04873","resolution":{"observed_at":"2026-08-07T15:23:42.776984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:42.652405Z","title":"Bennett, Junaid Ahmed, and Arnold Overwijk","venue":null,"work_id":"e450824b-036a-4fe7-9c7b-45f1c6cce2c8","year":2021},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:41.954147Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:e179d3fc61c3e015c7487f70a7532a46ec31aa5feeb1dc90495d2ed420c43264","observation_id":"4f5d212b-0dfb-4282-82f3-072519541752","resolution":{"observed_at":"2026-08-07T15:23:42.700358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13826","last_updated":"2025-02-19T15:41:08Z","snapshot_observed_at":"2026-08-07T18:04:40.708988Z","submitted_at":"2025-02-19T15:41:08Z","title":"In-Place Updates of a Graph Index for Streaming Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13826","snapshot_observed_at":"2026-08-07T15:23:42.006202Z","title":"Bernstein, Badrish Chandramouli, Richard Wen, and Harsha Vardhan Simhadri","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:42.006202Z"},"links":{"cited_paper":"/paper/2502.13826","citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:9e16741330cc45385ef6f34a07e490d92a45252b0a801189dd936ad5f314495f","observation_id":"949dbd40-e8a4-4168-94c8-0ef54f8b5dd9","resolution":{"observed_at":"2026-08-07T15:23:42.006202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02891","last_updated":"2024-06-05T03:17:48Z","snapshot_observed_at":"2026-08-06T22:59:50.754481Z","submitted_at":"2024-06-05T03:17:48Z","title":"A Bi-metric Framework for Fast Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02891","snapshot_observed_at":"2026-08-07T15:23:42.116435Z","title":"A bi-metric framework for fast similarity search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:42.116435Z"},"links":{"cited_paper":"/paper/2406.02891","citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:9254cef8cce1c3e06fc4d518daf9b2a80155042caa8ac698dc6dc1592de805a4","observation_id":"e7bfca46-aef3-4a4a-89ea-f1f13fa639dc","resolution":{"observed_at":"2026-08-07T15:23:42.116435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:42.565202Z","title":"GraSP: Optimizing graph-based nearest neighbor search with subgraph sampling and pruning","venue":null,"work_id":"5b63c8f9-576f-4d73-973f-cad91ce63830","year":2022},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:42.163163Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:9661af0ceea4ac9f359911fee167fd8a0985caaa6152512bf996180153c997b4","observation_id":"7ab734b0-7b6d-4edd-8418-f6efd81785d0","resolution":{"observed_at":"2026-08-07T15:23:42.599330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:42.490955Z","title":"distance based","venue":null,"work_id":"8f418647-5198-43a8-b4fd-e65f66331025","year":1979},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:42.197962Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:87bd52e4e8ff0bb1f830df065bc0cff0e4ed0f4048cdec52d4e8fa5656ac7982","observation_id":"374e2187-7cca-430f-a670-082898192e25","resolution":{"observed_at":"2026-08-07T15:23:42.516278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:23:49.511649Z","title":null,"venue":null,"work_id":"1740be4e-5aa1-4dac-ae84-36d62f75a8d2","year":null},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:38.313256Z"},"links":{"citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:5df1bd3ea32d48e517fdf32e5cea212c36e2734d6c46838405109ea57b6b5d3d","observation_id":"906ba684-3e15-4eda-8bc3-af6de577bff4","resolution":{"observed_at":"2026-08-07T15:23:49.575458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":47},"total_outbound_references":60},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 3 inbound Pith citation observations for arXiv:2505.15636."}