# From Explanations to Interventions: Execution-Guided Counterfactual Synthesis in Temporal Graphs

arXiv: https://arxiv.org/abs/2609.11170 · HTML: https://mlsanity.com/paper/2609.11170/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 15 of its 28 references that are in the map.
- First posted on arXiv 10 Sep 2026.

## Builds on (most cited first, 15 of 15)

- [Explanation in Artificial Intelligence: Insights from the Social Sciences](https://mlsanity.com/paper/1706.07269/) (2017)
- [Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPR](https://mlsanity.com/paper/1711.00399/) (2017)
- [Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks](https://mlsanity.com/paper/1908.01207/) (2019)
- [CF-GNNExplainer: Counterfactual Explanations for Graph Neural Networks](https://mlsanity.com/paper/2102.03322/) (2021)
- [TLogic: Temporal Logical Rules for Explainable Link Forecasting on Temporal Knowledge Graphs](https://mlsanity.com/paper/2112.08025/) (2021)
- [A Survey on Graph Counterfactual Explanations: Definitions, Methods, Evaluation, and Research Challenges](https://mlsanity.com/paper/2210.12089/) (2022)
- [TempME: Towards the Explainability of Temporal Graph Neural Networks via Motif Discovery](https://mlsanity.com/paper/2310.19324/) (2023)
- [Investigating Robustness and Interpretability of Link Prediction via Adversarial Modifications](https://mlsanity.com/paper/1905.00563/) (2019)
- [TEILP: Time Prediction over Knowledge Graphs via Logical Reasoning](https://mlsanity.com/paper/2312.15816/) (2023)
- [Counterfactual Learning on Graphs: A Survey](https://mlsanity.com/paper/2304.01391/) (2023)
- [TILP: Differentiable Learning of Temporal Logical Rules on Knowledge Graphs](https://mlsanity.com/paper/2402.12309/) (2024)
- [Advancing Abductive Reasoning in Knowledge Graphs through Complex Logical Hypothesis Generation](https://mlsanity.com/paper/2312.15643/) (2023)
- [TFLEX: Temporal Feature-Logic Embedding Framework for Complex Reasoning over Temporal Knowledge Graph](https://mlsanity.com/paper/2205.14307/) (2022)
- [Counterfactual Reasoning with Knowledge Graph Embeddings](https://mlsanity.com/paper/2403.06936/) (2024)
- [Where Does Neural Advantage Arise in Continuous-Time Dynamic Graph Prediction?](https://mlsanity.com/paper/2608.06765/) (2026)

## Abstract (arXiv)

Can a trace explaining model execution also compute the changes needed for a specified alternative prediction? We propose trace-guided intervention search, which uses executable reasoning traces as an intermediate representation for intervention synthesis. A Specified-Foil Counterfactual edits past events so that a frozen temporal predictor selects a designated foil. Our method constructs facts and replacement values from completed original and foil executions and recovered unmet conditions. Proposal generation constructs edits and selects candidates within a fixed cap; exact replay verifies foil top-1 outcomes among retained edits and compositions. Implemented in LiFTER for continuous-time dynamic graphs (CTDGs) and TLogic for temporal knowledge graphs (TKGs), the method improves success over coordinate-based proposal generation by 13.7-34.7 percentage points on four CTDG datasets and 60.0-83.3 points on two TKG datasets under matched downstream search and a proposal cap of 32. Separate shared-candidate comparisons retain 85.7-93.6% of black-box greedy's CTDG success rate with 75.0-80.0% fewer predictor evaluations. A Pulse case study confirms simulator-level survival for five of six interventions. Executable traces thus provide both explanatory evidence and a reusable computational representation for constructing and testing specified alternatives.
