%====================================================================== \section{Findings about the paper}\label{s:findings} We recorded $70$ entries about version 1 of [U1]: $5$ errors, $11$ gaps and $11$ unstated hypotheses, besides $43$ points of presentation, notation or simplification. They include every place where the formalization, the written-out proofs, their referee reports or the audits found a statement or proof wrong, incomplete or relying on something unstated. For each, the list gives replacement text for [U1] and, where it applies, how the formal proof and the written-out proofs treat it. No entry changes Theorem~\ref{thm:main} or its corollaries, and where an entry changes a statement of [U1], the paper's proofs already use the new statement. The list is the file \lean{changes.md} of the record [repo], and \lean{PROVENANCE.md} there says for each entry where it was found and which documents are involved, among them the findings ledger \lean{FINDINGS.md} of the Lean archive. Versions 2 and later of [U1] apply every entry that is not marked optional. The five errors are statements or proof steps that are false as written. Display (A.3) takes the supremum over the interpolation parameters inside the sum over elementary terms, while Proposition A.7 combines all terms with one link datum and bounds that combination uniformly in the parameters, which needs the supremum outside the sum; the corrected form has the same proof and the same constants. Section D.3(c) bounds the number of points at graph distance $k$ in a slit graph by $4k^2+2$, the size of an $\ell^1$-sphere of $\mathbb Z^3$, which fails on slit graphs: in a three-dimensional H-tree the sphere of radius $189$ about the root has $2^{18}=262144$ points, while $4\cdot189^2+2=142886$. What the proof uses is the bound $\sum_ye^{-a\,d(x,y)}\le64a^{-3}$ for $0