The output hidden representation h v ∈ R d of a node v after a single layer of graph convolution operation can be obtained by considering only the immediate neighbours of v, as formulated in (Kipf and Welling, 2016).
predicting the time of these documents based on their content is an important task, often referred to as Document Dating.