{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VC3HZ37TICQAYBKSSBEZWRF4OJ","short_pith_number":"pith:VC3HZ37T","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"},"canonical_sha256":"a8b67ceff340a00c055290499b44bc725c50e5d7ed1b90b22769a34f1dc0a6e3","source":{"kind":"arxiv","id":"1307.6679","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VC3HZ37TICQAYBKSSBEZWRF4OJ","target":"record","payload":{"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"},"canonical_sha256":"a8b67ceff340a00c055290499b44bc725c50e5d7ed1b90b22769a34f1dc0a6e3","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"},"source_kind":"arxiv","source_id":"1307.6679","source_version":3,"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-18T00:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hW3DTixDzx/PqgiFTD1oiuYn2xhxsT4o0NE3T6h7JHtDFc+3vAxQXCYgW3xtt4ORfjJpf1tR33OkcZrSmvPFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:50:02.233087Z"},"content_sha256":"8668f313d82bde84093cb0ec50252657ac84b20477d0da57ec09f9d1dd52f8e9","schema_version":"1.0","event_id":"sha256:8668f313d82bde84093cb0ec50252657ac84b20477d0da57ec09f9d1dd52f8e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VC3HZ37TICQAYBKSSBEZWRF4OJ","target":"graph","payload":{"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"},"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-18T00:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smDj4hOuQdHtpfvqF7x8g6wOagSO/Zg9rn/eHNSOqOvNqJg6PxxWBrnVIxUBTcghaXaWIFrP5iYtDrfxQ4nPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:50:02.233723Z"},"content_sha256":"514cf31677a7d8b546679f40f60b71c0c29fdd17beaa65dd6ff7a12e6b0fd34f","schema_version":"1.0","event_id":"sha256:514cf31677a7d8b546679f40f60b71c0c29fdd17beaa65dd6ff7a12e6b0fd34f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/bundle.json","state_url":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/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-05-27T11:50:02Z","links":{"resolver":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ","bundle":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/bundle.json","state":"https://pith.science/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VC3HZ37TICQAYBKSSBEZWRF4OJ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNfo2F2iS58ECl4M/yFSrbT1ixWJvmDJMKSYKGpdIpbZYppCnEnlUa0ImRpT6uWVD2uE+ho85UZfYSCOEGsvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:50:02.237373Z","bundle_sha256":"39132a10d8b72a9e0db0a6fd84418367a6941e830a6b2083c4cff7802372cf6b"}}