ArticlePloS one2026
Evolving graph attention networks for dynamic link prediction.
Article in PloS one, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
7 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Graph neural networks (GNNs), which learn node representations via aggregating their neighbors, have shown superior performance and become the de facto efficient toolkit for analyzing and learning from data with structured properties. However, most existing GNNs are designed for static graphs and assume fixed graph structures and node sets. In many real-world applications, graphs evolve continuously over time-with nodes and edges appearing or disappearing-rendering static models insufficient for capturing these temporal dynamics. In this paper, we propose Evolving Graph Attention Networks (EGAT), a novel framework for dynamic graph representation learning. Specifically, EGAT leverages the anisotropic attention mechanism of Graph Attention Networks (GATs) to capture complex inter-node relationships. Crucially, the multi-head attention weights of the GAT are evolved over time via a recurrent neural network (RNN), enabling the model to adaptively adjust the importance of different neighbors as the graph topology and relational dynamics change. This weight-evolving paradigm couples the anisotropic attention mechanism of GATs with a recurrent subnetwork, enabling the joint modeling of topological evolution and temporal relational dynamics. Extensive experiments on benchmark datasets demonstrate that the proposed model consistently outperforms state-of-the-art baselines.
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.