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.
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.
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. We propose FITTER, the first fully-inductive structural model for temporal knowledge graph link prediction that supports cross-domain transfer: the inference graph may contain entirely unseen entities, relation names, and timestamps drawn from a different domain.
arXiv:2609.36559v1 Announce Type: cross Abstract: Extrapolative temporal knowledge graph reasoning (TKGR) predicts future facts from historical snapshots. Most existing methods train once on an early...
arXiv:2608. 13023v1 Announce Type: new Abstract: Relational Deep Learning (RDL) models multi-tabular databases as temporal heterogeneous graphs to enable end-to-end representation learning.
arXiv:2607. 14733v1 Announce Type: new Abstract: Temporal Knowledge Graphs (TKGs) record how facts evolve over time, but forecasting future events on a TKG remains difficult for three reasons: (i) long-range temporal dependencies are hard to encode; (ii) events on different chains mutually excite or inhibit one another in ways that snapshot-level models cannot express; and (iii) inter-arrival times are heavy-tailed and statistically sparse, so deterministic time predictors are unreliable.
arXiv:2609.14279v1 Announce Type: cross Abstract: Temporal knowledge graph embedding (TKGE) models infer missing facts in knowledge graphs that evolve over time. Many existing models use a single geo...
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...
arXiv:2605. 07121v2 Announce Type: replace Abstract: Temporal knowledge graphs (TKGs) represent time-stamped relational facts and support a wide range of reasoning tasks over evolving events.
arXiv:2607. 27303v1 Announce Type: new Abstract: Temporal heterogeneous graphs offer a natural abstraction for dynamic relational systems in which diverse node and relation types co-exist and evolve over time.
The paper introduces a method that transforms knowledge graph facts into a fixed vocabulary representation, where each fact becomes a node linked to its subject, object, and relation type via six meta-relations. Using this representation, standard GNNs (e.g., GAT, GINE, GraphSAGE, R-GCN) trained on a single small graph can achieve zero‑shot link prediction on 40 inductive benchmarks, matching the performance of specialized foundation models like ULTRA. The approach also generalizes to relational databases, enabling foreign‑key prediction without cell values or schema text, and the authors provide code, checkpoints, and evaluation tools for all benchmarks.
D-TAIA is a framework that adapts large language models for multi‑task predictive process monitoring, jointly predicting the next activity and remaining time of ongoing cases. It uses domain‑aware triplet loss pre‑training, FAISS‑based nearest‑neighbor retrieval for time estimation, and a TAIA inference strategy to preserve sequential reasoning while fine‑tuning a 10 M‑parameter backbone. Across four real‑world event logs, D‑TAIA achieves state‑of‑the‑art or competitive results compared to a fine‑tuned LLM and a recurrent neural network baseline, with ablation studies showing the effectiveness of NLP and computer‑vision techniques for this domain.
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.