{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6SRWOEDSIIDX4LDYA7C7RGLGQX","short_pith_number":"pith:6SRWOEDS","canonical_record":{"source":{"id":"1304.7516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2013-04-28T20:11:05Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"a47802dbc6ab81dea0fd5602bd5aaca706fd7f17bcfae34c55bda2d7eae6b472","abstract_canon_sha256":"2e65e1c0e749baa0fa4bcc3d97ea1ecafe0e5faae83a66cad2474f312c47d226"},"schema_version":"1.0"},"canonical_sha256":"f4a367107242077e2c7807c5f8996685dae248263beba8e8d9f57f0b23e37d71","source":{"kind":"arxiv","id":"1304.7516","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7516","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7516v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7516","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"6SRWOEDSIIDX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6SRWOEDSIIDX4LDY","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6SRWOEDS","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6SRWOEDSIIDX4LDYA7C7RGLGQX","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2013-04-28T20:11:05Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"a47802dbc6ab81dea0fd5602bd5aaca706fd7f17bcfae34c55bda2d7eae6b472","abstract_canon_sha256":"2e65e1c0e749baa0fa4bcc3d97ea1ecafe0e5faae83a66cad2474f312c47d226"},"schema_version":"1.0"},"canonical_sha256":"f4a367107242077e2c7807c5f8996685dae248263beba8e8d9f57f0b23e37d71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:53.816484Z","signature_b64":"L9xQdDx2fi4YDVxVGPsyzRlPfu+YV9b5pLZItIe6kRsetCMhVTu6jF3jTUrWirVquYJxN6X1qSngJTfDRtFcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4a367107242077e2c7807c5f8996685dae248263beba8e8d9f57f0b23e37d71","last_reissued_at":"2026-05-18T03:26:53.815862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:53.815862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7516","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-05-18T03:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lo7QaoxwiGwvknwXO7bDHAS4BwBi0CepGmrrynMnHyMScK2qA7wpCterseelzlROrfvd/0RVUCksXefYydZ9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:04:22.360183Z"},"content_sha256":"d9ba73b95554d5bd0e8fb7edc10881273a0d864b2c6756069c2c0090b0e53be4","schema_version":"1.0","event_id":"sha256:d9ba73b95554d5bd0e8fb7edc10881273a0d864b2c6756069c2c0090b0e53be4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6SRWOEDSIIDX4LDYA7C7RGLGQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Circuits for GCD Computation with $O(n \\log n)$ Depth and O(n) Ancillae","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":"2013-04-28T20:11:05Z","abstract_excerpt":"GCD computations and variants of the Euclidean algorithm enjoy broad uses in both classical and quantum algorithms. In this paper, we propose quantum circuits for GCD computation with $O(n \\log n)$ depth with O(n) ancillae. Prior circuit construction needs $O(n^2)$ running time with O(n) ancillae. The proposed construction is based on the binary GCD algorithm and it benefits from log-depth circuits for 1-bit shift, comparison/subtraction, and managing ancillae. The worst-case gate count remains $O(n^2)$, as in traditional circuits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7516","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":""},"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:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWFTU9vYOR17x6K6qUUU+B0buKcfcN0bTcZrvP8tg6Q3t+A6eoH3NH23gQHmAlv8dXVmFBfSrenVAJX18PN3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:04:22.360866Z"},"content_sha256":"bee8aab4143b1a60b40a5e58c3820bcb92a061022aceca5670e5047073451b20","schema_version":"1.0","event_id":"sha256:bee8aab4143b1a60b40a5e58c3820bcb92a061022aceca5670e5047073451b20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SRWOEDSIIDX4LDYA7C7RGLGQX/bundle.json","state_url":"https://pith.science/pith/6SRWOEDSIIDX4LDYA7C7RGLGQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SRWOEDSIIDX4LDYA7C7RGLGQX/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-27T08:04:22Z","links":{"resolver":"https://pith.science/pith/6SRWOEDSIIDX4LDYA7C7RGLGQX","bundle":"https://pith.science/pith/6SRWOEDSIIDX4LDYA7C7RGLGQX/bundle.json","state":"https://pith.science/pith/6SRWOEDSIIDX4LDYA7C7RGLGQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SRWOEDSIIDX4LDYA7C7RGLGQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6SRWOEDSIIDX4LDYA7C7RGLGQX","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":"2e65e1c0e749baa0fa4bcc3d97ea1ecafe0e5faae83a66cad2474f312c47d226","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2013-04-28T20:11:05Z","title_canon_sha256":"a47802dbc6ab81dea0fd5602bd5aaca706fd7f17bcfae34c55bda2d7eae6b472"},"schema_version":"1.0","source":{"id":"1304.7516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7516","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7516v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7516","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"6SRWOEDSIIDX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6SRWOEDSIIDX4LDY","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6SRWOEDS","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:bee8aab4143b1a60b40a5e58c3820bcb92a061022aceca5670e5047073451b20","target":"graph","created_at":"2026-05-18T03:26:53Z","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":"GCD computations and variants of the Euclidean algorithm enjoy broad uses in both classical and quantum algorithms. In this paper, we propose quantum circuits for GCD computation with $O(n \\log n)$ depth with O(n) ancillae. Prior circuit construction needs $O(n^2)$ running time with O(n) ancillae. The proposed construction is based on the binary GCD algorithm and it benefits from log-depth circuits for 1-bit shift, comparison/subtraction, and managing ancillae. The worst-case gate count remains $O(n^2)$, as in traditional circuits.","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":"2013-04-28T20:11:05Z","title":"Quantum Circuits for GCD Computation with $O(n \\log n)$ Depth and O(n) Ancillae"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7516","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:d9ba73b95554d5bd0e8fb7edc10881273a0d864b2c6756069c2c0090b0e53be4","target":"record","created_at":"2026-05-18T03:26:53Z","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":"2e65e1c0e749baa0fa4bcc3d97ea1ecafe0e5faae83a66cad2474f312c47d226","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2013-04-28T20:11:05Z","title_canon_sha256":"a47802dbc6ab81dea0fd5602bd5aaca706fd7f17bcfae34c55bda2d7eae6b472"},"schema_version":"1.0","source":{"id":"1304.7516","kind":"arxiv","version":1}},"canonical_sha256":"f4a367107242077e2c7807c5f8996685dae248263beba8e8d9f57f0b23e37d71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4a367107242077e2c7807c5f8996685dae248263beba8e8d9f57f0b23e37d71","first_computed_at":"2026-05-18T03:26:53.815862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:53.815862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L9xQdDx2fi4YDVxVGPsyzRlPfu+YV9b5pLZItIe6kRsetCMhVTu6jF3jTUrWirVquYJxN6X1qSngJTfDRtFcBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:53.816484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9ba73b95554d5bd0e8fb7edc10881273a0d864b2c6756069c2c0090b0e53be4","sha256:bee8aab4143b1a60b40a5e58c3820bcb92a061022aceca5670e5047073451b20"],"state_sha256":"1b8d9064e22a3aaa33b37fdc0ea5e1b263e9fe38e245b5c72763a65047d7e9cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+f/q9Lc3vhQRDvHG3ZYahVkfnCM+I3a10YvmOoF3JpN5z/gaKwC/YwUFqWru40nTIepzSAtgGHiuOLH/OevBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:04:22.364531Z","bundle_sha256":"3077dd25d78ce32f88a903a2e4d3ef0679131667d08dab6a0399d8f4cfc5b7e6"}}