{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZZI5PN2V4YSH4JPAJOOMBJMKXA","short_pith_number":"pith:ZZI5PN2V","canonical_record":{"source":{"id":"2402.04713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-02-07T10:05:42Z","cross_cats_sorted":["cs.DB","cs.LG"],"title_canon_sha256":"d533821c376663e256d50f8307d938f16631a55921b546deb393304e1960d3d2","abstract_canon_sha256":"79306c96bc2b20d72d0191e58fb8383d971ce820cac1ea63de0df9c705499a26"},"schema_version":"1.0"},"canonical_sha256":"ce51d7b755e6247e25e04b9cc0a58ab820f0c3f0b932c5eb9cf42073024bb5b3","source":{"kind":"arxiv","id":"2402.04713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.04713","created_at":"2026-07-05T07:42:31Z"},{"alias_kind":"arxiv_version","alias_value":"2402.04713v1","created_at":"2026-07-05T07:42:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.04713","created_at":"2026-07-05T07:42:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZZI5PN2V4YSH","created_at":"2026-07-05T07:42:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZZI5PN2V4YSH4JPA","created_at":"2026-07-05T07:42:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZZI5PN2V","created_at":"2026-07-05T07:42:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZZI5PN2V4YSH4JPAJOOMBJMKXA","target":"record","payload":{"canonical_record":{"source":{"id":"2402.04713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-02-07T10:05:42Z","cross_cats_sorted":["cs.DB","cs.LG"],"title_canon_sha256":"d533821c376663e256d50f8307d938f16631a55921b546deb393304e1960d3d2","abstract_canon_sha256":"79306c96bc2b20d72d0191e58fb8383d971ce820cac1ea63de0df9c705499a26"},"schema_version":"1.0"},"canonical_sha256":"ce51d7b755e6247e25e04b9cc0a58ab820f0c3f0b932c5eb9cf42073024bb5b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:42:31.267250Z","signature_b64":"o9oZg4SI5I8XPmHY5Ob4bGmaj/DuhRK7f9A3ZDp8j3mX0WE0zOVepBl+ipa7Jrh+/cf1sc1uRar4naa+O5hbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce51d7b755e6247e25e04b9cc0a58ab820f0c3f0b932c5eb9cf42073024bb5b3","last_reissued_at":"2026-07-05T07:42:31.266747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:42:31.266747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.04713","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-05T07:42:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2AN0Qi7Rm7BcQwHdT7EuUKh9WjT3MeFqJeaRvT5wTFZyHG+9pa0jOp9IkwJy21jUwrCmSIzeCfTeQfQNg0cBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T00:34:03.178637Z"},"content_sha256":"209bd0be68e2e16abe4f08561482da643549c6e544edec4124d72070e30094b4","schema_version":"1.0","event_id":"sha256:209bd0be68e2e16abe4f08561482da643549c6e544edec4124d72070e30094b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZZI5PN2V4YSH4JPAJOOMBJMKXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"cs.IR","authors_text":"Yusuke Matsui, Yutaro Oguri","submitted_at":"2024-02-07T10:05:42Z","abstract_excerpt":"We present a theoretical and empirical analysis of the adaptive entry point selection for graph-based approximate nearest neighbor search (ANNS). We introduce novel concepts: $b\\textit{-monotonic path}$ and $B\\textit{-MSNET}$, which better capture an actual graph in practical algorithms than existing concepts like MSNET. We prove that adaptive entry point selection offers better performance upper bound than the fixed central entry point under more general conditions than previous work. Empirically, we validate the method's effectiveness in accuracy, speed, and memory usage across various datas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.04713","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/2402.04713/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-05T07:42:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opSdqYhAuXG4WJSNVpq+A/ppbYhgdhWWELjZTqBOzHcqScdcAE5ZIrdam/k0BvjVsUlbkyG4SrK2DbE14d3PDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T00:34:03.179415Z"},"content_sha256":"4a265f11ff9f009a1ceb112f8d530de273604cd1476719f855ef1d578d57abfd","schema_version":"1.0","event_id":"sha256:4a265f11ff9f009a1ceb112f8d530de273604cd1476719f855ef1d578d57abfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZI5PN2V4YSH4JPAJOOMBJMKXA/bundle.json","state_url":"https://pith.science/pith/ZZI5PN2V4YSH4JPAJOOMBJMKXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZI5PN2V4YSH4JPAJOOMBJMKXA/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-20T00:34:03Z","links":{"resolver":"https://pith.science/pith/ZZI5PN2V4YSH4JPAJOOMBJMKXA","bundle":"https://pith.science/pith/ZZI5PN2V4YSH4JPAJOOMBJMKXA/bundle.json","state":"https://pith.science/pith/ZZI5PN2V4YSH4JPAJOOMBJMKXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZI5PN2V4YSH4JPAJOOMBJMKXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZZI5PN2V4YSH4JPAJOOMBJMKXA","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":"79306c96bc2b20d72d0191e58fb8383d971ce820cac1ea63de0df9c705499a26","cross_cats_sorted":["cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-02-07T10:05:42Z","title_canon_sha256":"d533821c376663e256d50f8307d938f16631a55921b546deb393304e1960d3d2"},"schema_version":"1.0","source":{"id":"2402.04713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.04713","created_at":"2026-07-05T07:42:31Z"},{"alias_kind":"arxiv_version","alias_value":"2402.04713v1","created_at":"2026-07-05T07:42:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.04713","created_at":"2026-07-05T07:42:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZZI5PN2V4YSH","created_at":"2026-07-05T07:42:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZZI5PN2V4YSH4JPA","created_at":"2026-07-05T07:42:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZZI5PN2V","created_at":"2026-07-05T07:42:31Z"}],"graph_snapshots":[{"event_id":"sha256:4a265f11ff9f009a1ceb112f8d530de273604cd1476719f855ef1d578d57abfd","target":"graph","created_at":"2026-07-05T07:42:31Z","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.04713/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a theoretical and empirical analysis of the adaptive entry point selection for graph-based approximate nearest neighbor search (ANNS). We introduce novel concepts: $b\\textit{-monotonic path}$ and $B\\textit{-MSNET}$, which better capture an actual graph in practical algorithms than existing concepts like MSNET. We prove that adaptive entry point selection offers better performance upper bound than the fixed central entry point under more general conditions than previous work. Empirically, we validate the method's effectiveness in accuracy, speed, and memory usage across various datas","authors_text":"Yusuke Matsui, Yutaro Oguri","cross_cats":["cs.DB","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-02-07T10:05:42Z","title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.04713","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:209bd0be68e2e16abe4f08561482da643549c6e544edec4124d72070e30094b4","target":"record","created_at":"2026-07-05T07:42:31Z","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":"79306c96bc2b20d72d0191e58fb8383d971ce820cac1ea63de0df9c705499a26","cross_cats_sorted":["cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-02-07T10:05:42Z","title_canon_sha256":"d533821c376663e256d50f8307d938f16631a55921b546deb393304e1960d3d2"},"schema_version":"1.0","source":{"id":"2402.04713","kind":"arxiv","version":1}},"canonical_sha256":"ce51d7b755e6247e25e04b9cc0a58ab820f0c3f0b932c5eb9cf42073024bb5b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce51d7b755e6247e25e04b9cc0a58ab820f0c3f0b932c5eb9cf42073024bb5b3","first_computed_at":"2026-07-05T07:42:31.266747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:42:31.266747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o9oZg4SI5I8XPmHY5Ob4bGmaj/DuhRK7f9A3ZDp8j3mX0WE0zOVepBl+ipa7Jrh+/cf1sc1uRar4naa+O5hbAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:42:31.267250Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.04713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:209bd0be68e2e16abe4f08561482da643549c6e544edec4124d72070e30094b4","sha256:4a265f11ff9f009a1ceb112f8d530de273604cd1476719f855ef1d578d57abfd"],"state_sha256":"dc4d76a36ce12f372fbfa36c4df447b6d27ab4e6f70f757703d5d9657f985c53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gc3juu7M19Us9OBc2DkMunSd5LaV+0v5WP3+Zvf6UrIcfoYgh/IiD2cJxInRUQv87B0VIkc5GH9V0U+VSy0zBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T00:34:03.194277Z","bundle_sha256":"003b95e2d75e68a475c4523d17be436260347258c4a9a30a7112be5f416e2894"}}