{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q5QWK35UFQIX2YTFJ55RHSOE4C","short_pith_number":"pith:Q5QWK35U","schema_version":"1.0","canonical_sha256":"8761656fb42c117d62654f7b13c9c4e088a3323fbf5eab2a668b2ad23dddf20a","source":{"kind":"arxiv","id":"1701.08475","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.08475","created_at":"2026-05-18T00:51:29.848946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08475v2","created_at":"2026-05-18T00:51:29.848946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08475","created_at":"2026-05-18T00:51:29.848946+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5QWK35UFQIX","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5QWK35UFQIX2YTF","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5QWK35U","created_at":"2026-05-18T12:31:37.085036+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/Q5QWK35UFQIX2YTFJ55RHSOE4C","json":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C.json","graph_json":"https://pith.science/api/pith-number/Q5QWK35UFQIX2YTFJ55RHSOE4C/graph.json","events_json":"https://pith.science/api/pith-number/Q5QWK35UFQIX2YTFJ55RHSOE4C/events.json","paper":"https://pith.science/paper/Q5QWK35U"},"agent_actions":{"view_html":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C","download_json":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C.json","view_paper":"https://pith.science/paper/Q5QWK35U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08475&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5QWK35UFQIX2YTFJ55RHSOE4C/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5QWK35UFQIX2YTFJ55RHSOE4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/action/storage_attestation","attest_author":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/action/author_attestation","sign_citation":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/action/citation_signature","submit_replication":"https://pith.science/pith/Q5QWK35UFQIX2YTFJ55RHSOE4C/action/replication_record"}},"created_at":"2026-05-18T00:51:29.848946+00:00","updated_at":"2026-05-18T00:51:29.848946+00:00"}