{"id":"47.4.3.c","row":226,"stored":{"file":"master_catalog.json","row":226,"construction":null,"columns_sha256":null},"parameters":{"n":47,"k":4,"d":3,"N":10,"r":6,"level":3},"gate":{"string":"01+23","human":"CS01\u00b7CS23","monomials":[[0,1],[2,3]],"sk_key":[[0,1],[2,3]],"sk_fingerprint":"4c6da188308a72a6","sk_canonical_frame":true,"relabelled_into_canonical_frame":false},"circuit":{"columns":[[0,1,3,5],[1,4,5],[1,6],[0,1,2,3,5,6],[0,2,3,4,5,6],[3,7],[0,1,5,7],[0,4,5,7],[1,6,7],[0,1,2,5,6,7],[1,2,4,5,6,7],[3,8],[1,5,8],[0,2,4,5,8],[1,2,3,6,8],[0,1,2,5,6,8],[0,1,2,3,4,5,6,8],[0,1,2,7,8],[1,3,5,7,8],[0,4,5,7,8],[0,3,6,7,8],[0,1,2,3,5,6,7,8],[0,1,4,5,6,7,8],[1,9],[5,9],[0,2,4,5,9],[0,3,6,9],[1,3,5,6,9],[0,2,3,4,5,6,9],[0,1,2,3,7,9],[3,5,7,9],[0,1,4,5,7,9],[2,3,6,7,9],[1,5,6,7,9],[0,1,4,5,6,7,9],[0,3,8,9],[1,5,8,9],[1,3,4,5,8,9],[1,2,6,8,9],[0,3,5,6,8,9],[0,1,2,4,5,6,8,9],[0,1,7,8,9],[1,3,5,7,8,9],[0,1,3,4,5,7,8,9],[2,6,7,8,9],[0,5,6,7,8,9],[1,2,3,4,5,6,7,8,9]]},"distance":{"d":3,"is_exact":true,"upper":3,"witness":[0,2,3],"A_d":253,"certified":null},"clifford":{"kind":"required","correction":{"S":[[0,3],[1,1],[2,3],[3,1]],"CZ":[[0,6],[0,7],[0,8],[1,4],[1,5],[1,9],[2,3],[2,6],[2,8],[3,4],[3,5],[3,7]]},"rotation_powers":null},"metrics":{"gamma":2.2426958682368214,"gamma_t":1.8736256218082787,"gamma_rho":2.873625621808279,"gamma_claim":2.2426958682368214,"gamma_t_claim":1.8736256218082787,"gamma_rho_claim":2.873625621808279,"v_ex":2,"rate":0.0851063829787234,"t_count":6,"poly_degree":2,"effective_width":4},"provenance":{"regimes":["exhaustive classification n<=54 (Pareto point)","AI search: multi-agent campaign 39<=n<=127"],"discovery":"AI search","strongest_claim":"a Pareto point of the exhaustive classification of generalised triorthogonal protocols through length 54 (classification/length54/): no protocol with n <= 54, the same CNOT+S output class and the same exact distance has n and S both no larger and one of them smaller, where S counts every matrix row -- the N of this table","sources":[{"regime":"AI search: multi-agent campaign 39<=n<=127","file":"magic-states-AI/campaigns/2026-09-01_39to127_broad/found/n47_k4_d3_CS-CS.json","label":"15","N":10,"d":3,"d_is_exact":true,"origin":null,"provenance":"actor-1, round 1, campaigns/2026-09-01_39to127_broad. Parent: an r=6 punctured simplex, one of the 1953 legal n=47 column sets (a single autocorrelation class; work/actor-1/tools/parents6.py). Search: campaigns/2026-08-31_48to128/tools/simplex_general.py --r 6 --tail 100 --restarts 24 --coset-cap 80 --node-cap 6000. Verified by this campaign's tools/verify.py --distance 3 --require-disjoint."},{"regime":"exhaustive classification n<=54 (Pareto point)","file":"classification/length54/pareto_frontier.json","label":"protocol 28","N":10,"d":3,"d_is_exact":true,"origin":"exhaustive classification of generalised triorthogonal protocols through length 54 (Wills, Jain and Singh)","provenance":"Pareto point 28 of the length-54 classification: output class Q4_0000000000000120 (CS^(tensor 2)), (n, S, d_Z) = (47, 10, 3), leading error coefficient 257; the outputs are its 4 logical rows"}]},"references":[{"key":"wills2026classification","short":"Wills et al. (2026)","full":"A. Wills, S. P. Jain, and S. Singh, \"Classification of Generalised Triorthogonal Codes through Length 54,\" arXiv:2609.30860 (2026).","url":"https://arxiv.org/abs/2609.30860","date":"2026-09-25"},{"key":"jain2026symmetry","short":"Jain et al. (2026)","full":"S. P. Jain, A. Wills, and S. Singh, \"Symmetry and AI-assisted discovery of magic-state factories,\" arXiv:2610.06535 (2026).","url":"https://arxiv.org/abs/2610.06535","date":"2026-10-05"}]}