{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:53AYMZB34C76CQJ5MVHUZMHKMQ","short_pith_number":"pith:53AYMZB3","schema_version":"1.0","canonical_sha256":"eec186643be0bfe1413d654f4cb0ea641af0eaa80f9252b4e522c8cf84024b1c","source":{"kind":"arxiv","id":"1301.6176","version":1},"attestation_state":"computed","paper":{"title":"Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Joop van de Pol, Michele Mosca, Thijs Laarhoven","submitted_at":"2013-01-25T21:15:55Z","abstract_excerpt":"By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehl\\'{e}, we obtain improved asymptotic quantum results for solving the shortest vector problem. With quantum computers we can provably find a shortest vector in time $2^{1.799n + o(n)}$, improving upon the classical time complexity of $2^{2.465n + o(n)}$ of Pujol and Stehl\\'{e} and the $2^{2n + o(n)}$ of Micciancio and Voulgaris, while heuristically we expect to find a shortest vector in time $2^{0.312n + o(n)}$, improving upon the classical time"},"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":"1301.6176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-25T21:15:55Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"ff49da1bb08123326362d8fbc013fa0d8b29410245def05cd62f13e5186b68ad","abstract_canon_sha256":"f1927cf78937afdb7dcdc4a0c4579b125c894a2b11b558b4d079fe98d6e21644"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:21.523002Z","signature_b64":"0+ri3s+YoqWnkfVrhof7Mx5nsuzWslGDLbd0YqYBESOigAffNAter8pv7mFeB6yYuTNA3B58V/6SDxxdb0NEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eec186643be0bfe1413d654f4cb0ea641af0eaa80f9252b4e522c8cf84024b1c","last_reissued_at":"2026-05-18T03:21:21.522543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:21.522543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Joop van de Pol, Michele Mosca, Thijs Laarhoven","submitted_at":"2013-01-25T21:15:55Z","abstract_excerpt":"By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehl\\'{e}, we obtain improved asymptotic quantum results for solving the shortest vector problem. With quantum computers we can provably find a shortest vector in time $2^{1.799n + o(n)}$, improving upon the classical time complexity of $2^{2.465n + o(n)}$ of Pujol and Stehl\\'{e} and the $2^{2n + o(n)}$ of Micciancio and Voulgaris, while heuristically we expect to find a shortest vector in time $2^{0.312n + o(n)}$, improving upon the classical time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6176","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":"1301.6176","created_at":"2026-05-18T03:21:21.522621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6176v1","created_at":"2026-05-18T03:21:21.522621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6176","created_at":"2026-05-18T03:21:21.522621+00:00"},{"alias_kind":"pith_short_12","alias_value":"53AYMZB34C76","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"53AYMZB34C76CQJ5","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"53AYMZB3","created_at":"2026-05-18T12:27:34.582898+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/53AYMZB34C76CQJ5MVHUZMHKMQ","json":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ.json","graph_json":"https://pith.science/api/pith-number/53AYMZB34C76CQJ5MVHUZMHKMQ/graph.json","events_json":"https://pith.science/api/pith-number/53AYMZB34C76CQJ5MVHUZMHKMQ/events.json","paper":"https://pith.science/paper/53AYMZB3"},"agent_actions":{"view_html":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ","download_json":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ.json","view_paper":"https://pith.science/paper/53AYMZB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6176&json=true","fetch_graph":"https://pith.science/api/pith-number/53AYMZB34C76CQJ5MVHUZMHKMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/53AYMZB34C76CQJ5MVHUZMHKMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/action/storage_attestation","attest_author":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/action/author_attestation","sign_citation":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/action/citation_signature","submit_replication":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/action/replication_record"}},"created_at":"2026-05-18T03:21:21.522621+00:00","updated_at":"2026-05-18T03:21:21.522621+00:00"}