{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:L4A2YYOIUQFTNSZF5LKF4UZPZR","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":"c88bb7cc43e9d6c0b4dfee4c82bc60db73d8bbfbd019fad3e182a4bf62e35499","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-07-26T02:05:34Z","title_canon_sha256":"ae1a27db6c2625f2e8b8ff76db2156a74a1f71ee3e607d20f230127c3486ee9f"},"schema_version":"1.0","source":{"id":"2307.13905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.13905","created_at":"2026-07-05T06:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"2307.13905v1","created_at":"2026-07-05T06:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13905","created_at":"2026-07-05T06:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"L4A2YYOIUQFT","created_at":"2026-07-05T06:34:54Z"},{"alias_kind":"pith_short_16","alias_value":"L4A2YYOIUQFTNSZF","created_at":"2026-07-05T06:34:54Z"},{"alias_kind":"pith_short_8","alias_value":"L4A2YYOI","created_at":"2026-07-05T06:34:54Z"}],"graph_snapshots":[{"event_id":"sha256:8a4847f054951be279bdb3480878db448373ffe5f3b69888f463867d7cc19dca","target":"graph","created_at":"2026-07-05T06:34:54Z","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/2307.13905/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we propose reinforcement learning (RL) for sequential decoding of moderate length generalized low-density parity-check (GLDPC) codes. Here, sequential decoding refers to scheduling all the generalized constraint nodes (GCNs) and single parity-check nodes (SPCNs) of a GLDPC code serially in each iteration. A GLDPC decoding environment is modeled as a finite Markov decision process (MDP) in which the state-space comprises of all possible sequences of hard-decision values of the variables nodes (VNs) connected to the scheduled GCN or SPCN, and the action-space of the MDP consists of","authors_text":"David G. M. Mitchell, Salman Habib","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-07-26T02:05:34Z","title":"Reinforcement Learning for Sequential Decoding of Generalized LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13905","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:24036b287df996ab13ead18ca0b77a708ef51b2ab0c1b251a1097f42ef1bef0a","target":"record","created_at":"2026-07-05T06:34:54Z","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":"c88bb7cc43e9d6c0b4dfee4c82bc60db73d8bbfbd019fad3e182a4bf62e35499","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-07-26T02:05:34Z","title_canon_sha256":"ae1a27db6c2625f2e8b8ff76db2156a74a1f71ee3e607d20f230127c3486ee9f"},"schema_version":"1.0","source":{"id":"2307.13905","kind":"arxiv","version":1}},"canonical_sha256":"5f01ac61c8a40b36cb25ead45e532fcc790a939b764426a1f3ad409e091ef911","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f01ac61c8a40b36cb25ead45e532fcc790a939b764426a1f3ad409e091ef911","first_computed_at":"2026-07-05T06:34:54.795650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:34:54.795650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U/VNIPhKOO510L+jP1RKy4dAfbPec6frPw3L/nYI6XYocKIMDQVG1t1NuyfvpiGsIxTbPf2d+CnZvqQrCjMEAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:34:54.796123Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.13905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24036b287df996ab13ead18ca0b77a708ef51b2ab0c1b251a1097f42ef1bef0a","sha256:8a4847f054951be279bdb3480878db448373ffe5f3b69888f463867d7cc19dca"],"state_sha256":"037cee7fab08f66bbfb8293e0204c872a7eb00fa3b95aae43f1055a5168788bc"}