{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5QA47Y73QTSNYKXN74VMUBHFRU","short_pith_number":"pith:5QA47Y73","canonical_record":{"source":{"id":"2308.00194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-31T23:15:45Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"9d4cc658b6a4776ef93db03464b26d748807ca7aa3d5ecf9a5515ea865fa6dee","abstract_canon_sha256":"da878a2bab7c9a3001bf4aa7f9295c4537f6cd7446722353bb094de20e1012c6"},"schema_version":"1.0"},"canonical_sha256":"ec01cfe3fb84e4dc2aedff2aca04e58d25cae163a317589fd6ab445286d91d0a","source":{"kind":"arxiv","id":"2308.00194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00194","created_at":"2026-07-05T06:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00194v1","created_at":"2026-07-05T06:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00194","created_at":"2026-07-05T06:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"5QA47Y73QTSN","created_at":"2026-07-05T06:36:15Z"},{"alias_kind":"pith_short_16","alias_value":"5QA47Y73QTSNYKXN","created_at":"2026-07-05T06:36:15Z"},{"alias_kind":"pith_short_8","alias_value":"5QA47Y73","created_at":"2026-07-05T06:36:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5QA47Y73QTSNYKXN74VMUBHFRU","target":"record","payload":{"canonical_record":{"source":{"id":"2308.00194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-31T23:15:45Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"9d4cc658b6a4776ef93db03464b26d748807ca7aa3d5ecf9a5515ea865fa6dee","abstract_canon_sha256":"da878a2bab7c9a3001bf4aa7f9295c4537f6cd7446722353bb094de20e1012c6"},"schema_version":"1.0"},"canonical_sha256":"ec01cfe3fb84e4dc2aedff2aca04e58d25cae163a317589fd6ab445286d91d0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:36:15.589146Z","signature_b64":"L7iFkC+rM+eKI5EV3x3Fgw/AhsQ7mblgHu58ew5Fld5m/UDSR5Yc7PMXeV4jx/eHHsntiMHb5TcyMnW0dm0mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec01cfe3fb84e4dc2aedff2aca04e58d25cae163a317589fd6ab445286d91d0a","last_reissued_at":"2026-07-05T06:36:15.588677Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:36:15.588677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.00194","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:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rlfH1H6f+XcsI/FEkjkj5J9sLBlikxeNfSxSjekGhs6BjLC1BVsnCZeMK6rSmVUQTxRr1pD4hVa1GwZzAc6jCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:40:54.140643Z"},"content_sha256":"a62b321366c286d31c236379eb6de95ebd9e02c4a55fcd2dcefe8813e8355631","schema_version":"1.0","event_id":"sha256:a62b321366c286d31c236379eb6de95ebd9e02c4a55fcd2dcefe8813e8355631"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5QA47Y73QTSNYKXN74VMUBHFRU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Qubit Reuse for Near-Term Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Ilia Polian, Kevin Krsulich, Sebastian Brandhofer","submitted_at":"2023-07-31T23:15:45Z","abstract_excerpt":"Near-term quantum computations are limited by high error rates, the scarcity of qubits and low qubit connectivity. Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse that may yield quantum computations with fewer qubits and lower errors. In this work, we introduce a formal model for qubit reuse optimization that delivers provably optimal solutions with respect to quantum circuit depth, number of qubits, or number of swap gates for the first time. This is in contrast to related work where qubit reuse is used heuristically or optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00194","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.00194/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:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kOf04/Votr3A6PxUFbKTazEDVKZoB0JdFDRdgkCiohyAVhnoGh/VvFtMC6DpkP4bjrdDb/bpH6jsYpcaAwSpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:40:54.141248Z"},"content_sha256":"5830364a4aec3060aa52751587ee8ada9d5c39bc25a9b6b47716aefec6456d86","schema_version":"1.0","event_id":"sha256:5830364a4aec3060aa52751587ee8ada9d5c39bc25a9b6b47716aefec6456d86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QA47Y73QTSNYKXN74VMUBHFRU/bundle.json","state_url":"https://pith.science/pith/5QA47Y73QTSNYKXN74VMUBHFRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QA47Y73QTSNYKXN74VMUBHFRU/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-17T05:40:54Z","links":{"resolver":"https://pith.science/pith/5QA47Y73QTSNYKXN74VMUBHFRU","bundle":"https://pith.science/pith/5QA47Y73QTSNYKXN74VMUBHFRU/bundle.json","state":"https://pith.science/pith/5QA47Y73QTSNYKXN74VMUBHFRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QA47Y73QTSNYKXN74VMUBHFRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5QA47Y73QTSNYKXN74VMUBHFRU","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":"da878a2bab7c9a3001bf4aa7f9295c4537f6cd7446722353bb094de20e1012c6","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-31T23:15:45Z","title_canon_sha256":"9d4cc658b6a4776ef93db03464b26d748807ca7aa3d5ecf9a5515ea865fa6dee"},"schema_version":"1.0","source":{"id":"2308.00194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00194","created_at":"2026-07-05T06:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00194v1","created_at":"2026-07-05T06:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00194","created_at":"2026-07-05T06:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"5QA47Y73QTSN","created_at":"2026-07-05T06:36:15Z"},{"alias_kind":"pith_short_16","alias_value":"5QA47Y73QTSNYKXN","created_at":"2026-07-05T06:36:15Z"},{"alias_kind":"pith_short_8","alias_value":"5QA47Y73","created_at":"2026-07-05T06:36:15Z"}],"graph_snapshots":[{"event_id":"sha256:5830364a4aec3060aa52751587ee8ada9d5c39bc25a9b6b47716aefec6456d86","target":"graph","created_at":"2026-07-05T06:36:15Z","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.00194/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Near-term quantum computations are limited by high error rates, the scarcity of qubits and low qubit connectivity. Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse that may yield quantum computations with fewer qubits and lower errors. In this work, we introduce a formal model for qubit reuse optimization that delivers provably optimal solutions with respect to quantum circuit depth, number of qubits, or number of swap gates for the first time. This is in contrast to related work where qubit reuse is used heuristically or optima","authors_text":"Ilia Polian, Kevin Krsulich, Sebastian Brandhofer","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-31T23:15:45Z","title":"Optimal Qubit Reuse for Near-Term Quantum Computers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00194","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:a62b321366c286d31c236379eb6de95ebd9e02c4a55fcd2dcefe8813e8355631","target":"record","created_at":"2026-07-05T06:36:15Z","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":"da878a2bab7c9a3001bf4aa7f9295c4537f6cd7446722353bb094de20e1012c6","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-31T23:15:45Z","title_canon_sha256":"9d4cc658b6a4776ef93db03464b26d748807ca7aa3d5ecf9a5515ea865fa6dee"},"schema_version":"1.0","source":{"id":"2308.00194","kind":"arxiv","version":1}},"canonical_sha256":"ec01cfe3fb84e4dc2aedff2aca04e58d25cae163a317589fd6ab445286d91d0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec01cfe3fb84e4dc2aedff2aca04e58d25cae163a317589fd6ab445286d91d0a","first_computed_at":"2026-07-05T06:36:15.588677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:36:15.588677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L7iFkC+rM+eKI5EV3x3Fgw/AhsQ7mblgHu58ew5Fld5m/UDSR5Yc7PMXeV4jx/eHHsntiMHb5TcyMnW0dm0mDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:36:15.589146Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.00194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a62b321366c286d31c236379eb6de95ebd9e02c4a55fcd2dcefe8813e8355631","sha256:5830364a4aec3060aa52751587ee8ada9d5c39bc25a9b6b47716aefec6456d86"],"state_sha256":"3394ffacb2a5c3aec023797ceb8fd524f2f195b6a0fe43f6bf2ac69cde2efc24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pArUd1FkTklr1nUQEksr8ImF2KsU4/hcTIpJcyAIjrWxW93FdyMKaNr+72KZ30Yh6Q0j2c23M91a97NssxhXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T05:40:54.146500Z","bundle_sha256":"1ff8953d4f74529d503e812c84d9e52dffc1f08c7afa041db92a916586553862"}}