The stable twin-width 2 conjecture for bounded clique-width

Let $\mathcal{C}$ be a stable class of graphs of twin-width at most $2$. Stable twin-width 2 conjecture. Then $\mathcal{C}$ has bounded clique-width. This conjecture is the corrected form of the unrestricted bounded clique-width claim, which the paper disproves using unit interval graphs; its resolution is not given in the supplied text.