{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RIVF4YFHCBYGFMNGUREEPIBHAE","short_pith_number":"pith:RIVF4YFH","canonical_record":{"source":{"id":"1603.09320","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-30T19:29:44Z","cross_cats_sorted":["cs.CV","cs.IR","cs.SI"],"title_canon_sha256":"f695261b1715eb6e5dcdc31c9840417c6f2901907814b2c2b3dee7b35ab7180c","abstract_canon_sha256":"2430158b32f9db5803c28bf9f6340c837390503bfa044a9cc89d9bb5f77c7f06"},"schema_version":"1.0"},"canonical_sha256":"8a2a5e60a7107062b1a6a44847a0270118a8ddeca88a073975db9c0f12072657","source":{"kind":"arxiv","id":"1603.09320","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09320","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09320v4","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09320","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"RIVF4YFHCBYG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RIVF4YFHCBYGFMNG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RIVF4YFH","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RIVF4YFHCBYGFMNGUREEPIBHAE","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09320","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-30T19:29:44Z","cross_cats_sorted":["cs.CV","cs.IR","cs.SI"],"title_canon_sha256":"f695261b1715eb6e5dcdc31c9840417c6f2901907814b2c2b3dee7b35ab7180c","abstract_canon_sha256":"2430158b32f9db5803c28bf9f6340c837390503bfa044a9cc89d9bb5f77c7f06"},"schema_version":"1.0"},"canonical_sha256":"8a2a5e60a7107062b1a6a44847a0270118a8ddeca88a073975db9c0f12072657","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:05.404182Z","signature_b64":"MSzVFqd7+Sduz0yO2o2cm58D5mDYe7w/XEZAWNubFyZVvsudbcm/eFe9kFd6l0toWVGR4JyCmj5DiEvSVGRKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a2a5e60a7107062b1a6a44847a0270118a8ddeca88a073975db9c0f12072657","last_reissued_at":"2026-05-18T00:08:05.403699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:05.403699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09320","source_version":4,"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-05-18T00:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A9zYX8ONlqmqfx/5w6j7YzzfIIEpzu8ziB7HAiLom1qfqv49nint7vl4IXy6zJ0IJlDVvl4pAPUhtKSOkv2OBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:34:56.889967Z"},"content_sha256":"4dcb130edbf9d450ba520171016ee07d9ea0db05d807787864e82504005eba5c","schema_version":"1.0","event_id":"sha256:4dcb130edbf9d450ba520171016ee07d9ea0db05d807787864e82504005eba5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RIVF4YFHCBYGFMNGUREEPIBHAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IR","cs.SI"],"primary_cat":"cs.DS","authors_text":"D. A. Yashunin, Yu. A. Malkov","submitted_at":"2016-03-30T19:29:44Z","abstract_excerpt":"We present a new approach for the approximate K-nearest neighbor search based on navigable small world graphs with controllable hierarchy (Hierarchical NSW, HNSW). The proposed solution is fully graph-based, without any need for additional search structures, which are typically used at the coarse search stage of the most proximity graph techniques. Hierarchical NSW incrementally builds a multi-layer structure consisting from hierarchical set of proximity graphs (layers) for nested subsets of the stored elements. The maximum layer in which an element is present is selected randomly with an expo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09320","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TfbGWo/2u7UO9TLC63PUljzhfsCTthZDrdQ7bP0/WpvY772YMXwbw5N+1R4RDp3pXZ//OHXlcyujt+bdDOgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:34:56.890735Z"},"content_sha256":"fe4ea9b384caa4a4007a7a29769a016bdc5ec71184808e56c08b00f9336b42a8","schema_version":"1.0","event_id":"sha256:fe4ea9b384caa4a4007a7a29769a016bdc5ec71184808e56c08b00f9336b42a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIVF4YFHCBYGFMNGUREEPIBHAE/bundle.json","state_url":"https://pith.science/pith/RIVF4YFHCBYGFMNGUREEPIBHAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIVF4YFHCBYGFMNGUREEPIBHAE/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-06-10T00:34:56Z","links":{"resolver":"https://pith.science/pith/RIVF4YFHCBYGFMNGUREEPIBHAE","bundle":"https://pith.science/pith/RIVF4YFHCBYGFMNGUREEPIBHAE/bundle.json","state":"https://pith.science/pith/RIVF4YFHCBYGFMNGUREEPIBHAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIVF4YFHCBYGFMNGUREEPIBHAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RIVF4YFHCBYGFMNGUREEPIBHAE","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":"2430158b32f9db5803c28bf9f6340c837390503bfa044a9cc89d9bb5f77c7f06","cross_cats_sorted":["cs.CV","cs.IR","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-30T19:29:44Z","title_canon_sha256":"f695261b1715eb6e5dcdc31c9840417c6f2901907814b2c2b3dee7b35ab7180c"},"schema_version":"1.0","source":{"id":"1603.09320","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09320","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09320v4","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09320","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"RIVF4YFHCBYG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RIVF4YFHCBYGFMNG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RIVF4YFH","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:fe4ea9b384caa4a4007a7a29769a016bdc5ec71184808e56c08b00f9336b42a8","target":"graph","created_at":"2026-05-18T00:08:05Z","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"},"paper":{"abstract_excerpt":"We present a new approach for the approximate K-nearest neighbor search based on navigable small world graphs with controllable hierarchy (Hierarchical NSW, HNSW). The proposed solution is fully graph-based, without any need for additional search structures, which are typically used at the coarse search stage of the most proximity graph techniques. Hierarchical NSW incrementally builds a multi-layer structure consisting from hierarchical set of proximity graphs (layers) for nested subsets of the stored elements. The maximum layer in which an element is present is selected randomly with an expo","authors_text":"D. A. Yashunin, Yu. A. Malkov","cross_cats":["cs.CV","cs.IR","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-30T19:29:44Z","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09320","kind":"arxiv","version":4},"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:4dcb130edbf9d450ba520171016ee07d9ea0db05d807787864e82504005eba5c","target":"record","created_at":"2026-05-18T00:08:05Z","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":"2430158b32f9db5803c28bf9f6340c837390503bfa044a9cc89d9bb5f77c7f06","cross_cats_sorted":["cs.CV","cs.IR","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-30T19:29:44Z","title_canon_sha256":"f695261b1715eb6e5dcdc31c9840417c6f2901907814b2c2b3dee7b35ab7180c"},"schema_version":"1.0","source":{"id":"1603.09320","kind":"arxiv","version":4}},"canonical_sha256":"8a2a5e60a7107062b1a6a44847a0270118a8ddeca88a073975db9c0f12072657","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a2a5e60a7107062b1a6a44847a0270118a8ddeca88a073975db9c0f12072657","first_computed_at":"2026-05-18T00:08:05.403699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:05.403699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MSzVFqd7+Sduz0yO2o2cm58D5mDYe7w/XEZAWNubFyZVvsudbcm/eFe9kFd6l0toWVGR4JyCmj5DiEvSVGRKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:05.404182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09320","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dcb130edbf9d450ba520171016ee07d9ea0db05d807787864e82504005eba5c","sha256:fe4ea9b384caa4a4007a7a29769a016bdc5ec71184808e56c08b00f9336b42a8"],"state_sha256":"f8f47e77f70e2853240aa06b16c7c624359ccc14b44a81aba0675b0a1f98fdfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uzjAVdiXzlj8Ih/CImVcwcO5cNZQk/gviiJhmbKYTM2inDDtlBbyzACyjs3Wc2NYKuTvi/nygt7e8Gzt9giUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:34:56.894769Z","bundle_sha256":"771652a8ac985dc61b4efbe5d7ff29e5e3659506f2b380a7aecd9d184ad1f355"}}