{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:REOW5KI6DET6SVARBRLQAMJKZZ","short_pith_number":"pith:REOW5KI6","canonical_record":{"source":{"id":"2301.07564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-18T14:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"6c86d5d1cb384fa9b2ca7e68cb0f5935fe5e894065818378886b840059809c33","abstract_canon_sha256":"d0d6637bbe187ac996664354db57600ac483534361862351bb5c38ff4a4a3692"},"schema_version":"1.0"},"canonical_sha256":"891d6ea91e1927e954110c5700312ace4e99a8175bf6f244caf87c51d35bc6ff","source":{"kind":"arxiv","id":"2301.07564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.07564","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"2301.07564v1","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07564","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"REOW5KI6DET6","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_16","alias_value":"REOW5KI6DET6SVAR","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_8","alias_value":"REOW5KI6","created_at":"2026-07-05T05:34:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:REOW5KI6DET6SVARBRLQAMJKZZ","target":"record","payload":{"canonical_record":{"source":{"id":"2301.07564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-18T14:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"6c86d5d1cb384fa9b2ca7e68cb0f5935fe5e894065818378886b840059809c33","abstract_canon_sha256":"d0d6637bbe187ac996664354db57600ac483534361862351bb5c38ff4a4a3692"},"schema_version":"1.0"},"canonical_sha256":"891d6ea91e1927e954110c5700312ace4e99a8175bf6f244caf87c51d35bc6ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:34:10.521577Z","signature_b64":"a2y1MF55eaTbXA2PZ3+SkhV/vshwZRe5dEXGbtemdKHVBbyRAhILb1GtBvE8PIm1V/782SJBc59fecyed5pfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"891d6ea91e1927e954110c5700312ace4e99a8175bf6f244caf87c51d35bc6ff","last_reissued_at":"2026-07-05T05:34:10.521117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:34:10.521117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.07564","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-05T05:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brGcjGpGN8LOHOTFE6ZdJh2RiwHsQg3W6spZeztUqnSjKm9eSxf8b/Fd02tUShX/kwDB8iPtldCfxp53UYKkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:57:46.355728Z"},"content_sha256":"ee3c9bdb1d9c9e9480d16dc75cbc13b0bc88f63d57baefafac31efc9ecf05024","schema_version":"1.0","event_id":"sha256:ee3c9bdb1d9c9e9480d16dc75cbc13b0bc88f63d57baefafac31efc9ecf05024"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:REOW5KI6DET6SVARBRLQAMJKZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Realization of Scalable Cirac-Zoller Multi-Qubit Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chao Fang, Jungsang Kim, Ke Sun, Ye Wang","submitted_at":"2023-01-18T14:34:24Z","abstract_excerpt":"The universality theorem in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. However, the process of such decomposition is generally inefficient, often leading to exponentially many gates to realize an arbitrary computational task. Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits to implement the desired circuit. In 1995, Cirac and Zoller proposed a method to realize native multi-qubit controlled-$Z$ gates in trapped ion systems,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07564","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/2301.07564/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-05T05:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFrbe0Dn9hB372XF9wd20Wl58J/4j5Ie8ZJpCEDKoTLA3e1ty3BlnGvM9waFrZzGDLwCvtaMwmyGPeXBdF5/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:57:46.356304Z"},"content_sha256":"dce12a5c5fae38894f546e152a0ebc90499cb2e9fb1be8fd4b3fe7712e1fb113","schema_version":"1.0","event_id":"sha256:dce12a5c5fae38894f546e152a0ebc90499cb2e9fb1be8fd4b3fe7712e1fb113"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/REOW5KI6DET6SVARBRLQAMJKZZ/bundle.json","state_url":"https://pith.science/pith/REOW5KI6DET6SVARBRLQAMJKZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/REOW5KI6DET6SVARBRLQAMJKZZ/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-11T02:57:46Z","links":{"resolver":"https://pith.science/pith/REOW5KI6DET6SVARBRLQAMJKZZ","bundle":"https://pith.science/pith/REOW5KI6DET6SVARBRLQAMJKZZ/bundle.json","state":"https://pith.science/pith/REOW5KI6DET6SVARBRLQAMJKZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/REOW5KI6DET6SVARBRLQAMJKZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:REOW5KI6DET6SVARBRLQAMJKZZ","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":"d0d6637bbe187ac996664354db57600ac483534361862351bb5c38ff4a4a3692","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-18T14:34:24Z","title_canon_sha256":"6c86d5d1cb384fa9b2ca7e68cb0f5935fe5e894065818378886b840059809c33"},"schema_version":"1.0","source":{"id":"2301.07564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.07564","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"2301.07564v1","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07564","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"REOW5KI6DET6","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_16","alias_value":"REOW5KI6DET6SVAR","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_8","alias_value":"REOW5KI6","created_at":"2026-07-05T05:34:10Z"}],"graph_snapshots":[{"event_id":"sha256:dce12a5c5fae38894f546e152a0ebc90499cb2e9fb1be8fd4b3fe7712e1fb113","target":"graph","created_at":"2026-07-05T05:34:10Z","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/2301.07564/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The universality theorem in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. However, the process of such decomposition is generally inefficient, often leading to exponentially many gates to realize an arbitrary computational task. Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits to implement the desired circuit. In 1995, Cirac and Zoller proposed a method to realize native multi-qubit controlled-$Z$ gates in trapped ion systems,","authors_text":"Chao Fang, Jungsang Kim, Ke Sun, Ye Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-18T14:34:24Z","title":"Realization of Scalable Cirac-Zoller Multi-Qubit Gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07564","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:ee3c9bdb1d9c9e9480d16dc75cbc13b0bc88f63d57baefafac31efc9ecf05024","target":"record","created_at":"2026-07-05T05:34:10Z","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":"d0d6637bbe187ac996664354db57600ac483534361862351bb5c38ff4a4a3692","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-18T14:34:24Z","title_canon_sha256":"6c86d5d1cb384fa9b2ca7e68cb0f5935fe5e894065818378886b840059809c33"},"schema_version":"1.0","source":{"id":"2301.07564","kind":"arxiv","version":1}},"canonical_sha256":"891d6ea91e1927e954110c5700312ace4e99a8175bf6f244caf87c51d35bc6ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"891d6ea91e1927e954110c5700312ace4e99a8175bf6f244caf87c51d35bc6ff","first_computed_at":"2026-07-05T05:34:10.521117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:34:10.521117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a2y1MF55eaTbXA2PZ3+SkhV/vshwZRe5dEXGbtemdKHVBbyRAhILb1GtBvE8PIm1V/782SJBc59fecyed5pfCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:34:10.521577Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.07564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee3c9bdb1d9c9e9480d16dc75cbc13b0bc88f63d57baefafac31efc9ecf05024","sha256:dce12a5c5fae38894f546e152a0ebc90499cb2e9fb1be8fd4b3fe7712e1fb113"],"state_sha256":"6a9579669f265fff100ba5a1cf91bd8e368b8795c9abdfd2a2a6daec36cd9f31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sm6btPk+DuGREBn/iB2g+cW98PWYD12xOUF4YYkMKENzwkmoWqSHTnPjeWZVFq/pHUlIP/MZkYsh2DwclUlsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:57:46.360882Z","bundle_sha256":"6b18a19ef6e004a27aa09f4831bc5d9ae59d7ab981584ffda18f6811ae1e0d62"}}