{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UEIFZW4HKGNPMDU244M6RVAFEX","short_pith_number":"pith:UEIFZW4H","schema_version":"1.0","canonical_sha256":"a1105cdb87519af60e9ae719e8d40525df0161fcff84b49d6ba44a659cd23563","source":{"kind":"arxiv","id":"1408.0751","version":1},"attestation_state":"computed","paper":{"title":"Spectral Approaches to Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Amirali Abdullah, Ravindran Kannan, Robert Krauthgamer","submitted_at":"2014-08-04T17:51:17Z","abstract_excerpt":"We study spectral algorithms for the high-dimensional Nearest Neighbor Search problem (NNS). In particular, we consider a semi-random setting where a dataset $P$ in $\\mathbb{R}^d$ is chosen arbitrarily from an unknown subspace of low dimension $k\\ll d$, and then perturbed by fully $d$-dimensional Gaussian noise. We design spectral NNS algorithms whose query time depends polynomially on $d$ and $\\log n$ (where $n=|P|$) for large ranges of $k$, $d$ and $n$. Our algorithms use a repeated computation of the top PCA vector/subspace, and are effective even when the random-noise magnitude is {\\em muc"},"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":"1408.0751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-04T17:51:17Z","cross_cats_sorted":[],"title_canon_sha256":"1f3d286b109182f35b750d1f1c5a1caa3c048176e3bcf5ed15fcaa6a47d17ff6","abstract_canon_sha256":"a7aad7fac2a03c1f7658b79d2aeea030fea5a9257ecc6abc18f34d364d28ad7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:56.310123Z","signature_b64":"CA7BQbfAZYfRwikNK7Sei+AbMXNX6r8OcZKiQpKwLwMLunbAgWShJZI4WWnouKs6eB6DQkkWfoogBvXqdfuiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1105cdb87519af60e9ae719e8d40525df0161fcff84b49d6ba44a659cd23563","last_reissued_at":"2026-05-18T02:45:56.309484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:56.309484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Approaches to Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Amirali Abdullah, Ravindran Kannan, Robert Krauthgamer","submitted_at":"2014-08-04T17:51:17Z","abstract_excerpt":"We study spectral algorithms for the high-dimensional Nearest Neighbor Search problem (NNS). In particular, we consider a semi-random setting where a dataset $P$ in $\\mathbb{R}^d$ is chosen arbitrarily from an unknown subspace of low dimension $k\\ll d$, and then perturbed by fully $d$-dimensional Gaussian noise. We design spectral NNS algorithms whose query time depends polynomially on $d$ and $\\log n$ (where $n=|P|$) for large ranges of $k$, $d$ and $n$. Our algorithms use a repeated computation of the top PCA vector/subspace, and are effective even when the random-noise magnitude is {\\em muc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0751","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":"1408.0751","created_at":"2026-05-18T02:45:56.309568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0751v1","created_at":"2026-05-18T02:45:56.309568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0751","created_at":"2026-05-18T02:45:56.309568+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEIFZW4HKGNP","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEIFZW4HKGNPMDU2","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEIFZW4H","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.03831","citing_title":"SVD Provably Denoises Nearest Neighbor Data","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UEIFZW4HKGNPMDU244M6RVAFEX","json":"https://pith.science/pith/UEIFZW4HKGNPMDU244M6RVAFEX.json","graph_json":"https://pith.science/api/pith-number/UEIFZW4HKGNPMDU244M6RVAFEX/graph.json","events_json":"https://pith.science/api/pith-number/UEIFZW4HKGNPMDU244M6RVAFEX/events.json","paper":"https://pith.science/paper/UEIFZW4H"},"agent_actions":{"view_html":"https://pith.science/pith/UEIFZW4HKGNPMDU244M6RVAFEX","download_json":"https://pith.science/pith/UEIFZW4HKGNPMDU244M6RVAFEX.json","view_paper":"https://pith.science/paper/UEIFZW4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0751&json=true","fetch_graph":"https://pith.science/api/pith-number/UEIFZW4HKGNPMDU244M6RVAFEX/graph.json","fetch_events":"https://pith.science/api/pith-number/UEIFZW4HKGNPMDU244M6RVAFEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEIFZW4HKGNPMDU244M6RVAFEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEIFZW4HKGNPMDU244M6RVAFEX/action/storage_attestation","attest_author":"https://pith.science/pith/UEIFZW4HKGNPMDU244M6RVAFEX/action/author_attestation","sign_citation":"https://pith.science/pith/UEIFZW4HKGNPMDU244M6RVAFEX/action/citation_signature","submit_replication":"https://pith.science/pith/UEIFZW4HKGNPMDU244M6RVAFEX/action/replication_record"}},"created_at":"2026-05-18T02:45:56.309568+00:00","updated_at":"2026-05-18T02:45:56.309568+00:00"}