Kohayakawa–Prömel–Rödl conjecture for induced Ramsey numbers

Let $G$ be a fixed graph, and let $H$ be a graph on $n$ vertices. The quantity $r_{\mathrm{ind}}(G,H)$ is the minimum order of a graph whose every red-blue edge-coloring contains either a red induced copy of $H$ or a blue induced copy of $G$. Kohayakawa–Prömel–Rödl conjecture. There is a constant $f=f(G)$ depending only on $G$ such that

$$r_{\mathrm{ind}}(G,H)\leq n^f.$$

This conjecture predicts a polynomial upper bound when one graph is fixed and the other varies with order $n$. The supplied text gives no resolution status.