{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CN5ZZJDFOT4JDYZPHTTWAFFCF5","short_pith_number":"pith:CN5ZZJDF","schema_version":"1.0","canonical_sha256":"137b9ca46574f891e32f3ce76014a22f7b2b1f8033fee200627793ef782c7bd4","source":{"kind":"arxiv","id":"1702.05760","version":1},"attestation_state":"computed","paper":{"title":"Hypercube LSH for approximate near neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.CR"],"primary_cat":"cs.DS","authors_text":"Thijs Laarhoven","submitted_at":"2017-02-19T15:48:11Z","abstract_excerpt":"A celebrated technique for finding near neighbors for the angular distance involves using a set of \\textit{random} hyperplanes to partition the space into hash regions [Charikar, STOC 2002]. Experiments later showed that using a set of \\textit{orthogonal} hyperplanes, thereby partitioning the space into the Voronoi regions induced by a hypercube, leads to even better results [Terasawa and Tanaka, WADS 2007]. However, no theoretical explanation for this improvement was ever given, and it remained unclear how the resulting hypercube hash method scales in high dimensions.\n  In this work, we provi"},"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":"1702.05760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-19T15:48:11Z","cross_cats_sorted":["cs.CC","cs.CG","cs.CR"],"title_canon_sha256":"7f3dc05c81e1c9a257c4d7623cdba8b1ad503f1ed809edc9661bd138a8562c9c","abstract_canon_sha256":"fa0842f63b92b89f31c818eb2304afd86dbfd45d91230e10d2cf4ccd8dc2d58e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:35.695282Z","signature_b64":"EjH1A+K0TCtq5wWfkuVOUnSjbaNJ3ro8d5+4J9I4t2NwJBBiJe2AZIlKl3fPafaEjJcs6skSH/3bMWItPtbdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"137b9ca46574f891e32f3ce76014a22f7b2b1f8033fee200627793ef782c7bd4","last_reissued_at":"2026-05-18T00:28:35.694633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:35.694633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypercube LSH for approximate near neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.CR"],"primary_cat":"cs.DS","authors_text":"Thijs Laarhoven","submitted_at":"2017-02-19T15:48:11Z","abstract_excerpt":"A celebrated technique for finding near neighbors for the angular distance involves using a set of \\textit{random} hyperplanes to partition the space into hash regions [Charikar, STOC 2002]. Experiments later showed that using a set of \\textit{orthogonal} hyperplanes, thereby partitioning the space into the Voronoi regions induced by a hypercube, leads to even better results [Terasawa and Tanaka, WADS 2007]. However, no theoretical explanation for this improvement was ever given, and it remained unclear how the resulting hypercube hash method scales in high dimensions.\n  In this work, we provi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05760","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":"1702.05760","created_at":"2026-05-18T00:28:35.694718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05760v1","created_at":"2026-05-18T00:28:35.694718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05760","created_at":"2026-05-18T00:28:35.694718+00:00"},{"alias_kind":"pith_short_12","alias_value":"CN5ZZJDFOT4J","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CN5ZZJDFOT4JDYZP","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CN5ZZJDF","created_at":"2026-05-18T12:31:10.602751+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/CN5ZZJDFOT4JDYZPHTTWAFFCF5","json":"https://pith.science/pith/CN5ZZJDFOT4JDYZPHTTWAFFCF5.json","graph_json":"https://pith.science/api/pith-number/CN5ZZJDFOT4JDYZPHTTWAFFCF5/graph.json","events_json":"https://pith.science/api/pith-number/CN5ZZJDFOT4JDYZPHTTWAFFCF5/events.json","paper":"https://pith.science/paper/CN5ZZJDF"},"agent_actions":{"view_html":"https://pith.science/pith/CN5ZZJDFOT4JDYZPHTTWAFFCF5","download_json":"https://pith.science/pith/CN5ZZJDFOT4JDYZPHTTWAFFCF5.json","view_paper":"https://pith.science/paper/CN5ZZJDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05760&json=true","fetch_graph":"https://pith.science/api/pith-number/CN5ZZJDFOT4JDYZPHTTWAFFCF5/graph.json","fetch_events":"https://pith.science/api/pith-number/CN5ZZJDFOT4JDYZPHTTWAFFCF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CN5ZZJDFOT4JDYZPHTTWAFFCF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CN5ZZJDFOT4JDYZPHTTWAFFCF5/action/storage_attestation","attest_author":"https://pith.science/pith/CN5ZZJDFOT4JDYZPHTTWAFFCF5/action/author_attestation","sign_citation":"https://pith.science/pith/CN5ZZJDFOT4JDYZPHTTWAFFCF5/action/citation_signature","submit_replication":"https://pith.science/pith/CN5ZZJDFOT4JDYZPHTTWAFFCF5/action/replication_record"}},"created_at":"2026-05-18T00:28:35.694718+00:00","updated_at":"2026-05-18T00:28:35.694718+00:00"}