Common minimum in- and out-degree conjecture for cycle orientations

Let $t$ be a positive integer. An orientation of the cycle on $t$ vertices is obtained by assigning a direction to each edge of that cycle. Common degree conjecture. Every digraph with minimum out-degree and minimum in-degree at least $t-1$ contains every orientation of the cycle on $t$ vertices as a subdivision. This is proposed as a common strengthening of known results for dichromatic number and polynomial minimum-out-degree bounds; its status is not resolved in the source.