\section{Proofs of the site tools and of the bond corollary}\label{app:tools} This appendix proves the statements of Section~\ref{sec:tools}, which are site adaptations of the corresponding lemmas of~\cite[Section~2]{OAINU}, writing out every changed step, and then Corollary~\ref{cor:bond}. \subsection{The site tools} \begin{proof}[Proof of Lemma~\ref{lem:crit-finite}] An open self-avoiding path with $n+1$ sites from $x$ has probability at most $d^np^{n+1}$, so there is no infinite cluster when $pd<1$. For the upper bound, the number of connected sets of size $n$ containing $x$ is at most $d^{2n}$~\cite[Lemma~2.2]{OAINU}. If $C_x=A$ then $\partial A$ is closed and $|\partial A|\ge h_Vn$, so $\Pp_p(|C_x|<\infty)\le(1-p)+\sum_{n\ge1}d^{2n}(1-p)^{h_Vn}<1$ for $p$ near $1$. As in~\cite[Lemma~2.2]{OAINU}, $|B(x,r+1)|\ge(1+h_V)|B(x,r)|$, so $G$ has exponential growth, and with $p_c<1$ the site theorem~\cite[Theorem~1.1(2)]{Pei26b} gives no infinite cluster at $p_c$. Countability gives all vertices at once, and a cluster in an induced subgraph lies inside a full-graph cluster. \end{proof} \begin{proof}[Proof of Lemma~\ref{lem:tools}] Harris's inequality~\cite{Har60} and the van den Berg--Kesten inequality~\cite{vdBK85}: the proofs quoted in~\cite[Lemma~2.3]{OAINU} are for an arbitrary finite product of Bernoulli bits followed by exhaustion, and apply verbatim to vertex bits. For the tree bound, on the event take a simple open path $\pi$ from $x$ to $y$ in $D$ and a simple open path from $z$ to $x$, and let $w$ be its first vertex on $\pi$. The three sets $\pi[x,w]$ (which contains $w$), $\pi(w,y]$ and the part of the $z$-path strictly before $w$ are pairwise disjoint sets of open vertices. The second is empty if and only if $w=y$, and otherwise it is an open path from a neighbour of $w$ to $y$; likewise for $z$. A union over $w$ and the two neighbours, and the van den Berg--Kesten inequality, give $\Pp\le\sum_wT(x,w)(I+\Adj T)(w,y)(I+\Adj T)(w,z)$, and~\eqref{eq:H} gives~\eqref{eq:tree}. Summing over $y,z$ gives $\E_ps_x^2\le\kappa_p\chi_{\max}^3$. \end{proof} \begin{proof}[Proof of Lemma~\ref{lem:threshold-order}] The proof of~\cite[Lemma~2.4]{OAINU} applies verbatim. Under almost sure uniqueness at $p$, some vertex has $\Pp_p(|C_x|=\infty)>0$, by countability. Harris's inequality with the event that the finitely many sites of a fixed path from $x$ to $y$ are open makes this positive at every vertex, and the finitely many types give $\inf_x\theta_x=\theta>0$. Uniqueness and Harris's inequality give $T_p(x,y)\ge\Pp_p(x\lr\infty,\ y\lr\infty)\ge\theta^2$, so $\ip{\1_F}{T_p\1_F}\ge\theta^2|F|^2$ for finite $F$, and $T_p$ is unbounded. The site kernel $T_p$ is entrywise increasing in $p$, so the parameters with bounded $T_p$ form a downward interval, and $\ptwo\le p_u$. \end{proof} \begin{proof}[Proof of Lemma~\ref{lem:sharpness}] Finiteness of $\chi_x(p)$ for $pp_c$. \emph{$N_{12}\ne1$.} Put $\theta(x)=\Pp_{p_1}(|C_x|=\infty)$. Some $\theta(x)$ is positive, and $\theta(x)\ge p_1^l\theta(y)$ along an open path of length $l$ by Harris's inequality, so $\theta_*=\inf_x\theta(x)>0$ by the finitely many types. If $N_{12}=1$, Harris's inequality gives $T_{p_2}(x,y)\ge\theta_*^2$, contradicting boundedness as in Lemma~\ref{lem:threshold-order}. \emph{$N_{12}$ is not a finite $n\ge2$.} By countability there are fixed $x,y$ which, with positive probability, lie in infinite $p_1$-clusters in distinct $p_2$-clusters. Replace the labels of the vertices of a fixed finite path from $x$ to $y$, endpoints included, by independent uniforms on $[0,p_1]$. The modified law is absolutely continuous with respect to the original, and the modification only opens sites at both parameters. Opening finitely many sites, each adjacent to at most $d$ old clusters, joins only finitely many old clusters into any new cluster, so every infinite new $p_1$-cluster contains an infinite old one; every old counted $p_2$-cluster lies in a counted new one; and old $p_2$-clusters only merge. The two distinguished counted clusters merge, so the new count is at most $n-1$, contradicting absolute continuity. Hence $N_{12}=\infty$ almost surely. \emph{Simultaneity.} On this event choose an infinite $p_1$-cluster in each of infinitely many distinct counted $p_2$-clusters. For every $p\in[p_1,p_2]$ their containing $p$-clusters are infinite and distinct, because their $p_2$-clusters are distinct. \end{proof} \subsection{Bond percolation: proof of Corollary~\ref{cor:bond}}\label{app:bond} \begin{proof}[Proof of Corollary~\ref{cor:bond}] Let $L=L(G)$ be the line graph: its vertices are the edges of $G$, loops and parallel copies included, and two distinct edges are adjacent when they share an endpoint. Let $d$ be the maximal number of edges at a vertex of $G$. Then $L$ is infinite, connected and locally finite, and automorphisms of $G$ act on $L$ with finitely many orbits, because every edge contains a vertex from a finite set of orbit representatives, each of which lies in at most $d$ edges. For a finite nonempty $F\subseteq V(L)$, let $W$ be the set of endpoints of edges in $F$. Each vertex $y\in\partial W$ is joined by an edge $g$ to some $w\in W$; the edge $g$ is not in $F$, since its endpoint $y$ is not in $W$, and $g$ shares $w$ with an edge of $F$. Distinct $y$ give distinct $g$, so $|\partial_LF|\ge|\partial W|\ge h_V(G)|W|\ge(h_V(G)/d)|F|$, as $|F|\le d|W|$. Hence $h_V(L)>0$. Bond percolation on $G$ with edge labels is site percolation on $L$ with the same labels. The open clusters of $L$ are the edge sets of the bond clusters that contain an edge, and a bond cluster is infinite if and only if its edge set is, by local finiteness. Hence the numbers of infinite clusters agree for every configuration, so $p_c$ and $p_u$ agree, and~(3) for bond percolation on $G$ is~(3) of Theorem~\ref{thm:main} for $L$. For the two-point kernels, $x\lr y$ in bond percolation on $G$ means $x=y$, or some open edge $e\ni x$ and some open edge $f\ni y$ lie in one open cluster of $L$. With the incidence kernel $B(x,e)=\1\{x\in e\}$ this gives, entrywise, \[ T_p^{\mathrm{bond}}\le I+B\,T_p^{\mathrm{site},L}B^*,\qquad\norm{B}^2=\norm{BB^*}\le2d, \] since $\sum_y(BB^*)(x,y)=\sum_{e\ni x}|e|\le2d$. Theorem~\ref{thm:main}(1) for $L$ therefore bounds $T^{\mathrm{bond}}_{p_c}$, and~(2) for $L$ gives $\ptwo^{\mathrm{bond}}(G)\ge\ptwo^{\mathrm{site}}(L)> p_c$. The inequality $\ptwo^{\mathrm{bond}}\le p_u^{\mathrm{bond}}$ is~\cite[Lemma~2.4]{OAINU}, and the supremum identity is~\cite[Lemma~9.2]{OAINU}. \end{proof}