{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QRMXTZMYRYCKE7BBZBRTTW76LD","short_pith_number":"pith:QRMXTZMY","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"},"canonical_sha256":"845979e5988e04a27c21c86339dbfe58cc712e404573e5a549b2768a95517187","source":{"kind":"arxiv","id":"1812.07484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.07484","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"arxiv_version","alias_value":"1812.07484v1","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07484","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"pith_short_12","alias_value":"QRMXTZMYRYCK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QRMXTZMYRYCKE7BB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QRMXTZMY","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QRMXTZMYRYCKE7BBZBRTTW76LD","target":"record","payload":{"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"},"canonical_sha256":"845979e5988e04a27c21c86339dbfe58cc712e404573e5a549b2768a95517187","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"},"source_kind":"arxiv","source_id":"1812.07484","source_version":1,"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-17T23:47:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cp8c5inmE6LkR4p8rC0kWjKBict4w/7OwSgVY1anv75ywcaKsz8YDooYe/f/qNoQ93DPy8+QQK6FJDid4n98AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:43:25.733915Z"},"content_sha256":"4d703d5c3a0761e0ce58a82eaf991bc97297d199cc80f34c4386aaa2eb23932e","schema_version":"1.0","event_id":"sha256:4d703d5c3a0761e0ce58a82eaf991bc97297d199cc80f34c4386aaa2eb23932e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QRMXTZMYRYCKE7BBZBRTTW76LD","target":"graph","payload":{"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"},"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-17T23:47:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxbCU1t7Oo59sakfx+UZ+7bRLjRfD7VI68xNPc9K26w51B7FSfrc0/yiyr4knAqit+Yp+u38eIRhm2M3trKcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:43:25.734674Z"},"content_sha256":"d60af28ac5604d30b1b0e67251fd336b45e18aa5e333759a4978bc5df8dcad0c","schema_version":"1.0","event_id":"sha256:d60af28ac5604d30b1b0e67251fd336b45e18aa5e333759a4978bc5df8dcad0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/bundle.json","state_url":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/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-05-26T14:43:25Z","links":{"resolver":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD","bundle":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/bundle.json","state":"https://pith.science/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRMXTZMYRYCKE7BBZBRTTW76LD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QRMXTZMYRYCKE7BBZBRTTW76LD","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":"31ca99a6038716dfa1714e091704f2c4dab11334ab02da8c55e940578b874311","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-18T17:06:05Z","title_canon_sha256":"a8be9740219472268c8bf709cce6ee7dfec8a25476c63cf13bdf132c8456a6b0"},"schema_version":"1.0","source":{"id":"1812.07484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.07484","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"arxiv_version","alias_value":"1812.07484v1","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07484","created_at":"2026-05-17T23:47:50Z"},{"alias_kind":"pith_short_12","alias_value":"QRMXTZMYRYCK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QRMXTZMYRYCKE7BB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QRMXTZMY","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:d60af28ac5604d30b1b0e67251fd336b45e18aa5e333759a4978bc5df8dcad0c","target":"graph","created_at":"2026-05-17T23:47:50Z","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":"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","authors_text":"Elias J\\\"a\\\"asaari, Teemu Roos, Ville Hyv\\\"onen","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-18T17:06:05Z","title":"Efficient Autotuning of Hyperparameters in Approximate Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07484","kind":"arxiv","version":1},"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:4d703d5c3a0761e0ce58a82eaf991bc97297d199cc80f34c4386aaa2eb23932e","target":"record","created_at":"2026-05-17T23:47:50Z","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":"31ca99a6038716dfa1714e091704f2c4dab11334ab02da8c55e940578b874311","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-18T17:06:05Z","title_canon_sha256":"a8be9740219472268c8bf709cce6ee7dfec8a25476c63cf13bdf132c8456a6b0"},"schema_version":"1.0","source":{"id":"1812.07484","kind":"arxiv","version":1}},"canonical_sha256":"845979e5988e04a27c21c86339dbfe58cc712e404573e5a549b2768a95517187","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"845979e5988e04a27c21c86339dbfe58cc712e404573e5a549b2768a95517187","first_computed_at":"2026-05-17T23:47:50.774445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:50.774445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LTrbU6LMEpWzaUHwwdcmVumR6zwhnVY67dnZekaMPSRp2auCW1udE3dqcM4cjUdnjmmrStDNlkmNC5/NE31GAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:50.774942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.07484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d703d5c3a0761e0ce58a82eaf991bc97297d199cc80f34c4386aaa2eb23932e","sha256:d60af28ac5604d30b1b0e67251fd336b45e18aa5e333759a4978bc5df8dcad0c"],"state_sha256":"82bd8a5c6dd03555ee23b1e6b32a5df7bccfd5d8c2b878cc5e8cecf7f750d61f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avNuvNuwmfs1vblC4EZQzxdeMVu9FlMUdSmmTUkept3kr6FwlUaV9HOYZFjYk8+uC3K6Hb/Jo0fGw/2cpvpNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:43:25.738387Z","bundle_sha256":"ad5bad57269d7e50baaa9185da24a9a182f8611162c24b187ebbc8a830dbed97"}}