{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5W7U4LVWSOIMEZFHT3OUUUH7HX","short_pith_number":"pith:5W7U4LVW","schema_version":"1.0","canonical_sha256":"edbf4e2eb69390c264a79edd4a50ff3de1b076ad64326e5b4f807fb6739e2755","source":{"kind":"arxiv","id":"2507.06232","version":4},"attestation_state":"computed","paper":{"title":"Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math-ph","math.FA","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Hao-Chung Cheng, Po-Chieh Liu","submitted_at":"2025-07-08T17:59:58Z","abstract_excerpt":"In this work, we prove a one-shot random coding bound for classical-quantum channel coding, a problem conjectured by Burnashev and Holevo in 1998. By choosing the optimal input distribution, the bound implies the optimal error exponent (i.e., the reliability function) of classical-quantum channels for rates above the critical rate, even in infinite-dimensional Hilbert spaces. Our result extends to various quantum packing-type problems, including classical communication over any fully quantum channel with or without entanglement-assistance, constant composition codes, and classical data compres"},"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":"2507.06232","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-08T17:59:58Z","cross_cats_sorted":["cs.IT","math-ph","math.FA","math.IT","math.MP"],"title_canon_sha256":"13cee88fc7aad923ee63ff462e99b9d0e9719b732eedfc588fd6fd21755c2ea5","abstract_canon_sha256":"d2ec011bcb81aa2df72a32c356b6bf223150ca0f7630bd08be8704c8ea9afae0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:14.750004Z","signature_b64":"VeSSMJHkrg3/z8XVaIw+B17Dl/kcVDzpeyaYY8VZwzQaDvBBMLIWuud/IGaPzZkfbYpSCEkGp1nrwAKLB2NgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edbf4e2eb69390c264a79edd4a50ff3de1b076ad64326e5b4f807fb6739e2755","last_reissued_at":"2026-06-05T01:15:14.749086Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:14.749086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math-ph","math.FA","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Hao-Chung Cheng, Po-Chieh Liu","submitted_at":"2025-07-08T17:59:58Z","abstract_excerpt":"In this work, we prove a one-shot random coding bound for classical-quantum channel coding, a problem conjectured by Burnashev and Holevo in 1998. By choosing the optimal input distribution, the bound implies the optimal error exponent (i.e., the reliability function) of classical-quantum channels for rates above the critical rate, even in infinite-dimensional Hilbert spaces. Our result extends to various quantum packing-type problems, including classical communication over any fully quantum channel with or without entanglement-assistance, constant composition codes, and classical data compres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.06232","kind":"arxiv","version":4},"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/2507.06232/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":"2507.06232","created_at":"2026-06-05T01:15:14.749197+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.06232v4","created_at":"2026-06-05T01:15:14.749197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.06232","created_at":"2026-06-05T01:15:14.749197+00:00"},{"alias_kind":"pith_short_12","alias_value":"5W7U4LVWSOIM","created_at":"2026-06-05T01:15:14.749197+00:00"},{"alias_kind":"pith_short_16","alias_value":"5W7U4LVWSOIMEZFH","created_at":"2026-06-05T01:15:14.749197+00:00"},{"alias_kind":"pith_short_8","alias_value":"5W7U4LVW","created_at":"2026-06-05T01:15:14.749197+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2604.08380","citing_title":"Sufficiency and Petz recovery for positive maps","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14617","citing_title":"Optimal Trace Inequalities for Single-Shot Quantum Information","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2604.08380","citing_title":"Sufficiency and Petz recovery for positive maps","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14617","citing_title":"Optimal Trace Inequalities for Single-Shot Quantum Information","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5W7U4LVWSOIMEZFHT3OUUUH7HX","json":"https://pith.science/pith/5W7U4LVWSOIMEZFHT3OUUUH7HX.json","graph_json":"https://pith.science/api/pith-number/5W7U4LVWSOIMEZFHT3OUUUH7HX/graph.json","events_json":"https://pith.science/api/pith-number/5W7U4LVWSOIMEZFHT3OUUUH7HX/events.json","paper":"https://pith.science/paper/5W7U4LVW"},"agent_actions":{"view_html":"https://pith.science/pith/5W7U4LVWSOIMEZFHT3OUUUH7HX","download_json":"https://pith.science/pith/5W7U4LVWSOIMEZFHT3OUUUH7HX.json","view_paper":"https://pith.science/paper/5W7U4LVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.06232&json=true","fetch_graph":"https://pith.science/api/pith-number/5W7U4LVWSOIMEZFHT3OUUUH7HX/graph.json","fetch_events":"https://pith.science/api/pith-number/5W7U4LVWSOIMEZFHT3OUUUH7HX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5W7U4LVWSOIMEZFHT3OUUUH7HX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5W7U4LVWSOIMEZFHT3OUUUH7HX/action/storage_attestation","attest_author":"https://pith.science/pith/5W7U4LVWSOIMEZFHT3OUUUH7HX/action/author_attestation","sign_citation":"https://pith.science/pith/5W7U4LVWSOIMEZFHT3OUUUH7HX/action/citation_signature","submit_replication":"https://pith.science/pith/5W7U4LVWSOIMEZFHT3OUUUH7HX/action/replication_record"}},"created_at":"2026-06-05T01:15:14.749197+00:00","updated_at":"2026-06-05T01:15:14.749197+00:00"}