{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NUB2AGTI6FNGXOPMUON6HVA3VA","short_pith_number":"pith:NUB2AGTI","schema_version":"1.0","canonical_sha256":"6d03a01a68f15a6bb9eca39be3d41ba813506fbd75938efadf239fe1704288ca","source":{"kind":"arxiv","id":"2503.01738","version":1},"attestation_state":"computed","paper":{"title":"Automorphism Ensemble Decoding of Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Dan E Browne, Hasan Sayginel, Mark Webster, Stergios Koutsioumpas","submitted_at":"2025-03-03T16:58:24Z","abstract_excerpt":"We introduce AutDEC, a fast and accurate decoder for quantum error-correcting codes with large automorphism groups. Our decoder employs a set of automorphisms of the quantum code and an ensemble of belief propagation (BP) decoders. Each BP decoder is given a syndrome which is transformed by one of the automorphisms, and is run in parallel. For quantum codes, the accuracy of BP decoders is limited because short cycles occur in the Tanner graph and our approach mitigates this effect. We demonstrate decoding accuracy comparable to BP-OSD-0 with a lower time overhead for Quantum Reed-Muller (QRM) "},"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":"2503.01738","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-03T16:58:24Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6e34d13717621013467cfb80a6a1e12571047facff7e8b0e62048cbbf521538b","abstract_canon_sha256":"3f9b8086ef6981e2a94ef654b91a02859f86e28ee48e09265bbbf383082202d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:13.722853Z","signature_b64":"Jc4BlzPEZqAPU512xCTLFPLTUGSAB75aIfXXfl05xyTN47AoykK5omEHgHp3yQc1gaahl6TRBLEy6Pg7Jb95Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d03a01a68f15a6bb9eca39be3d41ba813506fbd75938efadf239fe1704288ca","last_reissued_at":"2026-07-05T10:23:13.722173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:13.722173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automorphism Ensemble Decoding of Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Dan E Browne, Hasan Sayginel, Mark Webster, Stergios Koutsioumpas","submitted_at":"2025-03-03T16:58:24Z","abstract_excerpt":"We introduce AutDEC, a fast and accurate decoder for quantum error-correcting codes with large automorphism groups. Our decoder employs a set of automorphisms of the quantum code and an ensemble of belief propagation (BP) decoders. Each BP decoder is given a syndrome which is transformed by one of the automorphisms, and is run in parallel. For quantum codes, the accuracy of BP decoders is limited because short cycles occur in the Tanner graph and our approach mitigates this effect. We demonstrate decoding accuracy comparable to BP-OSD-0 with a lower time overhead for Quantum Reed-Muller (QRM) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01738","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/2503.01738/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":"2503.01738","created_at":"2026-07-05T10:23:13.722263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.01738v1","created_at":"2026-07-05T10:23:13.722263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01738","created_at":"2026-07-05T10:23:13.722263+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUB2AGTI6FNG","created_at":"2026-07-05T10:23:13.722263+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUB2AGTI6FNGXOPM","created_at":"2026-07-05T10:23:13.722263+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUB2AGTI","created_at":"2026-07-05T10:23:13.722263+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19482","citing_title":"Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18240","citing_title":"Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03631","citing_title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03631","citing_title":"Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06547","citing_title":"Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01035","citing_title":"A Scalable FPGA Architecture for Real-Time Decoding of Quantum LDPC Codes Using GARI","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06547","citing_title":"Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NUB2AGTI6FNGXOPMUON6HVA3VA","json":"https://pith.science/pith/NUB2AGTI6FNGXOPMUON6HVA3VA.json","graph_json":"https://pith.science/api/pith-number/NUB2AGTI6FNGXOPMUON6HVA3VA/graph.json","events_json":"https://pith.science/api/pith-number/NUB2AGTI6FNGXOPMUON6HVA3VA/events.json","paper":"https://pith.science/paper/NUB2AGTI"},"agent_actions":{"view_html":"https://pith.science/pith/NUB2AGTI6FNGXOPMUON6HVA3VA","download_json":"https://pith.science/pith/NUB2AGTI6FNGXOPMUON6HVA3VA.json","view_paper":"https://pith.science/paper/NUB2AGTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.01738&json=true","fetch_graph":"https://pith.science/api/pith-number/NUB2AGTI6FNGXOPMUON6HVA3VA/graph.json","fetch_events":"https://pith.science/api/pith-number/NUB2AGTI6FNGXOPMUON6HVA3VA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUB2AGTI6FNGXOPMUON6HVA3VA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUB2AGTI6FNGXOPMUON6HVA3VA/action/storage_attestation","attest_author":"https://pith.science/pith/NUB2AGTI6FNGXOPMUON6HVA3VA/action/author_attestation","sign_citation":"https://pith.science/pith/NUB2AGTI6FNGXOPMUON6HVA3VA/action/citation_signature","submit_replication":"https://pith.science/pith/NUB2AGTI6FNGXOPMUON6HVA3VA/action/replication_record"}},"created_at":"2026-07-05T10:23:13.722263+00:00","updated_at":"2026-07-05T10:23:13.722263+00:00"}