{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NQBXOB7STIFSXE2Z2KGHXXEPMG","short_pith_number":"pith:NQBXOB7S","canonical_record":{"source":{"id":"2501.13992","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-23T10:20:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"40ca155bb8c54b3e194b821d753511376ba601829a98c54f70fb5f0b6c70f5db","abstract_canon_sha256":"9ef1af313eea31b79c233f0be9da3ff216c12189c1c6ffebd5fe11684648b573"},"schema_version":"1.0"},"canonical_sha256":"6c037707f29a0b2b9359d28c7bdc8f6198513b50410e516c9b880e3937d556ec","source":{"kind":"arxiv","id":"2501.13992","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13992","created_at":"2026-07-05T10:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13992v2","created_at":"2026-07-05T10:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13992","created_at":"2026-07-05T10:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"NQBXOB7STIFS","created_at":"2026-07-05T10:53:51Z"},{"alias_kind":"pith_short_16","alias_value":"NQBXOB7STIFSXE2Z","created_at":"2026-07-05T10:53:51Z"},{"alias_kind":"pith_short_8","alias_value":"NQBXOB7S","created_at":"2026-07-05T10:53:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NQBXOB7STIFSXE2Z2KGHXXEPMG","target":"record","payload":{"canonical_record":{"source":{"id":"2501.13992","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-23T10:20:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"40ca155bb8c54b3e194b821d753511376ba601829a98c54f70fb5f0b6c70f5db","abstract_canon_sha256":"9ef1af313eea31b79c233f0be9da3ff216c12189c1c6ffebd5fe11684648b573"},"schema_version":"1.0"},"canonical_sha256":"6c037707f29a0b2b9359d28c7bdc8f6198513b50410e516c9b880e3937d556ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:51.209938Z","signature_b64":"pbpRpC3PcLEP33s9ltr0CGJp45WGWqz0dDoS0JyA45cz5UyRtGTlr8KWPltxoLoI4MMQ7nPxpVkQ2GqBsrIfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c037707f29a0b2b9359d28c7bdc8f6198513b50410e516c9b880e3937d556ec","last_reissued_at":"2026-07-05T10:53:51.209445Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:51.209445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.13992","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-05T10:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ry9DQ/uYrYMHqevl6Q1/P0uD29BRaS7TgxK74ny/8dg0u4zgfsK6kiEnWKpjtHfwUne0T+LQbWgZFc8C6qYOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T10:03:09.372285Z"},"content_sha256":"d554b22ff76876c36d60478bfdf52ea4ba9d40447a86bb148b3fa5d786d3b828","schema_version":"1.0","event_id":"sha256:d554b22ff76876c36d60478bfdf52ea4ba9d40447a86bb148b3fa5d786d3b828"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NQBXOB7STIFSXE2Z2KGHXXEPMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hung Du, Hy Nguyen, Kon Mouzakis, Nguyen Hung Nguyen, Nguyen Linh Bao Nguyen, Rajesh Vasa, Srikanth Thudumu","submitted_at":"2025-01-23T10:20:12Z","abstract_excerpt":"The Hierarchical Navigable Small World (HNSW) algorithm is widely used for approximate nearest neighbor (ANN) search, leveraging the principles of navigable small-world graphs. However, it faces some limitations. The first is the local optima problem, which arises from the algorithm's greedy search strategy, selecting neighbors based solely on proximity at each step. This often leads to cluster disconnections. The second limitation is that HNSW frequently fails to achieve logarithmic complexity, particularly in high-dimensional datasets, due to the exhaustive traversal through each layer. To a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13992","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/2501.13992/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-05T10:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rir9C9yja4OhEXQHtMcGvkXEZJAQzyYPXxxbm3giO+qSA07MlX5zf/DTZ+TVikQiF2I0Cj0YsJXS/X+cI/EaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T10:03:09.372680Z"},"content_sha256":"87f265887f00c5247d51255cc1f4f1c12065a0f766fcc4a772a48a86d50b2799","schema_version":"1.0","event_id":"sha256:87f265887f00c5247d51255cc1f4f1c12065a0f766fcc4a772a48a86d50b2799"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQBXOB7STIFSXE2Z2KGHXXEPMG/bundle.json","state_url":"https://pith.science/pith/NQBXOB7STIFSXE2Z2KGHXXEPMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQBXOB7STIFSXE2Z2KGHXXEPMG/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-01T10:03:09Z","links":{"resolver":"https://pith.science/pith/NQBXOB7STIFSXE2Z2KGHXXEPMG","bundle":"https://pith.science/pith/NQBXOB7STIFSXE2Z2KGHXXEPMG/bundle.json","state":"https://pith.science/pith/NQBXOB7STIFSXE2Z2KGHXXEPMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQBXOB7STIFSXE2Z2KGHXXEPMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NQBXOB7STIFSXE2Z2KGHXXEPMG","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":"9ef1af313eea31b79c233f0be9da3ff216c12189c1c6ffebd5fe11684648b573","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-23T10:20:12Z","title_canon_sha256":"40ca155bb8c54b3e194b821d753511376ba601829a98c54f70fb5f0b6c70f5db"},"schema_version":"1.0","source":{"id":"2501.13992","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13992","created_at":"2026-07-05T10:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13992v2","created_at":"2026-07-05T10:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13992","created_at":"2026-07-05T10:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"NQBXOB7STIFS","created_at":"2026-07-05T10:53:51Z"},{"alias_kind":"pith_short_16","alias_value":"NQBXOB7STIFSXE2Z","created_at":"2026-07-05T10:53:51Z"},{"alias_kind":"pith_short_8","alias_value":"NQBXOB7S","created_at":"2026-07-05T10:53:51Z"}],"graph_snapshots":[{"event_id":"sha256:87f265887f00c5247d51255cc1f4f1c12065a0f766fcc4a772a48a86d50b2799","target":"graph","created_at":"2026-07-05T10:53:51Z","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/2501.13992/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Hierarchical Navigable Small World (HNSW) algorithm is widely used for approximate nearest neighbor (ANN) search, leveraging the principles of navigable small-world graphs. However, it faces some limitations. The first is the local optima problem, which arises from the algorithm's greedy search strategy, selecting neighbors based solely on proximity at each step. This often leads to cluster disconnections. The second limitation is that HNSW frequently fails to achieve logarithmic complexity, particularly in high-dimensional datasets, due to the exhaustive traversal through each layer. To a","authors_text":"Hung Du, Hy Nguyen, Kon Mouzakis, Nguyen Hung Nguyen, Nguyen Linh Bao Nguyen, Rajesh Vasa, Srikanth Thudumu","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13992","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:d554b22ff76876c36d60478bfdf52ea4ba9d40447a86bb148b3fa5d786d3b828","target":"record","created_at":"2026-07-05T10:53:51Z","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":"9ef1af313eea31b79c233f0be9da3ff216c12189c1c6ffebd5fe11684648b573","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-23T10:20:12Z","title_canon_sha256":"40ca155bb8c54b3e194b821d753511376ba601829a98c54f70fb5f0b6c70f5db"},"schema_version":"1.0","source":{"id":"2501.13992","kind":"arxiv","version":2}},"canonical_sha256":"6c037707f29a0b2b9359d28c7bdc8f6198513b50410e516c9b880e3937d556ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c037707f29a0b2b9359d28c7bdc8f6198513b50410e516c9b880e3937d556ec","first_computed_at":"2026-07-05T10:53:51.209445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:53:51.209445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pbpRpC3PcLEP33s9ltr0CGJp45WGWqz0dDoS0JyA45cz5UyRtGTlr8KWPltxoLoI4MMQ7nPxpVkQ2GqBsrIfAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:53:51.209938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.13992","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d554b22ff76876c36d60478bfdf52ea4ba9d40447a86bb148b3fa5d786d3b828","sha256:87f265887f00c5247d51255cc1f4f1c12065a0f766fcc4a772a48a86d50b2799"],"state_sha256":"48d718dbf08e710045e2d8bbec9a4a449e616dc2dd2ff65f321d1ab443c71503"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZ5L3kzViZ33v7JzgJsWMQCfheXgaOaspAeGu0A24KMoMSJCOaZVrB1esn10Qz3m2q45xTHMLCkasUQ0iSKWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T10:03:09.375297Z","bundle_sha256":"3b2304f6f4f7988156f2dc04f795f4199cf61b68d514c112b8eb6d6e5da1b0ca"}}