{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CZ2M2P7456SWZTEZDSPRPP7MX2","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":"9fc5f483f03c03ab0c4c269e9e63c6d98654f4e1bacbccdd3c9df13d41f39530","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-21T22:24:46Z","title_canon_sha256":"b51b8a069a2f91a8f6f5e1eddaf0e327f644b9c9e990920e4f84f33299a62f55"},"schema_version":"1.0","source":{"id":"2601.15505","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.15505","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2601.15505v3","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.15505","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"CZ2M2P7456SW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"CZ2M2P7456SWZTEZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"CZ2M2P74","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:70431975e410fd4e71838c8e23f7a743f270d8c84dfeeefb6fcbb3e66e9a655c","target":"graph","created_at":"2026-05-18T02:44:31Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Given any [[n, k]] stabilizer generator set, we construct a full symplectic tableau, compute the induced joint distribution of logical Pauli errors and syndromes under the physical Pauli channel, and obtain an achievable rate via a hashing bound with decoder side information."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The induced logical channel after inner decoding can be treated as memoryless for re-applying the hashing bound, with the joint error-syndrome distribution accurately capturing all relevant statistics."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Arbitrary small stabilizer codes used as channel transforms improve hashing bounds for Pauli channels beyond repetition codes via induced logical noise distributions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Any stabilizer code can improve hashing rates on asymmetric Pauli channels by acting as a channel transform."}],"snapshot_sha256":"46f19dddaa43a468ee059bcbb693055d677b8bd36f7c1fa8fe0979ccf0570c52"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The quantum hashing bound guarantees that rates up to $1-H(p_I, p_X, p_Y, p_Z)$ are achievable for memoryless Pauli channels, but it is not generally tight. A known way to improve achievable rates for certain asymmetric Pauli channels is to apply a small inner stabilizer code to a few channel uses, decode, and treat the resulting logical noise as an induced Pauli channel; reapplying the hashing argument to this induced channel can beat the baseline hashing bound. We generalize this induced-channel viewpoint to arbitrary stabilizer codes used purely as channel transforms. Given any $ [\\![ n, k ","authors_text":"Matthieu R. Bloch, Ruediger Urbanke, Shrinivas Kudekar, Tyler Kann","cross_cats":["math.IT","quant-ph"],"headline":"Any stabilizer code can improve hashing rates on asymmetric Pauli channels by acting as a channel transform.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-21T22:24:46Z","title":"Stabilizer-Code Channel Transforms Beyond Repetition Codes for Improved Hashing Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.15505","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T11:38:55.932829Z","id":"b24abcac-d4c4-4fcc-8ac4-e2136268c8ae","model_set":{"reader":"grok-4.3"},"one_line_summary":"Arbitrary small stabilizer codes used as channel transforms improve hashing bounds for Pauli channels beyond repetition codes via induced logical noise distributions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Any stabilizer code can improve hashing rates on asymmetric Pauli channels by acting as a channel transform.","strongest_claim":"Given any [[n, k]] stabilizer generator set, we construct a full symplectic tableau, compute the induced joint distribution of logical Pauli errors and syndromes under the physical Pauli channel, and obtain an achievable rate via a hashing bound with decoder side information.","weakest_assumption":"The induced logical channel after inner decoding can be treated as memoryless for re-applying the hashing bound, with the joint error-syndrome distribution accurately capturing all relevant statistics."}},"verdict_id":"b24abcac-d4c4-4fcc-8ac4-e2136268c8ae"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8a6a3725afa6783e72a69109d48d725292d208a9a3d10127a70e72e3b68eb5e0","target":"record","created_at":"2026-05-18T02:44:31Z","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":"9fc5f483f03c03ab0c4c269e9e63c6d98654f4e1bacbccdd3c9df13d41f39530","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-21T22:24:46Z","title_canon_sha256":"b51b8a069a2f91a8f6f5e1eddaf0e327f644b9c9e990920e4f84f33299a62f55"},"schema_version":"1.0","source":{"id":"2601.15505","kind":"arxiv","version":3}},"canonical_sha256":"1674cd3ffcefa56ccc991c9f17bfecbea1b78ccaf8f0e4b9ac1f29c63b2e7e5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1674cd3ffcefa56ccc991c9f17bfecbea1b78ccaf8f0e4b9ac1f29c63b2e7e5d","first_computed_at":"2026-05-18T02:44:31.895846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:31.895846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7wWAg8V41pKMxXZbM3zq1o+iA+8P7XZSxtFyN35cgXn1UUPBRUOj49KyDJjiInHsCeZJpA0pOhI9pJLRTaTHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:31.896260Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.15505","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a6a3725afa6783e72a69109d48d725292d208a9a3d10127a70e72e3b68eb5e0","sha256:70431975e410fd4e71838c8e23f7a743f270d8c84dfeeefb6fcbb3e66e9a655c"],"state_sha256":"c6a6b17826d9f20c344b0f979e7eb19f23a7209c1c119484477082bde1c6ad54"}