{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:B4JWJNSTXTDYC2BG33ZLHZE273","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":"a10a2e020869c799296a5f2a6691849b380bc3d9257726306859553c800304a0","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-18T20:38:03Z","title_canon_sha256":"dfbe7149248e21e3098ec4727991b67cbccee60896c4af45090d14e4f93b6ed5"},"schema_version":"1.0","source":{"id":"2606.20926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20926","created_at":"2026-06-23T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20926v1","created_at":"2026-06-23T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20926","created_at":"2026-06-23T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"B4JWJNSTXTDY","created_at":"2026-06-23T01:12:22Z"},{"alias_kind":"pith_short_16","alias_value":"B4JWJNSTXTDYC2BG","created_at":"2026-06-23T01:12:22Z"},{"alias_kind":"pith_short_8","alias_value":"B4JWJNST","created_at":"2026-06-23T01:12:22Z"}],"graph_snapshots":[{"event_id":"sha256:8eeddd6ebc0858fb273de77f0325f94f2570aab0faedd6db95a798a4110d8684","target":"graph","created_at":"2026-06-23T01:12:22Z","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/2606.20926/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum low-density parity-check (QLDPC) codes are strong candidates for fault-tolerant quantum computation, but efficient decoding remains a major challenge due to short cycles, degeneracy, and the poor convergence of standard belief-propagation (BP) decoders. We propose a reinforcement learning-based list sequential (RL-LS) BP decoder for QLDPC codes by extending the reinforcement-learning-based sequential variable-node scheduling (RL-S) framework with list-based search. At each step, the learned policy selects the next variable node to update; the decoder then retains the ordinary RL-S traj","authors_text":"Mohsen Moradi, Remi A. Chou, Taejoon Kim","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-18T20:38:03Z","title":"Learning-Based List Sequential Belief Propagation Decoding of Quantum LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20926","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:9d6276501b8d9020bce75bb2db657469e5fe0fa7d1129694eefba215cf771ad2","target":"record","created_at":"2026-06-23T01:12:22Z","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":"a10a2e020869c799296a5f2a6691849b380bc3d9257726306859553c800304a0","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-18T20:38:03Z","title_canon_sha256":"dfbe7149248e21e3098ec4727991b67cbccee60896c4af45090d14e4f93b6ed5"},"schema_version":"1.0","source":{"id":"2606.20926","kind":"arxiv","version":1}},"canonical_sha256":"0f1364b653bcc7816826def2b3e49afef70a871e190071d7ed084566754cbdc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f1364b653bcc7816826def2b3e49afef70a871e190071d7ed084566754cbdc5","first_computed_at":"2026-06-23T01:12:22.248613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T01:12:22.248613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QiR7w1ENbfNU9Y6pVfNrYpFSpf7VJuJ3vzap8B+XIR+MksGAymDfSUPXUpZ/9CUUNfS5YKcqTh+aefK3cyLkCg==","signature_status":"signed_v1","signed_at":"2026-06-23T01:12:22.249065Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.20926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d6276501b8d9020bce75bb2db657469e5fe0fa7d1129694eefba215cf771ad2","sha256:8eeddd6ebc0858fb273de77f0325f94f2570aab0faedd6db95a798a4110d8684"],"state_sha256":"df9a5b74aa2b1767a5983559f2e7a8f8921ea891b28099df7bb14868211770d0"}