The complete, complete-bipartite, or 2-degenerate induced-subgraph conjecture

Let $\operatorname{tw}(G)$ denote the treewidth of $G$. A graph is $2$-degenerate if every induced subgraph has a vertex of degree at most $2$. The complete, complete-bipartite, or 2-degenerate induced-subgraph conjecture. For every integer $t\geq 1$, every graph of sufficiently large treewidth has an induced subgraph of treewidth $t$ which is either complete, complete bipartite, or $2$-degenerate. The source states that this strengthens the general sparse induced-subgraph conjecture, but the abstract says it has been refuted by Chudnovsky and Trotignon (2024).