In the magic state cultivation paper, the authors mentioned: "due to a lack of better alternatives, we are forced to rely on Assumption 3.1." - which is to replace all the $T$ gates in the simulation with $S$ gates instead. However, they proceed to talk about the "dangers of using S as a proxy for T" in their figure 22. In general, I think they had issues verifying the simulation results when a $d=5$ colour code is used.
I counted 38 total $T$ or $T^{\dagger}$ gates in their $d=5$ colour code version. In principle they can use the $|\text{cat}_{n=39}\rangle$ stabiliser decomposition from this thesis to simulate the $d=5$ colour code cultivation results at a cost of 39366 times slower simulations. Albeit the higher cost to simulate, it seems like this can be parallelised. Note that $_1\langle T|\text{cat}_{n=39}\rangle = |T\rangle^{\otimes 38}$ (use ZX copy rule).
Has anyone thought of somehow incorporating Stim with PyZX or equivalent for stabiliser decompositions? 39366 classical CPU cores isn't too expensive in the grand scheme of things. Would be nice to actually verify their results.
Thesis on $|\text{cat}_{n=39}\rangle$: (Cutting-Edge Graphical Stabiliser Decompositions for Classical Simulation of Quantum Circuits, J Codsi, A thesis submitted for the degree of MSc in Mathematics and Foundations of Computer Science, Trinity 2022)