{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L3U35QGXB2553ODKCNXEMGXFVA","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":"68927c4aad9bdde40c9e3e5bfffd220b9b9e7c58e20ae32f9e7060a48706d50e","cross_cats_sorted":["cs.LG","cs.NE","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-24T12:49:29Z","title_canon_sha256":"03263e64de3bb5b564ac2c2d48c1b4f0557697f53e3f73c8f6be425e57f500e0"},"schema_version":"1.0","source":{"id":"1702.07560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07560","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07560v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07560","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"L3U35QGXB255","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L3U35QGXB2553ODK","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L3U35QGX","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:41b6adc411aef18d86d180bf7c9146f5852fd03d0faa958ae4c7e1225dd0c9e1","target":"graph","created_at":"2026-05-18T00:50:02Z","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":"Designing a practical, low complexity, close to optimal, channel decoder for powerful algebraic codes with short to moderate block length is an open research problem. Recently it has been shown that a feed-forward neural network architecture can improve on standard belief propagation decoding, despite the large example space. In this paper we introduce a recurrent neural network architecture for decoding linear block codes. Our method shows comparable bit error rate results compared to the feed-forward neural network with significantly less parameters. We also demonstrate improved performance ","authors_text":"David Burshtein, Elad Marciano, Eliya Nachmani, Yair Be'ery","cross_cats":["cs.LG","cs.NE","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-24T12:49:29Z","title":"RNN Decoding of Linear Block Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07560","kind":"arxiv","version":1},"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:86ae5cdaf6e3b3eb3daf188c8a6f3f09693621bd91a89652c9bdd49d9b31507f","target":"record","created_at":"2026-05-18T00:50:02Z","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":"68927c4aad9bdde40c9e3e5bfffd220b9b9e7c58e20ae32f9e7060a48706d50e","cross_cats_sorted":["cs.LG","cs.NE","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-24T12:49:29Z","title_canon_sha256":"03263e64de3bb5b564ac2c2d48c1b4f0557697f53e3f73c8f6be425e57f500e0"},"schema_version":"1.0","source":{"id":"1702.07560","kind":"arxiv","version":1}},"canonical_sha256":"5ee9bec0d70ebbddb86a136e461ae5a81cb37fc553098544bed9c00e240f3266","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ee9bec0d70ebbddb86a136e461ae5a81cb37fc553098544bed9c00e240f3266","first_computed_at":"2026-05-18T00:50:02.902910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.902910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WHwKJZuzACGgqzbm0nZuF/SKRRHuTFQQ/NG8QLAZ1g7mCNi8yT8ewjS3BQSBD+iBqMMYaiLJ5zV4d8qh3dPlAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.903595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86ae5cdaf6e3b3eb3daf188c8a6f3f09693621bd91a89652c9bdd49d9b31507f","sha256:41b6adc411aef18d86d180bf7c9146f5852fd03d0faa958ae4c7e1225dd0c9e1"],"state_sha256":"2cd42afc67001d2cd77696512bb337ff68c17efba8dbda14411afd95eb0464aa"}