{"as_of":"2026-08-08T10:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cee7b53764a6769b511a3166eb627f08ce1e2fa2e7680b793febf2a0e8caeeb6","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:23:30.617105Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2507.14060/citation-record","integrity":"/paper/2507.14060/integrity","json":"/paper/2507.14060/citation-record.json","paper":"/paper/2507.14060"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:23:33.815590Z","title":"Raykar, Kirankumar Shiragur, and Haike Xu","venue":null,"work_id":"f224bae9-a23d-4d14-a43c-a740b86fafc6","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":1,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:28.645852Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:5b257791044e115ffc037e25d1eff175b2029da3f447fbc2dddce77c6a0b284e","observation_id":"99f3d122-1160-47c9-9c41-2a3410948dd6","resolution":{"observed_at":"2026-08-06T16:23:33.858879Z","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":"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:23:28.923821Z","title":"Cover trees for nearest neighbor","venue":null,"work_id":null,"year":2006},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:28.923821Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:28a05fcaec8eff4e29daa0f2adb83e8bbc2b83fb64f9430f1bb2d6434f5f92e7","observation_id":"085de39c-927a-4cb2-bd6f-90bd7dfbd56b","resolution":{"observed_at":"2026-08-06T16:23:28.923821Z","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-06T16:23:33.687779Z","title":"Efficiently constructing sparse navigable graphs, 2025","venue":null,"work_id":"60169bc6-c5b2-4c37-9d01-38f5ef454407","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":4,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:28.993190Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:02a6d86c4bcac693198da4de6da37430ca0538cc53093057484ef66f5c6e73b7","observation_id":"5be74378-1d57-4ceb-97d5-9465635ff85d","resolution":{"observed_at":"2026-08-06T16:23:33.752665Z","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-06T16:23:33.515091Z","title":"Clarkson","venue":null,"work_id":"73999869-cb42-4dd2-a02c-e08c8463c939","year":2006},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.087532Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:15555ce43bddb7961a11069048ccf93e3ee970d0af77ccbb2c1eaf0876347f96","observation_id":"96bd0df0-e7f9-4cab-95ee-9c05e221cc94","resolution":{"observed_at":"2026-08-06T16:23:33.590758Z","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-06T16:23:33.370956Z","title":"Navigable graphs for high-dimensional nearest neighbor search: Constructions and limits","venue":null,"work_id":"d4e1e8cf-4dc1-472c-b948-2fc8f18cc580","year":2024},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.153078Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:ea5342d766bca218a17d043f091a499bc9336c7fcdc3af562718c98d4bf36ebe","observation_id":"3dab7f35-fdb0-4c87-879c-5e07b59cba92","resolution":{"observed_at":"2026-08-06T16:23:33.440796Z","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-06T16:23:33.199475Z","title":"Beyond the Worst-Case Analysis of Algorithms , chapter Nearest Neighbor Classification and Search","venue":null,"work_id":"5b7b204d-e9ec-4f8d-a644-c303fbe67a4f","year":2020},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.214632Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:5512536d5683d228a5cd47f4b585eb18bb7c098a690eaefa2a96bfece24a3173","observation_id":"6b927733-6639-4381-8e3c-b2ff9a592385","resolution":{"observed_at":"2026-08-06T16:23:33.273115Z","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-06T16:23:33.089347Z","title":"Analytical approach to parallel repetition","venue":null,"work_id":"d454f05a-317f-4ac8-8b79-78964f31cf0c","year":2014},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.293481Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:20d16bb16224d237315d664029474f84ecc9877f4a810a4a8e1296f8fc790436","observation_id":"a9a723aa-1371-4945-8904-b24ab588dd44","resolution":{"observed_at":"2026-08-06T16:23:33.144507Z","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-06T16:23:32.921383Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":null,"work_id":"6e4da6a3-d01a-44b4-af66-1b47cba62f85","year":2019},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.373562Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:4f15d30b0553114453ce0b91da3974ff0d521be9dac7dc47e7cddea531d9f4c4","observation_id":"6af91fb4-c8c9-47bc-8824-02d8177020ae","resolution":{"observed_at":"2026-08-06T16:23:33.007146Z","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-06T16:23:32.710614Z","title":"Gupta, R","venue":null,"work_id":"82b42981-63f1-4fcd-9d9f-da4548d32515","year":2003},"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":10,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.420760Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:49587594a865d1ae4ffb2ed2873d4fe2ca3e8fd0533f76a73da448664f10a4e0","observation_id":"5bd037a6-6398-42ef-8ea2-7ad416cb6bdd","resolution":{"observed_at":"2026-08-06T16:23:32.810373Z","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-06T16:23:32.561979Z","title":"Sort before you prune: Improved worst-case guarantees of the disk ANN family of graphs","venue":null,"work_id":"7cc581ab-4415-41d9-881e-5edbbdce08fe","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":11,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.536048Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:3080e47a02df57622f19ffb0bb5699782231797a03ad384f769baaf6cc884e7d","observation_id":"818a9545-aabd-4cd0-acab-f7f3f14b61d3","resolution":{"observed_at":"2026-08-06T16:23:32.617942Z","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-06T16:23:32.399109Z","title":"Set Cover in Sub-linear Time","venue":null,"work_id":"6cc8c8e8-f61b-4a8a-85c7-e603633045ae","year":2018},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.644618Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:0f22f0263f81e24330f2c3d2994e4de345b9e59da4c6e2722c8ee3deb71729a7","observation_id":"7da4fcbe-ab94-4ca6-b027-cc944df89c66","resolution":{"observed_at":"2026-08-06T16:23:32.476817Z","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-06T16:23:32.250914Z","title":"Worst-case performance of popular approximate nearest neighbor search implementations: Guarantees and limitations","venue":null,"work_id":"9bdb12ad-50dd-46c3-8cd1-7bf809881a3e","year":2023},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.786099Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:33e72476e03254e1f94b89fd694126598280ae41b57cc50f881d71796fe0a1d3","observation_id":"a3bfaf76-b0aa-45dd-ad01-e20c3ea00c6f","resolution":{"observed_at":"2026-08-06T16:23:32.314898Z","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-06T16:23:32.122499Z","title":null,"venue":null,"work_id":"dde3ffae-3a53-411a-a01b-65632190b031","year":1973},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.844574Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:b507c91de6d4d2b9dcd77f817580d73cdc1a4fd939e1beedba991362e7af0f09","observation_id":"c0b7d52f-d8b3-4b94-aa56-c2c5bb8a441a","resolution":{"observed_at":"2026-08-06T16:23:32.188556Z","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-06T16:23:31.927894Z","title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","venue":null,"work_id":"01fe710d-c389-4ad7-8240-1f292ca55ec5","year":2019},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.896659Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:c6a66e629a104aaa00cfcf9a93472f9b700dc86b20bc6c9f16124e5ca48d05f6","observation_id":"367c4ac4-1f3b-4f4a-b417-eb6c66a2cb9c","resolution":{"observed_at":"2026-08-06T16:23:32.033927Z","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-06T16:23:31.755874Z","title":null,"venue":null,"work_id":"4c6f7cdf-d83b-466e-8b61-4e180f2bee2a","year":2004},"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":16,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:29.965129Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:bc9c55401387edb6caffa8ab1d4ac9d3b8b107d8b6abf23d92d042945da31a61","observation_id":"92862936-58c5-4284-9927-ecb5aaf6d266","resolution":{"observed_at":"2026-08-06T16:23:31.841068Z","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-06T16:23:31.606392Z","title":null,"venue":null,"work_id":"1fe36ae8-fbc1-469a-8321-24fdae003abc","year":2014},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:30.021838Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:88673e2f86d7fa3e49843404e812abf001d2630e4ce4100f6349e0969ec68002","observation_id":"ac609635-d673-45ac-af68-72a309716974","resolution":{"observed_at":"2026-08-06T16:23:31.700281Z","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-06T16:23:31.407686Z","title":"Graph-based time-space trade-offs for approximate near neighbors","venue":null,"work_id":"60c2b0ff-14f8-494b-8929-c96e0b753a92","year":2018},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:30.122173Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:c89945ae04f80b3851dcf26f31a922a5ef7100d30c7b6c19e2a975b6213e8b92","observation_id":"c69cd5fd-4e9d-4174-b3ef-12d3d979a378","resolution":{"observed_at":"2026-08-06T16:23:31.503757Z","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-06T16:23:31.256541Z","title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","venue":null,"work_id":"ec088383-fadd-417a-af18-8cab5d0288f5","year":2018},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:30.258257Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:ef914cba7a95919d8ce6d25c3840c7c02e3b32831d5d556c316c466c199a9352","observation_id":"9214f825-5596-447e-9b7b-34223786c64e","resolution":{"observed_at":"2026-08-06T16:23:31.351836Z","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-06T16:23:31.112468Z","title":"Graph-based nearest neighbor search: From practice to theory","venue":null,"work_id":"f0af1d96-7f65-4291-af63-fac88aa68e88","year":2020},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:30.355803Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:31bf3a00ef64e72b9ddcd66bd879dc8b94660a5f0de02ff4294b0ca8296afd8b","observation_id":"34400c9c-2619-469c-bc92-6a3ea43ef561","resolution":{"observed_at":"2026-08-06T16:23:31.178624Z","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-06T16:23:30.933902Z","title":"Results of the big ann: Neurips'23 competition, 2024","venue":null,"work_id":"ac66f6e4-8a72-4209-b9b9-e7d65c84b470","year":2024},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:30.423625Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:16f659cdb6e4c7a544d6f20f092fda20b98827cc4ee88492f6e9dfeefd250b72","observation_id":"256c9ea2-c08d-4674-8737-9662dc47225b","resolution":{"observed_at":"2026-08-06T16:23:31.032003Z","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-06T16:23:30.751818Z","title":"Results of the NeurIPS'21 challenge on billion-scale approximate nearest neighbor search","venue":null,"work_id":"0fff4c29-560c-4090-b2d9-c5b90d8ccc33","year":2021},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:30.512969Z"},"links":{"citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:c218f8064366c73ec7689f76e2edb942289a0b775fa47597d83b35fa50fea11c","observation_id":"d062ba19-f5df-4403-b356-f4ffd9ad3bc9","resolution":{"observed_at":"2026-08-06T16:23:30.817662Z","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":"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-06T16:23:30.617105Z","title":"A bi-metric framework for fast similarity search","venue":null,"work_id":null,"year":2024},"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":23,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:30.617105Z"},"links":{"cited_paper":"/paper/2406.02891","citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:14737b6eb3c9b9caf18f941e828e0f91a95c450ea6bf73d96ff719add7791c90","observation_id":"b90574ad-1c11-436d-aa30-332d36d88d5c","resolution":{"observed_at":"2026-08-06T16:23:30.617105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.14060","last_updated":"2025-07-18T16:41:21Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":23},"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 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2507.14060."}