{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7DXK6HF6ULF44EOJOE5GMY4PE6","short_pith_number":"pith:7DXK6HF6","canonical_record":{"source":{"id":"2402.11354","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-17T18:08:37Z","cross_cats_sorted":["cs.AI","cs.CV","cs.DB","cs.DS"],"title_canon_sha256":"8431e8c6baeb2752acbba2df7633881f6baf90ee4649c11cb08f0e49a209a173","abstract_canon_sha256":"73bd59e3615e2ca1ce48f797a8e3287cc1b233cfcfd9da0e32f7da7737a6f36a"},"schema_version":"1.0"},"canonical_sha256":"f8eeaf1cbea2cbce11c9713a66638f27af5121d765d65c9a2c05c6b6ce706653","source":{"kind":"arxiv","id":"2402.11354","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7DXK6HF6ULF44EOJOE5GMY4PE6","target":"record","payload":{"canonical_record":{"source":{"id":"2402.11354","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-17T18:08:37Z","cross_cats_sorted":["cs.AI","cs.CV","cs.DB","cs.DS"],"title_canon_sha256":"8431e8c6baeb2752acbba2df7633881f6baf90ee4649c11cb08f0e49a209a173","abstract_canon_sha256":"73bd59e3615e2ca1ce48f797a8e3287cc1b233cfcfd9da0e32f7da7737a6f36a"},"schema_version":"1.0"},"canonical_sha256":"f8eeaf1cbea2cbce11c9713a66638f27af5121d765d65c9a2c05c6b6ce706653","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:21.942374Z","signature_b64":"VosSVM4iKXBgOZ2jBB0L5qKQWst3cOYWqYroMSxCzFj0y0/6zQsLEMcRSgsbsfGJ2AY0uTgu8MkQ80Ksw3QDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8eeaf1cbea2cbce11c9713a66638f27af5121d765d65c9a2c05c6b6ce706653","last_reissued_at":"2026-07-05T08:42:21.941914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:21.941914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.11354","source_version":2,"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-05T08:42:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnmRHX0GwdYhKOxpaN8+mUrwB5vW3FP0wtXksJdT4WI3DrTGjj/bGlmEzTZm7PYLc/W65En5FoxEcCWPEmW6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T21:11:40.290462Z"},"content_sha256":"b042d80f07754ec6b3c5b465b5f3b0d8667e8415dcf9a065045eca345328b11a","schema_version":"1.0","event_id":"sha256:b042d80f07754ec6b3c5b465b5f3b0d8667e8415dcf9a065045eca345328b11a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7DXK6HF6ULF44EOJOE5GMY4PE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.DB","cs.DS"],"primary_cat":"cs.LG","authors_text":"Chuan Xiao, Kejing Lu, Yoshiharu Ishikawa","submitted_at":"2024-02-17T18:08:37Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11354","kind":"arxiv","version":2},"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/2402.11354/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-05T08:42:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oPu3sweaGRXcuERzUAKLdaWH+4QDu/CwsMkO3zSYsnx9jTB/sDe0OG3oJJiMbe88DHo9EX+A7cMM6sHukbrsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T21:11:40.291008Z"},"content_sha256":"a67f27344818ee493a4824cb2c8970b0e87aeaa31130045445b527accddef056","schema_version":"1.0","event_id":"sha256:a67f27344818ee493a4824cb2c8970b0e87aeaa31130045445b527accddef056"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DXK6HF6ULF44EOJOE5GMY4PE6/bundle.json","state_url":"https://pith.science/pith/7DXK6HF6ULF44EOJOE5GMY4PE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DXK6HF6ULF44EOJOE5GMY4PE6/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-19T21:11:40Z","links":{"resolver":"https://pith.science/pith/7DXK6HF6ULF44EOJOE5GMY4PE6","bundle":"https://pith.science/pith/7DXK6HF6ULF44EOJOE5GMY4PE6/bundle.json","state":"https://pith.science/pith/7DXK6HF6ULF44EOJOE5GMY4PE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DXK6HF6ULF44EOJOE5GMY4PE6/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYnNbEeGEADBVGQaLE8/LQPRYrZ37PWv9DeFR2Qj4R/HDaitSsJ2+Dgy+i26X430FTBYTqG9XKBcf8kHqPzMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T21:11:40.297988Z","bundle_sha256":"b6750ced134f7a14471eee5b221d56ed939bb8887a1e36b62f90b93ded85796c"}}