The coded-coloring atlas conjecture for twisted tent maps

Let $c$ be a parameter in the parameter plane, let $K(c)$ be the associated filled-in set, and let a coded-coloring be the coloring procedure described in the source using symbolic dynamical data. A sub-$K$ is a smaller filled-in structure contained in the dynamical structure of $K(c)$. Coded-coloring atlas conjecture. In a neighborhood of $c$ in the parameter plane, the coded-coloring using a test point very close to $0$ produces an atlas of sub-$K$'s which can be found in the coded-coloring of $K(c)$ near the test point. The statement is presented as an experimentally motivated conjecture about correspondence between parameter-plane and dynamical coded-colorings; no resolution is given.