{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MBSFWHSTGIUK7F7HGO2RIICFLB","short_pith_number":"pith:MBSFWHST","canonical_record":{"source":{"id":"2308.09567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-18T13:59:55Z","cross_cats_sorted":[],"title_canon_sha256":"b7707e2b19afd144136f18c495b4f6774be6b97eea44d0403ff5a032e70b5085","abstract_canon_sha256":"fd1243b89855b2d66664405bd26e0f9360481524d4abebab5dc7612191f37a7e"},"schema_version":"1.0"},"canonical_sha256":"60645b1e533228af97e733b51420455871964118e63a5a624b78136ad2fc1c08","source":{"kind":"arxiv","id":"2308.09567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.09567","created_at":"2026-07-05T06:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"2308.09567v1","created_at":"2026-07-05T06:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.09567","created_at":"2026-07-05T06:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"MBSFWHSTGIUK","created_at":"2026-07-05T06:42:34Z"},{"alias_kind":"pith_short_16","alias_value":"MBSFWHSTGIUK7F7H","created_at":"2026-07-05T06:42:34Z"},{"alias_kind":"pith_short_8","alias_value":"MBSFWHST","created_at":"2026-07-05T06:42:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MBSFWHSTGIUK7F7HGO2RIICFLB","target":"record","payload":{"canonical_record":{"source":{"id":"2308.09567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-18T13:59:55Z","cross_cats_sorted":[],"title_canon_sha256":"b7707e2b19afd144136f18c495b4f6774be6b97eea44d0403ff5a032e70b5085","abstract_canon_sha256":"fd1243b89855b2d66664405bd26e0f9360481524d4abebab5dc7612191f37a7e"},"schema_version":"1.0"},"canonical_sha256":"60645b1e533228af97e733b51420455871964118e63a5a624b78136ad2fc1c08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:42:34.908870Z","signature_b64":"UFvlrah8wZ9QnrWD9VZQwQjh9wXA1Bb91vVRGQC/EFhz0kx0SD0yb2t5BGoKzVpjkDrfk9TrfVMDDPWkyuj1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60645b1e533228af97e733b51420455871964118e63a5a624b78136ad2fc1c08","last_reissued_at":"2026-07-05T06:42:34.908531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:42:34.908531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.09567","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-05T06:42:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDTVHaKgD+N3oSuIR64j9DRkG7rjnYG2K8APYq/ZtE6zj3YqF8bahel22DsjbKgmEewvbQyx7OWc5MNBe4gkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:13:04.424933Z"},"content_sha256":"eb3b3100a37b36cbbc80f26d1cb399993abac8b1b67d0f6f775bb3f935c9aadd","schema_version":"1.0","event_id":"sha256:eb3b3100a37b36cbbc80f26d1cb399993abac8b1b67d0f6f775bb3f935c9aadd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MBSFWHSTGIUK7F7HGO2RIICFLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Partitioning of Quantum Circuits using Gate Cuts and Wire Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ilia Polian, Kevin Krsulich, Sebastian Brandhofer","submitted_at":"2023-08-18T13:59:55Z","abstract_excerpt":"A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into a set of computations that include smaller-scale quantum (sub)circuits and classical postprocessing steps. These quantum subcircuits require fewer qubits, incur a smaller effort for satisfying qubit connectivity requirements, and typically incur less error. Thus, quantum circuit partitioning has the potential to enable quantum computations that would otherwise only be available on more mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.09567","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/2308.09567/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-05T06:42:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BILak4C/DNd5eZhcIxOsVjvcu999SsB9GgTrJYO56zNXnKST8zsxFyer2MnBh5+tdAnmwq72BV3Wbq+v5kjjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:13:04.426056Z"},"content_sha256":"6f56e558f0ce66de6bb8244949401f8bc129c47fb9d232561dcbdfa06f8f2dc3","schema_version":"1.0","event_id":"sha256:6f56e558f0ce66de6bb8244949401f8bc129c47fb9d232561dcbdfa06f8f2dc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBSFWHSTGIUK7F7HGO2RIICFLB/bundle.json","state_url":"https://pith.science/pith/MBSFWHSTGIUK7F7HGO2RIICFLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBSFWHSTGIUK7F7HGO2RIICFLB/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-11T03:13:04Z","links":{"resolver":"https://pith.science/pith/MBSFWHSTGIUK7F7HGO2RIICFLB","bundle":"https://pith.science/pith/MBSFWHSTGIUK7F7HGO2RIICFLB/bundle.json","state":"https://pith.science/pith/MBSFWHSTGIUK7F7HGO2RIICFLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBSFWHSTGIUK7F7HGO2RIICFLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MBSFWHSTGIUK7F7HGO2RIICFLB","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":"fd1243b89855b2d66664405bd26e0f9360481524d4abebab5dc7612191f37a7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-18T13:59:55Z","title_canon_sha256":"b7707e2b19afd144136f18c495b4f6774be6b97eea44d0403ff5a032e70b5085"},"schema_version":"1.0","source":{"id":"2308.09567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.09567","created_at":"2026-07-05T06:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"2308.09567v1","created_at":"2026-07-05T06:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.09567","created_at":"2026-07-05T06:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"MBSFWHSTGIUK","created_at":"2026-07-05T06:42:34Z"},{"alias_kind":"pith_short_16","alias_value":"MBSFWHSTGIUK7F7H","created_at":"2026-07-05T06:42:34Z"},{"alias_kind":"pith_short_8","alias_value":"MBSFWHST","created_at":"2026-07-05T06:42:34Z"}],"graph_snapshots":[{"event_id":"sha256:6f56e558f0ce66de6bb8244949401f8bc129c47fb9d232561dcbdfa06f8f2dc3","target":"graph","created_at":"2026-07-05T06:42:34Z","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/2308.09567/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into a set of computations that include smaller-scale quantum (sub)circuits and classical postprocessing steps. These quantum subcircuits require fewer qubits, incur a smaller effort for satisfying qubit connectivity requirements, and typically incur less error. Thus, quantum circuit partitioning has the potential to enable quantum computations that would otherwise only be available on more mat","authors_text":"Ilia Polian, Kevin Krsulich, Sebastian Brandhofer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-18T13:59:55Z","title":"Optimal Partitioning of Quantum Circuits using Gate Cuts and Wire Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.09567","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:eb3b3100a37b36cbbc80f26d1cb399993abac8b1b67d0f6f775bb3f935c9aadd","target":"record","created_at":"2026-07-05T06:42:34Z","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":"fd1243b89855b2d66664405bd26e0f9360481524d4abebab5dc7612191f37a7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-18T13:59:55Z","title_canon_sha256":"b7707e2b19afd144136f18c495b4f6774be6b97eea44d0403ff5a032e70b5085"},"schema_version":"1.0","source":{"id":"2308.09567","kind":"arxiv","version":1}},"canonical_sha256":"60645b1e533228af97e733b51420455871964118e63a5a624b78136ad2fc1c08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60645b1e533228af97e733b51420455871964118e63a5a624b78136ad2fc1c08","first_computed_at":"2026-07-05T06:42:34.908531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:42:34.908531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UFvlrah8wZ9QnrWD9VZQwQjh9wXA1Bb91vVRGQC/EFhz0kx0SD0yb2t5BGoKzVpjkDrfk9TrfVMDDPWkyuj1Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:42:34.908870Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.09567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb3b3100a37b36cbbc80f26d1cb399993abac8b1b67d0f6f775bb3f935c9aadd","sha256:6f56e558f0ce66de6bb8244949401f8bc129c47fb9d232561dcbdfa06f8f2dc3"],"state_sha256":"497233b749051321fb776f3bd1c56b49a7f03ef19695c380705b6298691f5fcb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkyqD5oFvbHy7Rly/jLRt0u40RVeDzJgxIdfuNdCfbm83OGar6I9aXZlcqJibV0VJQom4DwOuF/BLf2O7ubSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T03:13:04.432320Z","bundle_sha256":"0de971c722a87466ff8cf1b6cc7c5f45a38c0dfa57aab803d8d768c9f2911d25"}}