Oriented paths with two blocks in bipartite oriented graphs

Stein conjectured that for any integer $k\geq 2$, every oriented graph with minimum semidegree greater than $k/2$ contains every orientation of a path with $k$ edges. Recently, Chen, Hou and Zhou proved this conjecture to be true for any oriented path with two blocks, where a block of an oriented pa