Lin et al.'s vertex-count conjecture for ABC-minimal trees

Let $t$ be the number of leaves of a tree, and call a tree $t$-minimal if it has $t$ leaves and no other tree with the same number of leaves has a smaller ABC-index, where

$$\mathcal{ABC}(G)=\sum_{uv\in E(G)}\sqrt{\frac{d_u+d_v-2}{d_ud_v}}$$

for a graph $G$ with vertex degrees $d_v$. Lin et al.'s conjecture. For $t\geq 88$, a $t$-minimal tree has $t+\left\lfloor\tfrac{t}{11}\right\rfloor-1$ vertices. This conjecture predicts the order of every ABC-minimal tree with sufficiently many leaves; the source describes it as arising from computer-aided calculations, while the available context does not establish its resolution.