Thus, we want the known information of "Gulou Subway Station" to be sent to its successors.
for v ∈ V p ∪ V a , we compute its embedding recursively as follows: where E k t (v) is the depth-k node embedding in the t-th turn, N (v) denotes the set of nodes adjacent to v, W k is the parameter in the k-th iteration and the aggregate function is the element-wise max operation.