{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MXT7PUWRGKGJK6VL4VPUOAIZHN","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":"7585b5cecbaeb22f8fe623bdae95a5dfd87602c1db7938d01866b69355bdeaf8","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-27T14:49:09Z","title_canon_sha256":"1a808b9946fd5d1be608ed7a081fe9178bb1eed20a3bda8b207bdbc040e317c7"},"schema_version":"1.0","source":{"id":"2607.24891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24891","created_at":"2026-07-29T00:24:50Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24891v1","created_at":"2026-07-29T00:24:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24891","created_at":"2026-07-29T00:24:50Z"},{"alias_kind":"pith_short_12","alias_value":"MXT7PUWRGKGJ","created_at":"2026-07-29T00:24:50Z"},{"alias_kind":"pith_short_16","alias_value":"MXT7PUWRGKGJK6VL","created_at":"2026-07-29T00:24:50Z"},{"alias_kind":"pith_short_8","alias_value":"MXT7PUWR","created_at":"2026-07-29T00:24:50Z"}],"graph_snapshots":[{"event_id":"sha256:331f903e3145b42f7de136a6272a6270f1240c084480c7f52648006918d4af3b","target":"graph","created_at":"2026-07-29T00:24:50Z","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/2607.24891/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Belief-propagation (BP) decoding is attractive for quantum low-density parity-check (QLDPC) codes because it uses local message passing on sparse Tanner graphs. However, conventional flooding BP often stalls due to stabilizer degeneracy and short cycles. Reinforcement-learning-based sequential variable-node scheduling (RL-S), which learns the update order offline, has shown that adaptive scheduling can improve BP convergence. In this paper, we extend this idea with a second-order local update decoder, RL-S2LU. The proposed decoder preserves BP locality and low complexity, while numerical resul","authors_text":"David G. M. Mitchell, Mohsen Moradi, Remi A. Chou, Taejoon Kim, Vahid Nourozi","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-27T14:49:09Z","title":"High-Performance Reinforcement-Learned BP Decoding of Quantum LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24891","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:a09c5f4a2a5acefa638fae7d227b65810ee07702d654a3e6c7a7e62f9a0701d6","target":"record","created_at":"2026-07-29T00:24:50Z","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":"7585b5cecbaeb22f8fe623bdae95a5dfd87602c1db7938d01866b69355bdeaf8","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-27T14:49:09Z","title_canon_sha256":"1a808b9946fd5d1be608ed7a081fe9178bb1eed20a3bda8b207bdbc040e317c7"},"schema_version":"1.0","source":{"id":"2607.24891","kind":"arxiv","version":1}},"canonical_sha256":"65e7f7d2d1328c957aabe55f4701193b6aeadbc9df38701cd73fc9717c58bca9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65e7f7d2d1328c957aabe55f4701193b6aeadbc9df38701cd73fc9717c58bca9","first_computed_at":"2026-07-29T00:24:50.189968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-29T00:24:50.189968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u/Pg592ddKCuIvXt6POIUtIDfaB4G7THDXqp0rcMaKBC+Jsp7o4Sd/+oFpgIgk+PqiaLK//5S0n2DvDvVUuzBA==","signature_status":"signed_v1","signed_at":"2026-07-29T00:24:50.190869Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.24891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a09c5f4a2a5acefa638fae7d227b65810ee07702d654a3e6c7a7e62f9a0701d6","sha256:331f903e3145b42f7de136a6272a6270f1240c084480c7f52648006918d4af3b"],"state_sha256":"b836ca28926455de6ffdacd38e97d0575c289ac835ee24e17c1511e54a20147c"}