{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LSI5RJINEKMEKHFCVIG3XJCMQI","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":"024bce2b0d2c133114550991bd10676d75b4102fb3fb41c166a9e7a11f45a0a1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-11T12:36:30Z","title_canon_sha256":"8fee03e9ffad17d20f24b0354964a9604a7cf37224b8588ae4d63a03143ddfbd"},"schema_version":"1.0","source":{"id":"2507.08536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.08536","created_at":"2026-07-05T11:35:41Z"},{"alias_kind":"arxiv_version","alias_value":"2507.08536v1","created_at":"2026-07-05T11:35:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08536","created_at":"2026-07-05T11:35:41Z"},{"alias_kind":"pith_short_12","alias_value":"LSI5RJINEKME","created_at":"2026-07-05T11:35:41Z"},{"alias_kind":"pith_short_16","alias_value":"LSI5RJINEKMEKHFC","created_at":"2026-07-05T11:35:41Z"},{"alias_kind":"pith_short_8","alias_value":"LSI5RJIN","created_at":"2026-07-05T11:35:41Z"}],"graph_snapshots":[{"event_id":"sha256:082899c389db4547479f4a931dc10583f056c37562095fa74d87bdb92f778677","target":"graph","created_at":"2026-07-05T11:35:41Z","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/2507.08536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Lowering the resource overhead needed to achieve fault-tolerant quantum computation is crucial to building scalable quantum computers. We show that adapting conventional maximum likelihood (ML) decoders to a small subset of efficiently learnable physical error characteristics can significantly improve the logical performance of a quantum error-correcting code. Specifically, we leverage error information obtained from efficient characterization methods based on Cycle Error Reconstruction (CER), which yields Pauli error rates on the $n$ qubits of an error-correcting code. Although the total numb","authors_text":"Aditya Jain, Joseph Emerson, Pavithran Iyer, Stephen D. Bartlett","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-11T12:36:30Z","title":"Enhancing Decoding Performance using Efficient Error Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08536","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:a43cbdcbd417c7158bc0f4cc69dcbadf35ea42eb2456ddf5a76a29d1f48091fa","target":"record","created_at":"2026-07-05T11:35:41Z","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":"024bce2b0d2c133114550991bd10676d75b4102fb3fb41c166a9e7a11f45a0a1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-11T12:36:30Z","title_canon_sha256":"8fee03e9ffad17d20f24b0354964a9604a7cf37224b8588ae4d63a03143ddfbd"},"schema_version":"1.0","source":{"id":"2507.08536","kind":"arxiv","version":1}},"canonical_sha256":"5c91d8a50d2298451ca2aa0dbba44c822a939208c10122d41826f8629eed36ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c91d8a50d2298451ca2aa0dbba44c822a939208c10122d41826f8629eed36ff","first_computed_at":"2026-07-05T11:35:41.685305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:35:41.685305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zprTOwPIpJhRID94QgQefM0CdCcUxHMIyF2PVPWtGL4ddgobkiK4yjRW5gJLWYgiMGTkeJ8zrFbS+hI/pjXgBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:35:41.685799Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.08536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a43cbdcbd417c7158bc0f4cc69dcbadf35ea42eb2456ddf5a76a29d1f48091fa","sha256:082899c389db4547479f4a931dc10583f056c37562095fa74d87bdb92f778677"],"state_sha256":"584d853243966843609aa88194526c8d4b13cebb52d9d11771a83af25ed02dda"}