{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VXKYQVC263H5X2MJVCLE5CM7Z2","short_pith_number":"pith:VXKYQVC2","schema_version":"1.0","canonical_sha256":"add588545af6cfdbe989a8964e899fceb4a7e26d174ce7170d3792cbf7e42287","source":{"kind":"arxiv","id":"2412.08817","version":1},"attestation_state":"computed","paper":{"title":"Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Hanwen Yao, Henry D. Pfister, Mert G\\\"okduman","submitted_at":"2024-12-11T23:14:23Z","abstract_excerpt":"We introduce a new erasure decoder that applies to arbitrary quantum LDPC codes. Dubbed the cluster decoder, it generalizes the decomposition idea of Vertical-Horizontal (VH) decoding introduced by Connelly et al. in 2022. Like the VH decoder, the idea is to first run the peeling decoder and then post-process the resulting stopping set. The cluster decoder breaks the stopping set into a tree of clusters which can be solved sequentially via Gaussian Elimination (GE). By allowing clusters of unconstrained size, this decoder achieves maximum-likelihood (ML) performance with reduced complexity com"},"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":"2412.08817","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-12-11T23:14:23Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"f7982b0c8b107be57e32602f3657ad2ca8e756c076add6aeac719300f9476ab1","abstract_canon_sha256":"3fbfe202751ac22e320411e0f2df17bc1f53923761f4fdf84154977928e87f0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:02.093221Z","signature_b64":"CBgC8sFUOmViUpDEstVJGeHZQVGlIEAXga4+Y0epot5cOHNfPEPvX2Me08D5UqfPHbuKbFsVW88Gg2ROE6lcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"add588545af6cfdbe989a8964e899fceb4a7e26d174ce7170d3792cbf7e42287","last_reissued_at":"2026-07-05T09:48:02.092699Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:02.092699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Hanwen Yao, Henry D. Pfister, Mert G\\\"okduman","submitted_at":"2024-12-11T23:14:23Z","abstract_excerpt":"We introduce a new erasure decoder that applies to arbitrary quantum LDPC codes. Dubbed the cluster decoder, it generalizes the decomposition idea of Vertical-Horizontal (VH) decoding introduced by Connelly et al. in 2022. Like the VH decoder, the idea is to first run the peeling decoder and then post-process the resulting stopping set. The cluster decoder breaks the stopping set into a tree of clusters which can be solved sequentially via Gaussian Elimination (GE). By allowing clusters of unconstrained size, this decoder achieves maximum-likelihood (ML) performance with reduced complexity com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08817","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/2412.08817/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":"2412.08817","created_at":"2026-07-05T09:48:02.092767+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08817v1","created_at":"2026-07-05T09:48:02.092767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08817","created_at":"2026-07-05T09:48:02.092767+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXKYQVC263H5","created_at":"2026-07-05T09:48:02.092767+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXKYQVC263H5X2MJ","created_at":"2026-07-05T09:48:02.092767+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXKYQVC2","created_at":"2026-07-05T09:48:02.092767+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.13509","citing_title":"Degenerate quantum erasure decoding","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VXKYQVC263H5X2MJVCLE5CM7Z2","json":"https://pith.science/pith/VXKYQVC263H5X2MJVCLE5CM7Z2.json","graph_json":"https://pith.science/api/pith-number/VXKYQVC263H5X2MJVCLE5CM7Z2/graph.json","events_json":"https://pith.science/api/pith-number/VXKYQVC263H5X2MJVCLE5CM7Z2/events.json","paper":"https://pith.science/paper/VXKYQVC2"},"agent_actions":{"view_html":"https://pith.science/pith/VXKYQVC263H5X2MJVCLE5CM7Z2","download_json":"https://pith.science/pith/VXKYQVC263H5X2MJVCLE5CM7Z2.json","view_paper":"https://pith.science/paper/VXKYQVC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08817&json=true","fetch_graph":"https://pith.science/api/pith-number/VXKYQVC263H5X2MJVCLE5CM7Z2/graph.json","fetch_events":"https://pith.science/api/pith-number/VXKYQVC263H5X2MJVCLE5CM7Z2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXKYQVC263H5X2MJVCLE5CM7Z2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXKYQVC263H5X2MJVCLE5CM7Z2/action/storage_attestation","attest_author":"https://pith.science/pith/VXKYQVC263H5X2MJVCLE5CM7Z2/action/author_attestation","sign_citation":"https://pith.science/pith/VXKYQVC263H5X2MJVCLE5CM7Z2/action/citation_signature","submit_replication":"https://pith.science/pith/VXKYQVC263H5X2MJVCLE5CM7Z2/action/replication_record"}},"created_at":"2026-07-05T09:48:02.092767+00:00","updated_at":"2026-07-05T09:48:02.092767+00:00"}