A disproof of the uniform witness conjecture

The study of $(d+1)$-uniform set systems with VC-dimension at most $d$ links the Erdős--Ko--Rado theorem with VC-dimension. But already in 1997, Ahlswede and Khachatrian showed that this is not the right extension of the Erdős--Ko--Rado theorem. In 2025, Chao, Xu, Yip and Zhang proposed the uniform witness conjecture as a possible right extension: for $0\le s\le d$, if every set of a $(d+1)$-uniform family has a missing trace of the same fixed size $s$, then the family should have size at most $\binom{n-1}{d}$. They proved the conjecture when $s=d$, and when $s=1$ and $n$ is large. Very recently, Chao, Xu and Zakharov proved the conjecture when $s\le \frac{d}{2}$ and $n$ is large.
We fill in the missing half of the picture, although the picture is not the one suggested by the conjecture. More precisely, for $d\ge 4$ and $\left\lceil \frac{d+2}{2}\right\rceil\le s\le d-1$, we construct such a family $\mathcal{F}\subseteq\binom{[n]}{d+1}$ with $|\mathcal{F}|=\binom{n-1}{d}+\binom{n-2(d+1-s)-2}{2s-d-2}$ for every $n\ge2(d+1)$, thereby disproving the uniform witness conjecture.