{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:645JYZIADUCM75KMCMI4R33LIJ","short_pith_number":"pith:645JYZIA","schema_version":"1.0","canonical_sha256":"f73a9c65001d04cff54c1311c8ef6b4267c95c16f7250e373da31cf08c6082bb","source":{"kind":"arxiv","id":"1602.06922","version":3},"attestation_state":"computed","paper":{"title":"Fast Cross-Polytope Locality-Sensitive Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Christopher Kennedy, Rachel Ward","submitted_at":"2016-02-22T20:24:03Z","abstract_excerpt":"We provide a variant of cross-polytope locality sensitive hashing with respect to angular distance which is provably optimal in asymptotic sensitivity and enjoys $\\mathcal{O}(d \\ln d )$ hash computation time. Building on a recent result (by Andoni, Indyk, Laarhoven, Razenshteyn, Schmidt, 2015), we show that optimal asymptotic sensitivity for cross-polytope LSH is retained even when the dense Gaussian matrix is replaced by a fast Johnson-Lindenstrauss transform followed by discrete pseudo-rotation, reducing the hash computation time from $\\mathcal{O}(d^2)$ to $\\mathcal{O}(d \\ln d )$. Moreover, "},"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":"1602.06922","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T20:24:03Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"529eb380b033cf76faf6fec9dbfe718cbe989682145e76b9e8946e989ccc54a7","abstract_canon_sha256":"e2c80f5b832223a5f904fe67ae141e9949d18d544c4ad577e7c53b200e585c16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:09.199796Z","signature_b64":"5hqDeCY9BWJXLZbzC1tsGk0TWh1XYFE+yYqqqkqTB7YX9jwG5FJy/a+AcPMYNg/rqMyfpttyoNwuWGFN6u9cCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f73a9c65001d04cff54c1311c8ef6b4267c95c16f7250e373da31cf08c6082bb","last_reissued_at":"2026-05-18T01:04:09.199182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:09.199182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Cross-Polytope Locality-Sensitive Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Christopher Kennedy, Rachel Ward","submitted_at":"2016-02-22T20:24:03Z","abstract_excerpt":"We provide a variant of cross-polytope locality sensitive hashing with respect to angular distance which is provably optimal in asymptotic sensitivity and enjoys $\\mathcal{O}(d \\ln d )$ hash computation time. Building on a recent result (by Andoni, Indyk, Laarhoven, Razenshteyn, Schmidt, 2015), we show that optimal asymptotic sensitivity for cross-polytope LSH is retained even when the dense Gaussian matrix is replaced by a fast Johnson-Lindenstrauss transform followed by discrete pseudo-rotation, reducing the hash computation time from $\\mathcal{O}(d^2)$ to $\\mathcal{O}(d \\ln d )$. Moreover, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06922","kind":"arxiv","version":3},"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":"1602.06922","created_at":"2026-05-18T01:04:09.199283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06922v3","created_at":"2026-05-18T01:04:09.199283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06922","created_at":"2026-05-18T01:04:09.199283+00:00"},{"alias_kind":"pith_short_12","alias_value":"645JYZIADUCM","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"645JYZIADUCM75KM","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"645JYZIA","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.13810","citing_title":"Provable Quantization with Randomized Hadamard Transform","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/645JYZIADUCM75KMCMI4R33LIJ","json":"https://pith.science/pith/645JYZIADUCM75KMCMI4R33LIJ.json","graph_json":"https://pith.science/api/pith-number/645JYZIADUCM75KMCMI4R33LIJ/graph.json","events_json":"https://pith.science/api/pith-number/645JYZIADUCM75KMCMI4R33LIJ/events.json","paper":"https://pith.science/paper/645JYZIA"},"agent_actions":{"view_html":"https://pith.science/pith/645JYZIADUCM75KMCMI4R33LIJ","download_json":"https://pith.science/pith/645JYZIADUCM75KMCMI4R33LIJ.json","view_paper":"https://pith.science/paper/645JYZIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06922&json=true","fetch_graph":"https://pith.science/api/pith-number/645JYZIADUCM75KMCMI4R33LIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/645JYZIADUCM75KMCMI4R33LIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/645JYZIADUCM75KMCMI4R33LIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/645JYZIADUCM75KMCMI4R33LIJ/action/storage_attestation","attest_author":"https://pith.science/pith/645JYZIADUCM75KMCMI4R33LIJ/action/author_attestation","sign_citation":"https://pith.science/pith/645JYZIADUCM75KMCMI4R33LIJ/action/citation_signature","submit_replication":"https://pith.science/pith/645JYZIADUCM75KMCMI4R33LIJ/action/replication_record"}},"created_at":"2026-05-18T01:04:09.199283+00:00","updated_at":"2026-05-18T01:04:09.199283+00:00"}