{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GS32W4NFU72JU4F2GCHPXILVRL","short_pith_number":"pith:GS32W4NF","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"},"canonical_sha256":"34b7ab71a5a7f49a70ba308efba1758aebc6c5fd3884b8290211d5450929200b","source":{"kind":"arxiv","id":"2502.16408","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.16408","created_at":"2026-07-05T10:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"2502.16408v1","created_at":"2026-07-05T10:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16408","created_at":"2026-07-05T10:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"GS32W4NFU72J","created_at":"2026-07-05T10:18:52Z"},{"alias_kind":"pith_short_16","alias_value":"GS32W4NFU72JU4F2","created_at":"2026-07-05T10:18:52Z"},{"alias_kind":"pith_short_8","alias_value":"GS32W4NF","created_at":"2026-07-05T10:18:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GS32W4NFU72JU4F2GCHPXILVRL","target":"record","payload":{"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"},"canonical_sha256":"34b7ab71a5a7f49a70ba308efba1758aebc6c5fd3884b8290211d5450929200b","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"},"source_kind":"arxiv","source_id":"2502.16408","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JO+Jt4vqN4eNo0x0pMhk1golrXzijYFaKxMuoO1nAhkC3cA96ty/Dm1OXtBJBmFrA23+s1ex3DLjwDDdzQcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:46:32.084480Z"},"content_sha256":"a58e32d48595cd2f17f29574c8e7ad682250523daf4270588c7af71cd0338c63","schema_version":"1.0","event_id":"sha256:a58e32d48595cd2f17f29574c8e7ad682250523daf4270588c7af71cd0338c63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GS32W4NFU72JU4F2GCHPXILVRL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ysP7GNCxFuus/kkNYhps+7H9b+XbEnXMLD71IPXtMDjcVOHRDaJiAv0BTrcvzjGnLP+U9MK+ITzQUS0mTElDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:46:32.085512Z"},"content_sha256":"062f4f05a69edb3bce1ab53b30db76d6ab2f65364e3d396d76db33a646def6f1","schema_version":"1.0","event_id":"sha256:062f4f05a69edb3bce1ab53b30db76d6ab2f65364e3d396d76db33a646def6f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL/bundle.json","state_url":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GS32W4NFU72JU4F2GCHPXILVRL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T00:46:32Z","links":{"resolver":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL","bundle":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL/bundle.json","state":"https://pith.science/pith/GS32W4NFU72JU4F2GCHPXILVRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GS32W4NFU72JU4F2GCHPXILVRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GS32W4NFU72JU4F2GCHPXILVRL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4c3c524bde15bb8949a5b281def7e237a940e346c2f60a38c0985da17a0c25f8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-23T02:29:14Z","title_canon_sha256":"7321f8d8b31acc9cf5c4b9c08c875e6bd612807549c93c050ecc30ff03d58f84"},"schema_version":"1.0","source":{"id":"2502.16408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.16408","created_at":"2026-07-05T10:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"2502.16408v1","created_at":"2026-07-05T10:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16408","created_at":"2026-07-05T10:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"GS32W4NFU72J","created_at":"2026-07-05T10:18:52Z"},{"alias_kind":"pith_short_16","alias_value":"GS32W4NFU72JU4F2","created_at":"2026-07-05T10:18:52Z"},{"alias_kind":"pith_short_8","alias_value":"GS32W4NF","created_at":"2026-07-05T10:18:52Z"}],"graph_snapshots":[{"event_id":"sha256:062f4f05a69edb3bce1ab53b30db76d6ab2f65364e3d396d76db33a646def6f1","target":"graph","created_at":"2026-07-05T10:18:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.16408/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bence Het\\'enyi, Kai R. Ott, Michael E. Beverland","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-23T02:29:14Z","title":"Decision-tree decoders for general quantum LDPC codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16408","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a58e32d48595cd2f17f29574c8e7ad682250523daf4270588c7af71cd0338c63","target":"record","created_at":"2026-07-05T10:18:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4c3c524bde15bb8949a5b281def7e237a940e346c2f60a38c0985da17a0c25f8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-23T02:29:14Z","title_canon_sha256":"7321f8d8b31acc9cf5c4b9c08c875e6bd612807549c93c050ecc30ff03d58f84"},"schema_version":"1.0","source":{"id":"2502.16408","kind":"arxiv","version":1}},"canonical_sha256":"34b7ab71a5a7f49a70ba308efba1758aebc6c5fd3884b8290211d5450929200b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34b7ab71a5a7f49a70ba308efba1758aebc6c5fd3884b8290211d5450929200b","first_computed_at":"2026-07-05T10:18:52.985211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:18:52.985211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zwLoSIMm55ZSUUCzQ4vClfZvqF2KSzjUWEW1ZtGav/FeZHvsdovU8HCluSbuCoYr2t8qc7IylNLjC58A4goeCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:18:52.985692Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.16408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a58e32d48595cd2f17f29574c8e7ad682250523daf4270588c7af71cd0338c63","sha256:062f4f05a69edb3bce1ab53b30db76d6ab2f65364e3d396d76db33a646def6f1"],"state_sha256":"98ea47aecd28f59715c9ba924e203d29b50e3b86656b44552ad668c69ee26749"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Whtl/5JaOxxIQFrMA3Hc7oGSc4QOABtDSP/q+7c3WG2l6t5jtsFtoeT3W193cdy/x2gILHdL8CdT8YRN3Z+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T00:46:32.093018Z","bundle_sha256":"6585dcf25de0cc6f7ebfbcf51f8eb0b2446a2c1a7729023502837c458b80dd5f"}}