Suppose that a graph neural network runs $3$ message$-$passing iterations to generate a learned node embedding $($learned feature vector$/$representation for each node$).$ In this case, this learned node embedding contains information from nearby nodes. What is the maximum distance $($in terms of number of edges$)$ of the nearby nodes that contribute to this learned embedding?