arXiv:2607. 16198v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have emerged as the leading paradigm for link prediction, enabling the inference of missing connections and the anticipation of potential future links.
Bridge-LP is a new framework for link prediction on text‑attributed graphs that combines Graph Neural Networks and Language Models. It introduces three design components: jumping connections for robust language model training, compressed embeddings to encode neighborhood information, and a cache embedding strategy to reduce computational cost. Experiments on nine datasets show that Bridge‑LP outperforms 40 existing models, achieving up to a 43.06% improvement in Mean Reciprocal Rank.
The paper introduces SLM-Conditioned Hierarchical Relation Routing, a graph neural network architecture that incorporates a small language model to guide message selection in labeled property graphs. It combines structural states, node and relationship property encodings, and relationship types into messages, then uses a parameter‑efficient language model to generate target‑conditioned routing queries that filter relevant messages and route information across relation‑level summaries. The resulting representation updates a topology anchor with bounded residuals, preserving structural evidence while allowing contextual semantic information to influence predictions, and offers interpretable analysis at both neighbor and relationship‑type levels.
arXiv:2602. 14239v3 Announce Type: replace-cross Abstract: Predicting links in sparse, continuously evolving networks is a central challenge in network science.
arXiv:2602. 01553v3 Announce Type: replace-cross Abstract: Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies.
SiST‑GNN introduces a simultaneous spatial‑temporal message‑passing framework for dynamic graph neural networks, fusing per‑node temporal embeddings with spatial aggregation in a single operation. By maintaining a recurrent hidden state per node and treating it as a cross‑time edge, the model jointly reasons over topology and evolution. Experiments on link‑prediction and node‑classification benchmarks show significant improvements over prior methods, achieving up to 158% gains in live‑update link prediction and outperforming discrete‑time baselines by 7–23% in dynamic node classification.
arXiv:2608. 09031v1 Announce Type: new Abstract: Graph neural networks typically propagate information through repeated message-passing layers, coupling the distance over which information travels with the number of nonlinear transformations applied.
arXiv:2511. 11046v3 Announce Type: replace-cross Abstract: Graph neural networks (GNNs) have become an indispensable tool for analyzing relational data.
arXiv:2607. 11374v1 Announce Type: new Abstract: Graph Foundation Models (GFMs) have emerged as a promising paradigm for learning transferable representations across diverse graph domains.
arXiv:2610.19142v1 Announce Type: new Abstract: Graph Neural Networks on large graphs commonly rely on in-memory graph storage with ad hoc data processing pipelines for both training and inference. G...
arXiv:2501.08547v2 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) have been widely adopted for their ability to compute expressive node representations in graph datasets. However...
RAW-Explainer is a new explainability method designed for path reasoning graph neural networks used in knowledge graph completion. It produces connected, concise, and interpretable subgraph explanations for link prediction by leveraging heterogeneous information and a random walk objective. The approach also addresses distribution shift when evaluating small explanatory subgraphs with a robust evaluator, achieving a balance between explanation quality and computational efficiency on standard benchmarks.