{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:USMJW6OMYM3VDVEVDHNG36GDBS","short_pith_number":"pith:USMJW6OM","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"},"canonical_sha256":"a4989b79ccc33751d49519da6df8c30c927356a29f6b39b6718fd1b88e611a37","source":{"kind":"arxiv","id":"2303.06210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.06210","created_at":"2026-07-05T05:50:16Z"},{"alias_kind":"arxiv_version","alias_value":"2303.06210v1","created_at":"2026-07-05T05:50:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.06210","created_at":"2026-07-05T05:50:16Z"},{"alias_kind":"pith_short_12","alias_value":"USMJW6OMYM3V","created_at":"2026-07-05T05:50:16Z"},{"alias_kind":"pith_short_16","alias_value":"USMJW6OMYM3VDVEV","created_at":"2026-07-05T05:50:16Z"},{"alias_kind":"pith_short_8","alias_value":"USMJW6OM","created_at":"2026-07-05T05:50:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:USMJW6OMYM3VDVEVDHNG36GDBS","target":"record","payload":{"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"},"canonical_sha256":"a4989b79ccc33751d49519da6df8c30c927356a29f6b39b6718fd1b88e611a37","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"},"source_kind":"arxiv","source_id":"2303.06210","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:50:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lp28r43zWnpqrhlEUn8IMXaeyvguIryyBjq1zXJ3QfrwCjJGFu3sTY3wd1TBZgrKDwragq88IeUp2Onr428BDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:36:23.365841Z"},"content_sha256":"a7a75c796d284e5528bc8c3f4a3a18ced4b64dc70f260a0a346f19cfda753b43","schema_version":"1.0","event_id":"sha256:a7a75c796d284e5528bc8c3f4a3a18ced4b64dc70f260a0a346f19cfda753b43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:USMJW6OMYM3VDVEVDHNG36GDBS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:50:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LhIN5BVj6rP/Goi+D9/Wm6Relc7kXARcyAgA5aW6C5aoMDgWg0KKI88CWgJdb0FAaYwryr9MPWFTy4X1kyytCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:36:23.366820Z"},"content_sha256":"38cd7aac702bc5daf3282d39043a163f82b6abeb3647b0d4e4e068e630d4c9b9","schema_version":"1.0","event_id":"sha256:38cd7aac702bc5daf3282d39043a163f82b6abeb3647b0d4e4e068e630d4c9b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS/bundle.json","state_url":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USMJW6OMYM3VDVEVDHNG36GDBS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T09:36:23Z","links":{"resolver":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS","bundle":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS/bundle.json","state":"https://pith.science/pith/USMJW6OMYM3VDVEVDHNG36GDBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USMJW6OMYM3VDVEVDHNG36GDBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:USMJW6OMYM3VDVEVDHNG36GDBS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dedcce10724759ad5cf801ee8c511244ee6d584c21b6b129d73615229a0ee8b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-10T21:18:34Z","title_canon_sha256":"1951f78c7ea6a338985906110a0d306019917b0e38482807d3a733b740e44279"},"schema_version":"1.0","source":{"id":"2303.06210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.06210","created_at":"2026-07-05T05:50:16Z"},{"alias_kind":"arxiv_version","alias_value":"2303.06210v1","created_at":"2026-07-05T05:50:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.06210","created_at":"2026-07-05T05:50:16Z"},{"alias_kind":"pith_short_12","alias_value":"USMJW6OMYM3V","created_at":"2026-07-05T05:50:16Z"},{"alias_kind":"pith_short_16","alias_value":"USMJW6OMYM3VDVEV","created_at":"2026-07-05T05:50:16Z"},{"alias_kind":"pith_short_8","alias_value":"USMJW6OM","created_at":"2026-07-05T05:50:16Z"}],"graph_snapshots":[{"event_id":"sha256:38cd7aac702bc5daf3282d39043a163f82b6abeb3647b0d4e4e068e630d4c9b9","target":"graph","created_at":"2026-07-05T05:50:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.06210/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anshumali Shrivastava, Zhao Song, Zhaozhuo Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-10T21:18:34Z","title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.06210","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a7a75c796d284e5528bc8c3f4a3a18ced4b64dc70f260a0a346f19cfda753b43","target":"record","created_at":"2026-07-05T05:50:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dedcce10724759ad5cf801ee8c511244ee6d584c21b6b129d73615229a0ee8b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-10T21:18:34Z","title_canon_sha256":"1951f78c7ea6a338985906110a0d306019917b0e38482807d3a733b740e44279"},"schema_version":"1.0","source":{"id":"2303.06210","kind":"arxiv","version":1}},"canonical_sha256":"a4989b79ccc33751d49519da6df8c30c927356a29f6b39b6718fd1b88e611a37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4989b79ccc33751d49519da6df8c30c927356a29f6b39b6718fd1b88e611a37","first_computed_at":"2026-07-05T05:50:16.016343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:50:16.016343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mAc5FDA/15c9CqcWI+cFw4Zcj1laigLf33Xu548dthAxASKJ6+JGEX64Cb8dfZgSJJAujG/8G4+Fv7Ra11/RAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:50:16.016774Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.06210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7a75c796d284e5528bc8c3f4a3a18ced4b64dc70f260a0a346f19cfda753b43","sha256:38cd7aac702bc5daf3282d39043a163f82b6abeb3647b0d4e4e068e630d4c9b9"],"state_sha256":"879d85e31fcd243ad1a1fefefad74c445cdc187224d67b34944b1cd6bad3c8de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TXM+aScx21CC798m7igSO1vCWwXipUJsbONRLtBEveZG3fnndtTB7M60hY6rZWBqwli7ib6XS8Sl5hNb3+0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T09:36:23.375024Z","bundle_sha256":"a459f922450183c63be45391cc6353dcd59e01cb57971795a9ee98c5ec473c99"}}