{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UZ3L5B7BYRF2NQLL43L26GX54E","short_pith_number":"pith:UZ3L5B7B","schema_version":"1.0","canonical_sha256":"a676be87e1c44ba6c16be6d7af1afde1109d22bc6636e3eb553c4c1b7f813956","source":{"kind":"arxiv","id":"1507.04299","version":1},"attestation_state":"computed","paper":{"title":"Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Ilya Razenshteyn","submitted_at":"2015-07-15T17:02:20Z","abstract_excerpt":"We prove a tight lower bound for the exponent $\\rho$ for data-dependent Locality-Sensitive Hashing schemes, recently used to design efficient solutions for the $c$-approximate nearest neighbor search. In particular, our lower bound matches the bound of $\\rho\\le \\frac{1}{2c-1}+o(1)$ for the $\\ell_1$ space, obtained via the recent algorithm from [Andoni-Razenshteyn, STOC'15].\n  In recent years it emerged that data-dependent hashing is strictly superior to the classical Locality-Sensitive Hashing, when the hash function is data-independent. In the latter setting, the best exponent has been alread"},"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":"1507.04299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-15T17:02:20Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"90ebd2b06fdf6d0715c8dbc896b8c0daac63c3622b579ba57394cd1167e4409a","abstract_canon_sha256":"9fb6d0d447764410c92764b8e2991746815a5bd772182a5b541623125162f001"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:48.702125Z","signature_b64":"IAUPYmMQp1Gu8TZ7uOOu+q9X/bBoks334AhDNUzC8pkgyTF3jvyNfS6yLbhNd4fjSUv9YMenTYpYjnoIDVcpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a676be87e1c44ba6c16be6d7af1afde1109d22bc6636e3eb553c4c1b7f813956","last_reissued_at":"2026-05-18T01:36:48.701420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:48.701420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Ilya Razenshteyn","submitted_at":"2015-07-15T17:02:20Z","abstract_excerpt":"We prove a tight lower bound for the exponent $\\rho$ for data-dependent Locality-Sensitive Hashing schemes, recently used to design efficient solutions for the $c$-approximate nearest neighbor search. In particular, our lower bound matches the bound of $\\rho\\le \\frac{1}{2c-1}+o(1)$ for the $\\ell_1$ space, obtained via the recent algorithm from [Andoni-Razenshteyn, STOC'15].\n  In recent years it emerged that data-dependent hashing is strictly superior to the classical Locality-Sensitive Hashing, when the hash function is data-independent. In the latter setting, the best exponent has been alread"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04299","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":"1507.04299","created_at":"2026-05-18T01:36:48.701531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04299v1","created_at":"2026-05-18T01:36:48.701531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04299","created_at":"2026-05-18T01:36:48.701531+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZ3L5B7BYRF2","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZ3L5B7BYRF2NQLL","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZ3L5B7B","created_at":"2026-05-18T12:29:44.643036+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/UZ3L5B7BYRF2NQLL43L26GX54E","json":"https://pith.science/pith/UZ3L5B7BYRF2NQLL43L26GX54E.json","graph_json":"https://pith.science/api/pith-number/UZ3L5B7BYRF2NQLL43L26GX54E/graph.json","events_json":"https://pith.science/api/pith-number/UZ3L5B7BYRF2NQLL43L26GX54E/events.json","paper":"https://pith.science/paper/UZ3L5B7B"},"agent_actions":{"view_html":"https://pith.science/pith/UZ3L5B7BYRF2NQLL43L26GX54E","download_json":"https://pith.science/pith/UZ3L5B7BYRF2NQLL43L26GX54E.json","view_paper":"https://pith.science/paper/UZ3L5B7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04299&json=true","fetch_graph":"https://pith.science/api/pith-number/UZ3L5B7BYRF2NQLL43L26GX54E/graph.json","fetch_events":"https://pith.science/api/pith-number/UZ3L5B7BYRF2NQLL43L26GX54E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZ3L5B7BYRF2NQLL43L26GX54E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZ3L5B7BYRF2NQLL43L26GX54E/action/storage_attestation","attest_author":"https://pith.science/pith/UZ3L5B7BYRF2NQLL43L26GX54E/action/author_attestation","sign_citation":"https://pith.science/pith/UZ3L5B7BYRF2NQLL43L26GX54E/action/citation_signature","submit_replication":"https://pith.science/pith/UZ3L5B7BYRF2NQLL43L26GX54E/action/replication_record"}},"created_at":"2026-05-18T01:36:48.701531+00:00","updated_at":"2026-05-18T01:36:48.701531+00:00"}