{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NYKTSHNUEGYSR226XGIMCEVA3R","short_pith_number":"pith:NYKTSHNU","schema_version":"1.0","canonical_sha256":"6e15391db421b128eb5eb990c112a0dc6046dd565d56c0311029f7b2427871f6","source":{"kind":"arxiv","id":"1708.06395","version":3},"attestation_state":"computed","paper":{"title":"Approximate nearest neighbors search without false negatives for $l_2$ for $c>\\sqrt{\\log\\log{n}}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Piotr Sankowski, Piotr Wygocki","submitted_at":"2017-08-21T19:59:53Z","abstract_excerpt":"In this paper, we report progress on answering the open problem presented by Pagh~[14], who considered the nearest neighbor search without false negatives for the Hamming distance. We show new data structures for solving the $c$-approximate nearest neighbors problem without false negatives for Euclidean high dimensional space $\\mathcal{R}^d$. These data structures work for any $c = \\omega(\\sqrt{\\log{\\log{n}}})$, where $n$ is the number of points in the input set, with poly-logarithmic query time and polynomial preprocessing time. This improves over the known algorithms, which require $c$ to be"},"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.06395","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-21T19:59:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"94a3a6222cdf211014e56f7bacbda091dbeeb10fadcec2b90c7edb166bab5508","abstract_canon_sha256":"6e910285c238fed26af85c6d32c13bb8a721f21aece56a05c479da22c745f757"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:15.955980Z","signature_b64":"RMPx53E6h/Psd22mljLuMbxc2cR0uHg6pUH/E/o9yv/i8yOoNY4mEFRB+BYHo68UjE+ODhGh6PA9Fn/xVdRADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e15391db421b128eb5eb990c112a0dc6046dd565d56c0311029f7b2427871f6","last_reissued_at":"2026-05-18T00:35:15.955348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:15.955348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate nearest neighbors search without false negatives for $l_2$ for $c>\\sqrt{\\log\\log{n}}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Piotr Sankowski, Piotr Wygocki","submitted_at":"2017-08-21T19:59:53Z","abstract_excerpt":"In this paper, we report progress on answering the open problem presented by Pagh~[14], who considered the nearest neighbor search without false negatives for the Hamming distance. We show new data structures for solving the $c$-approximate nearest neighbors problem without false negatives for Euclidean high dimensional space $\\mathcal{R}^d$. These data structures work for any $c = \\omega(\\sqrt{\\log{\\log{n}}})$, where $n$ is the number of points in the input set, with poly-logarithmic query time and polynomial preprocessing time. This improves over the known algorithms, which require $c$ to be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06395","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":"1708.06395","created_at":"2026-05-18T00:35:15.955434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06395v3","created_at":"2026-05-18T00:35:15.955434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06395","created_at":"2026-05-18T00:35:15.955434+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYKTSHNUEGYS","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYKTSHNUEGYSR226","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYKTSHNU","created_at":"2026-05-18T12:31:34.259226+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/NYKTSHNUEGYSR226XGIMCEVA3R","json":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R.json","graph_json":"https://pith.science/api/pith-number/NYKTSHNUEGYSR226XGIMCEVA3R/graph.json","events_json":"https://pith.science/api/pith-number/NYKTSHNUEGYSR226XGIMCEVA3R/events.json","paper":"https://pith.science/paper/NYKTSHNU"},"agent_actions":{"view_html":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R","download_json":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R.json","view_paper":"https://pith.science/paper/NYKTSHNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06395&json=true","fetch_graph":"https://pith.science/api/pith-number/NYKTSHNUEGYSR226XGIMCEVA3R/graph.json","fetch_events":"https://pith.science/api/pith-number/NYKTSHNUEGYSR226XGIMCEVA3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R/action/storage_attestation","attest_author":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R/action/author_attestation","sign_citation":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R/action/citation_signature","submit_replication":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R/action/replication_record"}},"created_at":"2026-05-18T00:35:15.955434+00:00","updated_at":"2026-05-18T00:35:15.955434+00:00"}