Pith. sign in

REVIEW 3 cited by

xERTE: Explainable Reasoning on Temporal Knowledge Graphs for Forecasting Future Links

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.15537 v5 pith:FNTMAY5B submitted 2020-12-31 cs.LG cs.AI

classification cs.LGcs.AI
keywords temporalforecastinglinkgraphsknowledgemodelattentionevidence
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Modeling time-evolving knowledge graphs (KGs) has recently gained increasing interest. Here, graph representation learning has become the dominant paradigm for link prediction on temporal KGs. However, the embedding-based approaches largely operate in a black-box fashion, lacking the ability to interpret their predictions. This paper provides a link forecasting framework that reasons over query-relevant subgraphs of temporal KGs and jointly models the structural dependencies and the temporal dynamics. Especially, we propose a temporal relational attention mechanism and a novel reverse representation update scheme to guide the extraction of an enclosing subgraph around the query. The subgraph is expanded by an iterative sampling of temporal neighbors and by attention propagation. Our approach provides human-understandable evidence explaining the forecast. We evaluate our model on four benchmark temporal knowledge graphs for the link forecasting task. While being more explainable, our model obtains a relative improvement of up to 20% on Hits@1 compared to the previous best KG forecasting method. We also conduct a survey with 53 respondents, and the results show that the evidence extracted by the model for link forecasting is aligned with human understanding.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Mixture Policy based Multi-Hop Reasoning over N-tuple Temporal Knowledge Graphs

    cs.AI 2025-05 conditional novelty 6.0 of 10

    MT-Path predicts missing entities in N-tuple temporal knowledge graphs by training a mixture of three reinforcement-learning path-finding policies (predicate, core-element, whole-fact) with an auxiliary-aware GCN, and...

  2. VITA: Versatile Time Representation Learning for Temporal Hyper-Relational Knowledge Graphs

    cs.AI 2025-05 conditional novelty 5.0 of 10

    VITA uses a (conjunction, start, end) time triplet and an encoder-decoder Transformer to predict missing entities, relations, times, and numeric literals in temporal hyper-relational knowledge graphs, outperforming ba...

  3. Towards Improving Long-Tail Entity Predictions in Temporal Knowledge Graphs through Global Similarity and Weighted Sampling

    cs.AI 2025-07 reject novelty 4.0 of 10

    A global relation-similarity enhancement layer plus frequency-weighted sampling improves long-tail entity link prediction in incrementally trained temporal knowledge graphs on the ICEWS14 and ICEWS18 benchmarks.

Pith tools