{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FA3Q6EQLA4XIZN3DLRY44BW7F6","short_pith_number":"pith:FA3Q6EQL","schema_version":"1.0","canonical_sha256":"28370f120b072e8cb7635c71ce06df2f82433e2d6ba19128d83adb573fc308af","source":{"kind":"arxiv","id":"1908.00814","version":6},"attestation_state":"computed","paper":{"title":"On the Merge of k-NN Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.IR","authors_text":"Chong-Wah Ngo, Hui Wang, Peng-Cheng Lin, Wan-Lei Zhao","submitted_at":"2019-08-02T11:46:42Z","abstract_excerpt":"k-nearest neighbor graph is a fundamental data structure in many disciplines such as information retrieval, data-mining, pattern recognition, and machine learning, etc. In the literature, considerable research has been focusing on how to efficiently build an approximate k-nearest neighbor graph (k-NN graph) for a fixed dataset. Unfortunately, a closely related issue of how to merge two existing k-NN graphs has been overlooked. In this paper, we address the issue of k-NN graph merging in two different scenarios. In the first scenario, a symmetric merge algorithm is proposed to combine two appro"},"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":"1908.00814","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-08-02T11:46:42Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"8c397a2f9ff385d17868bea700457c894460c830982107fb0e07d468439aabce","abstract_canon_sha256":"2602f5dbf47d9bb17a4fd5503c7936d0cd466e17b5fdae008b00194115cbcebc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:01:32.417154Z","signature_b64":"wv6jkXorjDENM2JNjqSS7mFN+HJkeC3VP4RCm2iSS8P2yekD1ntFj3w6d5zNYUndvc/WrbILxsU/h92k/t7QCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28370f120b072e8cb7635c71ce06df2f82433e2d6ba19128d83adb573fc308af","last_reissued_at":"2026-07-05T03:01:32.416725Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:01:32.416725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Merge of k-NN Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.IR","authors_text":"Chong-Wah Ngo, Hui Wang, Peng-Cheng Lin, Wan-Lei Zhao","submitted_at":"2019-08-02T11:46:42Z","abstract_excerpt":"k-nearest neighbor graph is a fundamental data structure in many disciplines such as information retrieval, data-mining, pattern recognition, and machine learning, etc. In the literature, considerable research has been focusing on how to efficiently build an approximate k-nearest neighbor graph (k-NN graph) for a fixed dataset. Unfortunately, a closely related issue of how to merge two existing k-NN graphs has been overlooked. In this paper, we address the issue of k-NN graph merging in two different scenarios. In the first scenario, a symmetric merge algorithm is proposed to combine two appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00814","kind":"arxiv","version":6},"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/1908.00814/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":"1908.00814","created_at":"2026-07-05T03:01:32.416787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.00814v6","created_at":"2026-07-05T03:01:32.416787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00814","created_at":"2026-07-05T03:01:32.416787+00:00"},{"alias_kind":"pith_short_12","alias_value":"FA3Q6EQLA4XI","created_at":"2026-07-05T03:01:32.416787+00:00"},{"alias_kind":"pith_short_16","alias_value":"FA3Q6EQLA4XIZN3D","created_at":"2026-07-05T03:01:32.416787+00:00"},{"alias_kind":"pith_short_8","alias_value":"FA3Q6EQL","created_at":"2026-07-05T03:01:32.416787+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/FA3Q6EQLA4XIZN3DLRY44BW7F6","json":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6.json","graph_json":"https://pith.science/api/pith-number/FA3Q6EQLA4XIZN3DLRY44BW7F6/graph.json","events_json":"https://pith.science/api/pith-number/FA3Q6EQLA4XIZN3DLRY44BW7F6/events.json","paper":"https://pith.science/paper/FA3Q6EQL"},"agent_actions":{"view_html":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6","download_json":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6.json","view_paper":"https://pith.science/paper/FA3Q6EQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.00814&json=true","fetch_graph":"https://pith.science/api/pith-number/FA3Q6EQLA4XIZN3DLRY44BW7F6/graph.json","fetch_events":"https://pith.science/api/pith-number/FA3Q6EQLA4XIZN3DLRY44BW7F6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/action/storage_attestation","attest_author":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/action/author_attestation","sign_citation":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/action/citation_signature","submit_replication":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/action/replication_record"}},"created_at":"2026-07-05T03:01:32.416787+00:00","updated_at":"2026-07-05T03:01:32.416787+00:00"}