{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5Z46LP33NV7RV4SDOLEDSBPPGX","short_pith_number":"pith:5Z46LP33","schema_version":"1.0","canonical_sha256":"ee79e5bf7b6d7f1af24372c83905ef35dabfb9b64dba45ed22f1de70f867e96c","source":{"kind":"arxiv","id":"1511.07357","version":1},"attestation_state":"computed","paper":{"title":"Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled, Sepideh Mahabadi","submitted_at":"2015-11-23T18:45:12Z","abstract_excerpt":"We introduce a new variant of the nearest neighbor search problem, which allows for some coordinates of the dataset to be arbitrarily corrupted or unknown. Formally, given a dataset of $n$ points $P=\\{ x_1,\\ldots, x_n\\}$ in high-dimensions, and a parameter $k$, the goal is to preprocess the dataset, such that given a query point $q$, one can compute quickly a point $x \\in P$, such that the distance of the query to the point $x$ is minimized, when ignoring the \"optimal\" $k$ coordinates. Note, that the coordinates being ignored are a function of both the query point and the point returned.\n  We "},"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":"1511.07357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-11-23T18:45:12Z","cross_cats_sorted":[],"title_canon_sha256":"e3536785031dd28a6ff16e165e2c74f74add5edcb031e029774b9162751bed36","abstract_canon_sha256":"9cda30494164402c2d91933f7a80d23ab13dd6d8670789b14c5e46296341245e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.557191Z","signature_b64":"MftrsA0w30l8k8RnJNL5m5jt3QUmBf+RZkMzQcrzGr2ZapTwZyveiWJWTmHpml20nIdgnRPYC9hqx51pFENXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee79e5bf7b6d7f1af24372c83905ef35dabfb9b64dba45ed22f1de70f867e96c","last_reissued_at":"2026-05-18T01:26:11.556758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.556758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled, Sepideh Mahabadi","submitted_at":"2015-11-23T18:45:12Z","abstract_excerpt":"We introduce a new variant of the nearest neighbor search problem, which allows for some coordinates of the dataset to be arbitrarily corrupted or unknown. Formally, given a dataset of $n$ points $P=\\{ x_1,\\ldots, x_n\\}$ in high-dimensions, and a parameter $k$, the goal is to preprocess the dataset, such that given a query point $q$, one can compute quickly a point $x \\in P$, such that the distance of the query to the point $x$ is minimized, when ignoring the \"optimal\" $k$ coordinates. Note, that the coordinates being ignored are a function of both the query point and the point returned.\n  We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07357","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":"1511.07357","created_at":"2026-05-18T01:26:11.556833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07357v1","created_at":"2026-05-18T01:26:11.556833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07357","created_at":"2026-05-18T01:26:11.556833+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Z46LP33NV7R","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Z46LP33NV7RV4SD","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Z46LP33","created_at":"2026-05-18T12:29:07.941421+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/5Z46LP33NV7RV4SDOLEDSBPPGX","json":"https://pith.science/pith/5Z46LP33NV7RV4SDOLEDSBPPGX.json","graph_json":"https://pith.science/api/pith-number/5Z46LP33NV7RV4SDOLEDSBPPGX/graph.json","events_json":"https://pith.science/api/pith-number/5Z46LP33NV7RV4SDOLEDSBPPGX/events.json","paper":"https://pith.science/paper/5Z46LP33"},"agent_actions":{"view_html":"https://pith.science/pith/5Z46LP33NV7RV4SDOLEDSBPPGX","download_json":"https://pith.science/pith/5Z46LP33NV7RV4SDOLEDSBPPGX.json","view_paper":"https://pith.science/paper/5Z46LP33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07357&json=true","fetch_graph":"https://pith.science/api/pith-number/5Z46LP33NV7RV4SDOLEDSBPPGX/graph.json","fetch_events":"https://pith.science/api/pith-number/5Z46LP33NV7RV4SDOLEDSBPPGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Z46LP33NV7RV4SDOLEDSBPPGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Z46LP33NV7RV4SDOLEDSBPPGX/action/storage_attestation","attest_author":"https://pith.science/pith/5Z46LP33NV7RV4SDOLEDSBPPGX/action/author_attestation","sign_citation":"https://pith.science/pith/5Z46LP33NV7RV4SDOLEDSBPPGX/action/citation_signature","submit_replication":"https://pith.science/pith/5Z46LP33NV7RV4SDOLEDSBPPGX/action/replication_record"}},"created_at":"2026-05-18T01:26:11.556833+00:00","updated_at":"2026-05-18T01:26:11.556833+00:00"}