{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5OUW5ABSKHJPQXJCHCCPTF4MPV","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":"7928dbe974d3c60d44502f6896c1d07d7ce4a7c063cfbe7eba1c2a408d38895a","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-23T19:42:51Z","title_canon_sha256":"7bca3187b7ceb063224dcadf898c980496bc8105fef021027a3ad34584032cd3"},"schema_version":"1.0","source":{"id":"2507.17893","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.17893","created_at":"2026-07-05T11:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"2507.17893v2","created_at":"2026-07-05T11:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17893","created_at":"2026-07-05T11:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"5OUW5ABSKHJP","created_at":"2026-07-05T11:44:10Z"},{"alias_kind":"pith_short_16","alias_value":"5OUW5ABSKHJPQXJC","created_at":"2026-07-05T11:44:10Z"},{"alias_kind":"pith_short_8","alias_value":"5OUW5ABS","created_at":"2026-07-05T11:44:10Z"}],"graph_snapshots":[{"event_id":"sha256:2b03ac30baa9fa68bf01fcfc3e93f43e0d3b98d067b797c9fb64fc6b08e7bb7f","target":"graph","created_at":"2026-07-05T11:44:10Z","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/2507.17893/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper explores the application of reinforcement learning techniques to enhance the performance of decoding of linear block codes based on flipping bits and finding optimal decisions. We describe the methodology for mapping the iterative decoding process into Markov Decision Processes (MDPs) and propose different methods to reduce the number of states in the MDP. A truncated MDP is proposed to reduce the number of states in the MDP by learning a Hamming ball with a specified radius around codewords. We then propose a general scheme for reinforcement learning based decoders applicable to an","authors_text":"Bane Vasic, Milad Taghipour","cross_cats":["cs.AI","cs.LG","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-23T19:42:51Z","title":"Action-List Reinforcement Learning Syndrome Decoding for Binary Linear Block Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17893","kind":"arxiv","version":2},"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:69cc26bb83629fdb42950212950f907999a4569cfa12ce03c94a1f50b34732f6","target":"record","created_at":"2026-07-05T11:44:10Z","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":"7928dbe974d3c60d44502f6896c1d07d7ce4a7c063cfbe7eba1c2a408d38895a","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-23T19:42:51Z","title_canon_sha256":"7bca3187b7ceb063224dcadf898c980496bc8105fef021027a3ad34584032cd3"},"schema_version":"1.0","source":{"id":"2507.17893","kind":"arxiv","version":2}},"canonical_sha256":"eba96e803251d2f85d223884f9978c7d7807d526d325bc1802d992b25c85f62d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eba96e803251d2f85d223884f9978c7d7807d526d325bc1802d992b25c85f62d","first_computed_at":"2026-07-05T11:44:10.932198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:10.932198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sc0X0VqbjlySil2p1AMQ+ETL/n6aT4YI/KN8S1nTNr2RX+lvr3gdpJMxY00YYxu/bdRUYid1vtlvU5YMAPgQBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:10.932726Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.17893","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69cc26bb83629fdb42950212950f907999a4569cfa12ce03c94a1f50b34732f6","sha256:2b03ac30baa9fa68bf01fcfc3e93f43e0d3b98d067b797c9fb64fc6b08e7bb7f"],"state_sha256":"2e6a1582f3b60e3cf1f2409f863c6f69e91e2d05d4a34622b0db1ae0f3fd50d3"}