On colorings of variable words

In this note, we prove that the base case of the Graham–Rothschild Theorem, i.e., the one that considers colorings of the ($1$-dimensional) variable words, admits bounds in the class ${\mathcal{E}}^5$ of Grzegorczyk’s hierarchy.