Cohen et al.'s general oriented-cycle subdivision conjecture

For positive integers $k_1,k_2,\ldots,k_n$, let $C(k_1,k_2,\ldots,k_n)$ denote the oriented cycle formed by blocks of those lengths. A digraph is strongly connected if every ordered pair of vertices is joined by a directed path, and a subdivision is obtained by replacing each arc with a directed path of length at least $1$, with all replacement paths internally disjoint. The chromatic number of a digraph $D$ is denoted by $\chi(D)$. Cohen et al.'s conjecture. For every positive integers $k_1,k_2,\ldots,k_n$, there exists a constant $g(k_1,k_2,\ldots,k_n)$ such that every strongly connected digraph containing no subdivisions of the oriented cycle $C(k_1,k_2,\ldots,k_n)$ has chromatic number at most $g(k_1,k_2,\ldots,k_n)$. This conjecture seeks to extend Bondy's theorem from directed cycles to all oriented cycles; the source does not specify a resolution.