Skip to content
Conference

TAP-LLM: An Executable Attribution Framework for Temporal Event Graph Prediction

Aug 2026 · 2026 12th International Conference on Big Data and Information Analytics (BigDIA) · pp. 1077-1084 · 0 citations · 21 references

Abstract

Although temporal event graph predictors can infer future relational events from historical sequences, their scores provide limited evidence about which historical events support a particular output. We propose TAP-LLM, an executable attribution framework for temporal event graph prediction. Rather than treating explanations as free-form text or static reasoning paths, TAP-LLM represents each attribution as a program containing candidate event identifiers (IDs) and predefined operations. The program specifies evidence selection, history perturbation, score comparison, and greedy evidence compression, thereby connecting large language model (LLM) planning to predictor-side verification. We instantiate the main protocol with RE-GCN on ICEWS14s and ICEWS05-15 and add preliminary cross-predictor verification with RE-Net. Budget-matched retrieval and temporal-occlusion baselines, target-level uncertainty analysis, and a cost audit distinguish program planning from retrieval and verification. TAP-LLM produces approximately two-event evidence chains with about 99% program validity; our claims concern predictor-grounded fidelity and compactness rather than human-perceived interpretability.

View source

Similar papers

Open access 2026

EviGraphRAG: Constraint-Verified Retrieval-Augmented Question Answering over Event Knowledge Graphs

EviGraphRAG is proposed, a ranker-agnostic reliability layer that separates candidate ranking from exact verification and explicit abstention, and exact conjunction over represented event constraints and linked source-record connectivity can improve selective reliability, while parser quality and candidate retrieval re...

Yu-Teng Sun, Yang Su, Xu-An Wang · 0 citations
#natural language process... Preprint Sep 2026

SCoP: Structured Constraint Parsing for Evidence-Space Control in Temporal Knowledge Graph Question Answering

SCoP (Structured Constraint Parsing), a constraint-centric framework that externalizes temporal decisions before answer inference, separates answer-seeking event patterns from temporal anchor events, conservatively grounds them to canonical TKG entities and relations, and translates temporal intent into executable cons...

Xiao-Kun Guo, Zhen Xu, Dongdong Huo et al. · 0 citations
Preprint Aug 2026

SodaMem: Evidence-Grounded Temporal Graph Memory for LLM Agents

SodaMem is presented, an evidence-grounded temporal graph memory that extracts typed FactEvents with mandatory provenance spans, persists mention time, occurrence time, and validity with SUPERSEDES/CONTRADICTS/UPDATES edges under hybrid lexical-dense indexing and answers via a planner-reader loop that gathers citable e...

Fengrong Wan, Chengcan Wu, Ning Lyu · 1 citation

BridgeMem: Causal Dyadic Transition Residuals for Temporal Knowledge Graph Forecasting

BridgeMem is introduced, which estimates the value of explicit dyadic transition modeling as a residual added to the log scores of a frozen full-vocabulary forecaster, and shows the value of explicit dyadic transition modeling in temporal knowledge graph forecasting.

Zeyan Li, Li-Bing Chen, Sheng-Da Zhuo et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.