{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YFKWMJQXV7KLSZ5SHCSMMSSNT3","short_pith_number":"pith:YFKWMJQX","schema_version":"1.0","canonical_sha256":"c155662617afd4b967b238a4c64a4d9efb3cf210089649ad62f4d40986cb80b4","source":{"kind":"arxiv","id":"1509.06957","version":2},"attestation_state":"computed","paper":{"title":"Fast k-NN search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Elias J\\\"a\\\"asaari, Jukka Corander, Liang Wang, Risto Tuomainen, Sotiris Tasoulis, Teemu Pitk\\\"anen, Teemu Roos, Ville Hyv\\\"onen","submitted_at":"2015-09-23T13:10:36Z","abstract_excerpt":"Efficient index structures for fast approximate nearest neighbor queries are required in many applications such as recommendation systems. In high-dimensional spaces, many conventional methods suffer from excessive usage of memory and slow response times. We propose a method where multiple random projection trees are combined by a novel voting scheme. The key idea is to exploit the redundancy in a large number of candidate sets obtained by independently generated random projections in order to reduce the number of expensive exact distance evaluations. The method is straightforward to implement"},"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":"1509.06957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-23T13:10:36Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"8d01776f08848c5abecfa0c55cecbdb72c39d244814025305115e428aa4771be","abstract_canon_sha256":"8313e18fea6c84fd0425917681f55fb53a85ee5de7603cb422a8b00ea6928d64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:02.585601Z","signature_b64":"9iYCQLt2guuQMOJQQSyXOfmrSx22xaCxkBKm0sxKoTUJv+Eyp7Chvg2UbQLB06IhVSlBr4q8r+WlX5RmafwUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c155662617afd4b967b238a4c64a4d9efb3cf210089649ad62f4d40986cb80b4","last_reissued_at":"2026-05-17T23:48:02.585077Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:02.585077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast k-NN search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Elias J\\\"a\\\"asaari, Jukka Corander, Liang Wang, Risto Tuomainen, Sotiris Tasoulis, Teemu Pitk\\\"anen, Teemu Roos, Ville Hyv\\\"onen","submitted_at":"2015-09-23T13:10:36Z","abstract_excerpt":"Efficient index structures for fast approximate nearest neighbor queries are required in many applications such as recommendation systems. In high-dimensional spaces, many conventional methods suffer from excessive usage of memory and slow response times. We propose a method where multiple random projection trees are combined by a novel voting scheme. The key idea is to exploit the redundancy in a large number of candidate sets obtained by independently generated random projections in order to reduce the number of expensive exact distance evaluations. The method is straightforward to implement"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06957","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":"1509.06957","created_at":"2026-05-17T23:48:02.585156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06957v2","created_at":"2026-05-17T23:48:02.585156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06957","created_at":"2026-05-17T23:48:02.585156+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFKWMJQXV7KL","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFKWMJQXV7KLSZ5S","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFKWMJQX","created_at":"2026-05-18T12:29:50.041715+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/YFKWMJQXV7KLSZ5SHCSMMSSNT3","json":"https://pith.science/pith/YFKWMJQXV7KLSZ5SHCSMMSSNT3.json","graph_json":"https://pith.science/api/pith-number/YFKWMJQXV7KLSZ5SHCSMMSSNT3/graph.json","events_json":"https://pith.science/api/pith-number/YFKWMJQXV7KLSZ5SHCSMMSSNT3/events.json","paper":"https://pith.science/paper/YFKWMJQX"},"agent_actions":{"view_html":"https://pith.science/pith/YFKWMJQXV7KLSZ5SHCSMMSSNT3","download_json":"https://pith.science/pith/YFKWMJQXV7KLSZ5SHCSMMSSNT3.json","view_paper":"https://pith.science/paper/YFKWMJQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06957&json=true","fetch_graph":"https://pith.science/api/pith-number/YFKWMJQXV7KLSZ5SHCSMMSSNT3/graph.json","fetch_events":"https://pith.science/api/pith-number/YFKWMJQXV7KLSZ5SHCSMMSSNT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFKWMJQXV7KLSZ5SHCSMMSSNT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFKWMJQXV7KLSZ5SHCSMMSSNT3/action/storage_attestation","attest_author":"https://pith.science/pith/YFKWMJQXV7KLSZ5SHCSMMSSNT3/action/author_attestation","sign_citation":"https://pith.science/pith/YFKWMJQXV7KLSZ5SHCSMMSSNT3/action/citation_signature","submit_replication":"https://pith.science/pith/YFKWMJQXV7KLSZ5SHCSMMSSNT3/action/replication_record"}},"created_at":"2026-05-17T23:48:02.585156+00:00","updated_at":"2026-05-17T23:48:02.585156+00:00"}