{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:C7R3KS4TIMM5REYTLSS4T74CTG","short_pith_number":"pith:C7R3KS4T","schema_version":"1.0","canonical_sha256":"17e3b54b934319d893135ca5c9ff8299ab0d2b049881a360a9a014489d67ee02","source":{"kind":"arxiv","id":"2501.05021","version":1},"attestation_state":"computed","paper":{"title":"Enhanced Min-Sum Decoding of Quantum Codes Using Previous Iteration Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bane Vasic, Dimitris Chytas, Nithin Raveendran","submitted_at":"2025-01-09T07:28:26Z","abstract_excerpt":"In this paper, we propose a novel message-passing decoding approach that leverages the degeneracy of quantum low-density parity-check codes to enhance decoding performance, eliminating the need for serial scheduling or post-processing. Our focus is on two-block Calderbank-Shor-Steane (CSS) codes, which are composed of symmetric stabilizers that hinder the performance of conventional iterative decoders with uniform update rules. Specifically, our analysis shows that, under the isolation assumption, the min-sum decoder fails to converge when constant-weight errors are applied to symmetric stabil"},"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":"2501.05021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-01-09T07:28:26Z","cross_cats_sorted":[],"title_canon_sha256":"e7314190462ba535c50f6488fb866654063a8666000c870e64dd9969c28ddd2a","abstract_canon_sha256":"0dd4b7afc8fa7014c2fa8fa280a818f8a30d852fe0296986d562c9c2d1e9f852"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:50.287022Z","signature_b64":"k3TC6Ar6JLw7+wVxbJ8Yy5yrzediiQm93gzzCjD7hyfyeqwPTqXUsFla4vm19ioG6dpbl9CpVKXUGUhBm2IfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17e3b54b934319d893135ca5c9ff8299ab0d2b049881a360a9a014489d67ee02","last_reissued_at":"2026-07-05T09:58:50.286603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:50.286603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhanced Min-Sum Decoding of Quantum Codes Using Previous Iteration Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bane Vasic, Dimitris Chytas, Nithin Raveendran","submitted_at":"2025-01-09T07:28:26Z","abstract_excerpt":"In this paper, we propose a novel message-passing decoding approach that leverages the degeneracy of quantum low-density parity-check codes to enhance decoding performance, eliminating the need for serial scheduling or post-processing. Our focus is on two-block Calderbank-Shor-Steane (CSS) codes, which are composed of symmetric stabilizers that hinder the performance of conventional iterative decoders with uniform update rules. Specifically, our analysis shows that, under the isolation assumption, the min-sum decoder fails to converge when constant-weight errors are applied to symmetric stabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05021","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/2501.05021/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":"2501.05021","created_at":"2026-07-05T09:58:50.286657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.05021v1","created_at":"2026-07-05T09:58:50.286657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05021","created_at":"2026-07-05T09:58:50.286657+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7R3KS4TIMM5","created_at":"2026-07-05T09:58:50.286657+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7R3KS4TIMM5REYT","created_at":"2026-07-05T09:58:50.286657+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7R3KS4T","created_at":"2026-07-05T09:58:50.286657+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.03936","citing_title":"Construction and Decoding of Quantum Margulis Codes","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14170","citing_title":"Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03218","citing_title":"Edge-Based Anisotropic Decoding for Generalized Bicycle Codes","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10433","citing_title":"Syndrome Adaptive Gain Control for Min-Sum Decoding of Quantum LDPC Codes","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C7R3KS4TIMM5REYTLSS4T74CTG","json":"https://pith.science/pith/C7R3KS4TIMM5REYTLSS4T74CTG.json","graph_json":"https://pith.science/api/pith-number/C7R3KS4TIMM5REYTLSS4T74CTG/graph.json","events_json":"https://pith.science/api/pith-number/C7R3KS4TIMM5REYTLSS4T74CTG/events.json","paper":"https://pith.science/paper/C7R3KS4T"},"agent_actions":{"view_html":"https://pith.science/pith/C7R3KS4TIMM5REYTLSS4T74CTG","download_json":"https://pith.science/pith/C7R3KS4TIMM5REYTLSS4T74CTG.json","view_paper":"https://pith.science/paper/C7R3KS4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.05021&json=true","fetch_graph":"https://pith.science/api/pith-number/C7R3KS4TIMM5REYTLSS4T74CTG/graph.json","fetch_events":"https://pith.science/api/pith-number/C7R3KS4TIMM5REYTLSS4T74CTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7R3KS4TIMM5REYTLSS4T74CTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7R3KS4TIMM5REYTLSS4T74CTG/action/storage_attestation","attest_author":"https://pith.science/pith/C7R3KS4TIMM5REYTLSS4T74CTG/action/author_attestation","sign_citation":"https://pith.science/pith/C7R3KS4TIMM5REYTLSS4T74CTG/action/citation_signature","submit_replication":"https://pith.science/pith/C7R3KS4TIMM5REYTLSS4T74CTG/action/replication_record"}},"created_at":"2026-07-05T09:58:50.286657+00:00","updated_at":"2026-07-05T09:58:50.286657+00:00"}