{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IZDA6FTW74SIZESU5X4YZX3ZDM","short_pith_number":"pith:IZDA6FTW","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"},"canonical_sha256":"46460f1676ff248c9254edf98cdf791b16ccfa271904ca671aa3e7614ac933e7","source":{"kind":"arxiv","id":"1402.3626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3626","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3626v1","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3626","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"IZDA6FTW74SI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IZDA6FTW74SIZESU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IZDA6FTW","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IZDA6FTW74SIZESU5X4YZX3ZDM","target":"record","payload":{"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"},"canonical_sha256":"46460f1676ff248c9254edf98cdf791b16ccfa271904ca671aa3e7614ac933e7","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"},"source_kind":"arxiv","source_id":"1402.3626","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5D0pgQJCUyLn53o9M2lK8gO+8HCIDWX0gqAN36dLIwYwynjPq3H1n+771U7q3dYsIsqqhAZZGGX/4PG7IJDCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:13:20.623357Z"},"content_sha256":"209c73b4dc7701a7beb1b8b3e382b67b3f740687e1288cdc83446ac987c85529","schema_version":"1.0","event_id":"sha256:209c73b4dc7701a7beb1b8b3e382b67b3f740687e1288cdc83446ac987c85529"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IZDA6FTW74SIZESU5X4YZX3ZDM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cU3OKRPapzexxWsXVTd8GQnb0IVz9qtNUeu2KEdGMEKOTMpgTsI59qnEq6lqxnu2zpK5eTPVYuC6LTPOwdyeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:13:20.623816Z"},"content_sha256":"a58629a5eb80653b744ffa2f3728a027cc4de88f44405615a0da347362b359f4","schema_version":"1.0","event_id":"sha256:a58629a5eb80653b744ffa2f3728a027cc4de88f44405615a0da347362b359f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/bundle.json","state_url":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T07:13:20Z","links":{"resolver":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM","bundle":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/bundle.json","state":"https://pith.science/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZDA6FTW74SIZESU5X4YZX3ZDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IZDA6FTW74SIZESU5X4YZX3ZDM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c8f26b08c962d30f1cd00aadca2dd9f84f810ef9655ac42dc269db618e20a575","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-14T23:57:53Z","title_canon_sha256":"a69ee2f39c39f800ee0e08aa4cc39483de7cfb7da2075efa508f54f3e5d8cfa8"},"schema_version":"1.0","source":{"id":"1402.3626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3626","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3626v1","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3626","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"IZDA6FTW74SI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IZDA6FTW74SIZESU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IZDA6FTW","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:a58629a5eb80653b744ffa2f3728a027cc4de88f44405615a0da347362b359f4","target":"graph","created_at":"2026-05-18T02:31:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andreas Winter, Mark M. Wilde","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-14T23:57:53Z","title":"Strong converse for the quantum capacity of the erasure channel for almost all codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3626","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:209c73b4dc7701a7beb1b8b3e382b67b3f740687e1288cdc83446ac987c85529","target":"record","created_at":"2026-05-18T02:31:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c8f26b08c962d30f1cd00aadca2dd9f84f810ef9655ac42dc269db618e20a575","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-14T23:57:53Z","title_canon_sha256":"a69ee2f39c39f800ee0e08aa4cc39483de7cfb7da2075efa508f54f3e5d8cfa8"},"schema_version":"1.0","source":{"id":"1402.3626","kind":"arxiv","version":1}},"canonical_sha256":"46460f1676ff248c9254edf98cdf791b16ccfa271904ca671aa3e7614ac933e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46460f1676ff248c9254edf98cdf791b16ccfa271904ca671aa3e7614ac933e7","first_computed_at":"2026-05-18T02:31:30.080297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:30.080297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HrD19bH6uRPizr31rjryUDoLLwxvqxzH2PEn18MJ4dvz/6pRoisnmS/acWEfLNh5KUg49Oz20pKU0wtbsNCfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:30.080702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:209c73b4dc7701a7beb1b8b3e382b67b3f740687e1288cdc83446ac987c85529","sha256:a58629a5eb80653b744ffa2f3728a027cc4de88f44405615a0da347362b359f4"],"state_sha256":"d0c2f45e4c130eb6b936cd782fc5c03a84791d46afbdee3515987cc6d1f0ecdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gLp78NR+BzMHkEv9V20DPsrte8/EueFchBRWf5BYbqU9rpIu35bUUE5TsenoDsbzEaCVKMmCZOd9Z55nFAxnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T07:13:20.628981Z","bundle_sha256":"941de4e4472d506b98a8a47032cd952a6e0f5cbe0c6febd6576ac740dd45b5f1"}}