1. The theory section restates textbook facts.
Equation (14) says the rollout error grows like L^N e0 plus a sum of one-step defects. That is the standard one-step recursion in numerical ODE books (Hairer et al., 1993; LeVeque, 2007). Theorem A.1 proves it by the triangle inequality and induction. It does not describe APEX, and the text says it is not a stability guarantee.
Proposition A.3 says a finer view of the search state cannot make the best rule worse, because the coarse rule is a special case of the fine rule. Proposition A.4 says the same thing for a larger policy set. Both are true because one set sits inside the other. They do not show that this LLM uses the extra diagnostics well. The authors say that. Then these propositions should not be offered as analysis of the method.
Lemma A.5 says a library name that expands to the same tree has the same meaning. That is the definition of a macro. DreamCoder already learns reusable program pieces from search (Ellis et al., 2021). The length claim in Proposition A.6 is the usual “a macro can shorten the tree” fact. It does not say the search gets faster. The paper says that too.
This is the same move as a weak-journal note that reprints a known method and then prints a known error bound. Abascal Fuentes et al. (2022), in the Journal of Advances in Mathematics and Computer Science, take Horner’s rule, split the polynomial into blocks, and then analyze the rounding error. The venue is a low-bar ScienceDomain title. The scientific habit matches Section 4 here: a familiar object, a small wrapper, and a bound that was already true before the wrapper.
Bohannon (2013) sent a badly flawed paper to many open-access journals. More than half accepted it. A basic reader was supposed to see the flaw. Here, a reader who knows numerical PDE can see that Equation (14) is the standard rollout bound, and that the 19.3 times line is one run against a coarse scheme.
2. The 19.3 times line is one search path against a weak coarse scheme.
Figure 2 gives R40 = 7.34×10⁻³ for APEX and 1.42×10⁻¹ for the coarse spectral solver. The ratio is about 19.3. The text says this path was not repeated, so it does not estimate how often the search finds it. It also says there is no term-by-term knockout.
The coarse solver in that setting is skew convection, a hard two-thirds dealias, and RK4 with four substeps, on a 64² grid cut down from 128² (Appendix A.4.4). That is not a strong large-eddy baseline. The usual tools for a cutoff grid are a dynamic Smagorinsky term (Germano et al., 1991), a scale-similarity term (Bardina et al., 1980), approximate deconvolution (Stolz and Adams, 1999), and spectral viscosity (Tadmor, 1989). None of these is in the table. Learned coarse corrections already exist too (Bar-Sinai et al., 2019; Kochkov et al., 2021; Stachenfeld et al., 2022).
The found update is an extra field z near the cutoff, with fitted numbers 2.125, 0.925, and 6.38, plus weak-RA constants A = 0.03125 and q0 = 0.63. The start library already contains a generic extra-state primitive. So the search was allowed to add a hidden field before it “discovered” one. The missing test is the same program with z removed, and the same program with the feedback term removed.
3. Beating the neural nets is an easy win. The real gap to the coarse solver is small.
On Burgers, the coarse solver already has R40 = 8.66×10⁻⁵. FNO has 4.38×10⁻². The equation is known, and a spectral reference exists (ETDRK4, Kassam and Trefethen, 2005). A neural operator trained for 100 epochs of five-step push-forward is the wrong main rival. FNO, Transolver, LinearNO, and Tucker-FNO are for maps when you do not want to write the scheme (Li et al., 2021; Wu et al., 2024). Here the scheme is the object being searched.
Against the coarse solver, the R40 drops are about 26% (Burgers), 24% (KS), 23% (Navier–Stokes), and 19% (Gray–Scott). On the wave, APEX is worse. The ten-run wave row in Table 9 picks the best of ten validation runs and then looks better (1.20×10⁻³ versus 1.42×10⁻³). That is extra search, not the default method. The paper’s own selected programs for Burgers, KS, Gray–Scott, and the wave are not printed. Only the hard Navier–Stokes program is shown. A reader cannot see whether APEX found a new scheme or a known one, such as ETDRK4, CNAB2, or a dealias mask (Orszag, 1971; Ascher et al., 1995).
4. The reuse test stays inside one equation family.
Table 3 sends a Burgers library and a KS library to a PDE that is Burgers plus a fourth-derivative term. Full reuse beats scratch (R40 2.05×10⁻⁴ versus 7.20×10⁻⁴) and beats WENO5+FD4+IMEX. The two sources are the two pieces of the target. The paper says library and memory are transferred together, so the table does not say which one helped. CodePDE, AutoNumerics, and FunSearch already search solver code with an evaluator (Li et al., 2026; Du et al., 2026; Romera-Paredes et al., 2024). Those systems are cited and not run on this DSL.
5. The data and the agent cannot be checked.
All five sets are new. No PDEBench trajectory is reused (Takamoto et al., 2022). The agent is gpt-5.6-sol through a closed API (Appendix A.4.4). The prompt is not in the paper. Three synthesis seeds are not enough for the 19.3 times claim, because that claim is a single path.