{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:A37DRYO5GV5ONAHELLEJFYRA6N","short_pith_number":"pith:A37DRYO5","canonical_record":{"source":{"id":"1207.0511","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-02T20:06:12Z","cross_cats_sorted":[],"title_canon_sha256":"f7081ed2d94a3c777ead549a7df04daffcbc4e87f3a6143e6f60c5a1dbdd5195","abstract_canon_sha256":"26ef81c37c1b10bbece68f0828a8b6fb743980c7b9e8b8ccf1d468b7e070f99b"},"schema_version":"1.0"},"canonical_sha256":"06fe38e1dd357ae680e45ac892e220f36553403234203fc9a829eb2108344b4c","source":{"kind":"arxiv","id":"1207.0511","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0511","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0511v5","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0511","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"A37DRYO5GV5O","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A37DRYO5GV5ONAHE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A37DRYO5","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:A37DRYO5GV5ONAHELLEJFYRA6N","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0511","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-02T20:06:12Z","cross_cats_sorted":[],"title_canon_sha256":"f7081ed2d94a3c777ead549a7df04daffcbc4e87f3a6143e6f60c5a1dbdd5195","abstract_canon_sha256":"26ef81c37c1b10bbece68f0828a8b6fb743980c7b9e8b8ccf1d468b7e070f99b"},"schema_version":"1.0"},"canonical_sha256":"06fe38e1dd357ae680e45ac892e220f36553403234203fc9a829eb2108344b4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:14.559887Z","signature_b64":"aSl50226fcjtcoFTB3Cn9tv6XMj6HVfQjNhIE91/5lUSSi3q/aVt9Vao9xDInXxGCJ+hTRhc57Qgfi+NfOU9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06fe38e1dd357ae680e45ac892e220f36553403234203fc9a829eb2108344b4c","last_reissued_at":"2026-05-18T03:08:14.559403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:14.559403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0511","source_version":5,"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-18T03:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AGAtDsXvPNfayfjE+BM9CEUzrT8E+Ki/gt4eLzPNoaDUk8OKuzpe8VAWyDEWyQcAwjdlpBMLoT/4XSc7wEDhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:06:37.725389Z"},"content_sha256":"7a9c7b43fe626e0fee68276fc0f0edffa5d56fc851efdd07b421ab44dc54c673","schema_version":"1.0","event_id":"sha256:7a9c7b43fe626e0fee68276fc0f0edffa5d56fc851efdd07b421ab44dc54c673"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:A37DRYO5GV5ONAHELLEJFYRA6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Quantum Modular Exponentiation Architecture for Shor's Factorization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Archimedes Pavlidis, Dimitris Gizopoulos","submitted_at":"2012-07-02T20:06:12Z","abstract_excerpt":"We present a novel and efficient in terms of circuit depth design for Shor's quantum factorization algorithm. The circuit effectively utilizes a diverse set of adders based on the quantum Fourier transform (QFT) Draper's adders to build more complex arithmetic blocks: quantum multiplier/accumulators by constants and quantum dividers by constants. These arithmetic blocks are effectively architected into a generic modular quantum multiplier which is the fundamental block for modular exponentiation circuit, the most computational intensive part of Shor's algorithm. The proposed modular exponentia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0511","kind":"arxiv","version":5},"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-18T03:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BvF0m0AWv/a7tJZeSKYwwqQIM5YKjoSJqtIrGYmXjc4L8J2DxQerALKwBGJMzsVKzEeMJVOSEoc9B4qwOXxEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:06:37.726106Z"},"content_sha256":"613cae455397c4186e19f73fee95f0393fa0726705ade3b16a7cce16b968cdf2","schema_version":"1.0","event_id":"sha256:613cae455397c4186e19f73fee95f0393fa0726705ade3b16a7cce16b968cdf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N/bundle.json","state_url":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A37DRYO5GV5ONAHELLEJFYRA6N/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-26T20:06:37Z","links":{"resolver":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N","bundle":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N/bundle.json","state":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A37DRYO5GV5ONAHELLEJFYRA6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:A37DRYO5GV5ONAHELLEJFYRA6N","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":"26ef81c37c1b10bbece68f0828a8b6fb743980c7b9e8b8ccf1d468b7e070f99b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-02T20:06:12Z","title_canon_sha256":"f7081ed2d94a3c777ead549a7df04daffcbc4e87f3a6143e6f60c5a1dbdd5195"},"schema_version":"1.0","source":{"id":"1207.0511","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0511","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0511v5","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0511","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"A37DRYO5GV5O","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A37DRYO5GV5ONAHE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A37DRYO5","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:613cae455397c4186e19f73fee95f0393fa0726705ade3b16a7cce16b968cdf2","target":"graph","created_at":"2026-05-18T03:08:14Z","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 present a novel and efficient in terms of circuit depth design for Shor's quantum factorization algorithm. The circuit effectively utilizes a diverse set of adders based on the quantum Fourier transform (QFT) Draper's adders to build more complex arithmetic blocks: quantum multiplier/accumulators by constants and quantum dividers by constants. These arithmetic blocks are effectively architected into a generic modular quantum multiplier which is the fundamental block for modular exponentiation circuit, the most computational intensive part of Shor's algorithm. The proposed modular exponentia","authors_text":"Archimedes Pavlidis, Dimitris Gizopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-02T20:06:12Z","title":"Fast Quantum Modular Exponentiation Architecture for Shor's Factorization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0511","kind":"arxiv","version":5},"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:7a9c7b43fe626e0fee68276fc0f0edffa5d56fc851efdd07b421ab44dc54c673","target":"record","created_at":"2026-05-18T03:08:14Z","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":"26ef81c37c1b10bbece68f0828a8b6fb743980c7b9e8b8ccf1d468b7e070f99b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-02T20:06:12Z","title_canon_sha256":"f7081ed2d94a3c777ead549a7df04daffcbc4e87f3a6143e6f60c5a1dbdd5195"},"schema_version":"1.0","source":{"id":"1207.0511","kind":"arxiv","version":5}},"canonical_sha256":"06fe38e1dd357ae680e45ac892e220f36553403234203fc9a829eb2108344b4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06fe38e1dd357ae680e45ac892e220f36553403234203fc9a829eb2108344b4c","first_computed_at":"2026-05-18T03:08:14.559403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:14.559403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aSl50226fcjtcoFTB3Cn9tv6XMj6HVfQjNhIE91/5lUSSi3q/aVt9Vao9xDInXxGCJ+hTRhc57Qgfi+NfOU9BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:14.559887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0511","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a9c7b43fe626e0fee68276fc0f0edffa5d56fc851efdd07b421ab44dc54c673","sha256:613cae455397c4186e19f73fee95f0393fa0726705ade3b16a7cce16b968cdf2"],"state_sha256":"a60f3a84401bc3353cd57e4690115809aa2395cd2fa3b0a7b8d124faf60f57d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLiU87RcjVo6a/DpLFzcJD+/E26bfNzzg4H0TITrMmjaKL1GzpFUjG2+S+5b16vyZYQxTtdBWC1322h6nksSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:06:37.729842Z","bundle_sha256":"2a3ff6e8744f89d5caa8fe5dd8a21793d6e6e637077e5e03a8491924e677ae78"}}