Skip to content
Preprint

Counterfactual Sensitivity Is Not Repairability: Auditing Replay Probes for Video Evidence

Aug 2026 · 0 citations · 19 references
Computer Science

TL;DR

CARVE is introduced, a black-box counterfactual probe that compares answer changes under matched SHAM and DESTROY replays, and shows only a weak association with annotated temporal coverage, so CARVE is best understood as a routing signal rather than a direct grounding classifier.

Abstract

Tool-using video agents retrieve visual evidence before answering, but the final answer is not forced to depend on what was retrieved. The natural black box test is counterfactual: destroy the semantic content of the frames the agent retrieved and check whether the answer changes, against a matched sham that re-executes the identical pipeline on those same frames. We introduce CARVE, a black-box counterfactual probe that compares answer changes under matched SHAM and DESTROY replays. Across three independent k=3 runs on a frozen VideoExplorer-style agent, DESTROY changes the answer 29.3 percentage points more often than SHAM, yielding a large and reproducible aggregate effect. Question-level scores are less stable, and increasing the replay budget from k=3 to k=10 reduces ties but weakens the original zero-threshold routing policy. At k=3, CARVE selects 538 of 1,258 LVBench questions and improves accuracy by 3.26 points, with higher fallback yield than most matched random subsets. The score shows only a weak association with annotated temporal coverage, so CARVE is best understood as a routing signal rather than a direct grounding classifier. Our implementation is available at https://github.com/KurbanIntelligenceLab/CARVE.

View source

Similar papers

Preprint Aug 2026

HERALD: Counterfactual Audits and Minimal Repairs for Proof-of-Retrieval Rewards

HERALD is introduced, an offline audit that applies exact same-question interventions, separates candidate-visible from oracle information, and enumerates detector contracts before policy optimization, and separates robust scoring, sparse learning signal, and policy transfer.

Zhuowen Liu, Bohan Cui, YinShang Guo et al. · 0 citations
Preprint Aug 2026

The Replay Gap: Static Evaluation of Model Switching in LLM Agents Scores the Wrong World

This work forks live SWE-bench agent trajectories at controlled points, rebuild the environment, continue each fork with a different model, and compare against same-model control forks that isolate sampling and replay noise, finding configuration-dependent temperature-0"determinism" is configuration-dependent.

Ashritha Gonuguntla · 8 citations · ⚡2
Preprint Aug 2026

Explicit State Elicitation Is Not Enough: A Controlled Audit of Memory-Policy Classification

Family-level and seed-stability analyses show that example-level accuracy overstates counterfactual consistency: complete four-way family success is rare, and an exploratory follow-up that elicits decomposed semantic evidence fails to improve routing for the cleanly evaluated endpoint.

Yi-Hang Chen, Pinyan Qian, Su Wang et al. · 0 citations
Preprint Jul 2026

Resample or Reroute? Recoverable Stopping Debt Without Identified Action Selection

After a weak verifier accepts a large-language-model response, a second call may resample or reroute, but current evidence does not identify when to resample rather than reroute, so stopping debt exists, but current evidence does not identify when to resample rather than reroute.

Teng-Ruei Chen · 0 citations
Book Open access Jul 2026

Deletion Isn't Enough: Auditing RAG for Selective Forgetting

This paper introduces Forgetting-by-Design (FBD), a mechanism-agnostic audit that runs probes across paired system states before and after revocation, and separates compliance into two observable channels---retrieval/citation exposure and answer-level disclosure or abstention ---and reports the cost of compliance using...

Leila Tavakoli, Mark Sanderson · 0 citations

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