Jin–Tan conjecture on connected two-distance transitive dihedrants

A dihedrant is a Cayley graph on a dihedral group. A graph is 2-distance transitive if its automorphism group is transitive on ordered pairs of vertices at each of the distances one and two. Let $\mathsf{K}_{m[b]}$ denote the complete multipartite graph with $m$ parts of size $b$, and let $\mathrm{G}(2,p,(p-1)/4)$ denote the corresponding graph in the stated dihedrant family.

Jin–Tan's conjecture. Every connected $2$-distance transitive dihedrant either is a known $2$-arc transitive dihedrant, is isomorphic to $\mathsf{K}_{m[b]}$ for some $m\geq 3$ and $b\geq 2$, or is isomorphic to $\mathrm{G}(2,p,(p-1)/4)$ for a prime $p$ satisfying $p\equiv 1\pmod{8}$.

This conjecture seeks a classification of connected two-distance transitive Cayley graphs on dihedral groups, extending known classifications of two-arc transitive dihedrants and related symmetric graph families. The supplied text does not establish whether the conjecture has been resolved.