2.2.4 denotes the multiset $A=(2,2,4)$. Each index $d$ contributes every reduced fraction $j/d$ with $1\leq j<d$ and $\gcd(j,d)=1$, preserving multiplicity, to the four upper parameters $\alpha_1,\ldots,\alpha_4$. The four arithmetic lower residues are zero modulo integers, corresponding to the three analytic lower parameters $1,1,1$. Equivalently, the upper multiset is $\{r_1,1-r_1,r_2,1-r_2\}$ with the pairs in (4). These are the complete fourteen systems classified in [1].2.2.2.2: $(r_1,r_2)=(1/2,1/2)$; $X(2,2,2,2)\subset\mathbb P^7$, Table 4; $N_A=8$; newform 8.4.a.a; $\chi_A=\chi_{1}$.2.2.3: $(r_1,r_2)=(1/2,1/3)$; $X(2,2,3)\subset\mathbb P^6$, Table 4; $N_A=36$; newform 36.4.a.a; $\chi_A=\chi_{3}$.2.2.4: $(r_1,r_2)=(1/2,1/4)$; $X(2,4)\subset\mathbb P^5$, Table 4; $N_A=16$; newform 16.4.a.a; $\chi_A=\chi_{2}$.2.2.6: $(r_1,r_2)=(1/2,1/6)$; $X(2,6)\subset\mathbb P^5(1,1,1,1,1,3)$, Table 4; $N_A=72$; newform 72.4.a.b; $\chi_A=\chi_{1}$.3.3: $(r_1,r_2)=(1/3,1/3)$; $X(3,3)\subset\mathbb P^5$, Table 4; $N_A=27$; newform 27.4.a.a; $\chi_A=\chi_{1}$.3.4: $(r_1,r_2)=(1/3,1/4)$; $X(3,4)\subset\mathbb P^5(1,1,1,1,1,2)$, Table 4; $N_A=9$; newform 9.4.a.a; $\chi_A=\chi_{6}$.3.6: $(r_1,r_2)=(1/3,1/6)$; $X(6)\subset\mathbb P^4(1,1,1,1,2)$, Table 3; $N_A=108$; newform 108.4.a.a; $\chi_A=\chi_{3}$.4.4: $(r_1,r_2)=(1/4,1/4)$; $X(4,4)\subset\mathbb P^5(1,1,2,1,1,2)$, Table 4; $N_A=32$; newform 32.4.a.a; $\chi_A=\chi_{1}$.4.6: $(r_1,r_2)=(1/4,1/6)$; $X(4,6)\subset\mathbb P^5(1,1,2,1,2,3)$, Table 4; $N_A=144$; newform 144.4.a.f; $\chi_A=\chi_{2}$.6.6: $(r_1,r_2)=(1/6,1/6)$; $X(6,6)\subset\mathbb P^5(1,2,3,1,2,3)$, Table 4; $N_A=216$; newform 216.4.a.c; $\chi_A=\chi_{1}$.5: $(r_1,r_2)=(1/5,2/5)$; $X(5)\subset\mathbb P^4(1,1,1,1,1)$, Table 3; $N_A=25$; newform 25.4.a.b; $\chi_A=\chi_{5}$.8: $(r_1,r_2)=(1/8,3/8)$; $X(8)\subset\mathbb P^4(1,1,1,1,4)$, Table 3; $N_A=128$; newform 128.4.a.b; $\chi_A=\chi_{2}$.10: $(r_1,r_2)=(1/10,3/10)$; $X(10)\subset\mathbb P^4(1,1,1,2,5)$, Table 3; $N_A=200$; newform 200.4.a.f; $\chi_A=\chi_{1}$.12: $(r_1,r_2)=(1/12,5/12)$; $X(12,12)\subset\mathbb P^5(1,1,4,6,6,6)$, Table 4; $N_A=864$; newform 864.4.a.a; $\chi_A=\chi_{1}$.import numberdb.sage as numberdb
from sage.rings.integer_ring import ZZ
from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
p = ZZ(37)
m = p**3
term = total = ZZ(1)
for n in range(int(p)-1):
for j in (1, 2, 3, 4): # upper parameters j/5, template 5
term = (term*(j+5*n)*ZZ(5).inverse_mod(m)) % m
term = (term*ZZ(n+1).inverse_mod(m)**4) % m
total = (total+term) % m
a = total if 2*total <= m else total-m
assert a*a <= 4*p**3
R = PolynomialRing(ZZ, 'T')
R([1, -a, p**3])Exact modular rational arithmetic computes the truncated series in Theorem 1 of [1] modulo $p^3$. Every denominator is invertible for the selected primes. The residue is recovered as a signed integer and checked against $a_{A,p}^2\leq4p^3$; the inequality $p^6>16p^3$ makes recovery unique. No floating-point rounding is used.
Independent exact PARI newform computations reproduce all $112$ signed traces and complete polynomials. A coefficient prefix through index $16$ selects each source form, and its coefficients through index $99$ agree with the inspected exact LMFDB data. The unused primes $37,41$ provide further recognition controls.
A separately implemented finite-character-sum formula, Theorem 1.3 of [2], checks every trace, including nonsplit prime classes, after subtraction of $\chi_A(p)p$. The $384$-bit complex-ball computation requires finite real and imaginary radii below $10^{-80}$ and isolates a unique integer using the integrality of the geometric trace. Exact all-half quadratic-character convolutions check all eight selected primes. Known nonzero factors, all four zero traces, and deliberately reversed trace and incorrect character corrections control the comparisons. The attached evidence records software versions, actual bounds, source hashes and checks of values read from the draft.