The paper introduces a new entity alignment foundation model that overcomes the limitations of existing models by addressing the "reasoning horizon gap". It employs a parallel encoding strategy that uses seed entity pairs as local anchors to guide message passing, thereby shortening inference paths and improving alignment across sparse, heterogeneous knowledge graphs. The model also incorporates a merged relation graph and a learnable interaction module, and experimental results demonstrate its strong generalizability to unseen knowledge graphs.
arXiv:2606. 06109v1 Announce Type: cross Abstract: Entity alignment (EA) aims to identify equivalent entities across heterogeneous knowledge graphs (KGs) and is a key component of knowledge fusion and cross-KG reasoning.
Enrich-on-Graph (EoG) is a flexible framework that uses large language models to enrich knowledge graphs, thereby bridging the semantic gap between structured graphs and unstructured queries in complex reasoning tasks. By leveraging LLMs’ prior knowledge, EoG enables efficient evidence extraction from knowledge graphs, achieving precise and robust reasoning while maintaining low computational costs and scalability. The authors also introduce three graph quality evaluation metrics for query‑graph alignment, theoretically validate their optimization objectives, and demonstrate state‑of‑the‑art performance on two KGQA benchmark datasets.
arXiv:2607. 25579v1 Announce Type: cross Abstract: Entity alignment (EA) identifies entities across knowledge graphs (KGs) that refer to the same real-world object.
arXiv:2607. 03154v1 Announce Type: cross Abstract: Multi-domain knowledge graph completion (MKGC) aims to improve missing triple prediction in a target KG by transferring knowledge from other support KGs.
The paper introduces TOFU, a token-based foundation model for multi‑modal knowledge graph reasoning (MMKGR). TOFU converts structural, visual, and textual data into modality‑specific tokens and uses a hierarchical fusion architecture with mixture‑of‑message mechanisms to learn transferable features. Experiments on 17 MMKGs demonstrate that TOFU outperforms existing KGFM and MMKGR baselines, especially on unseen knowledge graphs.
arXiv:2607. 28980v1 Announce Type: new Abstract: Graph Foundation Models (GFMs) have recently emerged as a promising paradigm for enabling knowledge transfer across diverse domains.
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.
KGFR introduces a Knowledge Graph Foundation Retriever that collaborates with large language models to enhance knowledge‑intensive question answering. By encoding relations with LLM‑generated descriptions and initializing entities from question roles, KGFR enables zero‑shot generalization to unseen knowledge graphs. Its Asymmetric Progressive Propagation technique efficiently handles large graphs, while a controllable reasoning loop allows the LLM to request candidate answers, supporting facts, and reasoning paths.
Graph Foundation Models (GFMs) have emerged as a promising paradigm for learning transferable representations across diverse graph domains. Recent advancements in GFMs have been largely dominated by two paradigms: Graph Neural Network and Large Language Model (LLM) based methods.
arXiv:2606. 16509v1 Announce Type: new Abstract: Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations.
arXiv:2510. 09711v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have recently emerged as a powerful paradigm for Knowledge Graph Completion (KGC), offering strong reasoning and generalization capabilities beyond traditional embedding-based approaches.
FedV-KGQA is a framework for multi-hop question answering over knowledge graphs that are vertically partitioned across different organizations. It allows entities to be shared while each silo retains disjoint sets of relations, using local graph enrichment and knowledge graph embeddings so that raw triples and relation parameters never leave the silo. The system includes a topic entity anchoring mechanism to ground questions in the correct graph neighborhood without runtime inter-silo communication, and it achieves performance close to centralized systems on three benchmarks, including 3-hop reasoning and robustness to embedding perturbations.