{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MXT7PUWRGKGJK6VL4VPUOAIZHN","short_pith_number":"pith:MXT7PUWR","schema_version":"1.0","canonical_sha256":"65e7f7d2d1328c957aabe55f4701193b6aeadbc9df38701cd73fc9717c58bca9","source":{"kind":"arxiv","id":"2607.24891","version":1},"attestation_state":"computed","paper":{"title":"High-Performance Reinforcement-Learned BP Decoding of Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David G. M. Mitchell, Mohsen Moradi, Remi A. Chou, Taejoon Kim, Vahid Nourozi","submitted_at":"2026-07-27T14:49:09Z","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"},"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":"2607.24891","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-27T14:49:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a808b9946fd5d1be608ed7a081fe9178bb1eed20a3bda8b207bdbc040e317c7","abstract_canon_sha256":"7585b5cecbaeb22f8fe623bdae95a5dfd87602c1db7938d01866b69355bdeaf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T00:24:50.190869Z","signature_b64":"u/Pg592ddKCuIvXt6POIUtIDfaB4G7THDXqp0rcMaKBC+Jsp7o4Sd/+oFpgIgk+PqiaLK//5S0n2DvDvVUuzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65e7f7d2d1328c957aabe55f4701193b6aeadbc9df38701cd73fc9717c58bca9","last_reissued_at":"2026-07-29T00:24:50.189968Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T00:24:50.189968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Performance Reinforcement-Learned BP Decoding of Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David G. M. Mitchell, Mohsen Moradi, Remi A. Chou, Taejoon Kim, Vahid Nourozi","submitted_at":"2026-07-27T14:49:09Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24891","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/2607.24891/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":"2607.24891","created_at":"2026-07-29T00:24:50.190429+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.24891v1","created_at":"2026-07-29T00:24:50.190429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24891","created_at":"2026-07-29T00:24:50.190429+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXT7PUWRGKGJ","created_at":"2026-07-29T00:24:50.190429+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXT7PUWRGKGJK6VL","created_at":"2026-07-29T00:24:50.190429+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXT7PUWR","created_at":"2026-07-29T00:24:50.190429+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/MXT7PUWRGKGJK6VL4VPUOAIZHN","json":"https://pith.science/pith/MXT7PUWRGKGJK6VL4VPUOAIZHN.json","graph_json":"https://pith.science/api/pith-number/MXT7PUWRGKGJK6VL4VPUOAIZHN/graph.json","events_json":"https://pith.science/api/pith-number/MXT7PUWRGKGJK6VL4VPUOAIZHN/events.json","paper":"https://pith.science/paper/MXT7PUWR"},"agent_actions":{"view_html":"https://pith.science/pith/MXT7PUWRGKGJK6VL4VPUOAIZHN","download_json":"https://pith.science/pith/MXT7PUWRGKGJK6VL4VPUOAIZHN.json","view_paper":"https://pith.science/paper/MXT7PUWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.24891&json=true","fetch_graph":"https://pith.science/api/pith-number/MXT7PUWRGKGJK6VL4VPUOAIZHN/graph.json","fetch_events":"https://pith.science/api/pith-number/MXT7PUWRGKGJK6VL4VPUOAIZHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXT7PUWRGKGJK6VL4VPUOAIZHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXT7PUWRGKGJK6VL4VPUOAIZHN/action/storage_attestation","attest_author":"https://pith.science/pith/MXT7PUWRGKGJK6VL4VPUOAIZHN/action/author_attestation","sign_citation":"https://pith.science/pith/MXT7PUWRGKGJK6VL4VPUOAIZHN/action/citation_signature","submit_replication":"https://pith.science/pith/MXT7PUWRGKGJK6VL4VPUOAIZHN/action/replication_record"}},"created_at":"2026-07-29T00:24:50.190429+00:00","updated_at":"2026-07-29T00:24:50.190429+00:00"}