{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VC3HZ37TICQAYBKSSBEZWRF4OJ","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":"cd4556451e3dfe85bd0e382ca1458da76e1d33327291659ed167f09307a4a3dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-25T09:44:44Z","title_canon_sha256":"108f738e5bc2bed154758e74a6df88f0f03d852ef19566155f82dfa2141f91d8"},"schema_version":"1.0","source":{"id":"1307.6679","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6679","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6679v3","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6679","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"VC3HZ37TICQA","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VC3HZ37TICQAYBKS","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VC3HZ37T","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:514cf31677a7d8b546679f40f60b71c0c29fdd17beaa65dd6ff7a12e6b0fd34f","target":"graph","created_at":"2026-05-18T00:58:17Z","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":"This paper studies expurgated random-coding bounds and exponents for channel coding with a given (possibly suboptimal) decoding rule. Variations of Gallager's analysis are presented, yielding several asymptotic and non-asymptotic bounds on the error probability for an arbitrary codeword distribution. A simple non-asymptotic bound is shown to attain an exponent of Csisz\\'ar and K\\\"orner under constant-composition coding. Using Lagrange duality, this exponent is expressed in several forms, one of which is shown to permit a direct derivation via cost-constrained coding which extends to infinite a","authors_text":"Albert Guill\\'en i F\\`abregas, Alfonso Martinez, Jonathan Scarlett, Li Peng, Neri Merhav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-25T09:44:44Z","title":"Expurgated Random-Coding Ensembles: Exponents, Refinements and Connections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6679","kind":"arxiv","version":3},"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:8668f313d82bde84093cb0ec50252657ac84b20477d0da57ec09f9d1dd52f8e9","target":"record","created_at":"2026-05-18T00:58:17Z","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":"cd4556451e3dfe85bd0e382ca1458da76e1d33327291659ed167f09307a4a3dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-25T09:44:44Z","title_canon_sha256":"108f738e5bc2bed154758e74a6df88f0f03d852ef19566155f82dfa2141f91d8"},"schema_version":"1.0","source":{"id":"1307.6679","kind":"arxiv","version":3}},"canonical_sha256":"a8b67ceff340a00c055290499b44bc725c50e5d7ed1b90b22769a34f1dc0a6e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8b67ceff340a00c055290499b44bc725c50e5d7ed1b90b22769a34f1dc0a6e3","first_computed_at":"2026-05-18T00:58:17.014069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.014069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I+Bs5gIvtzciOFnAl0iITWKVO4aPTQOqpzFp/2uMGOUuN7pNQ3RjbsrT8XS4bWukrtTxH4zc/eBooAUARMkPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.014768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6679","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8668f313d82bde84093cb0ec50252657ac84b20477d0da57ec09f9d1dd52f8e9","sha256:514cf31677a7d8b546679f40f60b71c0c29fdd17beaa65dd6ff7a12e6b0fd34f"],"state_sha256":"1afb455dc8b17a9721297b0b893aeeedc2219450009818ab2dc848b20fb32483"}