{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:Z4U5ZEPHMJUKDY4TAWLKCHLEGH","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":"6aceeb7c1bcd2296364ccce183a8050fd6870e30ff36eebc6f2b6448f7c8ca1e","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-27T23:13:57Z","title_canon_sha256":"cd411ec5490584775dd7e57c5a22d481d9192fda748bc061b435f102fe02d014"},"schema_version":"1.0","source":{"id":"2112.13934","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.13934","created_at":"2026-07-05T06:35:03Z"},{"alias_kind":"arxiv_version","alias_value":"2112.13934v3","created_at":"2026-07-05T06:35:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13934","created_at":"2026-07-05T06:35:03Z"},{"alias_kind":"pith_short_12","alias_value":"Z4U5ZEPHMJUK","created_at":"2026-07-05T06:35:03Z"},{"alias_kind":"pith_short_16","alias_value":"Z4U5ZEPHMJUKDY4T","created_at":"2026-07-05T06:35:03Z"},{"alias_kind":"pith_short_8","alias_value":"Z4U5ZEPH","created_at":"2026-07-05T06:35:03Z"}],"graph_snapshots":[{"event_id":"sha256:f9522a5822dd3f6896979d22edc2e7abaae77575122702a730cf0c27b713db92","target":"graph","created_at":"2026-07-05T06:35:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.13934/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Allison Beemer, Joerg Kliewer, Salman Habib","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-27T23:13:57Z","title":"RELDEC: Reinforcement Learning-Based Decoding of Moderate Length LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13934","kind":"arxiv","version":3},"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:5167332acc5f719818c4c6deb261b18bfe6a72ea0e20a9aa93b938dc7e3ca4e3","target":"record","created_at":"2026-07-05T06:35:03Z","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":"6aceeb7c1bcd2296364ccce183a8050fd6870e30ff36eebc6f2b6448f7c8ca1e","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-27T23:13:57Z","title_canon_sha256":"cd411ec5490584775dd7e57c5a22d481d9192fda748bc061b435f102fe02d014"},"schema_version":"1.0","source":{"id":"2112.13934","kind":"arxiv","version":3}},"canonical_sha256":"cf29dc91e76268a1e3930596a11d6431d85abf3c316135db331eddb8cc620c6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf29dc91e76268a1e3930596a11d6431d85abf3c316135db331eddb8cc620c6f","first_computed_at":"2026-07-05T06:35:03.504808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:35:03.504808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NiEFBNArBhltI/8WjhrjpSCAsZijC+MELhtVJgUEiN7alrGvnSAbG2LRy3B2NyqigI2+hP8UwQXensn+iACvDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:35:03.505371Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.13934","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5167332acc5f719818c4c6deb261b18bfe6a72ea0e20a9aa93b938dc7e3ca4e3","sha256:f9522a5822dd3f6896979d22edc2e7abaae77575122702a730cf0c27b713db92"],"state_sha256":"155442f5829be2914851208bf92acea20db001387360a506b8cdd233341666d9"}