arXiv:2607. 17272v1 Announce Type: new Abstract: Node representation learning has advanced rapidly, yet most existing methods rely on per-dataset training and hyperparameter tuning.
By Dooho Lee, Jaemin Yoo
The paper introduces OFAG, a foundation model designed for attributed graph clustering that can be trained once and applied to diverse graphs without graph‑specific tuning. It learns a reusable clustering strategy from synthetic graphs and uses a dimension‑agnostic encoder to handle varying feature spaces, producing clustering‑friendly node representations in a single forward pass. Across ten datasets, a frozen OFAG model outperforms baselines in both speed and clustering quality, and the authors provide code and pretrained checkpoints for easy adoption.
By Yunhui Liu, Xudong Jin, Kang Zhang, Danshuo An, Yu Xing, Te Song, Jia Liu, Tieke He
arXiv:2608. 04377v1 Announce Type: cross Abstract: Hypergraph neural networks (HGNNs) have demonstrated remarkable capabilities in processing complex higher-order relationships.
By Mengyao Zhou, Zhiheng Zhou, Xiao Han, Guiying Yan
arXiv:2606. 09051v1 Announce Type: new Abstract: Convolutions have successfully transitioned from image processing to the complex realm of non-Euclidean higher-order domains, particularly in hypergraphs.
By Fuli Wang, Wei Qian, Daniel L. Lau, Gonzalo R. Arce
arXiv:2608. 02128v1 Announce Type: new Abstract: Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers.
By Antonin Joly, Nicolas Keriven, Aline Roumy
arXiv:2607. 20477v1 Announce Type: new Abstract: {\em Text-Attributed Graphs} (TAGs) have emerged as an expressive data model for integrating graph topology with rich textual semantics.
By Yurui Lai, Samir Moustafa, Renchi Yang, Tsz Nam Chan