What is uniquely selected here

Let $t_j^{\ast }(b)$ be the smallest arrival time of any admissible finite protocol implementing ${\mathrm{id}}_D$ at $b$. This minimum exists: coordinate steps provide a finite route, and the possible times are nonnegative integer multiples of ${\delta }_j$.