{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7DXK6HF6ULF44EOJOE5GMY4PE6","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":"73bd59e3615e2ca1ce48f797a8e3287cc1b233cfcfd9da0e32f7da7737a6f36a","cross_cats_sorted":["cs.AI","cs.CV","cs.DB","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-17T18:08:37Z","title_canon_sha256":"8431e8c6baeb2752acbba2df7633881f6baf90ee4649c11cb08f0e49a209a173"},"schema_version":"1.0","source":{"id":"2402.11354","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.11354","created_at":"2026-07-05T08:42:21Z"},{"alias_kind":"arxiv_version","alias_value":"2402.11354v2","created_at":"2026-07-05T08:42:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11354","created_at":"2026-07-05T08:42:21Z"},{"alias_kind":"pith_short_12","alias_value":"7DXK6HF6ULF4","created_at":"2026-07-05T08:42:21Z"},{"alias_kind":"pith_short_16","alias_value":"7DXK6HF6ULF44EOJ","created_at":"2026-07-05T08:42:21Z"},{"alias_kind":"pith_short_8","alias_value":"7DXK6HF6","created_at":"2026-07-05T08:42:21Z"}],"graph_snapshots":[{"event_id":"sha256:a67f27344818ee493a4824cb2c8970b0e87aeaa31130045445b527accddef056","target":"graph","created_at":"2026-07-05T08:42:21Z","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/2402.11354/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Approximate nearest neighbor search (ANNS) in high-dimensional spaces is a pivotal challenge in the field of machine learning. In recent years, graph-based methods have emerged as the superior approach to ANNS, establishing a new state of the art. Although various optimizations for graph-based ANNS have been introduced, they predominantly rely on heuristic methods that lack formal theoretical backing. This paper aims to enhance routing within graph-based ANNS by introducing a method that offers a probabilistic guarantee when exploring a node's neighbors in the graph. We formulate the problem a","authors_text":"Chuan Xiao, Kejing Lu, Yoshiharu Ishikawa","cross_cats":["cs.AI","cs.CV","cs.DB","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-17T18:08:37Z","title":"Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11354","kind":"arxiv","version":2},"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:b042d80f07754ec6b3c5b465b5f3b0d8667e8415dcf9a065045eca345328b11a","target":"record","created_at":"2026-07-05T08:42:21Z","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":"73bd59e3615e2ca1ce48f797a8e3287cc1b233cfcfd9da0e32f7da7737a6f36a","cross_cats_sorted":["cs.AI","cs.CV","cs.DB","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-17T18:08:37Z","title_canon_sha256":"8431e8c6baeb2752acbba2df7633881f6baf90ee4649c11cb08f0e49a209a173"},"schema_version":"1.0","source":{"id":"2402.11354","kind":"arxiv","version":2}},"canonical_sha256":"f8eeaf1cbea2cbce11c9713a66638f27af5121d765d65c9a2c05c6b6ce706653","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8eeaf1cbea2cbce11c9713a66638f27af5121d765d65c9a2c05c6b6ce706653","first_computed_at":"2026-07-05T08:42:21.941914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:42:21.941914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VosSVM4iKXBgOZ2jBB0L5qKQWst3cOYWqYroMSxCzFj0y0/6zQsLEMcRSgsbsfGJ2AY0uTgu8MkQ80Ksw3QDCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:42:21.942374Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.11354","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b042d80f07754ec6b3c5b465b5f3b0d8667e8415dcf9a065045eca345328b11a","sha256:a67f27344818ee493a4824cb2c8970b0e87aeaa31130045445b527accddef056"],"state_sha256":"280ee15b9b35d3f1984c443da34e7c768c07646f073c8ffc4768e3bb8f6d0a5b"}