{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QRMXTZMYRYCKE7BBZBRTTW76LD","short_pith_number":"pith:QRMXTZMY","schema_version":"1.0","canonical_sha256":"845979e5988e04a27c21c86339dbfe58cc712e404573e5a549b2768a95517187","source":{"kind":"arxiv","id":"1812.07484","version":1},"attestation_state":"computed","paper":{"title":"Efficient Autotuning of Hyperparameters in Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Elias J\\\"a\\\"asaari, Teemu Roos, Ville Hyv\\\"onen","submitted_at":"2018-12-18T17:06:05Z","abstract_excerpt":"Approximate nearest neighbor algorithms are used to speed up nearest neighbor search in a wide array of applications. However, current indexing methods feature several hyperparameters that need to be tuned to reach an acceptable accuracy--speed trade-off. A grid search in the parameter space is often impractically slow due to a time-consuming index-building procedure. Therefore, we propose an algorithm for automatically tuning the hyperparameters of indexing methods based on randomized space-partitioning trees. In particular, we present results using randomized k-d trees, random projection tre"},"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":"1812.07484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-18T17:06:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a8be9740219472268c8bf709cce6ee7dfec8a25476c63cf13bdf132c8456a6b0","abstract_canon_sha256":"31ca99a6038716dfa1714e091704f2c4dab11334ab02da8c55e940578b874311"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:50.774942Z","signature_b64":"LTrbU6LMEpWzaUHwwdcmVumR6zwhnVY67dnZekaMPSRp2auCW1udE3dqcM4cjUdnjmmrStDNlkmNC5/NE31GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"845979e5988e04a27c21c86339dbfe58cc712e404573e5a549b2768a95517187","last_reissued_at":"2026-05-17T23:47:50.774445Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:50.774445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Autotuning of Hyperparameters in Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Elias J\\\"a\\\"asaari, Teemu Roos, Ville Hyv\\\"onen","submitted_at":"2018-12-18T17:06:05Z","abstract_excerpt":"Approximate nearest neighbor algorithms are used to speed up nearest neighbor search in a wide array of applications. However, current indexing methods feature several hyperparameters that need to be tuned to reach an acceptable accuracy--speed trade-off. A grid search in the parameter space is often impractically slow due to a time-consuming index-building procedure. Therefore, we propose an algorithm for automatically tuning the hyperparameters of indexing methods based on randomized space-partitioning trees. In particular, we present results using randomized k-d trees, random projection tre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07484","kind":"arxiv","version":1},"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":"1812.07484","created_at":"2026-05-17T23:47:50.774504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.07484v1","created_at":"2026-05-17T23:47:50.774504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07484","created_at":"2026-05-17T23:47:50.774504+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRMXTZMYRYCK","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRMXTZMYRYCKE7BB","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRMXTZMY","created_at":"2026-05-18T12:32:46.962924+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/QRMXTZMYRYCKE7BBZBRTTW76LD","json":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD.json","graph_json":"https://pith.science/api/pith-number/QRMXTZMYRYCKE7BBZBRTTW76LD/graph.json","events_json":"https://pith.science/api/pith-number/QRMXTZMYRYCKE7BBZBRTTW76LD/events.json","paper":"https://pith.science/paper/QRMXTZMY"},"agent_actions":{"view_html":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD","download_json":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD.json","view_paper":"https://pith.science/paper/QRMXTZMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.07484&json=true","fetch_graph":"https://pith.science/api/pith-number/QRMXTZMYRYCKE7BBZBRTTW76LD/graph.json","fetch_events":"https://pith.science/api/pith-number/QRMXTZMYRYCKE7BBZBRTTW76LD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/action/storage_attestation","attest_author":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/action/author_attestation","sign_citation":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/action/citation_signature","submit_replication":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/action/replication_record"}},"created_at":"2026-05-17T23:47:50.774504+00:00","updated_at":"2026-05-17T23:47:50.774504+00:00"}