{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QY7KEQYYLXKKFUSCPDK5BV7FLL","short_pith_number":"pith:QY7KEQYY","schema_version":"1.0","canonical_sha256":"863ea243185dd4a2d24278d5d0d7e55acbbdaa69a374a936e1bde94a2d84e31c","source":{"kind":"arxiv","id":"1905.09749","version":3},"attestation_state":"computed","paper":{"title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Martin Eker{\\aa}","submitted_at":"2019-05-23T16:09:46Z","abstract_excerpt":"We significantly reduce the cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Niu 1996, Zalka 2006, Fowler 2012, Eker{\\aa}-H{\\aa}stad 2017, Eker{\\aa} 2017, Eker{\\aa} 2018, Gidney-Fowler 2019, Gidney 2019. We estimate the approximate cost of our construction using plausible physical assumptions for large-scale superconducting qubit platforms: a planar grid of qubits with nearest-neighbor connectivity, a characteristic physical gate error rate of $10^{-3}$, a surface code cycle time of 1 microseco"},"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":"1905.09749","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-05-23T16:09:46Z","cross_cats_sorted":[],"title_canon_sha256":"694cd1e1c05022404e6e269a400851ce762d20569d25186b692af9503dcbc698","abstract_canon_sha256":"64597cd37147ec7613d89604363feecf3ad7a1c26969a537483588eb10e3d602"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:33:45.750200Z","signature_b64":"GK8mPcaX0Q50DyhY1B0T/8b5umHWsLjY8oBV8X8Pfl7d76CAQZjABD1JnZ++Kx6jjQRDkaDc8KfhYChd9DCWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863ea243185dd4a2d24278d5d0d7e55acbbdaa69a374a936e1bde94a2d84e31c","last_reissued_at":"2026-07-05T02:33:45.749715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:33:45.749715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Martin Eker{\\aa}","submitted_at":"2019-05-23T16:09:46Z","abstract_excerpt":"We significantly reduce the cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Niu 1996, Zalka 2006, Fowler 2012, Eker{\\aa}-H{\\aa}stad 2017, Eker{\\aa} 2017, Eker{\\aa} 2018, Gidney-Fowler 2019, Gidney 2019. We estimate the approximate cost of our construction using plausible physical assumptions for large-scale superconducting qubit platforms: a planar grid of qubits with nearest-neighbor connectivity, a characteristic physical gate error rate of $10^{-3}$, a surface code cycle time of 1 microseco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09749","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.09749/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1905.09749","created_at":"2026-07-05T02:33:45.749775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09749v3","created_at":"2026-07-05T02:33:45.749775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09749","created_at":"2026-07-05T02:33:45.749775+00:00"},{"alias_kind":"pith_short_12","alias_value":"QY7KEQYYLXKK","created_at":"2026-07-05T02:33:45.749775+00:00"},{"alias_kind":"pith_short_16","alias_value":"QY7KEQYYLXKKFUSC","created_at":"2026-07-05T02:33:45.749775+00:00"},{"alias_kind":"pith_short_8","alias_value":"QY7KEQYY","created_at":"2026-07-05T02:33:45.749775+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28518","citing_title":"Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2404.10659","citing_title":"Cybersecurity in the Quantum Era: Assessing the Impact of Quantum Computing on Infrastructure","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2410.01252","citing_title":"Resource-efficient equivariant quantum convolutional neural networks","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2411.01880","citing_title":"Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12149","citing_title":"Zeno-Enhanced Probabilistic Error Cancellation with Quantum Error Detection Codes","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QY7KEQYYLXKKFUSCPDK5BV7FLL","json":"https://pith.science/pith/QY7KEQYYLXKKFUSCPDK5BV7FLL.json","graph_json":"https://pith.science/api/pith-number/QY7KEQYYLXKKFUSCPDK5BV7FLL/graph.json","events_json":"https://pith.science/api/pith-number/QY7KEQYYLXKKFUSCPDK5BV7FLL/events.json","paper":"https://pith.science/paper/QY7KEQYY"},"agent_actions":{"view_html":"https://pith.science/pith/QY7KEQYYLXKKFUSCPDK5BV7FLL","download_json":"https://pith.science/pith/QY7KEQYYLXKKFUSCPDK5BV7FLL.json","view_paper":"https://pith.science/paper/QY7KEQYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09749&json=true","fetch_graph":"https://pith.science/api/pith-number/QY7KEQYYLXKKFUSCPDK5BV7FLL/graph.json","fetch_events":"https://pith.science/api/pith-number/QY7KEQYYLXKKFUSCPDK5BV7FLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QY7KEQYYLXKKFUSCPDK5BV7FLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QY7KEQYYLXKKFUSCPDK5BV7FLL/action/storage_attestation","attest_author":"https://pith.science/pith/QY7KEQYYLXKKFUSCPDK5BV7FLL/action/author_attestation","sign_citation":"https://pith.science/pith/QY7KEQYYLXKKFUSCPDK5BV7FLL/action/citation_signature","submit_replication":"https://pith.science/pith/QY7KEQYYLXKKFUSCPDK5BV7FLL/action/replication_record"}},"created_at":"2026-07-05T02:33:45.749775+00:00","updated_at":"2026-07-05T02:33:45.749775+00:00"}