Koolen–Bang finiteness conjecture for geometric distance-regular graphs

Let $m \geq 2$ be a fixed integer. A distance-regular graph is coconnected if it is not a disjoint union of complete graphs. Let $\phi_1$ and $\tau_2$ be the clique parameters associated with a geometric distance-regular graph. Koolen–Bang's finiteness conjecture. There are only finitely many coconnected geometric distance-regular graphs with smallest eigenvalue $-m$ and $\phi_1 \leq \tau_2 - 2$. This conjecture is attributed in the source to Koolen and Bang and remains open.