{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:53AYMZB34C76CQJ5MVHUZMHKMQ","short_pith_number":"pith:53AYMZB3","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"},"canonical_sha256":"eec186643be0bfe1413d654f4cb0ea641af0eaa80f9252b4e522c8cf84024b1c","source":{"kind":"arxiv","id":"1301.6176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6176","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6176v1","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6176","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"pith_short_12","alias_value":"53AYMZB34C76","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"53AYMZB34C76CQJ5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"53AYMZB3","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:53AYMZB34C76CQJ5MVHUZMHKMQ","target":"record","payload":{"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"},"canonical_sha256":"eec186643be0bfe1413d654f4cb0ea641af0eaa80f9252b4e522c8cf84024b1c","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"},"source_kind":"arxiv","source_id":"1301.6176","source_version":1,"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-18T03:21:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUrVxzbaTQ73ZMMxdF+iBbGP4Q66dv3+bOb793ToDZs4OMkjQiQ1aNd/CYUr9Zs6aCPMD29aY2jAa3n/yYSqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:12:12.827259Z"},"content_sha256":"149593efb79c1a14fe7ea5f108657b5b341ac8d647cdf1d6f11b680562c7f42a","schema_version":"1.0","event_id":"sha256:149593efb79c1a14fe7ea5f108657b5b341ac8d647cdf1d6f11b680562c7f42a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:53AYMZB34C76CQJ5MVHUZMHKMQ","target":"graph","payload":{"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"},"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-18T03:21:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0DG13BZBvXNpHcS19puiJaLKvctazVZAxlzYgMmNFa9teSJ/LvOBqDub6RwCOOAj+ty+r6v5Ohqdv6mVHb8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:12:12.827849Z"},"content_sha256":"7a881e77bb6d6387736e1ba134a242388e06e55570b876ab58499e1c03fcf22e","schema_version":"1.0","event_id":"sha256:7a881e77bb6d6387736e1ba134a242388e06e55570b876ab58499e1c03fcf22e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/bundle.json","state_url":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/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-05-25T23:12:12Z","links":{"resolver":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ","bundle":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/bundle.json","state":"https://pith.science/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/53AYMZB34C76CQJ5MVHUZMHKMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:53AYMZB34C76CQJ5MVHUZMHKMQ","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":"f1927cf78937afdb7dcdc4a0c4579b125c894a2b11b558b4d079fe98d6e21644","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-25T21:15:55Z","title_canon_sha256":"ff49da1bb08123326362d8fbc013fa0d8b29410245def05cd62f13e5186b68ad"},"schema_version":"1.0","source":{"id":"1301.6176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6176","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6176v1","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6176","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"pith_short_12","alias_value":"53AYMZB34C76","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"53AYMZB34C76CQJ5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"53AYMZB3","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:7a881e77bb6d6387736e1ba134a242388e06e55570b876ab58499e1c03fcf22e","target":"graph","created_at":"2026-05-18T03:21:21Z","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":"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","authors_text":"Joop van de Pol, Michele Mosca, Thijs Laarhoven","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-25T21:15:55Z","title":"Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6176","kind":"arxiv","version":1},"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:149593efb79c1a14fe7ea5f108657b5b341ac8d647cdf1d6f11b680562c7f42a","target":"record","created_at":"2026-05-18T03:21:21Z","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":"f1927cf78937afdb7dcdc4a0c4579b125c894a2b11b558b4d079fe98d6e21644","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-25T21:15:55Z","title_canon_sha256":"ff49da1bb08123326362d8fbc013fa0d8b29410245def05cd62f13e5186b68ad"},"schema_version":"1.0","source":{"id":"1301.6176","kind":"arxiv","version":1}},"canonical_sha256":"eec186643be0bfe1413d654f4cb0ea641af0eaa80f9252b4e522c8cf84024b1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eec186643be0bfe1413d654f4cb0ea641af0eaa80f9252b4e522c8cf84024b1c","first_computed_at":"2026-05-18T03:21:21.522543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:21.522543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0+ri3s+YoqWnkfVrhof7Mx5nsuzWslGDLbd0YqYBESOigAffNAter8pv7mFeB6yYuTNA3B58V/6SDxxdb0NEDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:21.523002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:149593efb79c1a14fe7ea5f108657b5b341ac8d647cdf1d6f11b680562c7f42a","sha256:7a881e77bb6d6387736e1ba134a242388e06e55570b876ab58499e1c03fcf22e"],"state_sha256":"f0c52311f4cc52f976548291b9190ac078d3c447e2608ba0be717f84f34667df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXc43gXHr4IhCxDV2dTnI+C5YFyhwYWUPN62+5yqg38Jhj/pYrxg/s5enK2JJb4gFCUmWyhCrC3vPO6WJ/APCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:12:12.832096Z","bundle_sha256":"7d75b7d9a751cb94c5f2da44a3ca3d11e94f54323075ec36adab3052c7ef84a0"}}