{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4HGOKJ5AJDEV3UW3C72XITSXTO","short_pith_number":"pith:4HGOKJ5A","canonical_record":{"source":{"id":"1611.07995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-11-23T21:11:28Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"b0328afd95190bf8c23a9334412cb862a93ace66d8a70627a26577163e36ae51","abstract_canon_sha256":"4de9f1701a1d062db1fcf3a60a2ec03bd8419c15e06912e71da2782c69a2384b"},"schema_version":"1.0"},"canonical_sha256":"e1cce527a048c95dd2db17f5744e579b9d292f3aaf592e13ca79e296f4715119","source":{"kind":"arxiv","id":"1611.07995","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07995","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07995v2","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07995","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"4HGOKJ5AJDEV","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4HGOKJ5AJDEV3UW3","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4HGOKJ5A","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4HGOKJ5AJDEV3UW3C72XITSXTO","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-11-23T21:11:28Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"b0328afd95190bf8c23a9334412cb862a93ace66d8a70627a26577163e36ae51","abstract_canon_sha256":"4de9f1701a1d062db1fcf3a60a2ec03bd8419c15e06912e71da2782c69a2384b"},"schema_version":"1.0"},"canonical_sha256":"e1cce527a048c95dd2db17f5744e579b9d292f3aaf592e13ca79e296f4715119","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:18.189269Z","signature_b64":"nCrNHH0KGvJRV3/HwvmCjvlMyYtq6rKWOQGiQyZi5NVFXvbOrGf4BFCVd2n9I98OYuh1Wx/WfRvFJoRvMEcKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1cce527a048c95dd2db17f5744e579b9d292f3aaf592e13ca79e296f4715119","last_reissued_at":"2026-05-18T00:43:18.188617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:18.188617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07995","source_version":2,"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-18T00:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWRxaVgI6jgndbqgTAOSj0Ix/juK4fkhvnqbD83TRBb6PVII7Z200bWHjOLTaKLMcasFKNgeht1UM2HD+yOqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:09:35.814504Z"},"content_sha256":"db33f25b77ee3f7d17cf8e58628c38a35bb2da57d933e651f5cd3b91f0cb8b4c","schema_version":"1.0","event_id":"sha256:db33f25b77ee3f7d17cf8e58628c38a35bb2da57d933e651f5cd3b91f0cb8b4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4HGOKJ5AJDEV3UW3C72XITSXTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factoring using 2n+2 qubits with Toffoli based modular multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Krysta M. Svore, Martin Roetteler, Thomas H\\\"aner","submitted_at":"2016-11-23T21:11:28Z","abstract_excerpt":"We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast to previous space-optimized implementations, ours features a purely Toffoli based modular multiplication circuit. The circuit depth and the overall gate count are in O(n^3) and O(n^3 log(n)), respectively. We thus achieve the same space and time costs as Takahashi et al., while using a purely classical modular multiplication circuit. As a consequence, our approach evades most of the cost overheads originating from rotation synthesis and enables testing and localization of faul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07995","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":""},"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-05-18T00:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jy2a9ykkyRwMPIaG0VMPzY2wuKOcvEnJuKbMjgdO0PLCmUJCYILNDUECZLtadkeQBQdqspwAIPJZRXtpYGoACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:09:35.814850Z"},"content_sha256":"3292ee222df4a1f1682263c4cc528d6373c14f76b407a05cc29dd80aafa02b41","schema_version":"1.0","event_id":"sha256:3292ee222df4a1f1682263c4cc528d6373c14f76b407a05cc29dd80aafa02b41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/bundle.json","state_url":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/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-31T02:09:35Z","links":{"resolver":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO","bundle":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/bundle.json","state":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4HGOKJ5AJDEV3UW3C72XITSXTO","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":"4de9f1701a1d062db1fcf3a60a2ec03bd8419c15e06912e71da2782c69a2384b","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-11-23T21:11:28Z","title_canon_sha256":"b0328afd95190bf8c23a9334412cb862a93ace66d8a70627a26577163e36ae51"},"schema_version":"1.0","source":{"id":"1611.07995","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07995","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07995v2","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07995","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"4HGOKJ5AJDEV","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4HGOKJ5AJDEV3UW3","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4HGOKJ5A","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:3292ee222df4a1f1682263c4cc528d6373c14f76b407a05cc29dd80aafa02b41","target":"graph","created_at":"2026-05-18T00:43:18Z","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"},"paper":{"abstract_excerpt":"We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast to previous space-optimized implementations, ours features a purely Toffoli based modular multiplication circuit. The circuit depth and the overall gate count are in O(n^3) and O(n^3 log(n)), respectively. We thus achieve the same space and time costs as Takahashi et al., while using a purely classical modular multiplication circuit. As a consequence, our approach evades most of the cost overheads originating from rotation synthesis and enables testing and localization of faul","authors_text":"Krysta M. Svore, Martin Roetteler, Thomas H\\\"aner","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-11-23T21:11:28Z","title":"Factoring using 2n+2 qubits with Toffoli based modular multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07995","kind":"arxiv","version":2},"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:db33f25b77ee3f7d17cf8e58628c38a35bb2da57d933e651f5cd3b91f0cb8b4c","target":"record","created_at":"2026-05-18T00:43:18Z","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":"4de9f1701a1d062db1fcf3a60a2ec03bd8419c15e06912e71da2782c69a2384b","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-11-23T21:11:28Z","title_canon_sha256":"b0328afd95190bf8c23a9334412cb862a93ace66d8a70627a26577163e36ae51"},"schema_version":"1.0","source":{"id":"1611.07995","kind":"arxiv","version":2}},"canonical_sha256":"e1cce527a048c95dd2db17f5744e579b9d292f3aaf592e13ca79e296f4715119","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1cce527a048c95dd2db17f5744e579b9d292f3aaf592e13ca79e296f4715119","first_computed_at":"2026-05-18T00:43:18.188617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:18.188617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nCrNHH0KGvJRV3/HwvmCjvlMyYtq6rKWOQGiQyZi5NVFXvbOrGf4BFCVd2n9I98OYuh1Wx/WfRvFJoRvMEcKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:18.189269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07995","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db33f25b77ee3f7d17cf8e58628c38a35bb2da57d933e651f5cd3b91f0cb8b4c","sha256:3292ee222df4a1f1682263c4cc528d6373c14f76b407a05cc29dd80aafa02b41"],"state_sha256":"95653c4b8d9636803d70ff50dea3da6e153adf6e11fbaf3d74e1cb5da6263ac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9bALftAdLCR9OT0p8MjAmjUq4SiYx/Z5i+U6NSY+dAebehZt/uB3zpPGUpHp8GPei25u5t69uOyDmM4EJB0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:09:35.816800Z","bundle_sha256":"896ec7de444c71d6639bb4b49cdcb2632bed999d74e89eeeb2cce959ad2ab7f4"}}