{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IZDA6FTW74SIZESU5X4YZX3ZDM","short_pith_number":"pith:IZDA6FTW","schema_version":"1.0","canonical_sha256":"46460f1676ff248c9254edf98cdf791b16ccfa271904ca671aa3e7614ac933e7","source":{"kind":"arxiv","id":"1402.3626","version":1},"attestation_state":"computed","paper":{"title":"Strong converse for the quantum capacity of the erasure channel for almost all codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Andreas Winter, Mark M. Wilde","submitted_at":"2014-02-14T23:57:53Z","abstract_excerpt":"A strong converse theorem for channel capacity establishes that the error probability in any communication scheme for a given channel necessarily tends to one if the rate of communication exceeds the channel's capacity. Establishing such a theorem for the quantum capacity of degradable channels has been an elusive task, with the strongest progress so far being a so-called \"pretty strong converse\". In this work, Morgan and Winter proved that the quantum error of any quantum communication scheme for a given degradable channel converges to a value larger than $1/\\sqrt{2}$ in the limit of many cha"},"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":"1402.3626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-14T23:57:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a69ee2f39c39f800ee0e08aa4cc39483de7cfb7da2075efa508f54f3e5d8cfa8","abstract_canon_sha256":"c8f26b08c962d30f1cd00aadca2dd9f84f810ef9655ac42dc269db618e20a575"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:30.080702Z","signature_b64":"HrD19bH6uRPizr31rjryUDoLLwxvqxzH2PEn18MJ4dvz/6pRoisnmS/acWEfLNh5KUg49Oz20pKU0wtbsNCfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46460f1676ff248c9254edf98cdf791b16ccfa271904ca671aa3e7614ac933e7","last_reissued_at":"2026-05-18T02:31:30.080297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:30.080297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong converse for the quantum capacity of the erasure channel for almost all codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Andreas Winter, Mark M. Wilde","submitted_at":"2014-02-14T23:57:53Z","abstract_excerpt":"A strong converse theorem for channel capacity establishes that the error probability in any communication scheme for a given channel necessarily tends to one if the rate of communication exceeds the channel's capacity. Establishing such a theorem for the quantum capacity of degradable channels has been an elusive task, with the strongest progress so far being a so-called \"pretty strong converse\". In this work, Morgan and Winter proved that the quantum error of any quantum communication scheme for a given degradable channel converges to a value larger than $1/\\sqrt{2}$ in the limit of many cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3626","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":"1402.3626","created_at":"2026-05-18T02:31:30.080362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3626v1","created_at":"2026-05-18T02:31:30.080362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3626","created_at":"2026-05-18T02:31:30.080362+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZDA6FTW74SI","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZDA6FTW74SIZESU","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZDA6FTW","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01308","citing_title":"Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM","json":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM.json","graph_json":"https://pith.science/api/pith-number/IZDA6FTW74SIZESU5X4YZX3ZDM/graph.json","events_json":"https://pith.science/api/pith-number/IZDA6FTW74SIZESU5X4YZX3ZDM/events.json","paper":"https://pith.science/paper/IZDA6FTW"},"agent_actions":{"view_html":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM","download_json":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM.json","view_paper":"https://pith.science/paper/IZDA6FTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3626&json=true","fetch_graph":"https://pith.science/api/pith-number/IZDA6FTW74SIZESU5X4YZX3ZDM/graph.json","fetch_events":"https://pith.science/api/pith-number/IZDA6FTW74SIZESU5X4YZX3ZDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/action/storage_attestation","attest_author":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/action/author_attestation","sign_citation":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/action/citation_signature","submit_replication":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/action/replication_record"}},"created_at":"2026-05-18T02:31:30.080362+00:00","updated_at":"2026-05-18T02:31:30.080362+00:00"}