Cada et al.'s rainbow cycle length conjecture

Let $G$ be an edge-colored graph of order $n$, and let $k$ be a positive integer. For a vertex $v$ of $G$, write $d^c(v)$ for its color degree, the number of distinct edge colors incident with $v$. Cada et al.'s conjecture. If for each vertex $v$ of $G$,

$$d^c(v)>\frac{n+k}{2},$$

then $G$ contains a rainbow cycle of length at least $k$. This conjecture extends known results guaranteeing rainbow cycles under color-degree conditions; the supplied source does not indicate whether the conjecture has been resolved.