{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JZRJODVNWIUDGCBZKQEPYXJ43F","short_pith_number":"pith:JZRJODVN","schema_version":"1.0","canonical_sha256":"4e62970eadb2283308395408fc5d3cd96f80d2330c7c758d374e156456ba1eae","source":{"kind":"arxiv","id":"2307.09651","version":2},"attestation_state":"computed","paper":{"title":"A comment on \"Factoring integers with sublinear resources on a superconducting quantum processor\"","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Noureldin Yosri, Tanuj Khattar","submitted_at":"2023-07-18T21:46:54Z","abstract_excerpt":"Quantum computing has the potential to revolutionize cryptography by breaking classical public-key cryptography schemes, such as RSA and Diffie-Hellman. However, breaking the widely used 2048-bit RSA using Shor's quantum factoring algorithm is expected to require millions of noisy physical qubits and is well beyond the capabilities of present day quantum computers. A recent proposal by Yan et. al. tries to improve the widely debated Schnorr's lattice-based integer factorization algorithm using a quantum optimizer (QAOA), and further claim that one can break RSA 2048 using only 372 qubits. In t"},"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":"2307.09651","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-07-18T21:46:54Z","cross_cats_sorted":[],"title_canon_sha256":"011e2ebf7d69ac23c47d26a35cf57117a0cf7f71d4af8822adfbce030202ff71","abstract_canon_sha256":"8b605bfc4047e1cb5759ad05df75cb0fdaca1aeda30a117c23a1cf7d31a845c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:22.491107Z","signature_b64":"TjEeTp996IZ+zlmdje5Bb5REEzJI9k+N876WGHoVxybIBzUhwjrp1CVabNaHjy2aNdrzkOIDQ6oI54XEUg5HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e62970eadb2283308395408fc5d3cd96f80d2330c7c758d374e156456ba1eae","last_reissued_at":"2026-07-05T06:33:22.490672Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:22.490672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A comment on \"Factoring integers with sublinear resources on a superconducting quantum processor\"","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Noureldin Yosri, Tanuj Khattar","submitted_at":"2023-07-18T21:46:54Z","abstract_excerpt":"Quantum computing has the potential to revolutionize cryptography by breaking classical public-key cryptography schemes, such as RSA and Diffie-Hellman. However, breaking the widely used 2048-bit RSA using Shor's quantum factoring algorithm is expected to require millions of noisy physical qubits and is well beyond the capabilities of present day quantum computers. A recent proposal by Yan et. al. tries to improve the widely debated Schnorr's lattice-based integer factorization algorithm using a quantum optimizer (QAOA), and further claim that one can break RSA 2048 using only 372 qubits. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.09651","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.09651/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":"2307.09651","created_at":"2026-07-05T06:33:22.490741+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.09651v2","created_at":"2026-07-05T06:33:22.490741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.09651","created_at":"2026-07-05T06:33:22.490741+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZRJODVNWIUD","created_at":"2026-07-05T06:33:22.490741+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZRJODVNWIUDGCBZ","created_at":"2026-07-05T06:33:22.490741+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZRJODVN","created_at":"2026-07-05T06:33:22.490741+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2312.10054","citing_title":"Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JZRJODVNWIUDGCBZKQEPYXJ43F","json":"https://pith.science/pith/JZRJODVNWIUDGCBZKQEPYXJ43F.json","graph_json":"https://pith.science/api/pith-number/JZRJODVNWIUDGCBZKQEPYXJ43F/graph.json","events_json":"https://pith.science/api/pith-number/JZRJODVNWIUDGCBZKQEPYXJ43F/events.json","paper":"https://pith.science/paper/JZRJODVN"},"agent_actions":{"view_html":"https://pith.science/pith/JZRJODVNWIUDGCBZKQEPYXJ43F","download_json":"https://pith.science/pith/JZRJODVNWIUDGCBZKQEPYXJ43F.json","view_paper":"https://pith.science/paper/JZRJODVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.09651&json=true","fetch_graph":"https://pith.science/api/pith-number/JZRJODVNWIUDGCBZKQEPYXJ43F/graph.json","fetch_events":"https://pith.science/api/pith-number/JZRJODVNWIUDGCBZKQEPYXJ43F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZRJODVNWIUDGCBZKQEPYXJ43F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZRJODVNWIUDGCBZKQEPYXJ43F/action/storage_attestation","attest_author":"https://pith.science/pith/JZRJODVNWIUDGCBZKQEPYXJ43F/action/author_attestation","sign_citation":"https://pith.science/pith/JZRJODVNWIUDGCBZKQEPYXJ43F/action/citation_signature","submit_replication":"https://pith.science/pith/JZRJODVNWIUDGCBZKQEPYXJ43F/action/replication_record"}},"created_at":"2026-07-05T06:33:22.490741+00:00","updated_at":"2026-07-05T06:33:22.490741+00:00"}