because in this neighborhood thing two nodes are connected in a path length of order of n right you can you can pretty easily see that if i make the sequence longer i need that many more steps in order to send it around in fact it's like something like n divided by m this neighborhood size in a random graph it's log n and in this axial attention that's why i introduced it it's two okay every uh every two nodes are connected by two steps if if node if this node right here needs to send information to this node right here