{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DICLBUHTLVT5YHDKQCQUWWHZB5","short_pith_number":"pith:DICLBUHT","schema_version":"1.0","canonical_sha256":"1a04b0d0f35d67dc1c6a80a14b58f90f74268fc020821adb7a90244347b99cfb","source":{"kind":"arxiv","id":"1401.2142","version":2},"attestation_state":"computed","paper":{"title":"Quantum Algorithms for Nearest-Neighbor Methods for Supervised and Unsupervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashish Kapoor, Krysta Svore, Nathan Wiebe","submitted_at":"2014-01-09T20:28:06Z","abstract_excerpt":"We present several quantum algorithms for performing nearest-neighbor learning. At the core of our algorithms are fast and coherent quantum methods for computing distance metrics such as the inner product and Euclidean distance. We prove upper bounds on the number of queries to the input data required to compute these metrics. In the worst case, our quantum algorithms lead to polynomial reductions in query complexity relative to the corresponding classical algorithm. In certain cases, we show exponential or even super-exponential reductions over the classical analog. We study the performance o"},"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":"1401.2142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-01-09T20:28:06Z","cross_cats_sorted":[],"title_canon_sha256":"9817bf6b8d889c8e1a8b86d9354fdcc6a717593cf5bd233bf19e2a49323f8322","abstract_canon_sha256":"d858af7ca4ffbbd5134c73ea532b8184d991dca1e132d22df0ac15982e352ba9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:36.064199Z","signature_b64":"bRiQmjr5aBC6lU5NeIbJBLqdIlRrkoove1RseV5M6EbR5VjfLwGRqzEIwjk2RiBgITEBKDqNCDASeigjSG5+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a04b0d0f35d67dc1c6a80a14b58f90f74268fc020821adb7a90244347b99cfb","last_reissued_at":"2026-05-18T02:31:36.063571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:36.063571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Nearest-Neighbor Methods for Supervised and Unsupervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashish Kapoor, Krysta Svore, Nathan Wiebe","submitted_at":"2014-01-09T20:28:06Z","abstract_excerpt":"We present several quantum algorithms for performing nearest-neighbor learning. At the core of our algorithms are fast and coherent quantum methods for computing distance metrics such as the inner product and Euclidean distance. We prove upper bounds on the number of queries to the input data required to compute these metrics. In the worst case, our quantum algorithms lead to polynomial reductions in query complexity relative to the corresponding classical algorithm. In certain cases, we show exponential or even super-exponential reductions over the classical analog. We study the performance o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2142","kind":"arxiv","version":2},"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":"1401.2142","created_at":"2026-05-18T02:31:36.063664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2142v2","created_at":"2026-05-18T02:31:36.063664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2142","created_at":"2026-05-18T02:31:36.063664+00:00"},{"alias_kind":"pith_short_12","alias_value":"DICLBUHTLVT5","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DICLBUHTLVT5YHDK","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DICLBUHT","created_at":"2026-05-18T12:28:25.294606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.03315","citing_title":"A Quantum Algorithm for Finding $k$-Minima","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"1907.06949","citing_title":"Quantum Data Fitting Algorithm for Non-sparse Matrices","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04203","citing_title":"GHZ is All You Need: Quantum Sensing with VISTA","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DICLBUHTLVT5YHDKQCQUWWHZB5","json":"https://pith.science/pith/DICLBUHTLVT5YHDKQCQUWWHZB5.json","graph_json":"https://pith.science/api/pith-number/DICLBUHTLVT5YHDKQCQUWWHZB5/graph.json","events_json":"https://pith.science/api/pith-number/DICLBUHTLVT5YHDKQCQUWWHZB5/events.json","paper":"https://pith.science/paper/DICLBUHT"},"agent_actions":{"view_html":"https://pith.science/pith/DICLBUHTLVT5YHDKQCQUWWHZB5","download_json":"https://pith.science/pith/DICLBUHTLVT5YHDKQCQUWWHZB5.json","view_paper":"https://pith.science/paper/DICLBUHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2142&json=true","fetch_graph":"https://pith.science/api/pith-number/DICLBUHTLVT5YHDKQCQUWWHZB5/graph.json","fetch_events":"https://pith.science/api/pith-number/DICLBUHTLVT5YHDKQCQUWWHZB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DICLBUHTLVT5YHDKQCQUWWHZB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DICLBUHTLVT5YHDKQCQUWWHZB5/action/storage_attestation","attest_author":"https://pith.science/pith/DICLBUHTLVT5YHDKQCQUWWHZB5/action/author_attestation","sign_citation":"https://pith.science/pith/DICLBUHTLVT5YHDKQCQUWWHZB5/action/citation_signature","submit_replication":"https://pith.science/pith/DICLBUHTLVT5YHDKQCQUWWHZB5/action/replication_record"}},"created_at":"2026-05-18T02:31:36.063664+00:00","updated_at":"2026-05-18T02:31:36.063664+00:00"}