{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GS32W4NFU72JU4F2GCHPXILVRL","short_pith_number":"pith:GS32W4NF","schema_version":"1.0","canonical_sha256":"34b7ab71a5a7f49a70ba308efba1758aebc6c5fd3884b8290211d5450929200b","source":{"kind":"arxiv","id":"2502.16408","version":1},"attestation_state":"computed","paper":{"title":"Decision-tree decoders for general quantum LDPC codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bence Het\\'enyi, Kai R. Ott, Michael E. Beverland","submitted_at":"2025-02-23T02:29:14Z","abstract_excerpt":"We introduce Decision Tree Decoders (DTDs), which rely only on the sparsity of the binary check matrix, making them broadly applicable for decoding any quantum low-density parity-check (qLDPC) code and fault-tolerant quantum circuits. DTDs construct corrections incrementally by adding faults one-by-one, forming a path through a Decision Tree (DT). Each DTD algorithm is defined by its strategy for exploring the tree, with well-designed algorithms typically needing to explore only a small portion before finding a correction. We propose two explicit DTD algorithms that can be applied to any qLDPC"},"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":"2502.16408","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-23T02:29:14Z","cross_cats_sorted":[],"title_canon_sha256":"7321f8d8b31acc9cf5c4b9c08c875e6bd612807549c93c050ecc30ff03d58f84","abstract_canon_sha256":"4c3c524bde15bb8949a5b281def7e237a940e346c2f60a38c0985da17a0c25f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:52.985692Z","signature_b64":"zwLoSIMm55ZSUUCzQ4vClfZvqF2KSzjUWEW1ZtGav/FeZHvsdovU8HCluSbuCoYr2t8qc7IylNLjC58A4goeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34b7ab71a5a7f49a70ba308efba1758aebc6c5fd3884b8290211d5450929200b","last_reissued_at":"2026-07-05T10:18:52.985211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:52.985211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decision-tree decoders for general quantum LDPC codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bence Het\\'enyi, Kai R. Ott, Michael E. Beverland","submitted_at":"2025-02-23T02:29:14Z","abstract_excerpt":"We introduce Decision Tree Decoders (DTDs), which rely only on the sparsity of the binary check matrix, making them broadly applicable for decoding any quantum low-density parity-check (qLDPC) code and fault-tolerant quantum circuits. DTDs construct corrections incrementally by adding faults one-by-one, forming a path through a Decision Tree (DT). Each DTD algorithm is defined by its strategy for exploring the tree, with well-designed algorithms typically needing to explore only a small portion before finding a correction. We propose two explicit DTD algorithms that can be applied to any qLDPC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16408","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/2502.16408/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":"2502.16408","created_at":"2026-07-05T10:18:52.985272+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.16408v1","created_at":"2026-07-05T10:18:52.985272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16408","created_at":"2026-07-05T10:18:52.985272+00:00"},{"alias_kind":"pith_short_12","alias_value":"GS32W4NFU72J","created_at":"2026-07-05T10:18:52.985272+00:00"},{"alias_kind":"pith_short_16","alias_value":"GS32W4NFU72JU4F2","created_at":"2026-07-05T10:18:52.985272+00:00"},{"alias_kind":"pith_short_8","alias_value":"GS32W4NF","created_at":"2026-07-05T10:18:52.985272+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30592","citing_title":"Untangling QLDPC Codes with Biased Noise Ancilla","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20346","citing_title":"Forced Gap Post-Selection for Quantum LDPC Codes and their Operations","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2603.19062","citing_title":"Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL","json":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL.json","graph_json":"https://pith.science/api/pith-number/GS32W4NFU72JU4F2GCHPXILVRL/graph.json","events_json":"https://pith.science/api/pith-number/GS32W4NFU72JU4F2GCHPXILVRL/events.json","paper":"https://pith.science/paper/GS32W4NF"},"agent_actions":{"view_html":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL","download_json":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL.json","view_paper":"https://pith.science/paper/GS32W4NF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.16408&json=true","fetch_graph":"https://pith.science/api/pith-number/GS32W4NFU72JU4F2GCHPXILVRL/graph.json","fetch_events":"https://pith.science/api/pith-number/GS32W4NFU72JU4F2GCHPXILVRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL/action/storage_attestation","attest_author":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL/action/author_attestation","sign_citation":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL/action/citation_signature","submit_replication":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL/action/replication_record"}},"created_at":"2026-07-05T10:18:52.985272+00:00","updated_at":"2026-07-05T10:18:52.985272+00:00"}