{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:A37DRYO5GV5ONAHELLEJFYRA6N","short_pith_number":"pith:A37DRYO5","schema_version":"1.0","canonical_sha256":"06fe38e1dd357ae680e45ac892e220f36553403234203fc9a829eb2108344b4c","source":{"kind":"arxiv","id":"1207.0511","version":5},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.0511","created_at":"2026-05-18T03:08:14.559479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0511v5","created_at":"2026-05-18T03:08:14.559479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0511","created_at":"2026-05-18T03:08:14.559479+00:00"},{"alias_kind":"pith_short_12","alias_value":"A37DRYO5GV5O","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"A37DRYO5GV5ONAHE","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"A37DRYO5","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2408.03085","citing_title":"Universal Matrix Multiplication on Quantum Computer","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N","json":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N.json","graph_json":"https://pith.science/api/pith-number/A37DRYO5GV5ONAHELLEJFYRA6N/graph.json","events_json":"https://pith.science/api/pith-number/A37DRYO5GV5ONAHELLEJFYRA6N/events.json","paper":"https://pith.science/paper/A37DRYO5"},"agent_actions":{"view_html":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N","download_json":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N.json","view_paper":"https://pith.science/paper/A37DRYO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0511&json=true","fetch_graph":"https://pith.science/api/pith-number/A37DRYO5GV5ONAHELLEJFYRA6N/graph.json","fetch_events":"https://pith.science/api/pith-number/A37DRYO5GV5ONAHELLEJFYRA6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N/action/storage_attestation","attest_author":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N/action/author_attestation","sign_citation":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N/action/citation_signature","submit_replication":"https://pith.science/pith/A37DRYO5GV5ONAHELLEJFYRA6N/action/replication_record"}},"created_at":"2026-05-18T03:08:14.559479+00:00","updated_at":"2026-05-18T03:08:14.559479+00:00"}