{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5GQ2TFODS5MUR2ISUZI6TD4OC3","short_pith_number":"pith:5GQ2TFOD","schema_version":"1.0","canonical_sha256":"e9a1a995c3975948e912a651e98f8e16c43daca3400923dd6189cfdf925320bd","source":{"kind":"arxiv","id":"1303.0572","version":1},"attestation_state":"computed","paper":{"title":"New Non-asymptotic Random Channel Coding Theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"En-hui Yang, Jin Meng","submitted_at":"2013-03-03T21:32:43Z","abstract_excerpt":"New non-asymptotic random coding theorems (with error probability $\\epsilon$ and finite block length $n$) based on Gallager parity check ensemble and Shannon random code ensemble with a fixed codeword type are established for discrete input arbitrary output channels. The resulting non-asymptotic achievability bounds, when combined with non-asymptotic equipartition properties developed in the paper, can be easily computed. Analytically, these non-asymptotic achievability bounds are shown to be asymptotically tight up to the second order of the coding rate as $n$ goes to infinity with either con"},"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":"1303.0572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-03T21:32:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e8e22a05b5d1aedf0b128e079236f3039be6b8c3dc8c6559c2784fbdf20cede6","abstract_canon_sha256":"d664a2073a73f56c46d5861f162dbe44d815fb5ee8e2128fc9019b6bb15bf417"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:55.544141Z","signature_b64":"XuVvBNiRq0i4pYtcRiTFVi15yOdaJN7XWHKee5QN9tPm6l82SzqoCT/ZgOqTrmgQ0/rcgCywz1Ps06tq2aV4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9a1a995c3975948e912a651e98f8e16c43daca3400923dd6189cfdf925320bd","last_reissued_at":"2026-05-18T03:31:55.543356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:55.543356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Non-asymptotic Random Channel Coding Theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"En-hui Yang, Jin Meng","submitted_at":"2013-03-03T21:32:43Z","abstract_excerpt":"New non-asymptotic random coding theorems (with error probability $\\epsilon$ and finite block length $n$) based on Gallager parity check ensemble and Shannon random code ensemble with a fixed codeword type are established for discrete input arbitrary output channels. The resulting non-asymptotic achievability bounds, when combined with non-asymptotic equipartition properties developed in the paper, can be easily computed. Analytically, these non-asymptotic achievability bounds are shown to be asymptotically tight up to the second order of the coding rate as $n$ goes to infinity with either con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0572","kind":"arxiv","version":1},"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":"1303.0572","created_at":"2026-05-18T03:31:55.543498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.0572v1","created_at":"2026-05-18T03:31:55.543498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0572","created_at":"2026-05-18T03:31:55.543498+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GQ2TFODS5MU","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GQ2TFODS5MUR2IS","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GQ2TFOD","created_at":"2026-05-18T12:27:34.582898+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/5GQ2TFODS5MUR2ISUZI6TD4OC3","json":"https://pith.science/pith/5GQ2TFODS5MUR2ISUZI6TD4OC3.json","graph_json":"https://pith.science/api/pith-number/5GQ2TFODS5MUR2ISUZI6TD4OC3/graph.json","events_json":"https://pith.science/api/pith-number/5GQ2TFODS5MUR2ISUZI6TD4OC3/events.json","paper":"https://pith.science/paper/5GQ2TFOD"},"agent_actions":{"view_html":"https://pith.science/pith/5GQ2TFODS5MUR2ISUZI6TD4OC3","download_json":"https://pith.science/pith/5GQ2TFODS5MUR2ISUZI6TD4OC3.json","view_paper":"https://pith.science/paper/5GQ2TFOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.0572&json=true","fetch_graph":"https://pith.science/api/pith-number/5GQ2TFODS5MUR2ISUZI6TD4OC3/graph.json","fetch_events":"https://pith.science/api/pith-number/5GQ2TFODS5MUR2ISUZI6TD4OC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GQ2TFODS5MUR2ISUZI6TD4OC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GQ2TFODS5MUR2ISUZI6TD4OC3/action/storage_attestation","attest_author":"https://pith.science/pith/5GQ2TFODS5MUR2ISUZI6TD4OC3/action/author_attestation","sign_citation":"https://pith.science/pith/5GQ2TFODS5MUR2ISUZI6TD4OC3/action/citation_signature","submit_replication":"https://pith.science/pith/5GQ2TFODS5MUR2ISUZI6TD4OC3/action/replication_record"}},"created_at":"2026-05-18T03:31:55.543498+00:00","updated_at":"2026-05-18T03:31:55.543498+00:00"}