{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HDHXRZIY5DECCIVH5ET4EUOFLI","short_pith_number":"pith:HDHXRZIY","schema_version":"1.0","canonical_sha256":"38cf78e518e8c82122a7e927c251c55a0d860b2bc59cb6651426026778e3dd31","source":{"kind":"arxiv","id":"2207.14742","version":2},"attestation_state":"computed","paper":{"title":"Graph Neural Networks for Channel Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Keller, Fay\\c{c}al A\\\"it Aoudia, Jakob Hoydis, Sebastian Cammerer","submitted_at":"2022-07-29T15:29:18Z","abstract_excerpt":"In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph that represents the forward error correction (FEC) code structure by replacing node and edge message updates with trainable functions. Contrary to many other deep learning-based decoding approaches, the proposed solution enjoys scalability to arbit"},"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":"2207.14742","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-07-29T15:29:18Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"d0caf07b8dc2b2ac07b14fdb27ae61b6ffc112f101c7f7d6f906e861a0dbc657","abstract_canon_sha256":"48fa44d94b54055d4c63574e287366a557266280587f7d19ca72cdd7a6b1435f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:49.705211Z","signature_b64":"CeAGb0kmNuCyltFlcIXqra4LdQkrd9gZMuKB59DapQ0uaEirr9iCKg8uia9iladB6sjQgBafAldEd6UMkxm1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38cf78e518e8c82122a7e927c251c55a0d860b2bc59cb6651426026778e3dd31","last_reissued_at":"2026-07-05T05:05:49.704795Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:49.704795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Networks for Channel Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Keller, Fay\\c{c}al A\\\"it Aoudia, Jakob Hoydis, Sebastian Cammerer","submitted_at":"2022-07-29T15:29:18Z","abstract_excerpt":"In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph that represents the forward error correction (FEC) code structure by replacing node and edge message updates with trainable functions. Contrary to many other deep learning-based decoding approaches, the proposed solution enjoys scalability to arbit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.14742","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.14742/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.14742","created_at":"2026-07-05T05:05:49.704845+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.14742v2","created_at":"2026-07-05T05:05:49.704845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.14742","created_at":"2026-07-05T05:05:49.704845+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDHXRZIY5DEC","created_at":"2026-07-05T05:05:49.704845+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDHXRZIY5DECCIVH","created_at":"2026-07-05T05:05:49.704845+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDHXRZIY","created_at":"2026-07-05T05:05:49.704845+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14102","citing_title":"5G LDPC Linear Transformer for Channel Decoding","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDHXRZIY5DECCIVH5ET4EUOFLI","json":"https://pith.science/pith/HDHXRZIY5DECCIVH5ET4EUOFLI.json","graph_json":"https://pith.science/api/pith-number/HDHXRZIY5DECCIVH5ET4EUOFLI/graph.json","events_json":"https://pith.science/api/pith-number/HDHXRZIY5DECCIVH5ET4EUOFLI/events.json","paper":"https://pith.science/paper/HDHXRZIY"},"agent_actions":{"view_html":"https://pith.science/pith/HDHXRZIY5DECCIVH5ET4EUOFLI","download_json":"https://pith.science/pith/HDHXRZIY5DECCIVH5ET4EUOFLI.json","view_paper":"https://pith.science/paper/HDHXRZIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.14742&json=true","fetch_graph":"https://pith.science/api/pith-number/HDHXRZIY5DECCIVH5ET4EUOFLI/graph.json","fetch_events":"https://pith.science/api/pith-number/HDHXRZIY5DECCIVH5ET4EUOFLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDHXRZIY5DECCIVH5ET4EUOFLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDHXRZIY5DECCIVH5ET4EUOFLI/action/storage_attestation","attest_author":"https://pith.science/pith/HDHXRZIY5DECCIVH5ET4EUOFLI/action/author_attestation","sign_citation":"https://pith.science/pith/HDHXRZIY5DECCIVH5ET4EUOFLI/action/citation_signature","submit_replication":"https://pith.science/pith/HDHXRZIY5DECCIVH5ET4EUOFLI/action/replication_record"}},"created_at":"2026-07-05T05:05:49.704845+00:00","updated_at":"2026-07-05T05:05:49.704845+00:00"}