{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EEILXXXARTINQSO3WYG7KXQU6G","short_pith_number":"pith:EEILXXXA","canonical_record":{"source":{"id":"1706.07043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-21T06:46:14Z","cross_cats_sorted":["cs.NE","math.IT"],"title_canon_sha256":"a354fa5acb41fc484f82188c66aed15b2c504c3c315e5130082852f8a37369e3","abstract_canon_sha256":"535b402bca3091d615d6b544c8d5875fe74b579600a774a130f9e33e0d64d873"},"schema_version":"1.0"},"canonical_sha256":"2110bbdee08cd0d849dbb60df55e14f1bc15d12b34e1b71f4ecb97573b0e75f1","source":{"kind":"arxiv","id":"1706.07043","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07043","created_at":"2026-05-18T00:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07043v2","created_at":"2026-05-18T00:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07043","created_at":"2026-05-18T00:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"EEILXXXARTIN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEILXXXARTINQSO3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEILXXXA","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EEILXXXARTINQSO3WYG7KXQU6G","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-21T06:46:14Z","cross_cats_sorted":["cs.NE","math.IT"],"title_canon_sha256":"a354fa5acb41fc484f82188c66aed15b2c504c3c315e5130082852f8a37369e3","abstract_canon_sha256":"535b402bca3091d615d6b544c8d5875fe74b579600a774a130f9e33e0d64d873"},"schema_version":"1.0"},"canonical_sha256":"2110bbdee08cd0d849dbb60df55e14f1bc15d12b34e1b71f4ecb97573b0e75f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:13.583390Z","signature_b64":"Yz3l/enJfnalWQleWD281p3n1J34g06Ys45UKqww66Z5mdNpEoAHZ6vi4mmfdWG+30NhPLXwXMw7qbKPQOwcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2110bbdee08cd0d849dbb60df55e14f1bc15d12b34e1b71f4ecb97573b0e75f1","last_reissued_at":"2026-05-18T00:21:13.582938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:13.582938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07043","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jqKHx028gWDGUipolnLsJzkTAu5m5wC6JRrcbOsXFjI2Y+MvHvj0s9pT4W8Q+Ft2S9qY9LviePAVnOPp7EYGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:03:51.069373Z"},"content_sha256":"5ef3a3648ff1578ccb52b3bafb029e384f05e966f9ad6e09bb1981b598b2ce0e","schema_version":"1.0","event_id":"sha256:5ef3a3648ff1578ccb52b3bafb029e384f05e966f9ad6e09bb1981b598b2ce0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EEILXXXARTINQSO3WYG7KXQU6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Learning Methods for Improved Decoding of Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.IT"],"primary_cat":"cs.IT","authors_text":"David Burshtein, Elad Marciano, Eliya Nachmani, Loren Lugosch, Warren J. Gross, Yair Beery","submitted_at":"2017-06-21T06:46:14Z","abstract_excerpt":"The problem of low complexity, close to optimal, channel decoding of linear codes with short to moderate block length is considered. It is shown that deep learning methods can be used to improve a standard belief propagation decoder, despite the large example space. Similar improvements are obtained for the min-sum algorithm. It is also shown that tying the parameters of the decoders across iterations, so as to form a recurrent neural network architecture, can be implemented with comparable results. The advantage is that significantly less parameters are required. We also introduce a recurrent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07043","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GbfHVEisbC6UGXPaiHWtoSGfJlUeMb+KJYjWekDC/EVOEtrCQ/edUT2YQat9OcKqgyGDac+QVI/S7Qi1hw2cCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:03:51.070071Z"},"content_sha256":"e4e0f384e495053c97a1d487914909fe1c31938e63b4cbec793ff65185cd46e5","schema_version":"1.0","event_id":"sha256:e4e0f384e495053c97a1d487914909fe1c31938e63b4cbec793ff65185cd46e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEILXXXARTINQSO3WYG7KXQU6G/bundle.json","state_url":"https://pith.science/pith/EEILXXXARTINQSO3WYG7KXQU6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEILXXXARTINQSO3WYG7KXQU6G/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T08:03:51Z","links":{"resolver":"https://pith.science/pith/EEILXXXARTINQSO3WYG7KXQU6G","bundle":"https://pith.science/pith/EEILXXXARTINQSO3WYG7KXQU6G/bundle.json","state":"https://pith.science/pith/EEILXXXARTINQSO3WYG7KXQU6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEILXXXARTINQSO3WYG7KXQU6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EEILXXXARTINQSO3WYG7KXQU6G","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":"535b402bca3091d615d6b544c8d5875fe74b579600a774a130f9e33e0d64d873","cross_cats_sorted":["cs.NE","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-21T06:46:14Z","title_canon_sha256":"a354fa5acb41fc484f82188c66aed15b2c504c3c315e5130082852f8a37369e3"},"schema_version":"1.0","source":{"id":"1706.07043","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07043","created_at":"2026-05-18T00:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07043v2","created_at":"2026-05-18T00:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07043","created_at":"2026-05-18T00:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"EEILXXXARTIN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEILXXXARTINQSO3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEILXXXA","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:e4e0f384e495053c97a1d487914909fe1c31938e63b4cbec793ff65185cd46e5","target":"graph","created_at":"2026-05-18T00:21:13Z","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":"The problem of low complexity, close to optimal, channel decoding of linear codes with short to moderate block length is considered. It is shown that deep learning methods can be used to improve a standard belief propagation decoder, despite the large example space. Similar improvements are obtained for the min-sum algorithm. It is also shown that tying the parameters of the decoders across iterations, so as to form a recurrent neural network architecture, can be implemented with comparable results. The advantage is that significantly less parameters are required. We also introduce a recurrent","authors_text":"David Burshtein, Elad Marciano, Eliya Nachmani, Loren Lugosch, Warren J. Gross, Yair Beery","cross_cats":["cs.NE","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-21T06:46:14Z","title":"Deep Learning Methods for Improved Decoding of Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07043","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:5ef3a3648ff1578ccb52b3bafb029e384f05e966f9ad6e09bb1981b598b2ce0e","target":"record","created_at":"2026-05-18T00:21:13Z","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":"535b402bca3091d615d6b544c8d5875fe74b579600a774a130f9e33e0d64d873","cross_cats_sorted":["cs.NE","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-21T06:46:14Z","title_canon_sha256":"a354fa5acb41fc484f82188c66aed15b2c504c3c315e5130082852f8a37369e3"},"schema_version":"1.0","source":{"id":"1706.07043","kind":"arxiv","version":2}},"canonical_sha256":"2110bbdee08cd0d849dbb60df55e14f1bc15d12b34e1b71f4ecb97573b0e75f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2110bbdee08cd0d849dbb60df55e14f1bc15d12b34e1b71f4ecb97573b0e75f1","first_computed_at":"2026-05-18T00:21:13.582938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:13.582938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yz3l/enJfnalWQleWD281p3n1J34g06Ys45UKqww66Z5mdNpEoAHZ6vi4mmfdWG+30NhPLXwXMw7qbKPQOwcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:13.583390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07043","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ef3a3648ff1578ccb52b3bafb029e384f05e966f9ad6e09bb1981b598b2ce0e","sha256:e4e0f384e495053c97a1d487914909fe1c31938e63b4cbec793ff65185cd46e5"],"state_sha256":"493ca097825adb5ffe2eb5d36d2bec9c96decb56f075fb90a62b33bbeee807aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGbDRH99Mp+oiixWPsZXeJMz1ytEZ1LjdYQQLpD07k67eQGzck9wWckl97eMjtvq+mG5KQQg5Id1fVKX6SXRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:03:51.073926Z","bundle_sha256":"75a61a585bf290449ff15736d5ec9ead909fd287ae17366ce7db5259143519c1"}}