{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ROJ35MVPXXBMLLJBSPGPK2MYBN","short_pith_number":"pith:ROJ35MVP","schema_version":"1.0","canonical_sha256":"8b93beb2afbdc2c5ad2193ccf569980b77e436c6943635fec0c831049df74fb5","source":{"kind":"arxiv","id":"2505.16064","version":1},"attestation_state":"computed","paper":{"title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Ponomarenko","submitted_at":"2025-05-21T22:33:27Z","abstract_excerpt":"This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection and candidate collection during the merge process. We conceptualize graph merging as an iterative process with four key steps: processing vertex selection, candidate collection, neighborhood construction, "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.16064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-21T22:33:27Z","cross_cats_sorted":[],"title_canon_sha256":"f510198c316ecb53b51cae812377ff3d7a7a88d7353971359a9cc07b9cab53ab","abstract_canon_sha256":"6f36e1056194a34a6a171b07f117adb4e85b52a643495ace0dd4931c333b7697"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:29.253563Z","signature_b64":"7xwjoCtbZEQ8wLuOJ3nt+QTxbzI+rCYauhdcJq7tjzjL39IlKyAwZBO8pNMHtLRe91ng3XFm/q5umSIw9AkyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b93beb2afbdc2c5ad2193ccf569980b77e436c6943635fec0c831049df74fb5","last_reissued_at":"2026-07-05T11:07:29.253087Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:29.253087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three Algorithms for Merging Hierarchical Navigable Small World Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Ponomarenko","submitted_at":"2025-05-21T22:33:27Z","abstract_excerpt":"This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection and candidate collection during the merge process. We conceptualize graph merging as an iterative process with four key steps: processing vertex selection, candidate collection, neighborhood construction, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.16064","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/2505.16064/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.16064","created_at":"2026-07-05T11:07:29.253145+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.16064v1","created_at":"2026-07-05T11:07:29.253145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.16064","created_at":"2026-07-05T11:07:29.253145+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROJ35MVPXXBM","created_at":"2026-07-05T11:07:29.253145+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROJ35MVPXXBMLLJB","created_at":"2026-07-05T11:07:29.253145+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROJ35MVP","created_at":"2026-07-05T11:07:29.253145+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ROJ35MVPXXBMLLJBSPGPK2MYBN","json":"https://pith.science/pith/ROJ35MVPXXBMLLJBSPGPK2MYBN.json","graph_json":"https://pith.science/api/pith-number/ROJ35MVPXXBMLLJBSPGPK2MYBN/graph.json","events_json":"https://pith.science/api/pith-number/ROJ35MVPXXBMLLJBSPGPK2MYBN/events.json","paper":"https://pith.science/paper/ROJ35MVP"},"agent_actions":{"view_html":"https://pith.science/pith/ROJ35MVPXXBMLLJBSPGPK2MYBN","download_json":"https://pith.science/pith/ROJ35MVPXXBMLLJBSPGPK2MYBN.json","view_paper":"https://pith.science/paper/ROJ35MVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.16064&json=true","fetch_graph":"https://pith.science/api/pith-number/ROJ35MVPXXBMLLJBSPGPK2MYBN/graph.json","fetch_events":"https://pith.science/api/pith-number/ROJ35MVPXXBMLLJBSPGPK2MYBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROJ35MVPXXBMLLJBSPGPK2MYBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROJ35MVPXXBMLLJBSPGPK2MYBN/action/storage_attestation","attest_author":"https://pith.science/pith/ROJ35MVPXXBMLLJBSPGPK2MYBN/action/author_attestation","sign_citation":"https://pith.science/pith/ROJ35MVPXXBMLLJBSPGPK2MYBN/action/citation_signature","submit_replication":"https://pith.science/pith/ROJ35MVPXXBMLLJBSPGPK2MYBN/action/replication_record"}},"created_at":"2026-07-05T11:07:29.253145+00:00","updated_at":"2026-07-05T11:07:29.253145+00:00"}