The isotropy conjecture for stitchings of lattices

Consider a graph obtained by a non-trivial stitching of the lattices $\mathbb{Z}^{d}$ and $2\mathbb{Z}^{d}$. Stitching isotropy conjecture. Any such graph is an isotropic graph. If true, this would provide a broad family of examples of isotropic graphs and support the paper's scaling-limit framework for nonuniformly stitched lattices. The paper does not prove the assertion in general.