Exact codegree threshold conjecture for $(K_4^3-e)$-factors

Let $t_2^3(n,K_4^3-e)$ be the smallest integer $d$ such that every 3-uniform hypergraph on $n$ vertices with minimum 2-degree at least $d$ contains a spanning collection of vertex-disjoint copies of $K_4^3-e$, where $K_4^3-e$ is the 3-graph on four vertices with three edges. Exact threshold conjecture for $(K_4^3-e)$-factors. For integers $n>8$ divisible by $4$,

$$t_2^3(n,K_4^3-e)=n/2-1.$$

The paper proves the lower bound $t_2^3(n,K_4^3-e)\ge n/2-1$ and an asymptotically matching upper bound, so the conjecture asserts the exact value for every admissible $n>8$. Its resolution is not specified in the supplied source.