arXiv paper· explainable AI / temporal graph machine learning· method paper

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

Minwoo Yu, Young-guk Ha

cs.AI

Quick verdict

Uses executable traces to synthesize specified-foil counterfactual edits in temporal graphs; solid gains on 6 datasets but only rule-based backbones tested.

Summary

The paper proposes trace-guided intervention search: instead of searching counterfactual edits by output feedback alone, it reuses a predictor's executable reasoning traces (completed original and foil executions plus recovered unmet premises) as an intermediate representation from which concrete past-event edits are synthesized. A Specified-Foil Counterfactual requires a frozen temporal predictor to rank a user-designated foil candidate as top-1 after bounded edits (≤2, unit cost) to the history, verified by exact replay. Adapters are built for LiFTER (continuous-time dynamic graphs) and TLogic (temporal knowledge graphs). At a proposal cap of 32 under matched downstream search, execution-grounded generation beats coordinate-based generation by 13.7–34.7 points on Wikipedia/Reddit/MOOC/LastFM and 60.0–83.3 points on ICEWS14/18. On shared candidate sets, the method retains 85.7–93.6% of black-box greedy's CTDG success with 75–80% fewer predictor evaluations (1.34–3.20× end-to-end speedup), and recovers 83.4–100% of bounded-exhaustive solutions with 83–92% fewer evaluated interventions. A Pulse simulator case study confirms 5 of 6 model-level interventions. Limitations: only two rule-based/neuro-symbolic backbones whose traces expose groundings; hand-tuned priority coefficients without sensitivity analysis; no direct comparison with CoDy/TemGX; TLogic success judged under candidate-count stopping rather than full-catalog ranking; the simulator study is small (n=8) and trained on the same simulator family.

Review complete

Assessment at a glance

explainable AI / temporal graph machine learning

5

risk flags identified

● high 0

● medium 3

● low 2

Reproducibility readinesshigh
Code & data availableyes
Review confidencehigh
AI text signal0/20 passages flagged
Deep research viableCode-reproducible

4 strengths · 5 weaknesses · 5 author questions

AI text signal = Binoculars zero-shot detector score over 20 sampled passages (Fast-DetectGPT co-reported) — absence does not prove human authorship, and a flag does not imply misconduct.

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • Executable reasoning traces (completed original/foil executions plus recovered unmet conditions) can be converted into concrete edit candidates that reach designated foils far more often than coordinate-based generation under identical downstream search (Sec 5.2, Table 2: +13.7–34.7 pp CTDG, +60.0–83.3 pp TKG at cap 32).
  • Trace-derived priorities can replace most black-box screening, retaining 85.7–93.6% of greedy's CTDG success with 75–80% fewer predictor evaluations and 1.34–3.20× end-to-end speedup (Table 3, Fig 4).
  • In a bounded exhaustive space the method recovers 83.4–100% of solutions while examining 83–92% fewer interventions (Table 4).
  • Prediction invalidation rarely lands on rank-5/10 foils (1.4%/0.0% arrival rates, Table 9), so foil-directed execution information supplies the essential content of specified-foil search.
  • Model-derived interventions can transfer to an independent execution environment: 5 of 6 LiFTER-proposed treatments produced 75-minute survival in separately initialized Pulse simulations (Sec 6, Table 11).

Strengths

  • Well-motivated objective shift with a dedicated diagnostic

    Section 5.8 (Table 9) quantifies why prediction invalidation is insufficient: incidental arrival at a pre-fixed foil drops from 44.3% (rank-2) to 1.4% (rank-10) on CTDG and 91.8% to 0.0% on TKG, grounding the case for the specified-foil formulation.

  • Layered, honest evaluation design

    Five complementary experiments: matched-search proposal comparison (Table 2), shared-candidate selection-cost comparison (Table 3, Fig 3), bounded exhaustive audit (Table 4: 83.4–100% recovery at ~83–92% search reduction), pathway/objective ablations (Tables 5–6), and admissibility sensitivity (Table 10). Failure modes are reported, e.g., the LastFM K=4 drop from 10.3% to 7.7% (Sec 5.2).

  • Statistical care unusual for the area

  • Simulator study reports disagreement honestly

Weaknesses

  • Backbone scope limits external validity

  • Hand-tuned priority heuristics without sensitivity analysis

  • No direct comparison with prior temporal counterfactual explainers

  • TKG success criterion is truncated inference

  • Small, same-family simulator validation

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

Report preview

Scope & Claims

The paper reframes temporal-graph counterfactual explanation around a *specified foil*: rather than asking which past edits invalidate a prediction (the objective of CoDy and TemGX), it fixes a designated alternative candidate B in advance and asks which ≤2 unit-cost edits make a frozen predictor rank B top-1 (Sec 3.1, Eqs. 2–3). The contribution is trace-guided intervention search — using the predictor's executable reasoning traces (completed original and foil executions, recovered unmet premises) as an intermediate representation from which concrete edits (DELETE/INSERT/REWIRE/SHIFT, plus RELABEL for TKGs) are synthesized (Sec 4.2, Table 1), prioritized by execution-derived heuristics (Sec 4.3), and verified by exact replay over bounded compositions (Sec 4.4). Two adapters are implemented: LiFTER (the authors' own neuro-symbolic CTDG forecaster, ref [22]) and TLogic (temporal rule learner, ref [14]). Scope statements are unusually careful: no global minimality, no claims over untested backbones (Sec 3.3, 7.4).

The remaining sections cover Methodology Assessment, Statistical Evidence, Results & Reproducibility, Limitations & Risks, and Verdict & Recommendations.

  • All 4 strengths & 5 weaknesses, analyzed in detail
  • 5 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

What is a Specified-Foil Counterfactual in temporal graphs?

It is a counterfactual problem where, instead of merely changing a model's prediction to 'anything else', the user fixes a specific alternative candidate (the foil) in advance and asks which minimal edits to past events make the frozen predictor rank that foil as top-1. The paper formalizes this for continuous-time dynamic graphs and temporal knowledge graphs and verifies every solution by re-running the unchanged predictor on the edited history.

How much does trace-guided intervention search improve over baselines?

At a proposal cap of 32 with identical downstream search, it beats coordinate-based proposal generation by 13.7–34.7 percentage points on Wikipedia/Reddit/MOOC/LastFM and by 60.0–83.3 points on ICEWS14/18. Against black-box greedy on shared candidates it retains 85.7–93.6% of the CTDG success rate with 75–80% fewer predictor calls, and is 1.34–3.20× faster end-to-end.

Is the code and data available for this paper?

Yes — the paper states that implementation, experiment configurations, aggregation and plotting scripts are released at github.com/SnowyPainter/cf-public, and all six datasets (Jodie Wikipedia/Reddit/MOOC/LastFM and ICEWS14/18) are public, with source URLs in Supplementary Table 12.

Is the Pulse simulator result clinically meaningful?

No. The authors explicitly frame the 5-of-6 simulator confirmations as a proof of concept: the model was trained on Pulse-generated trajectories, the held-out test contained only 8 casualties, and the study does not establish clinical effectiveness or generalization to real patients.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

  • Figure panels (Figs. 2–5) appear in the extraction as interleaved label/value text runs; series-to-bar mappings were read from label order and surrounding text, not from rendered layout.

Go deeper on this paper

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
From Explanations to Interventions: Execution-Guided Counterfactual Synthesis in Temporal Graphs | Evolve.Pub