{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JDGXM5R3U3GK6XWIFW7BH3LMSE","short_pith_number":"pith:JDGXM5R3","schema_version":"1.0","canonical_sha256":"48cd76763ba6ccaf5ec82dbe13ed6c9130f1da7c45994f7eed18ebc328ddd820","source":{"kind":"arxiv","id":"1202.0813","version":2},"attestation_state":"computed","paper":{"title":"On The Performance of Random Block Codes over Finite-State Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fatemeh Hamidi-Sepehr, Henry Pfister, Jean-Francois Chamberland","submitted_at":"2012-02-03T20:46:35Z","abstract_excerpt":"As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffic. Among many ensuing engineering challenges is the need to better understand the fundamental limits of forward error correction in non-asymptotic regimes. This article seeks to characterize the performance of block codes over finite-state channels with memory. In particular, classical results from information theory are revisited in the context of channels with rate transitions, and bounds on the probabilities of de"},"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":"1202.0813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T20:46:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3da1e881185b27e42260d941689a8eb06ceeeadbfdd1e84989e2b295e9f6dffd","abstract_canon_sha256":"ebbec2c75ce742194643c4633d379c324d8d90af667f4fec10e89a5877b0b11a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:37.141205Z","signature_b64":"a+lhGhzmaYQpEX7IhbuZ6gCPKxHZcFSyN8eLk6ibIFfiqnjrydPrvTcUa8RxRaye72W17ZhzK5Pmsie3cvMRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48cd76763ba6ccaf5ec82dbe13ed6c9130f1da7c45994f7eed18ebc328ddd820","last_reissued_at":"2026-05-18T04:02:37.140656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:37.140656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On The Performance of Random Block Codes over Finite-State Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fatemeh Hamidi-Sepehr, Henry Pfister, Jean-Francois Chamberland","submitted_at":"2012-02-03T20:46:35Z","abstract_excerpt":"As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffic. Among many ensuing engineering challenges is the need to better understand the fundamental limits of forward error correction in non-asymptotic regimes. This article seeks to characterize the performance of block codes over finite-state channels with memory. In particular, classical results from information theory are revisited in the context of channels with rate transitions, and bounds on the probabilities of de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0813","kind":"arxiv","version":2},"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":"1202.0813","created_at":"2026-05-18T04:02:37.140743+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0813v2","created_at":"2026-05-18T04:02:37.140743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0813","created_at":"2026-05-18T04:02:37.140743+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDGXM5R3U3GK","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDGXM5R3U3GK6XWI","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDGXM5R3","created_at":"2026-05-18T12:27:11.947152+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/JDGXM5R3U3GK6XWIFW7BH3LMSE","json":"https://pith.science/pith/JDGXM5R3U3GK6XWIFW7BH3LMSE.json","graph_json":"https://pith.science/api/pith-number/JDGXM5R3U3GK6XWIFW7BH3LMSE/graph.json","events_json":"https://pith.science/api/pith-number/JDGXM5R3U3GK6XWIFW7BH3LMSE/events.json","paper":"https://pith.science/paper/JDGXM5R3"},"agent_actions":{"view_html":"https://pith.science/pith/JDGXM5R3U3GK6XWIFW7BH3LMSE","download_json":"https://pith.science/pith/JDGXM5R3U3GK6XWIFW7BH3LMSE.json","view_paper":"https://pith.science/paper/JDGXM5R3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0813&json=true","fetch_graph":"https://pith.science/api/pith-number/JDGXM5R3U3GK6XWIFW7BH3LMSE/graph.json","fetch_events":"https://pith.science/api/pith-number/JDGXM5R3U3GK6XWIFW7BH3LMSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDGXM5R3U3GK6XWIFW7BH3LMSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDGXM5R3U3GK6XWIFW7BH3LMSE/action/storage_attestation","attest_author":"https://pith.science/pith/JDGXM5R3U3GK6XWIFW7BH3LMSE/action/author_attestation","sign_citation":"https://pith.science/pith/JDGXM5R3U3GK6XWIFW7BH3LMSE/action/citation_signature","submit_replication":"https://pith.science/pith/JDGXM5R3U3GK6XWIFW7BH3LMSE/action/replication_record"}},"created_at":"2026-05-18T04:02:37.140743+00:00","updated_at":"2026-05-18T04:02:37.140743+00:00"}