{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FK6VMUM5DG4ODQJ2HTUYECEDNC","short_pith_number":"pith:FK6VMUM5","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"},"canonical_sha256":"2abd56519d19b8e1c13a3ce9820883688fddc814952f68b68cb6e55e501f6665","source":{"kind":"arxiv","id":"2308.06572","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.06572","created_at":"2026-07-05T07:30:52Z"},{"alias_kind":"arxiv_version","alias_value":"2308.06572v3","created_at":"2026-07-05T07:30:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06572","created_at":"2026-07-05T07:30:52Z"},{"alias_kind":"pith_short_12","alias_value":"FK6VMUM5DG4O","created_at":"2026-07-05T07:30:52Z"},{"alias_kind":"pith_short_16","alias_value":"FK6VMUM5DG4ODQJ2","created_at":"2026-07-05T07:30:52Z"},{"alias_kind":"pith_short_8","alias_value":"FK6VMUM5","created_at":"2026-07-05T07:30:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FK6VMUM5DG4ODQJ2HTUYECEDNC","target":"record","payload":{"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"},"canonical_sha256":"2abd56519d19b8e1c13a3ce9820883688fddc814952f68b68cb6e55e501f6665","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"},"source_kind":"arxiv","source_id":"2308.06572","source_version":3,"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-07-05T07:30:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQtqZ/yDf5lPGY50hLnOsbenGR+Z2BQZPs9uf2iIDU945cmC4yDAk3mr9xyE6IDFiiZC0NCa0YOXMyLA6e7WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:40:25.356058Z"},"content_sha256":"f7e9a1ff00bd311fcebbd8ef4a5265cf982e10526858d8247409f653f5b42584","schema_version":"1.0","event_id":"sha256:f7e9a1ff00bd311fcebbd8ef4a5265cf982e10526858d8247409f653f5b42584"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FK6VMUM5DG4ODQJ2HTUYECEDNC","target":"graph","payload":{"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"},"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-07-05T07:30:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grgCItuyYOXFzESaAeCfBjVLKDkeqAt/UHnURBHyfG11T7L/E/kspbRA2Uk8BcxB+AEDJBCVIvoCJLZY4ygfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:40:25.356584Z"},"content_sha256":"35dcca73a0ba75d467b0412d227c88616982ed398fece540f508583556b59045","schema_version":"1.0","event_id":"sha256:35dcca73a0ba75d467b0412d227c88616982ed398fece540f508583556b59045"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/bundle.json","state_url":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/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-08-10T10:40:25Z","links":{"resolver":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC","bundle":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/bundle.json","state":"https://pith.science/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FK6VMUM5DG4ODQJ2HTUYECEDNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FK6VMUM5DG4ODQJ2HTUYECEDNC","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":"aaf9f56868a571e038176331800cf383b2ca77b0085400affc22465ef919d119","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-12T13:57:38Z","title_canon_sha256":"204c6ca3f33e5f9bb0ec8cce2cfee23d90803c1f59a51f055e6c530f72cdc5a0"},"schema_version":"1.0","source":{"id":"2308.06572","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.06572","created_at":"2026-07-05T07:30:52Z"},{"alias_kind":"arxiv_version","alias_value":"2308.06572v3","created_at":"2026-07-05T07:30:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06572","created_at":"2026-07-05T07:30:52Z"},{"alias_kind":"pith_short_12","alias_value":"FK6VMUM5DG4O","created_at":"2026-07-05T07:30:52Z"},{"alias_kind":"pith_short_16","alias_value":"FK6VMUM5DG4ODQJ2","created_at":"2026-07-05T07:30:52Z"},{"alias_kind":"pith_short_8","alias_value":"FK6VMUM5","created_at":"2026-07-05T07:30:52Z"}],"graph_snapshots":[{"event_id":"sha256:35dcca73a0ba75d467b0412d227c88616982ed398fece540f508583556b59045","target":"graph","created_at":"2026-07-05T07:30:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.06572/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Oded Regev","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-12T13:57:38Z","title":"An Efficient Quantum Factoring Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06572","kind":"arxiv","version":3},"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:f7e9a1ff00bd311fcebbd8ef4a5265cf982e10526858d8247409f653f5b42584","target":"record","created_at":"2026-07-05T07:30:52Z","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":"aaf9f56868a571e038176331800cf383b2ca77b0085400affc22465ef919d119","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-12T13:57:38Z","title_canon_sha256":"204c6ca3f33e5f9bb0ec8cce2cfee23d90803c1f59a51f055e6c530f72cdc5a0"},"schema_version":"1.0","source":{"id":"2308.06572","kind":"arxiv","version":3}},"canonical_sha256":"2abd56519d19b8e1c13a3ce9820883688fddc814952f68b68cb6e55e501f6665","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2abd56519d19b8e1c13a3ce9820883688fddc814952f68b68cb6e55e501f6665","first_computed_at":"2026-07-05T07:30:52.218881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:30:52.218881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UuqJuaE6FLnErGwj520L8ZJXit7+zzZdKZR3uub6W8H9enoKVIEWigw+kd70ufKay77CbPftOkppuetnVJ/aBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:30:52.219290Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.06572","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7e9a1ff00bd311fcebbd8ef4a5265cf982e10526858d8247409f653f5b42584","sha256:35dcca73a0ba75d467b0412d227c88616982ed398fece540f508583556b59045"],"state_sha256":"3360dec41c66e8e5a9d1bf9b3f35d93e0bcdb767263591f8f794d1d4aa82f74d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16MuvC7v3aN/TFSeWVzZ6OolNZp6ryaHOnmGRYNzHg6fMBI4RPgzmhINETdzwA1yDFAZ4+PqIjUS0Ns1vP+1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T10:40:25.362111Z","bundle_sha256":"d3502d4df5d2c2796ab98b48675d066462aafd75011ea58c492e063674d339a9"}}