{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q5QWK35UFQIX2YTFJ55RHSOE4C","short_pith_number":"pith:Q5QWK35U","canonical_record":{"source":{"id":"1701.08475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-30T03:51:28Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ad8e3139eb27928084ffa03eb53a66076b97ede29e7c296be003df68f5c339f0","abstract_canon_sha256":"571265f2b4e2ecb45e0aeeb1f58350af53127b3293f4cc25dae2f99964567abb"},"schema_version":"1.0"},"canonical_sha256":"8761656fb42c117d62654f7b13c9c4e088a3323fbf5eab2a668b2ad23dddf20a","source":{"kind":"arxiv","id":"1701.08475","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08475","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08475v2","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08475","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"Q5QWK35UFQIX","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q5QWK35UFQIX2YTF","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q5QWK35U","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q5QWK35UFQIX2YTFJ55RHSOE4C","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-30T03:51:28Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ad8e3139eb27928084ffa03eb53a66076b97ede29e7c296be003df68f5c339f0","abstract_canon_sha256":"571265f2b4e2ecb45e0aeeb1f58350af53127b3293f4cc25dae2f99964567abb"},"schema_version":"1.0"},"canonical_sha256":"8761656fb42c117d62654f7b13c9c4e088a3323fbf5eab2a668b2ad23dddf20a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:29.849339Z","signature_b64":"XbwoaTQihwlqkacmWcEUze7MUF2DGbqixIhZYGmp6DxZkp8C9w5nB9sC8JSSVZ07zTIWjfZ5yBV7/++OYUB7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8761656fb42c117d62654f7b13c9c4e088a3323fbf5eab2a668b2ad23dddf20a","last_reissued_at":"2026-05-18T00:51:29.848880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:29.848880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08475","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-05-18T00:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JaJIl6hNinU/HxqmujNNgiIURDGSkvqINeKYP2pHSXTsUyP5G9u19pzaqi1FrYGeiYQ6vucGfJ4jUSZrlsFEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:32:36.592533Z"},"content_sha256":"b68e1c9e382b8a872259f3fe6fd207bb1cd8d7434c8af8f41700941b7d1e8763","schema_version":"1.0","event_id":"sha256:b68e1c9e382b8a872259f3fe6fd207bb1cd8d7434c8af8f41700941b7d1e8763"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q5QWK35UFQIX2YTFJ55RHSOE4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Nearest Neighbor Search based on kNN Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.CV","authors_text":"Cheng-Hao Deng, Jie Yang, Wan-Lei Zhao","submitted_at":"2017-01-30T03:51:28Z","abstract_excerpt":"Nearest neighbor search is known as a challenging issue that has been studied for several decades. Recently, this issue becomes more and more imminent in viewing that the big data problem arises from various fields. In this paper, a scalable solution based on hill-climbing strategy with the support of k-nearest neighbor graph (kNN) is presented. Two major issues have been considered in the paper. Firstly, an efficient kNN graph construction method based on two means tree is presented. For the nearest neighbor search, an enhanced hill-climbing procedure is proposed, which sees considerable perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08475","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":""},"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:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tebOI8M9mdWSp9kJ7ynFiIzdkS8BJzY5ZJiN4CsEt5n3SNv5ybNHEkhEd/V+Ugf62ecxa1u0teC0vlZEi/BvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:32:36.592883Z"},"content_sha256":"32aa2d14675e7866551251f2b82e9b6994f74ac700e4e8994f5a57642f48e7ea","schema_version":"1.0","event_id":"sha256:32aa2d14675e7866551251f2b82e9b6994f74ac700e4e8994f5a57642f48e7ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/bundle.json","state_url":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/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-26T00:32:36Z","links":{"resolver":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C","bundle":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/bundle.json","state":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q5QWK35UFQIX2YTFJ55RHSOE4C","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":"571265f2b4e2ecb45e0aeeb1f58350af53127b3293f4cc25dae2f99964567abb","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-30T03:51:28Z","title_canon_sha256":"ad8e3139eb27928084ffa03eb53a66076b97ede29e7c296be003df68f5c339f0"},"schema_version":"1.0","source":{"id":"1701.08475","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08475","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08475v2","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08475","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"Q5QWK35UFQIX","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q5QWK35UFQIX2YTF","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q5QWK35U","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:32aa2d14675e7866551251f2b82e9b6994f74ac700e4e8994f5a57642f48e7ea","target":"graph","created_at":"2026-05-18T00:51:29Z","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":"Nearest neighbor search is known as a challenging issue that has been studied for several decades. Recently, this issue becomes more and more imminent in viewing that the big data problem arises from various fields. In this paper, a scalable solution based on hill-climbing strategy with the support of k-nearest neighbor graph (kNN) is presented. Two major issues have been considered in the paper. Firstly, an efficient kNN graph construction method based on two means tree is presented. For the nearest neighbor search, an enhanced hill-climbing procedure is proposed, which sees considerable perf","authors_text":"Cheng-Hao Deng, Jie Yang, Wan-Lei Zhao","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-30T03:51:28Z","title":"Scalable Nearest Neighbor Search based on kNN Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08475","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:b68e1c9e382b8a872259f3fe6fd207bb1cd8d7434c8af8f41700941b7d1e8763","target":"record","created_at":"2026-05-18T00:51:29Z","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":"571265f2b4e2ecb45e0aeeb1f58350af53127b3293f4cc25dae2f99964567abb","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-30T03:51:28Z","title_canon_sha256":"ad8e3139eb27928084ffa03eb53a66076b97ede29e7c296be003df68f5c339f0"},"schema_version":"1.0","source":{"id":"1701.08475","kind":"arxiv","version":2}},"canonical_sha256":"8761656fb42c117d62654f7b13c9c4e088a3323fbf5eab2a668b2ad23dddf20a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8761656fb42c117d62654f7b13c9c4e088a3323fbf5eab2a668b2ad23dddf20a","first_computed_at":"2026-05-18T00:51:29.848880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:29.848880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XbwoaTQihwlqkacmWcEUze7MUF2DGbqixIhZYGmp6DxZkp8C9w5nB9sC8JSSVZ07zTIWjfZ5yBV7/++OYUB7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:29.849339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08475","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b68e1c9e382b8a872259f3fe6fd207bb1cd8d7434c8af8f41700941b7d1e8763","sha256:32aa2d14675e7866551251f2b82e9b6994f74ac700e4e8994f5a57642f48e7ea"],"state_sha256":"f0697b87fa71688f41dd9e24288934c055006a07644655a44fd511edd6cb8bea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FYD4dBE254qQ9/iaB2XhMcQhSeNasqHP6bfyB9GiHBB169lLQZqE5qLMvmY29JQUq6i9tF/2h0mIqT/jK8ajDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:32:36.594921Z","bundle_sha256":"fe05207850c16870dc89a6e7e58933c15b1be020a40743ffcb7da5aaa532a6e0"}}