{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NYKTSHNUEGYSR226XGIMCEVA3R","short_pith_number":"pith:NYKTSHNU","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"},"canonical_sha256":"6e15391db421b128eb5eb990c112a0dc6046dd565d56c0311029f7b2427871f6","source":{"kind":"arxiv","id":"1708.06395","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06395","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06395v3","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06395","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"NYKTSHNUEGYS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NYKTSHNUEGYSR226","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NYKTSHNU","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NYKTSHNUEGYSR226XGIMCEVA3R","target":"record","payload":{"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"},"canonical_sha256":"6e15391db421b128eb5eb990c112a0dc6046dd565d56c0311029f7b2427871f6","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"},"source_kind":"arxiv","source_id":"1708.06395","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQKT6jJIkNoK77/pnMQvIfsdfLlwZLa5DbGZewAiWwsZiTnScoNY6tiQ32OmrVvTIW476guCDzKh+wk8BjuJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:03:55.904641Z"},"content_sha256":"f8555cc013308c26eab1b2aaa1b8dd657a2f34cb0cf06398c6e1cbeceb904c50","schema_version":"1.0","event_id":"sha256:f8555cc013308c26eab1b2aaa1b8dd657a2f34cb0cf06398c6e1cbeceb904c50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NYKTSHNUEGYSR226XGIMCEVA3R","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NxJtAGUxUnIZOZ11TlLzxVI3KAbeu6vojCKo4hCRoGgHrakvSgvwcvbfqJLN53PL1c5Txp/K4vHKyf/JOjoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:03:55.905580Z"},"content_sha256":"2c2eaa7a82ffbd461bd007331112ed096e81399bf58f819cad5d1cd12a7ec439","schema_version":"1.0","event_id":"sha256:2c2eaa7a82ffbd461bd007331112ed096e81399bf58f819cad5d1cd12a7ec439"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R/bundle.json","state_url":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYKTSHNUEGYSR226XGIMCEVA3R/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T20:03:55Z","links":{"resolver":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R","bundle":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R/bundle.json","state":"https://pith.science/pith/NYKTSHNUEGYSR226XGIMCEVA3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYKTSHNUEGYSR226XGIMCEVA3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NYKTSHNUEGYSR226XGIMCEVA3R","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6e910285c238fed26af85c6d32c13bb8a721f21aece56a05c479da22c745f757","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-21T19:59:53Z","title_canon_sha256":"94a3a6222cdf211014e56f7bacbda091dbeeb10fadcec2b90c7edb166bab5508"},"schema_version":"1.0","source":{"id":"1708.06395","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06395","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06395v3","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06395","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"NYKTSHNUEGYS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NYKTSHNUEGYSR226","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NYKTSHNU","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:2c2eaa7a82ffbd461bd007331112ed096e81399bf58f819cad5d1cd12a7ec439","target":"graph","created_at":"2026-05-18T00:35:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Piotr Sankowski, Piotr Wygocki","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-21T19:59:53Z","title":"Approximate nearest neighbors search without false negatives for $l_2$ for $c>\\sqrt{\\log\\log{n}}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06395","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f8555cc013308c26eab1b2aaa1b8dd657a2f34cb0cf06398c6e1cbeceb904c50","target":"record","created_at":"2026-05-18T00:35:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6e910285c238fed26af85c6d32c13bb8a721f21aece56a05c479da22c745f757","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-21T19:59:53Z","title_canon_sha256":"94a3a6222cdf211014e56f7bacbda091dbeeb10fadcec2b90c7edb166bab5508"},"schema_version":"1.0","source":{"id":"1708.06395","kind":"arxiv","version":3}},"canonical_sha256":"6e15391db421b128eb5eb990c112a0dc6046dd565d56c0311029f7b2427871f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e15391db421b128eb5eb990c112a0dc6046dd565d56c0311029f7b2427871f6","first_computed_at":"2026-05-18T00:35:15.955348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:15.955348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RMPx53E6h/Psd22mljLuMbxc2cR0uHg6pUH/E/o9yv/i8yOoNY4mEFRB+BYHo68UjE+ODhGh6PA9Fn/xVdRADA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:15.955980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06395","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8555cc013308c26eab1b2aaa1b8dd657a2f34cb0cf06398c6e1cbeceb904c50","sha256:2c2eaa7a82ffbd461bd007331112ed096e81399bf58f819cad5d1cd12a7ec439"],"state_sha256":"c9f1762c8e6f2498a093e2c070c004dfc102f0ac447e6a07dfd007e4cc93bbd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4XmhBHyNVezD9OmTM9e2R9n19NYtZ12fEr0MOMRfQNaEHyrAgQMKpUdhswcn66BXu1nDLqxioRzY95HejxtDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:03:55.909581Z","bundle_sha256":"8cff26c24b2607cde0ac40a52080068990bc2a07f5681c09831bd67fc84183b6"}}