{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HJOBFV5XDLXYQFL5MN65HJF5LX","short_pith_number":"pith:HJOBFV5X","canonical_record":{"source":{"id":"1802.04741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-13T17:06:40Z","cross_cats_sorted":["cs.LG","cs.NE","math.IT"],"title_canon_sha256":"cd6376bc5d82c9a2ab1eb509349560e827d6b860297497eb14a06cc1318b3be7","abstract_canon_sha256":"b71dd55927bd75ee65a8ec20e83237029355cf763d88329d37eb23c53e71ef0e"},"schema_version":"1.0"},"canonical_sha256":"3a5c12d7b71aef88157d637dd3a4bd5dc75a1a0895c12d0d37f38efbd5159252","source":{"kind":"arxiv","id":"1802.04741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04741","created_at":"2026-05-18T00:22:38Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04741v1","created_at":"2026-05-18T00:22:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04741","created_at":"2026-05-18T00:22:38Z"},{"alias_kind":"pith_short_12","alias_value":"HJOBFV5XDLXY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HJOBFV5XDLXYQFL5","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HJOBFV5X","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HJOBFV5XDLXYQFL5MN65HJF5LX","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-13T17:06:40Z","cross_cats_sorted":["cs.LG","cs.NE","math.IT"],"title_canon_sha256":"cd6376bc5d82c9a2ab1eb509349560e827d6b860297497eb14a06cc1318b3be7","abstract_canon_sha256":"b71dd55927bd75ee65a8ec20e83237029355cf763d88329d37eb23c53e71ef0e"},"schema_version":"1.0"},"canonical_sha256":"3a5c12d7b71aef88157d637dd3a4bd5dc75a1a0895c12d0d37f38efbd5159252","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:38.773095Z","signature_b64":"EhdfF2yyKa02X3UKGkUiJGuo7ipV8g2PVi5aVgmEm3GiuKjJ9wP3z2kJnC4N1STTu6xl52Yhy87Dp4c8NZ+8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a5c12d7b71aef88157d637dd3a4bd5dc75a1a0895c12d0d37f38efbd5159252","last_reissued_at":"2026-05-18T00:22:38.772575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:38.772575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04741","source_version":1,"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:22:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEFSlTxfeqNa29GAw/2aUG0kzwzsJJWL/IFnCgWTqSSPuEhCR6FfWboju5Er1sPz7jzl778QJnSKSNZ6FfIyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:17:39.157116Z"},"content_sha256":"d6a8484e3d749f2e0fedecdd37fa5b2c248342a27887eeae2a18b7848e86674b","schema_version":"1.0","event_id":"sha256:d6a8484e3d749f2e0fedecdd37fa5b2c248342a27887eeae2a18b7848e86674b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HJOBFV5XDLXYQFL5MN65HJF5LX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Learning for Decoding of Linear Codes - A Syndrome-Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Bennatan, Pavel Kisilev, Yoni Choukroun","submitted_at":"2018-02-13T17:06:40Z","abstract_excerpt":"We present a novel framework for applying deep neural networks (DNN) to soft decoding of linear codes at arbitrary block lengths. Unlike other approaches, our framework allows unconstrained DNN design, enabling the free application of powerful designs that were developed in other contexts. Our method is robust to overfitting that inhibits many competing methods, which follows from the exponentially large number of codewords required for their training. We achieve this by transforming the channel output before feeding it to the network, extracting only the syndrome of the hard decisions and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04741","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"},"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:22:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1N0SF6FRTaQhSQ98YkgNRU7kh43jHhwZ26pyqVfDOu63BQ8yZKUZV0DnzIWkERSgklMg090jr/iOhnkHg+nIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:17:39.157715Z"},"content_sha256":"a60d59cb5f29d166662af6a82de1158776478fc79cfc3c2f122b3f6d602e83cf","schema_version":"1.0","event_id":"sha256:a60d59cb5f29d166662af6a82de1158776478fc79cfc3c2f122b3f6d602e83cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJOBFV5XDLXYQFL5MN65HJF5LX/bundle.json","state_url":"https://pith.science/pith/HJOBFV5XDLXYQFL5MN65HJF5LX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJOBFV5XDLXYQFL5MN65HJF5LX/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-25T13:17:39Z","links":{"resolver":"https://pith.science/pith/HJOBFV5XDLXYQFL5MN65HJF5LX","bundle":"https://pith.science/pith/HJOBFV5XDLXYQFL5MN65HJF5LX/bundle.json","state":"https://pith.science/pith/HJOBFV5XDLXYQFL5MN65HJF5LX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJOBFV5XDLXYQFL5MN65HJF5LX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HJOBFV5XDLXYQFL5MN65HJF5LX","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":"b71dd55927bd75ee65a8ec20e83237029355cf763d88329d37eb23c53e71ef0e","cross_cats_sorted":["cs.LG","cs.NE","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-13T17:06:40Z","title_canon_sha256":"cd6376bc5d82c9a2ab1eb509349560e827d6b860297497eb14a06cc1318b3be7"},"schema_version":"1.0","source":{"id":"1802.04741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04741","created_at":"2026-05-18T00:22:38Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04741v1","created_at":"2026-05-18T00:22:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04741","created_at":"2026-05-18T00:22:38Z"},{"alias_kind":"pith_short_12","alias_value":"HJOBFV5XDLXY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HJOBFV5XDLXYQFL5","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HJOBFV5X","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:a60d59cb5f29d166662af6a82de1158776478fc79cfc3c2f122b3f6d602e83cf","target":"graph","created_at":"2026-05-18T00:22:38Z","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":"We present a novel framework for applying deep neural networks (DNN) to soft decoding of linear codes at arbitrary block lengths. Unlike other approaches, our framework allows unconstrained DNN design, enabling the free application of powerful designs that were developed in other contexts. Our method is robust to overfitting that inhibits many competing methods, which follows from the exponentially large number of codewords required for their training. We achieve this by transforming the channel output before feeding it to the network, extracting only the syndrome of the hard decisions and the","authors_text":"Amir Bennatan, Pavel Kisilev, Yoni Choukroun","cross_cats":["cs.LG","cs.NE","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-13T17:06:40Z","title":"Deep Learning for Decoding of Linear Codes - A Syndrome-Based Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04741","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:d6a8484e3d749f2e0fedecdd37fa5b2c248342a27887eeae2a18b7848e86674b","target":"record","created_at":"2026-05-18T00:22:38Z","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":"b71dd55927bd75ee65a8ec20e83237029355cf763d88329d37eb23c53e71ef0e","cross_cats_sorted":["cs.LG","cs.NE","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-13T17:06:40Z","title_canon_sha256":"cd6376bc5d82c9a2ab1eb509349560e827d6b860297497eb14a06cc1318b3be7"},"schema_version":"1.0","source":{"id":"1802.04741","kind":"arxiv","version":1}},"canonical_sha256":"3a5c12d7b71aef88157d637dd3a4bd5dc75a1a0895c12d0d37f38efbd5159252","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a5c12d7b71aef88157d637dd3a4bd5dc75a1a0895c12d0d37f38efbd5159252","first_computed_at":"2026-05-18T00:22:38.772575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:38.772575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EhdfF2yyKa02X3UKGkUiJGuo7ipV8g2PVi5aVgmEm3GiuKjJ9wP3z2kJnC4N1STTu6xl52Yhy87Dp4c8NZ+8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:38.773095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6a8484e3d749f2e0fedecdd37fa5b2c248342a27887eeae2a18b7848e86674b","sha256:a60d59cb5f29d166662af6a82de1158776478fc79cfc3c2f122b3f6d602e83cf"],"state_sha256":"a8d5abd7bbfdc2e9b196213ed77bee888ad02c88d461e80c1f01726a1dd6a7e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MO2VQvzZ4s8Hhh5Ct/LbYbVC3J8zRA7cLiVbuQlbpWYTd9W+V6Wc6YqFFLwUy3v75t9m2QSAOsHaQCZNuILPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:17:39.160983Z","bundle_sha256":"85e369646c04f2d26da278e9aa9f9dceee06daf9f9a2758c2614c82b89c312af"}}