{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SD7RMIYKCF5FAIBCKR3U4FXIHO","short_pith_number":"pith:SD7RMIYK","schema_version":"1.0","canonical_sha256":"90ff16230a117a50202254774e16e83ba6b341b85f7eaa7a298c291ebf70117d","source":{"kind":"arxiv","id":"2607.21160","version":1},"attestation_state":"computed","paper":{"title":"Duality constrains optimal thresholds in quantum error correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Basudha Srivastava, Dominic J. Williamson, Haoyuan Luo, Lucas H. English, Stephen D. Bartlett, Yangming Wang","submitted_at":"2026-07-23T10:42:57Z","abstract_excerpt":"Error correction thresholds are often treated as the primary figure of merit for comparing quantum error-correcting code families. We show that the optimal error correction threshold for many commonly considered codes is constrained to a single universal value at leading order in a replica limit. Through a statistical mechanical mapping, we demonstrate that duality constrains all zero-rate em-symmetric CSS codes to have the same optimal code capacity threshold. Here, em symmetry means that the X- and Z-type parity-check matrices are equivalent up to row and column permutations. Under this stat"},"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":"2607.21160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-23T10:42:57Z","cross_cats_sorted":[],"title_canon_sha256":"bb09a1af7169dfb6dd890eda26b062e37511785934f5e94b2f6c7593f5e271c1","abstract_canon_sha256":"4331c683c4e67efaa09d891edcca9d9cb2ae94a68b3cb42eae4f0e467462bbb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-24T01:23:56.357536Z","signature_b64":"W8igiY3FCgsLTImTJOoDWsktVDCkCCPco9s0Lh0+n+mZ7FO9kLIHrlAHTvQjM+3t1f1bpiyt7w39QZC+FV5TDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90ff16230a117a50202254774e16e83ba6b341b85f7eaa7a298c291ebf70117d","last_reissued_at":"2026-07-24T01:23:56.356660Z","signature_status":"signed_v1","first_computed_at":"2026-07-24T01:23:56.356660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Duality constrains optimal thresholds in quantum error correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Basudha Srivastava, Dominic J. Williamson, Haoyuan Luo, Lucas H. English, Stephen D. Bartlett, Yangming Wang","submitted_at":"2026-07-23T10:42:57Z","abstract_excerpt":"Error correction thresholds are often treated as the primary figure of merit for comparing quantum error-correcting code families. We show that the optimal error correction threshold for many commonly considered codes is constrained to a single universal value at leading order in a replica limit. Through a statistical mechanical mapping, we demonstrate that duality constrains all zero-rate em-symmetric CSS codes to have the same optimal code capacity threshold. Here, em symmetry means that the X- and Z-type parity-check matrices are equivalent up to row and column permutations. Under this stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21160","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/2607.21160/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":"2607.21160","created_at":"2026-07-24T01:23:56.357111+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.21160v1","created_at":"2026-07-24T01:23:56.357111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21160","created_at":"2026-07-24T01:23:56.357111+00:00"},{"alias_kind":"pith_short_12","alias_value":"SD7RMIYKCF5F","created_at":"2026-07-24T01:23:56.357111+00:00"},{"alias_kind":"pith_short_16","alias_value":"SD7RMIYKCF5FAIBC","created_at":"2026-07-24T01:23:56.357111+00:00"},{"alias_kind":"pith_short_8","alias_value":"SD7RMIYK","created_at":"2026-07-24T01:23:56.357111+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SD7RMIYKCF5FAIBCKR3U4FXIHO","json":"https://pith.science/pith/SD7RMIYKCF5FAIBCKR3U4FXIHO.json","graph_json":"https://pith.science/api/pith-number/SD7RMIYKCF5FAIBCKR3U4FXIHO/graph.json","events_json":"https://pith.science/api/pith-number/SD7RMIYKCF5FAIBCKR3U4FXIHO/events.json","paper":"https://pith.science/paper/SD7RMIYK"},"agent_actions":{"view_html":"https://pith.science/pith/SD7RMIYKCF5FAIBCKR3U4FXIHO","download_json":"https://pith.science/pith/SD7RMIYKCF5FAIBCKR3U4FXIHO.json","view_paper":"https://pith.science/paper/SD7RMIYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.21160&json=true","fetch_graph":"https://pith.science/api/pith-number/SD7RMIYKCF5FAIBCKR3U4FXIHO/graph.json","fetch_events":"https://pith.science/api/pith-number/SD7RMIYKCF5FAIBCKR3U4FXIHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SD7RMIYKCF5FAIBCKR3U4FXIHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SD7RMIYKCF5FAIBCKR3U4FXIHO/action/storage_attestation","attest_author":"https://pith.science/pith/SD7RMIYKCF5FAIBCKR3U4FXIHO/action/author_attestation","sign_citation":"https://pith.science/pith/SD7RMIYKCF5FAIBCKR3U4FXIHO/action/citation_signature","submit_replication":"https://pith.science/pith/SD7RMIYKCF5FAIBCKR3U4FXIHO/action/replication_record"}},"created_at":"2026-07-24T01:23:56.357111+00:00","updated_at":"2026-07-24T01:23:56.357111+00:00"}