Restricted antidirected subdivision conjecture for oriented graphs

Let $D$ be an oriented graph, and let $\delta(D)$ denote its minimum degree. For positive integers $r$ and $s$, write $\vec{K}_{s,s}$ for the consistently oriented complete bipartite graph, and call an antidirected subdivision of a graph restricted when all its branch vertices are sources.

Restricted antidirected subdivision conjecture. Every oriented graph $D$ with

$$\delta(D) \geq f_{}(2s,f_{}(r,s))$$

contains a copy of $\vec{K}_{s,s}$ or an induced restricted antidirected subdivision of $K_r$.

This conjecture proposes a more precise version of the preceding minimum-degree result for oriented graphs. The supplied text does not indicate whether it has been resolved.