{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:25R3UQAPWL65MBBFX5HKQIEUFV","short_pith_number":"pith:25R3UQAP","schema_version":"1.0","canonical_sha256":"d763ba400fb2fdd60425bf4ea820942d42904c84e7c0a2fac09ab0f6ce130543","source":{"kind":"arxiv","id":"1807.00112","version":1},"attestation_state":"computed","paper":{"title":"Approximate Nearest Neighbors in Limited Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Piotr Indyk, Tal Wagner","submitted_at":"2018-06-30T02:33:15Z","abstract_excerpt":"We consider the $(1+\\epsilon)$-approximate nearest neighbor search problem: given a set $X$ of $n$ points in a $d$-dimensional space, build a data structure that, given any query point $y$, finds a point $x \\in X$ whose distance to $y$ is at most $(1+\\epsilon) \\min_{x \\in X} \\|x-y\\|$ for an accuracy parameter $\\epsilon \\in (0,1)$. Our main result is a data structure that occupies only $O(\\epsilon^{-2} n \\log(n) \\log(1/\\epsilon))$ bits of space, assuming all point coordinates are integers in the range $\\{-n^{O(1)} \\ldots n^{O(1)}\\}$, i.e., the coordinates have $O(\\log n)$ bits of precision. Thi"},"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":"1807.00112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-30T02:33:15Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"9d0a1e998834cdb5d20e84ec2fbd189044528dac8761074a127498f673990249","abstract_canon_sha256":"e0cc0c08c75fb2ae303545c07cf857df07190d51a3aeab4948a86228a824fded"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:56.064411Z","signature_b64":"P55kBkmeg5RR/7/hAxUAwdJu9TICNANZi9uG/yJ99ujy5aUHN10Kq3hjAsgtg448uEFo0T+TM8IvEhoOLipLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d763ba400fb2fdd60425bf4ea820942d42904c84e7c0a2fac09ab0f6ce130543","last_reissued_at":"2026-05-18T00:11:56.063870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:56.063870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Nearest Neighbors in Limited Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Piotr Indyk, Tal Wagner","submitted_at":"2018-06-30T02:33:15Z","abstract_excerpt":"We consider the $(1+\\epsilon)$-approximate nearest neighbor search problem: given a set $X$ of $n$ points in a $d$-dimensional space, build a data structure that, given any query point $y$, finds a point $x \\in X$ whose distance to $y$ is at most $(1+\\epsilon) \\min_{x \\in X} \\|x-y\\|$ for an accuracy parameter $\\epsilon \\in (0,1)$. Our main result is a data structure that occupies only $O(\\epsilon^{-2} n \\log(n) \\log(1/\\epsilon))$ bits of space, assuming all point coordinates are integers in the range $\\{-n^{O(1)} \\ldots n^{O(1)}\\}$, i.e., the coordinates have $O(\\log n)$ bits of precision. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00112","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":"1807.00112","created_at":"2026-05-18T00:11:56.063961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00112v1","created_at":"2026-05-18T00:11:56.063961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00112","created_at":"2026-05-18T00:11:56.063961+00:00"},{"alias_kind":"pith_short_12","alias_value":"25R3UQAPWL65","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"25R3UQAPWL65MBBF","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"25R3UQAP","created_at":"2026-05-18T12:31:59.375834+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/25R3UQAPWL65MBBFX5HKQIEUFV","json":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV.json","graph_json":"https://pith.science/api/pith-number/25R3UQAPWL65MBBFX5HKQIEUFV/graph.json","events_json":"https://pith.science/api/pith-number/25R3UQAPWL65MBBFX5HKQIEUFV/events.json","paper":"https://pith.science/paper/25R3UQAP"},"agent_actions":{"view_html":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV","download_json":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV.json","view_paper":"https://pith.science/paper/25R3UQAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00112&json=true","fetch_graph":"https://pith.science/api/pith-number/25R3UQAPWL65MBBFX5HKQIEUFV/graph.json","fetch_events":"https://pith.science/api/pith-number/25R3UQAPWL65MBBFX5HKQIEUFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV/action/storage_attestation","attest_author":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV/action/author_attestation","sign_citation":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV/action/citation_signature","submit_replication":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV/action/replication_record"}},"created_at":"2026-05-18T00:11:56.063961+00:00","updated_at":"2026-05-18T00:11:56.063961+00:00"}