{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BY6FGMIRKG32622YKXWJDSTXN4","short_pith_number":"pith:BY6FGMIR","schema_version":"1.0","canonical_sha256":"0e3c53311151b7af6b5855ec91ca776f086a42596a558bf450f39e1038106d98","source":{"kind":"arxiv","id":"1611.09317","version":1},"attestation_state":"computed","paper":{"title":"Locality-Sensitive Hashing without False Negatives for l_p","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrzej Pacuk, Karol Wegrzycki, Piotr Sankowski, Piotr Wygocki","submitted_at":"2016-11-28T20:11:11Z","abstract_excerpt":"In this paper, we show a construction of locality-sensitive hash functions without false negatives, i.e., which ensure collision for every pair of points within a given radius $R$ in $d$ dimensional space equipped with $l_p$ norm when $p \\in [1,\\infty]$. Furthermore, we show how to use these hash functions to solve the $c$-approximate nearest neighbor search problem without false negatives. Namely, if there is a point at distance $R$, we will certainly report it and points at distance greater than $cR$ will not be reported for $c=\\Omega(\\sqrt{d},d^{1-\\frac{1}{p}})$. The constructed algorithms "},"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":"1611.09317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T20:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"394de1eea2ff84721e0bf21b6219a86ba1d7ad2009b8461c4ebf73e990b6695c","abstract_canon_sha256":"2cea819c8fadb79bd3008d0d658ceae502a9353abda579e84f7c511aec06937a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:28.528780Z","signature_b64":"hAkr0+e6S/jHxN7pl/DjqBRrGc2d2PgCPjFDdMCBJ4KjOnCZXzATaDOPYrS1dsYRXk0hmr4Gff4oAPTeDS7lBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e3c53311151b7af6b5855ec91ca776f086a42596a558bf450f39e1038106d98","last_reissued_at":"2026-05-18T00:56:28.528060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:28.528060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locality-Sensitive Hashing without False Negatives for l_p","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrzej Pacuk, Karol Wegrzycki, Piotr Sankowski, Piotr Wygocki","submitted_at":"2016-11-28T20:11:11Z","abstract_excerpt":"In this paper, we show a construction of locality-sensitive hash functions without false negatives, i.e., which ensure collision for every pair of points within a given radius $R$ in $d$ dimensional space equipped with $l_p$ norm when $p \\in [1,\\infty]$. Furthermore, we show how to use these hash functions to solve the $c$-approximate nearest neighbor search problem without false negatives. Namely, if there is a point at distance $R$, we will certainly report it and points at distance greater than $cR$ will not be reported for $c=\\Omega(\\sqrt{d},d^{1-\\frac{1}{p}})$. The constructed algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09317","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":"1611.09317","created_at":"2026-05-18T00:56:28.528182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09317v1","created_at":"2026-05-18T00:56:28.528182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09317","created_at":"2026-05-18T00:56:28.528182+00:00"},{"alias_kind":"pith_short_12","alias_value":"BY6FGMIRKG32","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BY6FGMIRKG32622Y","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BY6FGMIR","created_at":"2026-05-18T12:30:09.641336+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/BY6FGMIRKG32622YKXWJDSTXN4","json":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4.json","graph_json":"https://pith.science/api/pith-number/BY6FGMIRKG32622YKXWJDSTXN4/graph.json","events_json":"https://pith.science/api/pith-number/BY6FGMIRKG32622YKXWJDSTXN4/events.json","paper":"https://pith.science/paper/BY6FGMIR"},"agent_actions":{"view_html":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4","download_json":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4.json","view_paper":"https://pith.science/paper/BY6FGMIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09317&json=true","fetch_graph":"https://pith.science/api/pith-number/BY6FGMIRKG32622YKXWJDSTXN4/graph.json","fetch_events":"https://pith.science/api/pith-number/BY6FGMIRKG32622YKXWJDSTXN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4/action/storage_attestation","attest_author":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4/action/author_attestation","sign_citation":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4/action/citation_signature","submit_replication":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4/action/replication_record"}},"created_at":"2026-05-18T00:56:28.528182+00:00","updated_at":"2026-05-18T00:56:28.528182+00:00"}