{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:USMJW6OMYM3VDVEVDHNG36GDBS","short_pith_number":"pith:USMJW6OM","schema_version":"1.0","canonical_sha256":"a4989b79ccc33751d49519da6df8c30c927356a29f6b39b6718fd1b88e611a37","source":{"kind":"arxiv","id":"2303.06210","version":1},"attestation_state":"computed","paper":{"title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anshumali Shrivastava, Zhao Song, Zhaozhuo Xu","submitted_at":"2023-03-10T21:18:34Z","abstract_excerpt":"Graph-based algorithms have demonstrated state-of-the-art performance in the nearest neighbor search (NN-Search) problem. These empirical successes urge the need for theoretical results that guarantee the search quality and efficiency of these algorithms. However, there exists a practice-to-theory gap in the graph-based NN-Search algorithms. Current theoretical literature focuses on greedy search on exact near neighbor graph while practitioners use approximate near neighbor graph (ANN-Graph) to reduce the preprocessing time. This work bridges this gap by presenting the theoretical guarantees o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2303.06210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-10T21:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"1951f78c7ea6a338985906110a0d306019917b0e38482807d3a733b740e44279","abstract_canon_sha256":"dedcce10724759ad5cf801ee8c511244ee6d584c21b6b129d73615229a0ee8b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:50:16.016774Z","signature_b64":"mAc5FDA/15c9CqcWI+cFw4Zcj1laigLf33Xu548dthAxASKJ6+JGEX64Cb8dfZgSJJAujG/8G4+Fv7Ra11/RAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4989b79ccc33751d49519da6df8c30c927356a29f6b39b6718fd1b88e611a37","last_reissued_at":"2026-07-05T05:50:16.016343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:50:16.016343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anshumali Shrivastava, Zhao Song, Zhaozhuo Xu","submitted_at":"2023-03-10T21:18:34Z","abstract_excerpt":"Graph-based algorithms have demonstrated state-of-the-art performance in the nearest neighbor search (NN-Search) problem. These empirical successes urge the need for theoretical results that guarantee the search quality and efficiency of these algorithms. However, there exists a practice-to-theory gap in the graph-based NN-Search algorithms. Current theoretical literature focuses on greedy search on exact near neighbor graph while practitioners use approximate near neighbor graph (ANN-Graph) to reduce the preprocessing time. This work bridges this gap by presenting the theoretical guarantees o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.06210","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.06210/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2303.06210","created_at":"2026-07-05T05:50:16.016405+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.06210v1","created_at":"2026-07-05T05:50:16.016405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.06210","created_at":"2026-07-05T05:50:16.016405+00:00"},{"alias_kind":"pith_short_12","alias_value":"USMJW6OMYM3V","created_at":"2026-07-05T05:50:16.016405+00:00"},{"alias_kind":"pith_short_16","alias_value":"USMJW6OMYM3VDVEV","created_at":"2026-07-05T05:50:16.016405+00:00"},{"alias_kind":"pith_short_8","alias_value":"USMJW6OM","created_at":"2026-07-05T05:50:16.016405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00688","citing_title":"High-Order Matching for One-Step Shortcut Diffusion Models","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS","json":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS.json","graph_json":"https://pith.science/api/pith-number/USMJW6OMYM3VDVEVDHNG36GDBS/graph.json","events_json":"https://pith.science/api/pith-number/USMJW6OMYM3VDVEVDHNG36GDBS/events.json","paper":"https://pith.science/paper/USMJW6OM"},"agent_actions":{"view_html":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS","download_json":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS.json","view_paper":"https://pith.science/paper/USMJW6OM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.06210&json=true","fetch_graph":"https://pith.science/api/pith-number/USMJW6OMYM3VDVEVDHNG36GDBS/graph.json","fetch_events":"https://pith.science/api/pith-number/USMJW6OMYM3VDVEVDHNG36GDBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS/action/storage_attestation","attest_author":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS/action/author_attestation","sign_citation":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS/action/citation_signature","submit_replication":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS/action/replication_record"}},"created_at":"2026-07-05T05:50:16.016405+00:00","updated_at":"2026-07-05T05:50:16.016405+00:00"}