{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:H3RLK6HQHILSJ7A77O5BS65DJM","short_pith_number":"pith:H3RLK6HQ","canonical_record":{"source":{"id":"2603.28627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-30T16:10:08Z","cross_cats_sorted":[],"title_canon_sha256":"0a7055d930073cdc885d5de7687ce443e79b6ed37211705fa0dbff525f459493","abstract_canon_sha256":"d076e27e5491f7e65d38a91711c91e851859e2b18ec18190b22fbc1b840b2179"},"schema_version":"1.0"},"canonical_sha256":"3ee2b578f03a1724fc1ffbba197ba34b3102eb1f9cfea40d9db9221273aba235","source":{"kind":"arxiv","id":"2603.28627","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.28627","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"arxiv_version","alias_value":"2603.28627v1","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.28627","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"pith_short_12","alias_value":"H3RLK6HQHILS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"H3RLK6HQHILSJ7A7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"H3RLK6HQ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:H3RLK6HQHILSJ7A77O5BS65DJM","target":"record","payload":{"canonical_record":{"source":{"id":"2603.28627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-30T16:10:08Z","cross_cats_sorted":[],"title_canon_sha256":"0a7055d930073cdc885d5de7687ce443e79b6ed37211705fa0dbff525f459493","abstract_canon_sha256":"d076e27e5491f7e65d38a91711c91e851859e2b18ec18190b22fbc1b840b2179"},"schema_version":"1.0"},"canonical_sha256":"3ee2b578f03a1724fc1ffbba197ba34b3102eb1f9cfea40d9db9221273aba235","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:49.102126Z","signature_b64":"KSZNHjNmPbuJj21+3SeEgNlGT//wQ9fsFvM8BnHAc1doRpTVvxUY7RrGqD3VPtvB8b3x3ai1Yo9xvGwO3fwcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ee2b578f03a1724fc1ffbba197ba34b3102eb1f9cfea40d9db9221273aba235","last_reissued_at":"2026-05-17T23:38:49.101567Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:49.101567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.28627","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-17T23:38:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ox6eElVI3YnNeA9TET4k4udTNh5947/i7a3+vraI7cYl+gas9kllSnexK04geM07Z8H6thVrWIjKyUpMjaokDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:44:25.219573Z"},"content_sha256":"f26212a1f26eb56409f623561e8e1929947d33fcbecad25099c270bcdac90c21","schema_version":"1.0","event_id":"sha256:f26212a1f26eb56409f623561e8e1929947d33fcbecad25099c270bcdac90c21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:H3RLK6HQHILSJ7A77O5BS65DJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dolev Bluvstein, Harry Levine, Hsin-Yuan Huang, John Preskill, Lewis R. B. Picard, Madelyn Cain, Manuel Endres, Qian Xu, Robbie King","submitted_at":"2026-03-30T16:10:08Z","abstract_excerpt":"Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance and practical relevance to cryptography. However, due to the high overhead of quantum error correction, optimized resource estimates for cryptographically relevant instances of Shor's algorithm require millions of physical qubits. Here, by leveraging advances in high-rate quantum error-correcting codes, efficient logical instruction sets, and circuit design, "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The performance and overhead of the high-rate quantum error-correcting codes, together with the assumption that neutral-atom hardware can achieve universal fault-tolerant operations below the error-correction threshold at the required scale and reconfigurability.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"84d83adea245091fb137bfc604525958d0c86b8aae422906c90bb9d494234fb2"},"source":{"id":"2603.28627","kind":"arxiv","version":1},"verdict":{"id":"cc7d43f6-f75c-4108-b956-37aa0c63b5be","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T04:29:40.755782Z","strongest_claim":"we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","one_line_summary":"Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The performance and overhead of the high-rate quantum error-correcting codes, together with the assumption that neutral-atom hardware can achieve universal fault-tolerant operations below the error-correction threshold at the required scale and reconfigurability.","pith_extraction_headline":"Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits."},"references":{"count":86,"sample":[{"doi":"","year":2023,"title":"Kubica, A.et al.Erasure qubits: Overcoming theT 1 limit in superconducting circuits.Phys. Rev. X13, 041022 (2023)","work_id":"7a264430-3b89-48ec-b09d-b987608c664d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Taming Rydberg Decay with Measurement-based Quantum Computation","work_id":"3e59e5af-f445-434e-b31b-eb2d5b6db5dc","ref_index":2,"cited_arxiv_id":"2411.04664","is_internal_anchor":true},{"doi":"","year":2024,"title":"arXiv:2408.00842 [quant-ph]","work_id":"3737eb18-65cf-428a-8b39-1d5761a26d95","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Perrin, H., Jandura, S. & Pupillo, G. Quantum error correction resilient against atom loss (2025). arXiv:2412.07841 [quant-ph]","work_id":"b1173af5-d20e-49a3-a01b-470c5dacd440","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"arXiv:2502.20558 [quant-ph]","work_id":"069f4e20-0e7c-49dc-b182-af687085c438","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":86,"snapshot_sha256":"0554c028438a9ff7bd5df3bebc925f3162403b3dda08f259ae7b4604c0f5da2c","internal_anchors":4},"formal_canon":{"evidence_count":2,"snapshot_sha256":"275030b7691bd4f2771c050b901ae9cb93b56669dc14095374bb7af348a09180"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"cc7d43f6-f75c-4108-b956-37aa0c63b5be"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCwI928Wp/6kYeMNv1goiXEGDo1KTRnkM66jRkMyWpzp7Mxtu2IifVKbHAY9ycdiP19TK2GB0etePlzL3z55CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:44:25.220364Z"},"content_sha256":"57cc348adbe581d0809dfd54742bd56895a9478fcb7eb3d15f16307e9961f3ac","schema_version":"1.0","event_id":"sha256:57cc348adbe581d0809dfd54742bd56895a9478fcb7eb3d15f16307e9961f3ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM/bundle.json","state_url":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3RLK6HQHILSJ7A77O5BS65DJM/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-26T16:44:25Z","links":{"resolver":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM","bundle":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM/bundle.json","state":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3RLK6HQHILSJ7A77O5BS65DJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:H3RLK6HQHILSJ7A77O5BS65DJM","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":"d076e27e5491f7e65d38a91711c91e851859e2b18ec18190b22fbc1b840b2179","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-30T16:10:08Z","title_canon_sha256":"0a7055d930073cdc885d5de7687ce443e79b6ed37211705fa0dbff525f459493"},"schema_version":"1.0","source":{"id":"2603.28627","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.28627","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"arxiv_version","alias_value":"2603.28627v1","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.28627","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"pith_short_12","alias_value":"H3RLK6HQHILS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"H3RLK6HQHILSJ7A7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"H3RLK6HQ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:57cc348adbe581d0809dfd54742bd56895a9478fcb7eb3d15f16307e9961f3ac","target":"graph","created_at":"2026-05-17T23:38:49Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The performance and overhead of the high-rate quantum error-correcting codes, together with the assumption that neutral-atom hardware can achieve universal fault-tolerant operations below the error-correction threshold at the required scale and reconfigurability."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits."}],"snapshot_sha256":"84d83adea245091fb137bfc604525958d0c86b8aae422906c90bb9d494234fb2"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"275030b7691bd4f2771c050b901ae9cb93b56669dc14095374bb7af348a09180"},"paper":{"abstract_excerpt":"Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance and practical relevance to cryptography. However, due to the high overhead of quantum error correction, optimized resource estimates for cryptographically relevant instances of Shor's algorithm require millions of physical qubits. Here, by leveraging advances in high-rate quantum error-correcting codes, efficient logical instruction sets, and circuit design, ","authors_text":"Dolev Bluvstein, Harry Levine, Hsin-Yuan Huang, John Preskill, Lewis R. B. Picard, Madelyn Cain, Manuel Endres, Qian Xu, Robbie King","cross_cats":[],"headline":"Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-30T16:10:08Z","title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits"},"references":{"count":86,"internal_anchors":4,"resolved_work":86,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Kubica, A.et al.Erasure qubits: Overcoming theT 1 limit in superconducting circuits.Phys. Rev. X13, 041022 (2023)","work_id":"7a264430-3b89-48ec-b09d-b987608c664d","year":2023},{"cited_arxiv_id":"2411.04664","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Taming Rydberg Decay with Measurement-based Quantum Computation","work_id":"3e59e5af-f445-434e-b31b-eb2d5b6db5dc","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"arXiv:2408.00842 [quant-ph]","work_id":"3737eb18-65cf-428a-8b39-1d5761a26d95","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Perrin, H., Jandura, S. & Pupillo, G. Quantum error correction resilient against atom loss (2025). arXiv:2412.07841 [quant-ph]","work_id":"b1173af5-d20e-49a3-a01b-470c5dacd440","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"arXiv:2502.20558 [quant-ph]","work_id":"069f4e20-0e7c-49dc-b182-af687085c438","year":2025}],"snapshot_sha256":"0554c028438a9ff7bd5df3bebc925f3162403b3dda08f259ae7b4604c0f5da2c"},"source":{"id":"2603.28627","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-16T04:29:40.755782Z","id":"cc7d43f6-f75c-4108-b956-37aa0c63b5be","model_set":{"reader":"grok-4.3"},"one_line_summary":"Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","strongest_claim":"we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","weakest_assumption":"The performance and overhead of the high-rate quantum error-correcting codes, together with the assumption that neutral-atom hardware can achieve universal fault-tolerant operations below the error-correction threshold at the required scale and reconfigurability."}},"verdict_id":"cc7d43f6-f75c-4108-b956-37aa0c63b5be"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f26212a1f26eb56409f623561e8e1929947d33fcbecad25099c270bcdac90c21","target":"record","created_at":"2026-05-17T23:38:49Z","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":"d076e27e5491f7e65d38a91711c91e851859e2b18ec18190b22fbc1b840b2179","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-30T16:10:08Z","title_canon_sha256":"0a7055d930073cdc885d5de7687ce443e79b6ed37211705fa0dbff525f459493"},"schema_version":"1.0","source":{"id":"2603.28627","kind":"arxiv","version":1}},"canonical_sha256":"3ee2b578f03a1724fc1ffbba197ba34b3102eb1f9cfea40d9db9221273aba235","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ee2b578f03a1724fc1ffbba197ba34b3102eb1f9cfea40d9db9221273aba235","first_computed_at":"2026-05-17T23:38:49.101567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:49.101567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KSZNHjNmPbuJj21+3SeEgNlGT//wQ9fsFvM8BnHAc1doRpTVvxUY7RrGqD3VPtvB8b3x3ai1Yo9xvGwO3fwcDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:49.102126Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.28627","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f26212a1f26eb56409f623561e8e1929947d33fcbecad25099c270bcdac90c21","sha256:57cc348adbe581d0809dfd54742bd56895a9478fcb7eb3d15f16307e9961f3ac"],"state_sha256":"92220af9f2b796ed0ca0976856fec3b9cd8ca0da08e12db155ca924b3f6cf94d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6rP+nkw11v0y3E7/8s3YRGlkQ8113Th3u5klOkfMQNssHUvDNRekOYKvZrR9Cml+8f4zkqh4uxAf8caLBP0yDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:44:25.223446Z","bundle_sha256":"a3e1fdf42f406f0387eb34e38746fea6cb4fb8fa11d218e270213ce09a967dfb"}}