{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NRZP3CKJJTLBMELSZUW2IIYXLG","short_pith_number":"pith:NRZP3CKJ","schema_version":"1.0","canonical_sha256":"6c72fd89494cd6161172cd2da423175993fcd9f08f510f3ec2b01ca80c3463de","source":{"kind":"arxiv","id":"2208.02132","version":2},"attestation_state":"computed","paper":{"title":"Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Hao-Chung Cheng","submitted_at":"2022-08-03T15:12:01Z","abstract_excerpt":"Achievability in information theory refers to demonstrating a coding strategy that accomplishes a prescribed performance benchmark for the underlying task. In quantum information theory, the crafted Hayashi-Nagaoka operator inequality is an essential technique in proving a wealth of one-shot achievability bounds since it effectively resembles a union bound in various problems. In this work, we show that the pretty-good measurement naturally plays a role as the union bound as well. A judicious application of it considerably simplifies the derivation of one-shot achievability for classical-quant"},"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":"2208.02132","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-08-03T15:12:01Z","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"title_canon_sha256":"b2b3d016a2367d46ee2df919f36b7fa336346afc3f7270d201325e36a979b4f5","abstract_canon_sha256":"b72be51d883156e3af483884f86df38ecd9f9c0ee3bad78658c29f636160b74d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:18:08.406040Z","signature_b64":"oHnrdInhxMVZ+KMwhvMbspw4bp3Z9y+SFoL6woBAZ6zGYoVMFErjYHgd7auOSFXcpFJC1nUJDy3wTuWLoZOpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c72fd89494cd6161172cd2da423175993fcd9f08f510f3ec2b01ca80c3463de","last_reissued_at":"2026-07-05T07:18:08.405586Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:18:08.405586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Hao-Chung Cheng","submitted_at":"2022-08-03T15:12:01Z","abstract_excerpt":"Achievability in information theory refers to demonstrating a coding strategy that accomplishes a prescribed performance benchmark for the underlying task. In quantum information theory, the crafted Hayashi-Nagaoka operator inequality is an essential technique in proving a wealth of one-shot achievability bounds since it effectively resembles a union bound in various problems. In this work, we show that the pretty-good measurement naturally plays a role as the union bound as well. A judicious application of it considerably simplifies the derivation of one-shot achievability for classical-quant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.02132","kind":"arxiv","version":2},"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/2208.02132/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":"2208.02132","created_at":"2026-07-05T07:18:08.405643+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.02132v2","created_at":"2026-07-05T07:18:08.405643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.02132","created_at":"2026-07-05T07:18:08.405643+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRZP3CKJJTLB","created_at":"2026-07-05T07:18:08.405643+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRZP3CKJJTLBMELS","created_at":"2026-07-05T07:18:08.405643+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRZP3CKJ","created_at":"2026-07-05T07:18:08.405643+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06246","citing_title":"Multiple Quantum Hypothesis Testing: One-Shot Pairwise Bounds and Sharp Asymptotics","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NRZP3CKJJTLBMELSZUW2IIYXLG","json":"https://pith.science/pith/NRZP3CKJJTLBMELSZUW2IIYXLG.json","graph_json":"https://pith.science/api/pith-number/NRZP3CKJJTLBMELSZUW2IIYXLG/graph.json","events_json":"https://pith.science/api/pith-number/NRZP3CKJJTLBMELSZUW2IIYXLG/events.json","paper":"https://pith.science/paper/NRZP3CKJ"},"agent_actions":{"view_html":"https://pith.science/pith/NRZP3CKJJTLBMELSZUW2IIYXLG","download_json":"https://pith.science/pith/NRZP3CKJJTLBMELSZUW2IIYXLG.json","view_paper":"https://pith.science/paper/NRZP3CKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.02132&json=true","fetch_graph":"https://pith.science/api/pith-number/NRZP3CKJJTLBMELSZUW2IIYXLG/graph.json","fetch_events":"https://pith.science/api/pith-number/NRZP3CKJJTLBMELSZUW2IIYXLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRZP3CKJJTLBMELSZUW2IIYXLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRZP3CKJJTLBMELSZUW2IIYXLG/action/storage_attestation","attest_author":"https://pith.science/pith/NRZP3CKJJTLBMELSZUW2IIYXLG/action/author_attestation","sign_citation":"https://pith.science/pith/NRZP3CKJJTLBMELSZUW2IIYXLG/action/citation_signature","submit_replication":"https://pith.science/pith/NRZP3CKJJTLBMELSZUW2IIYXLG/action/replication_record"}},"created_at":"2026-07-05T07:18:08.405643+00:00","updated_at":"2026-07-05T07:18:08.405643+00:00"}