{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KS5RLSL2G4M5D7ETKMKDDOULFE","short_pith_number":"pith:KS5RLSL2","schema_version":"1.0","canonical_sha256":"54bb15c97a3719d1fc93531431ba8b290089123378a2fba9fd7641fe79bb990b","source":{"kind":"arxiv","id":"1409.2536","version":1},"attestation_state":"computed","paper":{"title":"Coding Theorem and Strong Converse for Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Andreas Winter","submitted_at":"2014-09-08T21:46:08Z","abstract_excerpt":"In this correspondence we present a new proof of Holevo's coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz's combinatorial approach using types of sequences. As a by-product of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new proof of Holevo's information bound."},"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":"1409.2536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-08T21:46:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1b9987d18c23b9c5be495c60dcf17f3352f084c1c0882dfa432e11707a4f83a8","abstract_canon_sha256":"bd76d45a299f53c78c02e16c167c504c40d30c19bb8862aff1f5435e885e8bcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:10.317722Z","signature_b64":"t53a1lS5JPJjQgxFOHdJlyGz/Th3mm0Qn3S8rbhSorcycC7oan25ROYN+Oduot+DaTMx8kshaVQVbw2hAEfiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54bb15c97a3719d1fc93531431ba8b290089123378a2fba9fd7641fe79bb990b","last_reissued_at":"2026-05-18T02:43:10.317157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:10.317157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding Theorem and Strong Converse for Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Andreas Winter","submitted_at":"2014-09-08T21:46:08Z","abstract_excerpt":"In this correspondence we present a new proof of Holevo's coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz's combinatorial approach using types of sequences. As a by-product of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new proof of Holevo's information bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2536","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":""},"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":"1409.2536","created_at":"2026-05-18T02:43:10.317234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2536v1","created_at":"2026-05-18T02:43:10.317234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2536","created_at":"2026-05-18T02:43:10.317234+00:00"},{"alias_kind":"pith_short_12","alias_value":"KS5RLSL2G4M5","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KS5RLSL2G4M5D7ET","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KS5RLSL2","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.10495","citing_title":"Approximating Unitary Preparations of Orthogonal Black Box States","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2601.20924","citing_title":"Resource-Theoretic Quantifiers of Weak and Strong Symmetry Breaking: Strong Entanglement Asymmetry and Beyond","ref_index":97,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KS5RLSL2G4M5D7ETKMKDDOULFE","json":"https://pith.science/pith/KS5RLSL2G4M5D7ETKMKDDOULFE.json","graph_json":"https://pith.science/api/pith-number/KS5RLSL2G4M5D7ETKMKDDOULFE/graph.json","events_json":"https://pith.science/api/pith-number/KS5RLSL2G4M5D7ETKMKDDOULFE/events.json","paper":"https://pith.science/paper/KS5RLSL2"},"agent_actions":{"view_html":"https://pith.science/pith/KS5RLSL2G4M5D7ETKMKDDOULFE","download_json":"https://pith.science/pith/KS5RLSL2G4M5D7ETKMKDDOULFE.json","view_paper":"https://pith.science/paper/KS5RLSL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2536&json=true","fetch_graph":"https://pith.science/api/pith-number/KS5RLSL2G4M5D7ETKMKDDOULFE/graph.json","fetch_events":"https://pith.science/api/pith-number/KS5RLSL2G4M5D7ETKMKDDOULFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KS5RLSL2G4M5D7ETKMKDDOULFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KS5RLSL2G4M5D7ETKMKDDOULFE/action/storage_attestation","attest_author":"https://pith.science/pith/KS5RLSL2G4M5D7ETKMKDDOULFE/action/author_attestation","sign_citation":"https://pith.science/pith/KS5RLSL2G4M5D7ETKMKDDOULFE/action/citation_signature","submit_replication":"https://pith.science/pith/KS5RLSL2G4M5D7ETKMKDDOULFE/action/replication_record"}},"created_at":"2026-05-18T02:43:10.317234+00:00","updated_at":"2026-05-18T02:43:10.317234+00:00"}