{
  "annotation_id": "cc1f19de-8832-47e3-ab8e-9bdec0365f2b",
  "date_created": "2026-02-17T05:53:23.350000Z",
  "date_modified": "2026-02-17T05:53:23.350000Z",
  "file_hash": "93e7c5e698fee3a9d1024cbcbdc56e6e30a03c5d59bdf36e3746c75dfa1b55b3",
  "private": false,
  "record": {
    "abstract": "In 2010, Koolen and Bang proposed the following conjecture: For a fixed integer $m \\geq 2$, any geometric distance-regular graph with smallest eigenvalue $-m$, diameter $D \\geq 3$ and $c_2 \\geq 2$ is either a Johnson graph, a Grassmann graph, a Hamming graph, a bilinear forms graph, or the number of vertices is bounded above by a function of $m$. In this paper, we obtain some partial results towards this conjecture.",
    "arxiv_id": "2601.10330",
    "authors": [
      "Chenhui Lv",
      "Jack H. Koolen"
    ],
    "categories": [
      "math.CO"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "On the characterization of geometric distance-regular graphs",
    "url": "https://arxiv.org/abs/2601.10330",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6dbd8a14-719b-4100-8703-d1ff9b9f1811",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}