{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FA3Q6EQLA4XIZN3DLRY44BW7F6","short_pith_number":"pith:FA3Q6EQL","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"},"canonical_sha256":"28370f120b072e8cb7635c71ce06df2f82433e2d6ba19128d83adb573fc308af","source":{"kind":"arxiv","id":"1908.00814","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00814","created_at":"2026-07-05T03:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00814v6","created_at":"2026-07-05T03:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00814","created_at":"2026-07-05T03:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"FA3Q6EQLA4XI","created_at":"2026-07-05T03:01:32Z"},{"alias_kind":"pith_short_16","alias_value":"FA3Q6EQLA4XIZN3D","created_at":"2026-07-05T03:01:32Z"},{"alias_kind":"pith_short_8","alias_value":"FA3Q6EQL","created_at":"2026-07-05T03:01:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FA3Q6EQLA4XIZN3DLRY44BW7F6","target":"record","payload":{"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"},"canonical_sha256":"28370f120b072e8cb7635c71ce06df2f82433e2d6ba19128d83adb573fc308af","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"},"source_kind":"arxiv","source_id":"1908.00814","source_version":6,"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-05T03:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygHLpKfJPH5RQjBrXsOVFec/mbBpO/L1kQZXS4+axYz+c07duNHWpx0NectZmyMum0RIYJRfdUBE2LT+XxwyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:15:57.092790Z"},"content_sha256":"50feab84abe699fade1c3e2758b73d252b1694b456799ade4f5998a41d660d8a","schema_version":"1.0","event_id":"sha256:50feab84abe699fade1c3e2758b73d252b1694b456799ade4f5998a41d660d8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FA3Q6EQLA4XIZN3DLRY44BW7F6","target":"graph","payload":{"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"},"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-05T03:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNq6U36ly04q9HeNpWvOQzLdwP2PIL6cF+7sjJpMeImRSJer/1c29RqnnFPoPGA1w33OgiymZsyYF5YhXdDqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:15:57.093327Z"},"content_sha256":"9acfa6b4fc5f920bc4fc55b1ce434b1a95ae1bfc00c32b62ab11bd159ba95e4c","schema_version":"1.0","event_id":"sha256:9acfa6b4fc5f920bc4fc55b1ce434b1a95ae1bfc00c32b62ab11bd159ba95e4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/bundle.json","state_url":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/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-15T22:15:57Z","links":{"resolver":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6","bundle":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/bundle.json","state":"https://pith.science/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FA3Q6EQLA4XIZN3DLRY44BW7F6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FA3Q6EQLA4XIZN3DLRY44BW7F6","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":"2602f5dbf47d9bb17a4fd5503c7936d0cd466e17b5fdae008b00194115cbcebc","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-08-02T11:46:42Z","title_canon_sha256":"8c397a2f9ff385d17868bea700457c894460c830982107fb0e07d468439aabce"},"schema_version":"1.0","source":{"id":"1908.00814","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00814","created_at":"2026-07-05T03:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00814v6","created_at":"2026-07-05T03:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00814","created_at":"2026-07-05T03:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"FA3Q6EQLA4XI","created_at":"2026-07-05T03:01:32Z"},{"alias_kind":"pith_short_16","alias_value":"FA3Q6EQLA4XIZN3D","created_at":"2026-07-05T03:01:32Z"},{"alias_kind":"pith_short_8","alias_value":"FA3Q6EQL","created_at":"2026-07-05T03:01:32Z"}],"graph_snapshots":[{"event_id":"sha256:9acfa6b4fc5f920bc4fc55b1ce434b1a95ae1bfc00c32b62ab11bd159ba95e4c","target":"graph","created_at":"2026-07-05T03:01:32Z","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/1908.00814/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chong-Wah Ngo, Hui Wang, Peng-Cheng Lin, Wan-Lei Zhao","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00814","kind":"arxiv","version":6},"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:50feab84abe699fade1c3e2758b73d252b1694b456799ade4f5998a41d660d8a","target":"record","created_at":"2026-07-05T03:01:32Z","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":"2602f5dbf47d9bb17a4fd5503c7936d0cd466e17b5fdae008b00194115cbcebc","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-08-02T11:46:42Z","title_canon_sha256":"8c397a2f9ff385d17868bea700457c894460c830982107fb0e07d468439aabce"},"schema_version":"1.0","source":{"id":"1908.00814","kind":"arxiv","version":6}},"canonical_sha256":"28370f120b072e8cb7635c71ce06df2f82433e2d6ba19128d83adb573fc308af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28370f120b072e8cb7635c71ce06df2f82433e2d6ba19128d83adb573fc308af","first_computed_at":"2026-07-05T03:01:32.416725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:01:32.416725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wv6jkXorjDENM2JNjqSS7mFN+HJkeC3VP4RCm2iSS8P2yekD1ntFj3w6d5zNYUndvc/WrbILxsU/h92k/t7QCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:01:32.417154Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00814","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50feab84abe699fade1c3e2758b73d252b1694b456799ade4f5998a41d660d8a","sha256:9acfa6b4fc5f920bc4fc55b1ce434b1a95ae1bfc00c32b62ab11bd159ba95e4c"],"state_sha256":"b132f296984402099a6726d9c77d811b202b5b377dfaf91671b70f18462c278c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DqUXf6VmCVuq15ettTV8vpe1vXeyuvXaXIf3cU4fcojXStMjgXCwsFpR4JGweMRLssYCAqydFOG1/O/X19ZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T22:15:57.098409Z","bundle_sha256":"a206c542be3a68c28675a57bf41269c5c94d2f6db82420e4142a85add97d1fdb"}}