{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VC3HZ37TICQAYBKSSBEZWRF4OJ","short_pith_number":"pith:VC3HZ37T","schema_version":"1.0","canonical_sha256":"a8b67ceff340a00c055290499b44bc725c50e5d7ed1b90b22769a34f1dc0a6e3","source":{"kind":"arxiv","id":"1307.6679","version":3},"attestation_state":"computed","paper":{"title":"Expurgated Random-Coding Ensembles: Exponents, Refinements and Connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert Guill\\'en i F\\`abregas, Alfonso Martinez, Jonathan Scarlett, Li Peng, Neri Merhav","submitted_at":"2013-07-25T09:44:44Z","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"},"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":"1307.6679","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-25T09:44:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"108f738e5bc2bed154758e74a6df88f0f03d852ef19566155f82dfa2141f91d8","abstract_canon_sha256":"cd4556451e3dfe85bd0e382ca1458da76e1d33327291659ed167f09307a4a3dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.014768Z","signature_b64":"I+Bs5gIvtzciOFnAl0iITWKVO4aPTQOqpzFp/2uMGOUuN7pNQ3RjbsrT8XS4bWukrtTxH4zc/eBooAUARMkPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8b67ceff340a00c055290499b44bc725c50e5d7ed1b90b22769a34f1dc0a6e3","last_reissued_at":"2026-05-18T00:58:17.014069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.014069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expurgated Random-Coding Ensembles: Exponents, Refinements and Connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert Guill\\'en i F\\`abregas, Alfonso Martinez, Jonathan Scarlett, Li Peng, Neri Merhav","submitted_at":"2013-07-25T09:44:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6679","kind":"arxiv","version":3},"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":"1307.6679","created_at":"2026-05-18T00:58:17.014188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6679v3","created_at":"2026-05-18T00:58:17.014188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6679","created_at":"2026-05-18T00:58:17.014188+00:00"},{"alias_kind":"pith_short_12","alias_value":"VC3HZ37TICQA","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VC3HZ37TICQAYBKS","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VC3HZ37T","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ","json":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ.json","graph_json":"https://pith.science/api/pith-number/VC3HZ37TICQAYBKSSBEZWRF4OJ/graph.json","events_json":"https://pith.science/api/pith-number/VC3HZ37TICQAYBKSSBEZWRF4OJ/events.json","paper":"https://pith.science/paper/VC3HZ37T"},"agent_actions":{"view_html":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ","download_json":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ.json","view_paper":"https://pith.science/paper/VC3HZ37T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6679&json=true","fetch_graph":"https://pith.science/api/pith-number/VC3HZ37TICQAYBKSSBEZWRF4OJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VC3HZ37TICQAYBKSSBEZWRF4OJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/action/storage_attestation","attest_author":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/action/author_attestation","sign_citation":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/action/citation_signature","submit_replication":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/action/replication_record"}},"created_at":"2026-05-18T00:58:17.014188+00:00","updated_at":"2026-05-18T00:58:17.014188+00:00"}