{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DICH73GH6ISICVQBR3BFDFCCOF","short_pith_number":"pith:DICH73GH","schema_version":"1.0","canonical_sha256":"1a047fecc7f2248156018ec25194427151736a4f96f63028ab60af85d44c4b3e","source":{"kind":"arxiv","id":"2607.27947","version":1},"attestation_state":"computed","paper":{"title":"A CPU+DCU Heterogeneous Parallel Framework for Post-Processing Reconstruction in Quantum Circuit Cutting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Hengliang Guo, Jiandong Shang, Qiang Chen, Qingqing Jiang, Ruiqing He, Weidong Liu, Yufu Liu","submitted_at":"2026-07-30T09:53:27Z","abstract_excerpt":"In the NISQ era, limited qubit resources make it difficult to execute large quantum circuits directly on real hardware. Quantum circuit cutting mitigates this limitation by decomposing a large circuit into smaller subcircuits, but it shifts substantial overhead to classical post-processing. As circuit size, complexity, and cut count increase, reconstruction becomes a major computational and storage bottleneck. This paper presents a CPU+DCU heterogeneous parallel framework for circuit-cutting post-processing reconstruction. Instead of constructing a dense $2^n$-dimensional probability vector or"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.27947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T09:53:27Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7f3428178f9980429f4dc4856ddbd1f3bbc2b897ed05ca76b2530dc3a43d3e6d","abstract_canon_sha256":"dea932e7f5e33daf85a7a2832fb79b14b7b9e43d6d907ff34bae1c127444b7fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a047fecc7f2248156018ec25194427151736a4f96f63028ab60af85d44c4b3e","last_reissued_at":"2026-07-31T01:34:59.789992Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:34:59.789992Z"},"graph_snapshot":{"paper":{"title":"A CPU+DCU Heterogeneous Parallel Framework for Post-Processing Reconstruction in Quantum Circuit Cutting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Hengliang Guo, Jiandong Shang, Qiang Chen, Qingqing Jiang, Ruiqing He, Weidong Liu, Yufu Liu","submitted_at":"2026-07-30T09:53:27Z","abstract_excerpt":"In the NISQ era, limited qubit resources make it difficult to execute large quantum circuits directly on real hardware. Quantum circuit cutting mitigates this limitation by decomposing a large circuit into smaller subcircuits, but it shifts substantial overhead to classical post-processing. As circuit size, complexity, and cut count increase, reconstruction becomes a major computational and storage bottleneck. This paper presents a CPU+DCU heterogeneous parallel framework for circuit-cutting post-processing reconstruction. Instead of constructing a dense $2^n$-dimensional probability vector or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27947","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/2607.27947/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.27947","created_at":"2026-07-31T01:34:59.793107+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27947v1","created_at":"2026-07-31T01:34:59.793107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27947","created_at":"2026-07-31T01:34:59.793107+00:00"},{"alias_kind":"pith_short_12","alias_value":"DICH73GH6ISI","created_at":"2026-07-31T01:34:59.793107+00:00"},{"alias_kind":"pith_short_16","alias_value":"DICH73GH6ISICVQB","created_at":"2026-07-31T01:34:59.793107+00:00"},{"alias_kind":"pith_short_8","alias_value":"DICH73GH","created_at":"2026-07-31T01:34:59.793107+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DICH73GH6ISICVQBR3BFDFCCOF","json":"https://pith.science/pith/DICH73GH6ISICVQBR3BFDFCCOF.json","graph_json":"https://pith.science/api/pith-number/DICH73GH6ISICVQBR3BFDFCCOF/graph.json","events_json":"https://pith.science/api/pith-number/DICH73GH6ISICVQBR3BFDFCCOF/events.json","paper":"https://pith.science/paper/DICH73GH"},"agent_actions":{"view_html":"https://pith.science/pith/DICH73GH6ISICVQBR3BFDFCCOF","download_json":"https://pith.science/pith/DICH73GH6ISICVQBR3BFDFCCOF.json","view_paper":"https://pith.science/paper/DICH73GH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27947&json=true","fetch_graph":"https://pith.science/api/pith-number/DICH73GH6ISICVQBR3BFDFCCOF/graph.json","fetch_events":"https://pith.science/api/pith-number/DICH73GH6ISICVQBR3BFDFCCOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DICH73GH6ISICVQBR3BFDFCCOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DICH73GH6ISICVQBR3BFDFCCOF/action/storage_attestation","attest_author":"https://pith.science/pith/DICH73GH6ISICVQBR3BFDFCCOF/action/author_attestation","sign_citation":"https://pith.science/pith/DICH73GH6ISICVQBR3BFDFCCOF/action/citation_signature","submit_replication":"https://pith.science/pith/DICH73GH6ISICVQBR3BFDFCCOF/action/replication_record"}},"created_at":"2026-07-31T01:34:59.793107+00:00","updated_at":"2026-07-31T01:34:59.793107+00:00"}