Jun 2026· arXiv.org· Vol abs/2606.31166· 1 citation· 20 references
Computer Science
TL;DR
This work proposes method that unifies textual reasoning and graph message passing within a masked diffusion language model, a language model with bidirectional attention and generative decoding that outperforms graph neural networks, graph transformers, and LLM-based baselines on all three TAG benchmarks across two tasks.
Abstract
Text-attributed graphs (TAGs), where each node carries a natural language description, require models to jointly reason over text and graph topology. Existing approaches often handle the two modalities separately: graph neural networks operate on shallow text features, while hybrids of LLMs and graphs use the language model mainly as a text encoder and delegate structure learning to a separate graph module. We propose method that unifies textual reasoning and graph message passing within a masked diffusion language model, a language model with bidirectional attention and generative decoding. For each graph instance, method linearises a sampled local neighbourhood into a token sequence and injects graph structure through a topology attention mask, which realises message passing over the graph. Because the diffusion language model can both interpret and generate text, the method adapts to different tasks simply by changing the prompt, supporting node classification, link prediction, and cross-dataset transfer with no target-specific fine-tuning. Experiments show that method outperforms graph neural networks, graph transformers, and LLM-based baselines on all three TAG benchmarks across two tasks, improving over the strongest baseline by up to 3.9 points.
This work introduces agentic graph token reasoning, which recasts graph tokenization as part of the reasoning process itself and pushes LLM-based graph analysis from static graph-token encoders towards a graph-native agent paradigm.
Dynamic text-attributed graphs (DyTAGs) exhibit coupled textual and structural dynamics, and existing mainstream approaches for DyTAGs extend conventional large language models (LLMs) to capture both dynamics, thereby giving rise to dynamic graph LLMs. However, in DyTAGs, the continuous emergence of new nodes and edges...
Tianhang Wan, Xin Wang, Haibo Chen et al.· Proceedings of the 32nd ACM...· 0 citations
A novel Heterogeneous Three-View Graph Convolution Network (HTV-GCN) is proposed, which combines a group-wise smooth contrastive mechanism with three heterogeneous graphs: global, local, and text-lemma to improve the expressive ability of text-label alignment.
Yili Wang, Zhicheng Liu, Chengsheng Yuan· ACM Transactions on Asian an...· 0 citations
This work proposes RTA, a simple MLP-based framework that replaces structural message passing with label-aware retrieval and propagation and provides theoretical insights that connect retrieval-based aggregation to softmax-attention message passing and establish the robustness of retrieved-context supervision to mis-re...
Jintang Li, Yuhong Chen, Ruo-Fan Wu et al.· 0 citations
TAHB (Text-Attributed Hypergraph Benchmark) is presented, the first public benchmark integrating hypergraph structures and raw textual attributes, and shows that LLM-enhanced textual semantics improve hypergraph learning performance, while structural and textual information jointly provide the best setting for LLM-base...
D. Y. Kang, Junghyun Kim, Ju-hyun Jeon et al.· 0 citations
A multimodal model that combines two complementary ideas: a self-supervised method that enables a GNN encoder pretrained on one dataset to operate directly on another dataset with a different node-feature dimensionality, without rebuilding the model or realigning the data is investigated.
Fumiaki Kimino, Ryoma Sato Sokendai, National Institute of Informatics· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.