{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:L4A2YYOIUQFTNSZF5LKF4UZPZR","short_pith_number":"pith:L4A2YYOI","schema_version":"1.0","canonical_sha256":"5f01ac61c8a40b36cb25ead45e532fcc790a939b764426a1f3ad409e091ef911","source":{"kind":"arxiv","id":"2307.13905","version":1},"attestation_state":"computed","paper":{"title":"Reinforcement Learning for Sequential Decoding of Generalized LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David G. M. Mitchell, Salman Habib","submitted_at":"2023-07-26T02:05:34Z","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"},"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":"2307.13905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-07-26T02:05:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ae1a27db6c2625f2e8b8ff76db2156a74a1f71ee3e607d20f230127c3486ee9f","abstract_canon_sha256":"c88bb7cc43e9d6c0b4dfee4c82bc60db73d8bbfbd019fad3e182a4bf62e35499"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:54.796123Z","signature_b64":"U/VNIPhKOO510L+jP1RKy4dAfbPec6frPw3L/nYI6XYocKIMDQVG1t1NuyfvpiGsIxTbPf2d+CnZvqQrCjMEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f01ac61c8a40b36cb25ead45e532fcc790a939b764426a1f3ad409e091ef911","last_reissued_at":"2026-07-05T06:34:54.795650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:54.795650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning for Sequential Decoding of Generalized LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David G. M. Mitchell, Salman Habib","submitted_at":"2023-07-26T02:05:34Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13905","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.13905/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":"2307.13905","created_at":"2026-07-05T06:34:54.795712+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.13905v1","created_at":"2026-07-05T06:34:54.795712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13905","created_at":"2026-07-05T06:34:54.795712+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4A2YYOIUQFT","created_at":"2026-07-05T06:34:54.795712+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4A2YYOIUQFTNSZF","created_at":"2026-07-05T06:34:54.795712+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4A2YYOI","created_at":"2026-07-05T06:34:54.795712+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4A2YYOIUQFTNSZF5LKF4UZPZR","json":"https://pith.science/pith/L4A2YYOIUQFTNSZF5LKF4UZPZR.json","graph_json":"https://pith.science/api/pith-number/L4A2YYOIUQFTNSZF5LKF4UZPZR/graph.json","events_json":"https://pith.science/api/pith-number/L4A2YYOIUQFTNSZF5LKF4UZPZR/events.json","paper":"https://pith.science/paper/L4A2YYOI"},"agent_actions":{"view_html":"https://pith.science/pith/L4A2YYOIUQFTNSZF5LKF4UZPZR","download_json":"https://pith.science/pith/L4A2YYOIUQFTNSZF5LKF4UZPZR.json","view_paper":"https://pith.science/paper/L4A2YYOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.13905&json=true","fetch_graph":"https://pith.science/api/pith-number/L4A2YYOIUQFTNSZF5LKF4UZPZR/graph.json","fetch_events":"https://pith.science/api/pith-number/L4A2YYOIUQFTNSZF5LKF4UZPZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4A2YYOIUQFTNSZF5LKF4UZPZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4A2YYOIUQFTNSZF5LKF4UZPZR/action/storage_attestation","attest_author":"https://pith.science/pith/L4A2YYOIUQFTNSZF5LKF4UZPZR/action/author_attestation","sign_citation":"https://pith.science/pith/L4A2YYOIUQFTNSZF5LKF4UZPZR/action/citation_signature","submit_replication":"https://pith.science/pith/L4A2YYOIUQFTNSZF5LKF4UZPZR/action/replication_record"}},"created_at":"2026-07-05T06:34:54.795712+00:00","updated_at":"2026-07-05T06:34:54.795712+00:00"}