{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:4ZTRVX53DJZCFK7NRIHBNHUHQ7","short_pith_number":"pith:4ZTRVX53","canonical_record":{"source":{"id":"2112.11358","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T16:56:22Z","cross_cats_sorted":[],"title_canon_sha256":"7f378442798b2ae4066da24be1b516a92210463f056d4fbb881196b0066454a5","abstract_canon_sha256":"776d74653f5d18978836de69a4ed27ada5d9a4cc45bc395d84462a52d9ab3c01"},"schema_version":"1.0"},"canonical_sha256":"e6671adfbb1a7222abed8a0e169e8787f60e27739e6cdcffc796421508ef2230","source":{"kind":"arxiv","id":"2112.11358","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.11358","created_at":"2026-07-05T07:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"2112.11358v1","created_at":"2026-07-05T07:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.11358","created_at":"2026-07-05T07:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"4ZTRVX53DJZC","created_at":"2026-07-05T07:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"4ZTRVX53DJZCFK7N","created_at":"2026-07-05T07:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"4ZTRVX53","created_at":"2026-07-05T07:16:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:4ZTRVX53DJZCFK7NRIHBNHUHQ7","target":"record","payload":{"canonical_record":{"source":{"id":"2112.11358","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T16:56:22Z","cross_cats_sorted":[],"title_canon_sha256":"7f378442798b2ae4066da24be1b516a92210463f056d4fbb881196b0066454a5","abstract_canon_sha256":"776d74653f5d18978836de69a4ed27ada5d9a4cc45bc395d84462a52d9ab3c01"},"schema_version":"1.0"},"canonical_sha256":"e6671adfbb1a7222abed8a0e169e8787f60e27739e6cdcffc796421508ef2230","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:30.996593Z","signature_b64":"2gxfsdhnk/E0CG1MI5kO/oIE4c8HFbrNGbSWSMILdV87p1PZ9pq39HIVSQziDp9KVFubVz/NKmJCR4Il//aGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6671adfbb1a7222abed8a0e169e8787f60e27739e6cdcffc796421508ef2230","last_reissued_at":"2026-07-05T07:16:30.996118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:30.996118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.11358","source_version":1,"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:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xoWmX4v7tc8LBBCp4E927KC+NrrdL/VDLxgUGZFJLrhUq9toB8lO/e+8CrgtOEv9UjdxLGv+32JrzEKeIldhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:31:29.353880Z"},"content_sha256":"275809750e156b3eafab596af6783680d493b07fcf93fe960b1f99c452ab0248","schema_version":"1.0","event_id":"sha256:275809750e156b3eafab596af6783680d493b07fcf93fe960b1f99c452ab0248"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:4ZTRVX53DJZCFK7NRIHBNHUHQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CNOT-count optimized quantum circuit of the Shor's algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Huan Yang, Li Yang, Xia Liu","submitted_at":"2021-12-21T16:56:22Z","abstract_excerpt":"We present improved quantum circuit for modular exponentiation of a constant, which is the most expensive operation in Shor's algorithm for integer factorization. While previous work mostly focuses on minimizing the number of qubits or the depth of circuit, we try to minimize the number of CNOT gate which primarily determines the running time on a ion trap quantum computer. First, we give the implementation of basic arithmetic with known lowest number of CNOT gate and the construction of improved modular exponentiation of a constant by accumulating intermediate date and windowing technique. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.11358","kind":"arxiv","version":1},"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/2112.11358/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:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/1Ilqpfb4ORyPSMcOFFTHvtgPgSHl99ORCYYU4DtwhOkdSr4AtkVGVVZGghsSy2wBZX/UR/nCqRF8wbvTeaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:31:29.354379Z"},"content_sha256":"28713ac51db29d02951b5da0723053bfd9c4a98992dc2ef4f8d6400b9a7e132b","schema_version":"1.0","event_id":"sha256:28713ac51db29d02951b5da0723053bfd9c4a98992dc2ef4f8d6400b9a7e132b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZTRVX53DJZCFK7NRIHBNHUHQ7/bundle.json","state_url":"https://pith.science/pith/4ZTRVX53DJZCFK7NRIHBNHUHQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZTRVX53DJZCFK7NRIHBNHUHQ7/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-11T11:31:29Z","links":{"resolver":"https://pith.science/pith/4ZTRVX53DJZCFK7NRIHBNHUHQ7","bundle":"https://pith.science/pith/4ZTRVX53DJZCFK7NRIHBNHUHQ7/bundle.json","state":"https://pith.science/pith/4ZTRVX53DJZCFK7NRIHBNHUHQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZTRVX53DJZCFK7NRIHBNHUHQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4ZTRVX53DJZCFK7NRIHBNHUHQ7","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":"776d74653f5d18978836de69a4ed27ada5d9a4cc45bc395d84462a52d9ab3c01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T16:56:22Z","title_canon_sha256":"7f378442798b2ae4066da24be1b516a92210463f056d4fbb881196b0066454a5"},"schema_version":"1.0","source":{"id":"2112.11358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.11358","created_at":"2026-07-05T07:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"2112.11358v1","created_at":"2026-07-05T07:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.11358","created_at":"2026-07-05T07:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"4ZTRVX53DJZC","created_at":"2026-07-05T07:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"4ZTRVX53DJZCFK7N","created_at":"2026-07-05T07:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"4ZTRVX53","created_at":"2026-07-05T07:16:30Z"}],"graph_snapshots":[{"event_id":"sha256:28713ac51db29d02951b5da0723053bfd9c4a98992dc2ef4f8d6400b9a7e132b","target":"graph","created_at":"2026-07-05T07:16:30Z","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/2112.11358/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present improved quantum circuit for modular exponentiation of a constant, which is the most expensive operation in Shor's algorithm for integer factorization. While previous work mostly focuses on minimizing the number of qubits or the depth of circuit, we try to minimize the number of CNOT gate which primarily determines the running time on a ion trap quantum computer. First, we give the implementation of basic arithmetic with known lowest number of CNOT gate and the construction of improved modular exponentiation of a constant by accumulating intermediate date and windowing technique. Th","authors_text":"Huan Yang, Li Yang, Xia Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T16:56:22Z","title":"CNOT-count optimized quantum circuit of the Shor's algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.11358","kind":"arxiv","version":1},"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:275809750e156b3eafab596af6783680d493b07fcf93fe960b1f99c452ab0248","target":"record","created_at":"2026-07-05T07:16:30Z","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":"776d74653f5d18978836de69a4ed27ada5d9a4cc45bc395d84462a52d9ab3c01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T16:56:22Z","title_canon_sha256":"7f378442798b2ae4066da24be1b516a92210463f056d4fbb881196b0066454a5"},"schema_version":"1.0","source":{"id":"2112.11358","kind":"arxiv","version":1}},"canonical_sha256":"e6671adfbb1a7222abed8a0e169e8787f60e27739e6cdcffc796421508ef2230","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6671adfbb1a7222abed8a0e169e8787f60e27739e6cdcffc796421508ef2230","first_computed_at":"2026-07-05T07:16:30.996118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:16:30.996118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2gxfsdhnk/E0CG1MI5kO/oIE4c8HFbrNGbSWSMILdV87p1PZ9pq39HIVSQziDp9KVFubVz/NKmJCR4Il//aGCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:16:30.996593Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.11358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:275809750e156b3eafab596af6783680d493b07fcf93fe960b1f99c452ab0248","sha256:28713ac51db29d02951b5da0723053bfd9c4a98992dc2ef4f8d6400b9a7e132b"],"state_sha256":"c8feb4dc47c7e1f288d45af449eaa181e7ad031e5006fdd0428e508112717ea4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jHXbdKOdWoM5T6deFKkmAeR08yHTv0Md3RHIxkeOBYUMbWpn5nCi7Y0eh+u5I59T12eojAr+YLRTyyxVJK+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T11:31:29.358375Z","bundle_sha256":"fd16e536345fd2e1c9bf04a110c30e47f06811f6229fdab9ea4206596562cd3c"}}