{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:Z4U5ZEPHMJUKDY4TAWLKCHLEGH","short_pith_number":"pith:Z4U5ZEPH","schema_version":"1.0","canonical_sha256":"cf29dc91e76268a1e3930596a11d6431d85abf3c316135db331eddb8cc620c6f","source":{"kind":"arxiv","id":"2112.13934","version":3},"attestation_state":"computed","paper":{"title":"RELDEC: Reinforcement Learning-Based Decoding of Moderate Length LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Allison Beemer, Joerg Kliewer, Salman Habib","submitted_at":"2021-12-27T23:13:57Z","abstract_excerpt":"In this work we propose RELDEC, a novel approach for sequential decoding of moderate length low-density parity-check (LDPC) codes. The main idea behind RELDEC is that an optimized decoding policy is subsequently obtained via reinforcement learning based on a Markov decision process (MDP). In contrast to our previous work, where an agent learns to schedule only a single check node (CN) within a group (cluster) of CNs per iteration, in this work we train the agent to schedule all CNs in a cluster, and all clusters in every iteration. That is, in each learning step of RELDEC an agent learns to sc"},"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":"2112.13934","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-27T23:13:57Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"cd411ec5490584775dd7e57c5a22d481d9192fda748bc061b435f102fe02d014","abstract_canon_sha256":"6aceeb7c1bcd2296364ccce183a8050fd6870e30ff36eebc6f2b6448f7c8ca1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:03.505371Z","signature_b64":"NiEFBNArBhltI/8WjhrjpSCAsZijC+MELhtVJgUEiN7alrGvnSAbG2LRy3B2NyqigI2+hP8UwQXensn+iACvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf29dc91e76268a1e3930596a11d6431d85abf3c316135db331eddb8cc620c6f","last_reissued_at":"2026-07-05T06:35:03.504808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:03.504808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RELDEC: Reinforcement Learning-Based Decoding of Moderate Length LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Allison Beemer, Joerg Kliewer, Salman Habib","submitted_at":"2021-12-27T23:13:57Z","abstract_excerpt":"In this work we propose RELDEC, a novel approach for sequential decoding of moderate length low-density parity-check (LDPC) codes. The main idea behind RELDEC is that an optimized decoding policy is subsequently obtained via reinforcement learning based on a Markov decision process (MDP). In contrast to our previous work, where an agent learns to schedule only a single check node (CN) within a group (cluster) of CNs per iteration, in this work we train the agent to schedule all CNs in a cluster, and all clusters in every iteration. That is, in each learning step of RELDEC an agent learns to sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13934","kind":"arxiv","version":3},"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/2112.13934/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":"2112.13934","created_at":"2026-07-05T06:35:03.504866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.13934v3","created_at":"2026-07-05T06:35:03.504866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13934","created_at":"2026-07-05T06:35:03.504866+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z4U5ZEPHMJUK","created_at":"2026-07-05T06:35:03.504866+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z4U5ZEPHMJUKDY4T","created_at":"2026-07-05T06:35:03.504866+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z4U5ZEPH","created_at":"2026-07-05T06:35:03.504866+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20926","citing_title":"Learning-Based List Sequential Belief Propagation Decoding of Quantum LDPC Codes","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z4U5ZEPHMJUKDY4TAWLKCHLEGH","json":"https://pith.science/pith/Z4U5ZEPHMJUKDY4TAWLKCHLEGH.json","graph_json":"https://pith.science/api/pith-number/Z4U5ZEPHMJUKDY4TAWLKCHLEGH/graph.json","events_json":"https://pith.science/api/pith-number/Z4U5ZEPHMJUKDY4TAWLKCHLEGH/events.json","paper":"https://pith.science/paper/Z4U5ZEPH"},"agent_actions":{"view_html":"https://pith.science/pith/Z4U5ZEPHMJUKDY4TAWLKCHLEGH","download_json":"https://pith.science/pith/Z4U5ZEPHMJUKDY4TAWLKCHLEGH.json","view_paper":"https://pith.science/paper/Z4U5ZEPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.13934&json=true","fetch_graph":"https://pith.science/api/pith-number/Z4U5ZEPHMJUKDY4TAWLKCHLEGH/graph.json","fetch_events":"https://pith.science/api/pith-number/Z4U5ZEPHMJUKDY4TAWLKCHLEGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z4U5ZEPHMJUKDY4TAWLKCHLEGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z4U5ZEPHMJUKDY4TAWLKCHLEGH/action/storage_attestation","attest_author":"https://pith.science/pith/Z4U5ZEPHMJUKDY4TAWLKCHLEGH/action/author_attestation","sign_citation":"https://pith.science/pith/Z4U5ZEPHMJUKDY4TAWLKCHLEGH/action/citation_signature","submit_replication":"https://pith.science/pith/Z4U5ZEPHMJUKDY4TAWLKCHLEGH/action/replication_record"}},"created_at":"2026-07-05T06:35:03.504866+00:00","updated_at":"2026-07-05T06:35:03.504866+00:00"}