ArticleScientific reports2025
Unifying topological structure and self-attention mechanism for node classification in directed networks.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.
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
3 citing papers in PubMed.
- SA-ConSinGAN and reservoir computing fusion for accurate bearing fault classification and severity identification using GAF-based techniques.Scientific reports · 2026Article
- AI-driven molecular modeling and design: from property prediction to drug generation.Journal of computer-aided molecular design · 2025Article
- Knowledge Distillation for Molecular Property Prediction: A Scalability Analysis.Advanced science (Weinheim, Baden-Wurttemberg, Germany) · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
Abstract
Graph data is essential for modeling complex relationships among entities. Graph Neural Networks (GNNs) have demonstrated effectiveness in processing low-order undirected graph data; however, in complex directed graphs, relationships between nodes extend beyond first-order connections and encompass higher-order relationships. Additionally, the asymmetry introduced by edge directionality further complicates node interactions, presenting greater challenges for extracting node information. In this paper, We propose TWC-GNN, a novel graph neural network design, as a solution to this problem. TWC-GNN uses node degrees to define higher-order topological structures, assess node importance, and capture mutual interactions between central nodes and their adjacent counterparts. This approach improves our understanding of complex relationships within the network. Furthermore, by integrating self-attention mechanisms, TWC-GNN effectively gathers higher-order node information in addition to focusing on first-order node information. Experimental results demonstrate that the integration of topological structures and higher-order node information is crucial for the learning process of graph neural networks, particularly in directed graphs, leading to improved classification accuracy.
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.