arXiv:2608. 10668v1 Announce Type: new Abstract: Temporal knowledge graphs are central to many uses of the Semantic Web, but existing completion methods assume the entities, relation names, and timestamps to be reasoned about are already known at training time, restricting each model to a single graph and vocabulary.
By Jiaxin Pan, Mojtaba Nayyeri, Osama Mohammed, Daniel Hernandez, Rongchuan Zhang, Cheng Cheng, Steffen Staab
arXiv:2607. 10197v1 Announce Type: new Abstract: Knowledge graph foundation models such as Ultra and Trix achieve strong inductive transfer by learning relation-graph representations that generalise to unseen entities and relations.
By Jiaxin Pan, Osama Mohammed, Daniel Hern\'andez, Steffen Staab
arXiv:2606. 16509v1 Announce Type: new Abstract: Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations.
By Mohommad Esmaei Khani, Mahdieh Hasheminejad, Ali Taherkhani, Hossein Hajiabolhassan
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.
By Jiawei Sheng, Taoyu Su, Xixun Lin, Xiaodong Li, Tingwen Liu
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.
By Wenbin Guo, Xin Wang, Jiaoyan Chen, Lingbing Guo, Zhao Li, Zirui Chen
The paper introduces ImbalancE, an inference‑time latent search method that mitigates degree imbalance bias in Knowledge Graph Embedding models. It targets the problematic prediction of target entities with much lower degrees than anchor entities, a common issue in recommender systems and other applications. Experiments on benchmark datasets show that ImbalancE improves predictions on the most imbalanced triples compared to conventional methods.
By Alberto Bernardi, Luca Costabello, Christophe Gueret
PEARL is a new framework for inductive knowledge graph completion that treats relational paths as context-conditioned reasoning signals. It builds a query‑specific contextual subgraph from the query entities’ neighborhoods and uses a large language model‑guided retriever to select semantically relevant paths. By constructing a bipartite interaction graph over paths, contextual entities, and a global subgraph representation, and applying a dual‑view contrastive objective, PEARL adapts path embeddings to local and global structural evidence, achieving the best average Hits@10 on WN18RR, FB15k‑237, and NELL‑995.
By Yunchi Yang, Longlong Li, Cunquan Qu
arXiv:2604.05468v3 Announce Type: replace
Abstract: Temporal knowledge graph (TKG) extrapolation is an important task that aims to predict future facts through historical interaction information with...
By Dongying Lin, Yinan Liu, Shengwei tang, Bin Wang, Xiaochun Yang
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.
By Yuanning Cui, Zequn Sun, Wei Hu, Kexuan Xin, Zhangjie Fu
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.
By Xingyu Chen, Yuanning Cui, Zequn Sun, Wei Hu
TTGBench is a new benchmark for temporal graph learning that evaluates both structural evolution and semantic drift in text‑attributed graphs. It includes six real‑world, text‑rich datasets with dual volatility and supports multi‑class and multi‑label temporal node classification, addressing gaps left by existing benchmarks. A comprehensive evaluation of 17 state‑of‑the‑art methods shows a clear divide: TGNNs excel at structural prediction but struggle with semantic tracking, while LLM‑based models perform better on semantic tasks but lag in structural prediction.
By Longfei Ma, Zemin Liu, Fei Wu
arXiv:2606. 14047v1 Announce Type: cross Abstract: Long-context language modeling requires not only extending context windows but maintaining coherent understanding of entity states and relationships across thousands of tokens -- a challenge that semantic similarity alone cannot address.
By Ghadir Alselwi, Basem Suleiman, Hao Xue, Shoaib Jameel, Hakim Hacid, Flora D. Salim, Imran Razzak