{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CYPM6KAGEC7WTWK6YKE5XCG75I","short_pith_number":"pith:CYPM6KAG","schema_version":"1.0","canonical_sha256":"161ecf280620bf69d95ec289db88dfea052ed6e22183dfc371dfbb5af8cd2ab2","source":{"kind":"arxiv","id":"1312.6875","version":1},"attestation_state":"computed","paper":{"title":"Refinement of the random coding bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aaron B. Wagner, Yucel Altug","submitted_at":"2013-12-24T19:16:59Z","abstract_excerpt":"An improved pre-factor for the random coding bound is proved. Specifically, for channels with critical rate not equal to capacity, if a regularity condition is satisfied (resp. not satisfied), then for any $\\epsilon >0$ a pre-factor of $O(N^{-\\frac{1}{2}\\left( 1 - \\epsilon + \\bar{\\rho}^\\ast_R \\right)})$ (resp. $O(N^{-\\frac{1}{2}})$) is achievable for rates above the critical rate, where $N$ and $R$ is the blocklength and rate, respectively. The extra term $\\bar{\\rho}^\\ast_R$ is related to the slope of the random coding exponent. Further, the relation of these bounds with the authors' recent re"},"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":"1312.6875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-24T19:16:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b575c94a56d8f79572942b214d375d721587c2688d0afc20ae70f6d7a4f8d4f0","abstract_canon_sha256":"9eabee682ec36ad50c43aa18f066c850effcf27767d02b74b65e474174a7f35a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:55.778082Z","signature_b64":"vSznTmplj2xWIFfC71miRJEVHwSRzO3lHySg8UeG5qA2hx4FJXr4NB6Nm+yq+qSulx7PLa/UAFKRJ0cnQ3XvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"161ecf280620bf69d95ec289db88dfea052ed6e22183dfc371dfbb5af8cd2ab2","last_reissued_at":"2026-05-18T03:03:55.777312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:55.777312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Refinement of the random coding bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aaron B. Wagner, Yucel Altug","submitted_at":"2013-12-24T19:16:59Z","abstract_excerpt":"An improved pre-factor for the random coding bound is proved. Specifically, for channels with critical rate not equal to capacity, if a regularity condition is satisfied (resp. not satisfied), then for any $\\epsilon >0$ a pre-factor of $O(N^{-\\frac{1}{2}\\left( 1 - \\epsilon + \\bar{\\rho}^\\ast_R \\right)})$ (resp. $O(N^{-\\frac{1}{2}})$) is achievable for rates above the critical rate, where $N$ and $R$ is the blocklength and rate, respectively. The extra term $\\bar{\\rho}^\\ast_R$ is related to the slope of the random coding exponent. Further, the relation of these bounds with the authors' recent re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6875","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":"1312.6875","created_at":"2026-05-18T03:03:55.777443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6875v1","created_at":"2026-05-18T03:03:55.777443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6875","created_at":"2026-05-18T03:03:55.777443+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYPM6KAGEC7W","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYPM6KAGEC7WTWK6","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYPM6KAG","created_at":"2026-05-18T12:27:40.988391+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/CYPM6KAGEC7WTWK6YKE5XCG75I","json":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I.json","graph_json":"https://pith.science/api/pith-number/CYPM6KAGEC7WTWK6YKE5XCG75I/graph.json","events_json":"https://pith.science/api/pith-number/CYPM6KAGEC7WTWK6YKE5XCG75I/events.json","paper":"https://pith.science/paper/CYPM6KAG"},"agent_actions":{"view_html":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I","download_json":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I.json","view_paper":"https://pith.science/paper/CYPM6KAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6875&json=true","fetch_graph":"https://pith.science/api/pith-number/CYPM6KAGEC7WTWK6YKE5XCG75I/graph.json","fetch_events":"https://pith.science/api/pith-number/CYPM6KAGEC7WTWK6YKE5XCG75I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/action/storage_attestation","attest_author":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/action/author_attestation","sign_citation":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/action/citation_signature","submit_replication":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/action/replication_record"}},"created_at":"2026-05-18T03:03:55.777443+00:00","updated_at":"2026-05-18T03:03:55.777443+00:00"}