Koolen–Bang classification conjecture for geometric distance-regular graphs

Let $m \geq 2$ be a fixed integer. A geometric distance-regular graph has diameter $D \geq 3$ and intersection number $c_2 \geq 2$. Koolen–Bang's classification conjecture. Any geometric distance-regular graph with smallest eigenvalue $-m$ is either a Johnson graph, a Grassmann graph, a Hamming graph, a bilinear forms graph, or has number of vertices bounded above by a function of $m$. The source presents this as one of two conjectures proposed by Koolen and Bang; no resolution is given, so it remains open.