{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:J67CYT4CE7H552WKUCVC5A5EGI","short_pith_number":"pith:J67CYT4C","schema_version":"1.0","canonical_sha256":"4fbe2c4f8227cfdeeacaa0aa2e83a432214ba4c522144523f37f0f9c411eabe7","source":{"kind":"arxiv","id":"2504.16999","version":1},"attestation_state":"computed","paper":{"title":"Learning to decode logical circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chao Wan, Eun-Ah Kim, Jin Peng Zhou, Kilian Q. Weinberger, Yichen Xu, Yiqing Zhou","submitted_at":"2025-04-23T18:00:04Z","abstract_excerpt":"With the development of quantum hardware bringing the error-corrected quantum circuits to the near future, the lack of an efficient polynomial-time decoding algorithms for logical circuits presents a critical bottleneck. While quantum memory decoding has been well-studied, inevitable correlated errors introduced by entangling logical gates prevent the straightforward generalization of quantum memory decoders. We introduce a data-centric modular decoder framework, Multi-Core Circuit Decoder (MCCD), consisting of decoder modules corresponding to each logical operation supported by the quantum ha"},"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":"2504.16999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-23T18:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"8191a7b4426da8b518ff8de9e1570535c8a519e6d71c182ad9a4f31a1e4a1ec7","abstract_canon_sha256":"b9fe4ff5df4d4898f499760297d83514a5f86fb2a1b278206dfcbe1d56ac3d0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:20.351687Z","signature_b64":"f6O4qGSl4h25gA5S0esWw7Gll7Kl7AtA3vq4rcmPI/E3LX2hOhEi1y6LxXoXCz7LyrOoyjgVwUKlX+k6CagJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fbe2c4f8227cfdeeacaa0aa2e83a432214ba4c522144523f37f0f9c411eabe7","last_reissued_at":"2026-07-05T10:53:20.351125Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:20.351125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to decode logical circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chao Wan, Eun-Ah Kim, Jin Peng Zhou, Kilian Q. Weinberger, Yichen Xu, Yiqing Zhou","submitted_at":"2025-04-23T18:00:04Z","abstract_excerpt":"With the development of quantum hardware bringing the error-corrected quantum circuits to the near future, the lack of an efficient polynomial-time decoding algorithms for logical circuits presents a critical bottleneck. While quantum memory decoding has been well-studied, inevitable correlated errors introduced by entangling logical gates prevent the straightforward generalization of quantum memory decoders. We introduce a data-centric modular decoder framework, Multi-Core Circuit Decoder (MCCD), consisting of decoder modules corresponding to each logical operation supported by the quantum ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16999","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/2504.16999/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":"2504.16999","created_at":"2026-07-05T10:53:20.351192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.16999v1","created_at":"2026-07-05T10:53:20.351192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16999","created_at":"2026-07-05T10:53:20.351192+00:00"},{"alias_kind":"pith_short_12","alias_value":"J67CYT4CE7H5","created_at":"2026-07-05T10:53:20.351192+00:00"},{"alias_kind":"pith_short_16","alias_value":"J67CYT4CE7H552WK","created_at":"2026-07-05T10:53:20.351192+00:00"},{"alias_kind":"pith_short_8","alias_value":"J67CYT4C","created_at":"2026-07-05T10:53:20.351192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.10835","citing_title":"Rigorous estimation of error thresholds of transversal Clifford logical circuits","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J67CYT4CE7H552WKUCVC5A5EGI","json":"https://pith.science/pith/J67CYT4CE7H552WKUCVC5A5EGI.json","graph_json":"https://pith.science/api/pith-number/J67CYT4CE7H552WKUCVC5A5EGI/graph.json","events_json":"https://pith.science/api/pith-number/J67CYT4CE7H552WKUCVC5A5EGI/events.json","paper":"https://pith.science/paper/J67CYT4C"},"agent_actions":{"view_html":"https://pith.science/pith/J67CYT4CE7H552WKUCVC5A5EGI","download_json":"https://pith.science/pith/J67CYT4CE7H552WKUCVC5A5EGI.json","view_paper":"https://pith.science/paper/J67CYT4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.16999&json=true","fetch_graph":"https://pith.science/api/pith-number/J67CYT4CE7H552WKUCVC5A5EGI/graph.json","fetch_events":"https://pith.science/api/pith-number/J67CYT4CE7H552WKUCVC5A5EGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J67CYT4CE7H552WKUCVC5A5EGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J67CYT4CE7H552WKUCVC5A5EGI/action/storage_attestation","attest_author":"https://pith.science/pith/J67CYT4CE7H552WKUCVC5A5EGI/action/author_attestation","sign_citation":"https://pith.science/pith/J67CYT4CE7H552WKUCVC5A5EGI/action/citation_signature","submit_replication":"https://pith.science/pith/J67CYT4CE7H552WKUCVC5A5EGI/action/replication_record"}},"created_at":"2026-07-05T10:53:20.351192+00:00","updated_at":"2026-07-05T10:53:20.351192+00:00"}