arXiv:2606. 32016v1 Announce Type: new Abstract: Multimodal graph foundation models aim to learn reusable knowledge from graphs enriched with text, images, attributes, and relational topology, thereby supporting diverse graph-centric and modality-centric tasks.
arXiv:2607. 15687v1 Announce Type: new Abstract: Multimodal-attributed graphs (MAGs), whose nodes carry modalities such as images and text alongside topological structure, now pervade applications including social platforms, e-commerce, and biomedical networks, offering richer semantic signals than single-modality graphs.
arXiv:2608. 00623v1 Announce Type: new Abstract: Multimodal-attributed graphs (MAGs), where nodes carry heterogeneous semantic content across multiple modalities while edges encode relational dependencies, have been widely adopted across diverse domains.
arXiv:2607. 27665v1 Announce Type: new Abstract: Federated graph learning enables collaborative training over decentralized graph data without sharing raw graph information.
arXiv:2607. 23245v1 Announce Type: cross Abstract: Multimodal Federated Learning is often challenged by arbitrary modality missingness and Non-IID data distributions, which lead to severe representation drift and hinder effective collaboration across clients.
The paper introduces FedCORE, a federated adaptation framework for multimodal graph foundation models that jointly optimizes perception (Encoder) and reasoning (GNN) modules via a shared low‑dimensional latent state. Unlike prior methods that freeze the Encoder, FedCORE allows both components to adapt together, addressing the dependency between multimodal evidence extraction and graph‑based relational reasoning. Experiments show that FedCORE significantly narrows the Encoder–GNN pairing gap, achieving an 80.7% reduction compared to independent joint adaptation.
arXiv:2607. 28708v1 Announce Type: new Abstract: Multimodal federated graph learning enables clients to collaboratively train graph models over structural, textual, and visual signals without sharing private local data.
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.
arXiv:2607. 26023v1 Announce Type: new Abstract: Graph foundation models (GFMs) have emerged as a promising paradigm for transferring knowledge across graph domains and tasks.
arXiv:2608. 05833v1 Announce Type: new Abstract: Knowledge graph completion (KGC) aims to infer missing entities or relations from incomplete graph structures, and has evolved into multimodal knowledge graph completion (MMKGC), where entities are associated with multiple modalities such as text and images.
arXiv:2507. 20804v3 Announce Type: replace Abstract: Large Language Models (LLMs) suffer from hallucinations due to their static parametric knowledge.
arXiv:2606. 17667v1 Announce Type: cross Abstract: In recent years, the rapid development of foundation models and graph pre-training technologies has spurred increasing interest in constructing a universal pre-trained graph model or Graph Foundation Model (GFM).
ICE (Interaction-aware Clifford Encoder) is a multimodal graph foundation model that uses a node-indexed Clifford latent field to encode topology, text, and images into explicit Cl(3) addresses. Edge-aware geometric products transform these directions into scalar, bivector, and trivector relations over observed neighborhoods, preserving entity semantics while enabling higher-order transport and direct field access. Across eleven graphs and multiple node‑classification, link‑prediction, and few‑shot tasks, ICE outperforms all 30 reported supervised and few‑shot comparisons, with core removals and mechanism controls demonstrating the importance of its higher‑order structure and semantic protection.