Ore-type conjecture for all orientations of Hamilton cycles

An oriented graph is a directed graph with at most one directed edge between any pair of vertices. For an oriented graph $G$, let $V(G)$ be its vertex set, let $n=|V(G)|$, and write $\sigma_{+-}(G)$ for the minimum, over all directed edges $u\to v$, of $d^+(u)+d^-(v)$. An orientation of an undirected Hamilton cycle is obtained by assigning a direction to every edge of a Hamilton cycle on $V(G)$; saying that $G$ contains all possible orientations means that it contains a copy of every such orientation. All-orientations conjecture. There exists an integer $n_0$ such that every oriented graph $G$ on $n\geqslant n_0$ vertices with $\sigma_{+-}(G)\geqslant(3n+2)/4$ contains all possible orientations of a (undirected) Hamilton cycle. The problem asks whether this Ore-type condition forces every orientation pattern of a spanning cycle, extending Hamiltonicity results beyond a single prescribed cycle orientation.