{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2JZNE2OUE5DQ7JWKLBF2VL7ZBB","short_pith_number":"pith:2JZNE2OU","schema_version":"1.0","canonical_sha256":"d272d269d427470fa6ca584baaaff90854eb21d01f4706f20d3fe85fd5848763","source":{"kind":"arxiv","id":"1708.07586","version":2},"attestation_state":"computed","paper":{"title":"Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tobias Christiani","submitted_at":"2017-08-25T00:47:38Z","abstract_excerpt":"The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\\mathcal{H}$ over locality-sensitive hash functions that partition space. For a collection of $n$ points, after preprocessing, the query time is dominated by $O(n^{\\rho} \\log n)$ evaluations of hash functions from $\\mathcal{H}$ and $O(n^{\\rho})$ hash table lookups and distance computations where $\\rho \\in (0,1)$ is determined by the locality-sensitivity properties of $\\mathcal{H}$. It follows from "},"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":"1708.07586","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T00:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"0679d464ad3a702c7f56e3ec6b3d7fa61cd6855bee2e89268757df46821a5db4","abstract_canon_sha256":"ad0827f374ca9a1f62a614cdf6052b4e343a811597885ff0cde944e9744ee462"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:14.005370Z","signature_b64":"f4LPYWI+5plLf+0s/bJM/jZWPjE+ts8pKYCTvATN9/3gGXDIRM12XOLj2KetXsSfhezPFvYYAJIJCjA4PHcADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d272d269d427470fa6ca584baaaff90854eb21d01f4706f20d3fe85fd5848763","last_reissued_at":"2026-05-18T00:23:14.004720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:14.004720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tobias Christiani","submitted_at":"2017-08-25T00:47:38Z","abstract_excerpt":"The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\\mathcal{H}$ over locality-sensitive hash functions that partition space. For a collection of $n$ points, after preprocessing, the query time is dominated by $O(n^{\\rho} \\log n)$ evaluations of hash functions from $\\mathcal{H}$ and $O(n^{\\rho})$ hash table lookups and distance computations where $\\rho \\in (0,1)$ is determined by the locality-sensitivity properties of $\\mathcal{H}$. It follows from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07586","kind":"arxiv","version":2},"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":"1708.07586","created_at":"2026-05-18T00:23:14.004837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07586v2","created_at":"2026-05-18T00:23:14.004837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07586","created_at":"2026-05-18T00:23:14.004837+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JZNE2OUE5DQ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JZNE2OUE5DQ7JWK","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JZNE2OU","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.09430","citing_title":"Algorithms for Similarity Search and Pseudorandomness","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"1906.12211","citing_title":"PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB","json":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB.json","graph_json":"https://pith.science/api/pith-number/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/graph.json","events_json":"https://pith.science/api/pith-number/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/events.json","paper":"https://pith.science/paper/2JZNE2OU"},"agent_actions":{"view_html":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB","download_json":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB.json","view_paper":"https://pith.science/paper/2JZNE2OU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07586&json=true","fetch_graph":"https://pith.science/api/pith-number/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/graph.json","fetch_events":"https://pith.science/api/pith-number/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/action/storage_attestation","attest_author":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/action/author_attestation","sign_citation":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/action/citation_signature","submit_replication":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/action/replication_record"}},"created_at":"2026-05-18T00:23:14.004837+00:00","updated_at":"2026-05-18T00:23:14.004837+00:00"}