{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6W5LEZ4PBUCXHTCZ6HTTASAF3E","short_pith_number":"pith:6W5LEZ4P","schema_version":"1.0","canonical_sha256":"f5bab2678f0d0573cc59f1e7304805d92a5feb08ea6c22beed1e5a42e29a23d0","source":{"kind":"arxiv","id":"1603.09596","version":1},"attestation_state":"computed","paper":{"title":"High-dimensional approximate nearest neighbor: k-d Generalized Randomized Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Georgios Samaras, Ioannis Z. Emiris, Yannis Avrithis","submitted_at":"2016-03-31T14:04:30Z","abstract_excerpt":"We propose a new data-structure, the generalized randomized kd forest, or kgeraf, for approximate nearest neighbor searching in high dimensions. In particular, we introduce new randomization techniques to specify a set of independently constructed trees where search is performed simultaneously, hence increasing accuracy. We omit backtracking, and we optimize distance computations, thus accelerating queries. We release public domain software geraf and we compare it to existing implementations of state-of-the-art methods including BBD-trees, Locality Sensitive Hashing, randomized kd forests, and"},"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":"1603.09596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-31T14:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"aea3b5f66d3cd8e92d400c573c0380a4364ff0a25089bd5985f2f48ae41904ce","abstract_canon_sha256":"a3b1c72985256cc4f636ae6405a66c2f8b0e94a671409c730d47bb97c5bec950"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:58.090168Z","signature_b64":"Ms08gBt++IZwehF2oxcXHbFAYWJ2aqdcIwe25ovy8webLDnjIrt0kU5C5wwCVd1zuWRlhXSaCta2L17eEDfLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5bab2678f0d0573cc59f1e7304805d92a5feb08ea6c22beed1e5a42e29a23d0","last_reissued_at":"2026-05-18T01:17:58.089506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:58.089506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-dimensional approximate nearest neighbor: k-d Generalized Randomized Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Georgios Samaras, Ioannis Z. Emiris, Yannis Avrithis","submitted_at":"2016-03-31T14:04:30Z","abstract_excerpt":"We propose a new data-structure, the generalized randomized kd forest, or kgeraf, for approximate nearest neighbor searching in high dimensions. In particular, we introduce new randomization techniques to specify a set of independently constructed trees where search is performed simultaneously, hence increasing accuracy. We omit backtracking, and we optimize distance computations, thus accelerating queries. We release public domain software geraf and we compare it to existing implementations of state-of-the-art methods including BBD-trees, Locality Sensitive Hashing, randomized kd forests, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09596","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":"1603.09596","created_at":"2026-05-18T01:17:58.089602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09596v1","created_at":"2026-05-18T01:17:58.089602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09596","created_at":"2026-05-18T01:17:58.089602+00:00"},{"alias_kind":"pith_short_12","alias_value":"6W5LEZ4PBUCX","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"6W5LEZ4PBUCXHTCZ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"6W5LEZ4P","created_at":"2026-05-18T12:30:04.600751+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/6W5LEZ4PBUCXHTCZ6HTTASAF3E","json":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E.json","graph_json":"https://pith.science/api/pith-number/6W5LEZ4PBUCXHTCZ6HTTASAF3E/graph.json","events_json":"https://pith.science/api/pith-number/6W5LEZ4PBUCXHTCZ6HTTASAF3E/events.json","paper":"https://pith.science/paper/6W5LEZ4P"},"agent_actions":{"view_html":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E","download_json":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E.json","view_paper":"https://pith.science/paper/6W5LEZ4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09596&json=true","fetch_graph":"https://pith.science/api/pith-number/6W5LEZ4PBUCXHTCZ6HTTASAF3E/graph.json","fetch_events":"https://pith.science/api/pith-number/6W5LEZ4PBUCXHTCZ6HTTASAF3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/action/storage_attestation","attest_author":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/action/author_attestation","sign_citation":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/action/citation_signature","submit_replication":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/action/replication_record"}},"created_at":"2026-05-18T01:17:58.089602+00:00","updated_at":"2026-05-18T01:17:58.089602+00:00"}