{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FK6VMUM5DG4ODQJ2HTUYECEDNC","short_pith_number":"pith:FK6VMUM5","schema_version":"1.0","canonical_sha256":"2abd56519d19b8e1c13a3ce9820883688fddc814952f68b68cb6e55e501f6665","source":{"kind":"arxiv","id":"2308.06572","version":3},"attestation_state":"computed","paper":{"title":"An Efficient Quantum Factoring Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Oded Regev","submitted_at":"2023-08-12T13:57:38Z","abstract_excerpt":"We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\\tilde{O}(n^{3/2})$ gates for $\\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm relies on a number-theoretic heuristic assumption reminiscent of those used in subexponential classical factorization algorithms. It is currently not clear if the algorithm can lead to improved physical implementations in practice."},"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":"2308.06572","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-12T13:57:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"204c6ca3f33e5f9bb0ec8cce2cfee23d90803c1f59a51f055e6c530f72cdc5a0","abstract_canon_sha256":"aaf9f56868a571e038176331800cf383b2ca77b0085400affc22465ef919d119"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:30:52.219290Z","signature_b64":"UuqJuaE6FLnErGwj520L8ZJXit7+zzZdKZR3uub6W8H9enoKVIEWigw+kd70ufKay77CbPftOkppuetnVJ/aBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2abd56519d19b8e1c13a3ce9820883688fddc814952f68b68cb6e55e501f6665","last_reissued_at":"2026-07-05T07:30:52.218881Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:30:52.218881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Quantum Factoring Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Oded Regev","submitted_at":"2023-08-12T13:57:38Z","abstract_excerpt":"We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\\tilde{O}(n^{3/2})$ gates for $\\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm relies on a number-theoretic heuristic assumption reminiscent of those used in subexponential classical factorization algorithms. It is currently not clear if the algorithm can lead to improved physical implementations in practice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06572","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/2308.06572/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":"2308.06572","created_at":"2026-07-05T07:30:52.218937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.06572v3","created_at":"2026-07-05T07:30:52.218937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06572","created_at":"2026-07-05T07:30:52.218937+00:00"},{"alias_kind":"pith_short_12","alias_value":"FK6VMUM5DG4O","created_at":"2026-07-05T07:30:52.218937+00:00"},{"alias_kind":"pith_short_16","alias_value":"FK6VMUM5DG4ODQJ2","created_at":"2026-07-05T07:30:52.218937+00:00"},{"alias_kind":"pith_short_8","alias_value":"FK6VMUM5","created_at":"2026-07-05T07:30:52.218937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17647","citing_title":"From Period Finding to Lattice Sampling: Experimental Insights into Shor's and Regev's Factoring Algorithms","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2312.10054","citing_title":"Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00026","citing_title":"The $\\gamma_c$-Peak: Covariant Recovery on Four Organic Qubit Platforms","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2603.25774","citing_title":"Catalytic Quantum Error Correction: Theory, Efficient Catalyst Preparation, and Numerical Benchmarks","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00026","citing_title":"The $\\gamma_c$-Peak: Covariant Recovery on Four Organic Qubit Platforms","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00026","citing_title":"The $\\gamma_c$-Peak: Covariant Recovery on Four Organic Qubit Platforms","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11857","citing_title":"Blind Catalytic Quantum Error Correction: Target-State Estimation and Fidelity Recovery Without A Priori Knowledge","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11857","citing_title":"Blind Catalytic Quantum Error Correction: Target-State Estimation and Fidelity Recovery Without A Priori Knowledge","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC","json":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC.json","graph_json":"https://pith.science/api/pith-number/FK6VMUM5DG4ODQJ2HTUYECEDNC/graph.json","events_json":"https://pith.science/api/pith-number/FK6VMUM5DG4ODQJ2HTUYECEDNC/events.json","paper":"https://pith.science/paper/FK6VMUM5"},"agent_actions":{"view_html":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC","download_json":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC.json","view_paper":"https://pith.science/paper/FK6VMUM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.06572&json=true","fetch_graph":"https://pith.science/api/pith-number/FK6VMUM5DG4ODQJ2HTUYECEDNC/graph.json","fetch_events":"https://pith.science/api/pith-number/FK6VMUM5DG4ODQJ2HTUYECEDNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/action/storage_attestation","attest_author":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/action/author_attestation","sign_citation":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/action/citation_signature","submit_replication":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/action/replication_record"}},"created_at":"2026-07-05T07:30:52.218937+00:00","updated_at":"2026-07-05T07:30:52.218937+00:00"}