{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AEZV73KGVJIGQ6N3SNE2ETDJI4","short_pith_number":"pith:AEZV73KG","canonical_record":{"source":{"id":"1202.6614","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2012-02-29T17:23:42Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"e483a72184b0641252550866594184f14674434d05c0b25188e0015a85ddb29b","abstract_canon_sha256":"4e310fbc7f0275f994060eae2e9710dca2bcd6f6ec76b22436350025f1343a55"},"schema_version":"1.0"},"canonical_sha256":"01335fed46aa506879bb9349a24c69473b2f024832b9d47b4d6397899c4bd898","source":{"kind":"arxiv","id":"1202.6614","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6614","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6614v3","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6614","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"AEZV73KGVJIG","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AEZV73KGVJIGQ6N3","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AEZV73KG","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AEZV73KGVJIGQ6N3SNE2ETDJI4","target":"record","payload":{"canonical_record":{"source":{"id":"1202.6614","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2012-02-29T17:23:42Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"e483a72184b0641252550866594184f14674434d05c0b25188e0015a85ddb29b","abstract_canon_sha256":"4e310fbc7f0275f994060eae2e9710dca2bcd6f6ec76b22436350025f1343a55"},"schema_version":"1.0"},"canonical_sha256":"01335fed46aa506879bb9349a24c69473b2f024832b9d47b4d6397899c4bd898","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:42.828615Z","signature_b64":"rp0e1XtCCejdQq3zRXG8eQ7XgwBmtMtgq9LmXBJPmiByMZGwo+Pwx6tzFL+IXAm/Yir04M1425kbZL9jjmvHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01335fed46aa506879bb9349a24c69473b2f024832b9d47b4d6397899c4bd898","last_reissued_at":"2026-05-18T02:19:42.828170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:42.828170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.6614","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-05-18T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x90HLoOl4ir3iOiSBRkwRuTmcwA3TKvQd5CB59nZAvEB5HXtJ5tsVkt1tvdOv3dfDKkRqSc5AmDa0JvjfnEmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:15:40.897393Z"},"content_sha256":"aa149021b791890195a1a2a8e39c9399382a8d3d8df8f099b1d45ddb549dc1c3","schema_version":"1.0","event_id":"sha256:aa149021b791890195a1a2a8e39c9399382a8d3d8df8f099b1d45ddb549dc1c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AEZV73KGVJIGQ6N3SNE2ETDJI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constant-Optimized Quantum Circuits for Modular Multiplication and Exponentiation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Igor L. Markov, Mehdi Saeedi","submitted_at":"2012-02-29T17:23:42Z","abstract_excerpt":"Reversible circuits for modular multiplication $Cx$%$M$ with $x<M$ arise as components of modular exponentiation in Shor's quantum number-factoring algorithm. However, existing generic constructions focus on asymptotic gate count and circuit depth rather than actual values, producing fairly large circuits not optimized for specific $C$ and $M$ values. In this work, we develop such optimizations in a bottom-up fashion, starting with most convenient $C$ values. When zero-initialized ancilla registers are available, we reduce the search for compact circuits to a shortest-path problem. Some of our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6614","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":""},"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-18T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QlHaRvQcYxDMrZg1PTfvm/ezuO+6MuA3YwXgmNSgdO0dLiAociqY8ZNr8FWfSXOgLbiM0IZMShYA31VsN4ybAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:15:40.897772Z"},"content_sha256":"85965eb3cd4d1536979746dfeafd9ed3eb70fca5f9c5b61fca5d80a3f6f783d7","schema_version":"1.0","event_id":"sha256:85965eb3cd4d1536979746dfeafd9ed3eb70fca5f9c5b61fca5d80a3f6f783d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEZV73KGVJIGQ6N3SNE2ETDJI4/bundle.json","state_url":"https://pith.science/pith/AEZV73KGVJIGQ6N3SNE2ETDJI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEZV73KGVJIGQ6N3SNE2ETDJI4/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-06-01T18:15:40Z","links":{"resolver":"https://pith.science/pith/AEZV73KGVJIGQ6N3SNE2ETDJI4","bundle":"https://pith.science/pith/AEZV73KGVJIGQ6N3SNE2ETDJI4/bundle.json","state":"https://pith.science/pith/AEZV73KGVJIGQ6N3SNE2ETDJI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEZV73KGVJIGQ6N3SNE2ETDJI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AEZV73KGVJIGQ6N3SNE2ETDJI4","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":"4e310fbc7f0275f994060eae2e9710dca2bcd6f6ec76b22436350025f1343a55","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2012-02-29T17:23:42Z","title_canon_sha256":"e483a72184b0641252550866594184f14674434d05c0b25188e0015a85ddb29b"},"schema_version":"1.0","source":{"id":"1202.6614","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6614","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6614v3","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6614","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"AEZV73KGVJIG","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AEZV73KGVJIGQ6N3","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AEZV73KG","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:85965eb3cd4d1536979746dfeafd9ed3eb70fca5f9c5b61fca5d80a3f6f783d7","target":"graph","created_at":"2026-05-18T02:19:42Z","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":"Reversible circuits for modular multiplication $Cx$%$M$ with $x<M$ arise as components of modular exponentiation in Shor's quantum number-factoring algorithm. However, existing generic constructions focus on asymptotic gate count and circuit depth rather than actual values, producing fairly large circuits not optimized for specific $C$ and $M$ values. In this work, we develop such optimizations in a bottom-up fashion, starting with most convenient $C$ values. When zero-initialized ancilla registers are available, we reduce the search for compact circuits to a shortest-path problem. Some of our","authors_text":"Igor L. Markov, Mehdi Saeedi","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2012-02-29T17:23:42Z","title":"Constant-Optimized Quantum Circuits for Modular Multiplication and Exponentiation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6614","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:aa149021b791890195a1a2a8e39c9399382a8d3d8df8f099b1d45ddb549dc1c3","target":"record","created_at":"2026-05-18T02:19:42Z","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":"4e310fbc7f0275f994060eae2e9710dca2bcd6f6ec76b22436350025f1343a55","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2012-02-29T17:23:42Z","title_canon_sha256":"e483a72184b0641252550866594184f14674434d05c0b25188e0015a85ddb29b"},"schema_version":"1.0","source":{"id":"1202.6614","kind":"arxiv","version":3}},"canonical_sha256":"01335fed46aa506879bb9349a24c69473b2f024832b9d47b4d6397899c4bd898","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01335fed46aa506879bb9349a24c69473b2f024832b9d47b4d6397899c4bd898","first_computed_at":"2026-05-18T02:19:42.828170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:42.828170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rp0e1XtCCejdQq3zRXG8eQ7XgwBmtMtgq9LmXBJPmiByMZGwo+Pwx6tzFL+IXAm/Yir04M1425kbZL9jjmvHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:42.828615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6614","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa149021b791890195a1a2a8e39c9399382a8d3d8df8f099b1d45ddb549dc1c3","sha256:85965eb3cd4d1536979746dfeafd9ed3eb70fca5f9c5b61fca5d80a3f6f783d7"],"state_sha256":"c7e70df974f7e776b2e5b2729cc15d97f530731b5a1ffe34a451d2b801550eb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ngZ9YTnG2G75xLAyTN8Xxr8eJu0BaIxw9nq59rwqlJI2ZusxDTeTm/lb9j0CTe6W4TqUasoU+I7mr8RFNZhABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:15:40.899785Z","bundle_sha256":"599140fa905b36d69919b6d2ed3234ae465818494b52cf043100ca19c58d2fc4"}}