{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M2OXCY5WK5ZEPAN7KUHUVNH4HN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d138835be2d25b4dc09afb545bd4a35b3a788137b0516912ba5080b98bfa6f14","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-06T10:34:50Z","title_canon_sha256":"a3a9f44d37e911a5caaf0a91ca8179102868c71b6047d24104c61627c17a4fa5"},"schema_version":"1.0","source":{"id":"1903.02295","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02295","created_at":"2026-05-17T23:47:48Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02295v2","created_at":"2026-05-17T23:47:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02295","created_at":"2026-05-17T23:47:48Z"},{"alias_kind":"pith_short_12","alias_value":"M2OXCY5WK5ZE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M2OXCY5WK5ZEPAN7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M2OXCY5W","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:3198f213dcbe5d05c427ff11c5ae87f96a0550a708e8af3afd3618276fc08265","target":"graph","created_at":"2026-05-17T23:47:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Present-day communication systems routinely use codes that approach the channel capacity when coupled with a computationally efficient decoder. However, the decoder is typically designed for the Gaussian noise channel and is known to be sub-optimal for non-Gaussian noise distribution. Deep learning methods offer a new approach for designing decoders that can be trained and tailored for arbitrary channel statistics. We focus on Turbo codes and propose DeepTurbo, a novel deep learning based architecture for Turbo decoding.\n  The standard Turbo decoder (Turbo) iteratively applies the Bahl-Cocke-J","authors_text":"Himanshu Asnani, Hyeji Kim, Pramod Viswanath, Sewoong Oh, Sreeram Kannan, Yihan Jiang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-06T10:34:50Z","title":"DeepTurbo: Deep Turbo Decoder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02295","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7315c1dcd6a4a6c8c7430b6db7c95b423cb79588b71e587670b4b523d95209e4","target":"record","created_at":"2026-05-17T23:47:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d138835be2d25b4dc09afb545bd4a35b3a788137b0516912ba5080b98bfa6f14","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-06T10:34:50Z","title_canon_sha256":"a3a9f44d37e911a5caaf0a91ca8179102868c71b6047d24104c61627c17a4fa5"},"schema_version":"1.0","source":{"id":"1903.02295","kind":"arxiv","version":2}},"canonical_sha256":"669d7163b657724781bf550f4ab4fc3b7a56ef9e340370cc2d8a243ed6c8a398","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"669d7163b657724781bf550f4ab4fc3b7a56ef9e340370cc2d8a243ed6c8a398","first_computed_at":"2026-05-17T23:47:48.272654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:48.272654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oS+EkLRAQbTejtlGKTty6hYSbXqIfniN1zEtJe7J6ZchrkxMJAtVTDD6S+Jx/VmJevHVxvWoT87NKaw3JudzCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:48.273234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02295","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7315c1dcd6a4a6c8c7430b6db7c95b423cb79588b71e587670b4b523d95209e4","sha256:3198f213dcbe5d05c427ff11c5ae87f96a0550a708e8af3afd3618276fc08265"],"state_sha256":"1916380d55df6ae05ff6c0055e5c29afbe6748ff9921cdd53acfbf4f23ab1d84"}