{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6PCP3GU56FS3CTZ7QXCVKM7YYZ","short_pith_number":"pith:6PCP3GU5","schema_version":"1.0","canonical_sha256":"f3c4fd9a9df165b14f3f85c55533f8c6516e1caa72fd1b2b91a2df07aef072e2","source":{"kind":"arxiv","id":"1207.0067","version":1},"attestation_state":"computed","paper":{"title":"A decoupling approach to classical data transmission over quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fr\\'ed\\'eric Dupuis, Marco Tomamichel, Oleg Szehr","submitted_at":"2012-06-30T09:36:50Z","abstract_excerpt":"Most coding theorems in quantum Shannon theory can be proven using the decoupling technique: to send data through a channel, one guarantees that the environment gets no information about it; Uhlmann's theorem then ensures that the receiver must be able to decode. While a wide range of problems can be solved this way, one of the most basic coding problems remains impervious to a direct application of this method: sending classical information through a quantum channel. We will show that this problem can, in fact, be solved using decoupling ideas, specifically by proving a \"dequantizing\" theorem"},"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":"1207.0067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-30T09:36:50Z","cross_cats_sorted":[],"title_canon_sha256":"a9fa4d2492ac5094cc3a457556a87c1246e096b57441905feac145ca46e57cf4","abstract_canon_sha256":"fa88c019e4552277da8444ba531e8f8bdd957211c6c5608a8a7188b44d78666a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:41.425878Z","signature_b64":"7VZ/Fe/jrc5485DmLOfegoGfKON4Ma1B9stiSs1MHe+lcA0umvuRnWi216AVPJskSzenbN7i6wqZq+Z0GZrQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3c4fd9a9df165b14f3f85c55533f8c6516e1caa72fd1b2b91a2df07aef072e2","last_reissued_at":"2026-05-18T02:47:41.425200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:41.425200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A decoupling approach to classical data transmission over quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fr\\'ed\\'eric Dupuis, Marco Tomamichel, Oleg Szehr","submitted_at":"2012-06-30T09:36:50Z","abstract_excerpt":"Most coding theorems in quantum Shannon theory can be proven using the decoupling technique: to send data through a channel, one guarantees that the environment gets no information about it; Uhlmann's theorem then ensures that the receiver must be able to decode. While a wide range of problems can be solved this way, one of the most basic coding problems remains impervious to a direct application of this method: sending classical information through a quantum channel. We will show that this problem can, in fact, be solved using decoupling ideas, specifically by proving a \"dequantizing\" theorem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0067","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":"1207.0067","created_at":"2026-05-18T02:47:41.425307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0067v1","created_at":"2026-05-18T02:47:41.425307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0067","created_at":"2026-05-18T02:47:41.425307+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PCP3GU56FS3","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PCP3GU56FS3CTZ7","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PCP3GU5","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.06325","citing_title":"Probabilistic and approximate universal quantum purification machines","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6PCP3GU56FS3CTZ7QXCVKM7YYZ","json":"https://pith.science/pith/6PCP3GU56FS3CTZ7QXCVKM7YYZ.json","graph_json":"https://pith.science/api/pith-number/6PCP3GU56FS3CTZ7QXCVKM7YYZ/graph.json","events_json":"https://pith.science/api/pith-number/6PCP3GU56FS3CTZ7QXCVKM7YYZ/events.json","paper":"https://pith.science/paper/6PCP3GU5"},"agent_actions":{"view_html":"https://pith.science/pith/6PCP3GU56FS3CTZ7QXCVKM7YYZ","download_json":"https://pith.science/pith/6PCP3GU56FS3CTZ7QXCVKM7YYZ.json","view_paper":"https://pith.science/paper/6PCP3GU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0067&json=true","fetch_graph":"https://pith.science/api/pith-number/6PCP3GU56FS3CTZ7QXCVKM7YYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6PCP3GU56FS3CTZ7QXCVKM7YYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PCP3GU56FS3CTZ7QXCVKM7YYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PCP3GU56FS3CTZ7QXCVKM7YYZ/action/storage_attestation","attest_author":"https://pith.science/pith/6PCP3GU56FS3CTZ7QXCVKM7YYZ/action/author_attestation","sign_citation":"https://pith.science/pith/6PCP3GU56FS3CTZ7QXCVKM7YYZ/action/citation_signature","submit_replication":"https://pith.science/pith/6PCP3GU56FS3CTZ7QXCVKM7YYZ/action/replication_record"}},"created_at":"2026-05-18T02:47:41.425307+00:00","updated_at":"2026-05-18T02:47:41.425307+00:00"}