FO model checking on FO interpretations of nowhere dense classes

Let $\mathcal{C}$ be a nowhere dense graph class, and let $\mathcal{D}$ be a graph class FO interpretable in $\mathcal{C}$. FO model-checking conjecture. The class $\mathcal{D}$ has an FPT algorithm for FO model checking. This conjecture asks whether fixed-parameter tractability of FO model checking extends from nowhere dense classes to all graph classes FO interpretable in them; the source presents it as an explicit conjecture, and no resolution is given.