{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:K54CT3UA4IWBH3AN6H2MM5GWPS","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":"fc607f434edbd05ff506ac09b00586caf98b99a5aab7fccfaafafed14d2c79d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-26T09:18:35Z","title_canon_sha256":"33d8c9c51c6db9dadfce4bcfb73787de8c3bc3b9c37f9cd2607504442e6f29e8"},"schema_version":"1.0","source":{"id":"1410.7005","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7005","created_at":"2026-05-18T00:41:54Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7005v2","created_at":"2026-05-18T00:41:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7005","created_at":"2026-05-18T00:41:54Z"},{"alias_kind":"pith_short_12","alias_value":"K54CT3UA4IWB","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"K54CT3UA4IWBH3AN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"K54CT3UA","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:073d35d85da027b84ce4b5b0111ae349834293d7c1db30755bf233812c1a2a36","target":"graph","created_at":"2026-05-18T00:41:54Z","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":"We study the problem of universal decoding for unknown discrete memoryless channels in the presence of erasure/list option at the decoder, in the random coding regime. Specifically, we harness a universal version of Forney's classical erasure/list decoder developed in earlier studies, which is based on the competitive minimax methodology, and guarantees universal achievability of a certain fraction of the optimum random coding error exponents. In this paper, we derive an exact single-letter expression for the maximum achievable fraction. Examples are given in which the maximal achievable fract","authors_text":"Neri Merhav, Nir Weinberger, Wasim Huleihel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-26T09:18:35Z","title":"Erasure/List Random Coding Error Exponents Are Not Universally Achievable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7005","kind":"arxiv","version":2},"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:b000b627587135fefb1c03c9921fc0f9ab6bc6748d55e82ea7cce41514415c8b","target":"record","created_at":"2026-05-18T00:41:54Z","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":"fc607f434edbd05ff506ac09b00586caf98b99a5aab7fccfaafafed14d2c79d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-26T09:18:35Z","title_canon_sha256":"33d8c9c51c6db9dadfce4bcfb73787de8c3bc3b9c37f9cd2607504442e6f29e8"},"schema_version":"1.0","source":{"id":"1410.7005","kind":"arxiv","version":2}},"canonical_sha256":"577829ee80e22c13ec0df1f4c674d67c82ad20a64d6508028405d7d0779b2534","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"577829ee80e22c13ec0df1f4c674d67c82ad20a64d6508028405d7d0779b2534","first_computed_at":"2026-05-18T00:41:54.014920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:54.014920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ks1EY+e9FKkFXl0EM3H7hFSCfkNsFeKd8kAe0rTogSqiXGFS5p7O12heKil5UP2Gw2fE64D45J2XaHtUtbmFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:54.015422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7005","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b000b627587135fefb1c03c9921fc0f9ab6bc6748d55e82ea7cce41514415c8b","sha256:073d35d85da027b84ce4b5b0111ae349834293d7c1db30755bf233812c1a2a36"],"state_sha256":"292161e8d1b4ec063fe007686c352578e799cc716bad5962ae318998c083e0a1"}