{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PKEE2W73BZPR2BQHWCYNGZCZZI","short_pith_number":"pith:PKEE2W73","schema_version":"1.0","canonical_sha256":"7a884d5bfb0e5f1d0607b0b0d36459ca35a531116da3192a95ea667b8e9c16bd","source":{"kind":"arxiv","id":"1208.1924","version":1},"attestation_state":"computed","paper":{"title":"Moderate Deviations in Channel Coding","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":"2012-08-09T14:41:39Z","abstract_excerpt":"We consider block codes whose rate converges to the channel capacity with increasing block length at a certain speed and examine the best possible decay of the probability of error. We prove that a moderate deviation principle holds for all convergence rates between the large deviation and the central limit theorem regimes."},"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":"1208.1924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-09T14:41:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53abf9ca2f0301edcbac6f3b8e259aaf7d6dc59151bfaf1ef91aa63a1e5e26fb","abstract_canon_sha256":"32403a4f9f9f28430c9ef0b6e537a56e5934bc3d0bd93bf7cbcb93697782cf9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:01.367446Z","signature_b64":"lmXf8d49jpT14I/Gw9SzypyXAi+i0PtDflB8E5Q1/LJ38Nn2ruAHy0t68jOGt88t23kppizsnOshtfyYH/g9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a884d5bfb0e5f1d0607b0b0d36459ca35a531116da3192a95ea667b8e9c16bd","last_reissued_at":"2026-05-18T02:21:01.366783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:01.366783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Moderate Deviations in Channel Coding","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":"2012-08-09T14:41:39Z","abstract_excerpt":"We consider block codes whose rate converges to the channel capacity with increasing block length at a certain speed and examine the best possible decay of the probability of error. We prove that a moderate deviation principle holds for all convergence rates between the large deviation and the central limit theorem regimes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1924","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":"1208.1924","created_at":"2026-05-18T02:21:01.366868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1924v1","created_at":"2026-05-18T02:21:01.366868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1924","created_at":"2026-05-18T02:21:01.366868+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKEE2W73BZPR","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKEE2W73BZPR2BQH","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKEE2W73","created_at":"2026-05-18T12:27:18.751474+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/PKEE2W73BZPR2BQHWCYNGZCZZI","json":"https://pith.science/pith/PKEE2W73BZPR2BQHWCYNGZCZZI.json","graph_json":"https://pith.science/api/pith-number/PKEE2W73BZPR2BQHWCYNGZCZZI/graph.json","events_json":"https://pith.science/api/pith-number/PKEE2W73BZPR2BQHWCYNGZCZZI/events.json","paper":"https://pith.science/paper/PKEE2W73"},"agent_actions":{"view_html":"https://pith.science/pith/PKEE2W73BZPR2BQHWCYNGZCZZI","download_json":"https://pith.science/pith/PKEE2W73BZPR2BQHWCYNGZCZZI.json","view_paper":"https://pith.science/paper/PKEE2W73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1924&json=true","fetch_graph":"https://pith.science/api/pith-number/PKEE2W73BZPR2BQHWCYNGZCZZI/graph.json","fetch_events":"https://pith.science/api/pith-number/PKEE2W73BZPR2BQHWCYNGZCZZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKEE2W73BZPR2BQHWCYNGZCZZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKEE2W73BZPR2BQHWCYNGZCZZI/action/storage_attestation","attest_author":"https://pith.science/pith/PKEE2W73BZPR2BQHWCYNGZCZZI/action/author_attestation","sign_citation":"https://pith.science/pith/PKEE2W73BZPR2BQHWCYNGZCZZI/action/citation_signature","submit_replication":"https://pith.science/pith/PKEE2W73BZPR2BQHWCYNGZCZZI/action/replication_record"}},"created_at":"2026-05-18T02:21:01.366868+00:00","updated_at":"2026-05-18T02:21:01.366868+00:00"}