Minimum codegree conjecture for loose cycle factors

Let $n$ and $t$ be integers with $n\ge 6t$, and let $H$ be an $n$-vertex 3-uniform hypergraph. A loose cycle is a cyclic sequence of edges in which consecutive edges intersect in one vertex and all other pairs of edges are disjoint.

Loose-cycle factor conjecture. If $n$ is sufficiently large and

$$\delta_2(H)\ge 2t,$$

then $H$ contains $t$ vertex-disjoint loose cycles.

The source notes that this conjecture would follow trivially from the stronger $C_6$-factor conjecture, since each copy of $C_6$ is a loose cycle.