{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QHNNKPR6AOSMDPNM3AHO4XXABX","short_pith_number":"pith:QHNNKPR6","schema_version":"1.0","canonical_sha256":"81dad53e3e03a4c1bdacd80eee5ee00df31e901fcbfa39f3474b718b8270edd2","source":{"kind":"arxiv","id":"2510.08695","version":2},"attestation_state":"computed","paper":{"title":"Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hayata Yamasaki, Kento Tsubouchi, Shiro Tamiya","submitted_at":"2025-10-09T18:01:30Z","abstract_excerpt":"Quantum low-density parity-check (qLDPC) codes are promising for realizing scalable fault-tolerant quantum computation due to their potential for low-overhead protocols. A common approach to decoding qLDPC codes is to use the belief propagation (BP) decoder, followed by a post-processing step to enhance decoding accuracy. For fast decoding, the post-processing algorithm is desirable to have a small computational cost and rely only on local operations on the Tanner graph to facilitate parallel implementation. To address this requirement, we propose degeneracy cutting (DC), an efficient post-pro"},"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":"2510.08695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-09T18:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"30b5fbabe392cd807e29aab83a75ba618adf12dae524b77bf2b83cddb7bcd25b","abstract_canon_sha256":"a98366a854f60fbfb1268412d25a2c9a2a937f24356e3ebb391020d8eaf3a598"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:19:38.010834Z","signature_b64":"hILg4KY8FxtMmVcRuGQ/ORkd+bYT8/2p+3Qkf5e0OQF2WzJJA0ELvGchalsLdQQpTvhC7xgPUQ6wKL0qpBfDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81dad53e3e03a4c1bdacd80eee5ee00df31e901fcbfa39f3474b718b8270edd2","last_reissued_at":"2026-07-09T01:19:38.010355Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:19:38.010355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hayata Yamasaki, Kento Tsubouchi, Shiro Tamiya","submitted_at":"2025-10-09T18:01:30Z","abstract_excerpt":"Quantum low-density parity-check (qLDPC) codes are promising for realizing scalable fault-tolerant quantum computation due to their potential for low-overhead protocols. A common approach to decoding qLDPC codes is to use the belief propagation (BP) decoder, followed by a post-processing step to enhance decoding accuracy. For fast decoding, the post-processing algorithm is desirable to have a small computational cost and rely only on local operations on the Tanner graph to facilitate parallel implementation. To address this requirement, we propose degeneracy cutting (DC), an efficient post-pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.08695","kind":"arxiv","version":2},"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/2510.08695/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":"2510.08695","created_at":"2026-07-09T01:19:38.010415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.08695v2","created_at":"2026-07-09T01:19:38.010415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.08695","created_at":"2026-07-09T01:19:38.010415+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHNNKPR6AOSM","created_at":"2026-07-09T01:19:38.010415+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHNNKPR6AOSMDPNM","created_at":"2026-07-09T01:19:38.010415+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHNNKPR6","created_at":"2026-07-09T01:19:38.010415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.18240","citing_title":"Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX","json":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX.json","graph_json":"https://pith.science/api/pith-number/QHNNKPR6AOSMDPNM3AHO4XXABX/graph.json","events_json":"https://pith.science/api/pith-number/QHNNKPR6AOSMDPNM3AHO4XXABX/events.json","paper":"https://pith.science/paper/QHNNKPR6"},"agent_actions":{"view_html":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX","download_json":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX.json","view_paper":"https://pith.science/paper/QHNNKPR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.08695&json=true","fetch_graph":"https://pith.science/api/pith-number/QHNNKPR6AOSMDPNM3AHO4XXABX/graph.json","fetch_events":"https://pith.science/api/pith-number/QHNNKPR6AOSMDPNM3AHO4XXABX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/action/storage_attestation","attest_author":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/action/author_attestation","sign_citation":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/action/citation_signature","submit_replication":"https://pith.science/pith/QHNNKPR6AOSMDPNM3AHO4XXABX/action/replication_record"}},"created_at":"2026-07-09T01:19:38.010415+00:00","updated_at":"2026-07-09T01:19:38.010415+00:00"}