\section{The vertex-transitive case}\label{app:cocycle}\label{app:vt} For vertex-transitive graphs, Theorem~\ref{thm:b8} combines Lemma~\ref{lem:cocycle} with the site tilted-threshold separation of Tran and Nguyen. This deduction is not needed for Theorem~\ref{thm:main}, since Theorem~\ref{thm:b8} covers vertex-transitive graphs too. \begin{proposition}[{Tran--Nguyen~\cite[Proposition~5.5]{TN26} and Hutchcroft}]\label{prop:vt} Let $G$ be an infinite, connected, locally finite, vertex-transitive graph whose automorphism group is nonunimodular. For Bernoulli site percolation: \begin{enumerate}[label=\textup{(\arabic*)},leftmargin=2.2em] \item $\norm{T_p}_{2\to2}\le\chi_{p,\lambda}(v)$ for every $p\in[0,1]$ and $\lambda\in\R$; \item $p_c0$. The $u=v$ term is $\Pp_p(v\lr v)=p$ in both. Finally, \cite{TN26} defines $p_{st}=p_{sc}(1/2)$, while Hutchcroft defines $p_t=\sup\{p:X_{p,\lambda}<\infty\text{ for some }\lambda\}$; for the site kernel these agree. Indeed $p_t\ge p_{st}$ is trivial; conversely, if $\chi_{p,\lambda}<\infty$, then~\cite[(5.30)]{TN26} applied to $F(a,b,\omega)=\1\{a\lr b\text{ in } \omega\}\Delta(a,b)^\lambda$, which vanishes unless $a$ and $b$ are open, and $\Delta(x,v)=\Delta(v,x)^{-1}$ give $\chi_{p,\lambda}(v)=\chi_{p,1-\lambda}(v)$, and Cauchy--Schwarz against $\Pp_p(v\lr\cdot)$ gives $\chi_{p,1/2}\le(\chi_{p,\lambda}\chi_{p,1-\lambda})^{1/2}<\infty$, so $p\le p_{sc}(1/2)$, as in the proof of~\cite[Proposition~5.5]{TN26}. \paragraph{The inputs of~\cite[Proposition~5.5]{TN26}.} Its hypotheses, the estimates (5.23)--(5.26), (5.34), (5.59)--(5.60) and (5.73) there, are each derived inside~\cite[Section~5]{TN26} from earlier material of that section and from the external results cited there, including the tilted mass-transport principle~\cite[Proposition~2.2]{HutNU} and site sharpness~\cite{AV08}. Only~(5.26) and~(5.34) enter the inequality $p_{sc}p_c$ with $\chi_{p',1/2}<\infty$, hence $\chi_{p_c,1/2}<\infty$, and~(1) bounds $\norm{T_{p_c}}$. The supremum identity is Lemma~\ref{lem:passage}. \end{proof}