{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DUTGKQQYJCWCVGTYY6YNI43GBB","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":"afce79cb89ea108e47436e251f8ab360ace592e0607c1af2b758df7bac3a1e7d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-15T14:58:14Z","title_canon_sha256":"34bf5b155c11ee737160932a4babecf322c0c5564f067c890a43a1cace3bb8c2"},"schema_version":"1.0","source":{"id":"1212.3689","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3689","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3689v3","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3689","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"DUTGKQQYJCWC","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DUTGKQQYJCWCVGTY","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DUTGKQQY","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:1ae7d0f9e3d1eec3579a6f55b222cdf93d275579ed03cbbae231337e6fc7d8dd","target":"graph","created_at":"2026-05-18T03:09:12Z","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 shows that the logarithm of the epsilon-error capacity (average error probability) for n uses of a discrete memoryless channel is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2 log n + O(1) if the epsilon-dispersion of the channel is positive. This matches a lower bound by Y. Polyanskiy (2010) for discrete memoryless channels with positive reverse dispersion. If the epsilon-dispersion vanishes, the logarithm of the epsilon-error capacity is upper bounded by the n times the capacity plus a constant term except for a small class of DMCs and ","authors_text":"Marco Tomamichel, Vincent Y. F. Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-15T14:58:14Z","title":"A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3689","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:e1ff0303b6e36d3b68c8147f3fe6ad5b2f764f935765dd5e676d36a444dda6bb","target":"record","created_at":"2026-05-18T03:09:12Z","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":"afce79cb89ea108e47436e251f8ab360ace592e0607c1af2b758df7bac3a1e7d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-15T14:58:14Z","title_canon_sha256":"34bf5b155c11ee737160932a4babecf322c0c5564f067c890a43a1cace3bb8c2"},"schema_version":"1.0","source":{"id":"1212.3689","kind":"arxiv","version":3}},"canonical_sha256":"1d2665421848ac2a9a78c7b0d47366086962c9e31c66b3f2a1742dc54a70aed6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d2665421848ac2a9a78c7b0d47366086962c9e31c66b3f2a1742dc54a70aed6","first_computed_at":"2026-05-18T03:09:12.972215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:12.972215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"np2fK3tjfyn3U25x+zEA+NC1jLwjpiAMmaCTIeR6uwsT0245CW2wrGRyQUiyvJ1PqcnsRG+xx0giv79LwR9CBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:12.972695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3689","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1ff0303b6e36d3b68c8147f3fe6ad5b2f764f935765dd5e676d36a444dda6bb","sha256:1ae7d0f9e3d1eec3579a6f55b222cdf93d275579ed03cbbae231337e6fc7d8dd"],"state_sha256":"58d14884df10e205359d1b5f32d041e58295458f81120faaf8b82d8d986a5fd3"}