{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DUTGKQQYJCWCVGTYY6YNI43GBB","short_pith_number":"pith:DUTGKQQY","schema_version":"1.0","canonical_sha256":"1d2665421848ac2a9a78c7b0d47366086962c9e31c66b3f2a1742dc54a70aed6","source":{"kind":"arxiv","id":"1212.3689","version":3},"attestation_state":"computed","paper":{"title":"A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Tomamichel, Vincent Y. F. Tan","submitted_at":"2012-12-15T14:58:14Z","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 "},"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":"1212.3689","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-15T14:58:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34bf5b155c11ee737160932a4babecf322c0c5564f067c890a43a1cace3bb8c2","abstract_canon_sha256":"afce79cb89ea108e47436e251f8ab360ace592e0607c1af2b758df7bac3a1e7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:12.972695Z","signature_b64":"np2fK3tjfyn3U25x+zEA+NC1jLwjpiAMmaCTIeR6uwsT0245CW2wrGRyQUiyvJ1PqcnsRG+xx0giv79LwR9CBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d2665421848ac2a9a78c7b0d47366086962c9e31c66b3f2a1742dc54a70aed6","last_reissued_at":"2026-05-18T03:09:12.972215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:12.972215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Tomamichel, Vincent Y. F. Tan","submitted_at":"2012-12-15T14:58:14Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3689","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":"1212.3689","created_at":"2026-05-18T03:09:12.972281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3689v3","created_at":"2026-05-18T03:09:12.972281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3689","created_at":"2026-05-18T03:09:12.972281+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUTGKQQYJCWC","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUTGKQQYJCWCVGTY","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUTGKQQY","created_at":"2026-05-18T12:27:04.183437+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/DUTGKQQYJCWCVGTYY6YNI43GBB","json":"https://pith.science/pith/DUTGKQQYJCWCVGTYY6YNI43GBB.json","graph_json":"https://pith.science/api/pith-number/DUTGKQQYJCWCVGTYY6YNI43GBB/graph.json","events_json":"https://pith.science/api/pith-number/DUTGKQQYJCWCVGTYY6YNI43GBB/events.json","paper":"https://pith.science/paper/DUTGKQQY"},"agent_actions":{"view_html":"https://pith.science/pith/DUTGKQQYJCWCVGTYY6YNI43GBB","download_json":"https://pith.science/pith/DUTGKQQYJCWCVGTYY6YNI43GBB.json","view_paper":"https://pith.science/paper/DUTGKQQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3689&json=true","fetch_graph":"https://pith.science/api/pith-number/DUTGKQQYJCWCVGTYY6YNI43GBB/graph.json","fetch_events":"https://pith.science/api/pith-number/DUTGKQQYJCWCVGTYY6YNI43GBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUTGKQQYJCWCVGTYY6YNI43GBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUTGKQQYJCWCVGTYY6YNI43GBB/action/storage_attestation","attest_author":"https://pith.science/pith/DUTGKQQYJCWCVGTYY6YNI43GBB/action/author_attestation","sign_citation":"https://pith.science/pith/DUTGKQQYJCWCVGTYY6YNI43GBB/action/citation_signature","submit_replication":"https://pith.science/pith/DUTGKQQYJCWCVGTYY6YNI43GBB/action/replication_record"}},"created_at":"2026-05-18T03:09:12.972281+00:00","updated_at":"2026-05-18T03:09:12.972281+00:00"}