The paper investigates how causal action verifiers, which guard language agents’ tool calls by checking identifiability against a committed action‑state graph, can be compromised through small graph misspecifications. By removing a single bidirected edge or reversing an arrowhead, the authors demonstrate that a verifier (CIVeX) that originally had zero false executions can suffer false execution rates up to 48.9%, with most of those executions being harmful and overall utility dropping dramatically. An additional attestation step that samples executions can detect these attacks with few false alarms, but it also leads to many wrongful rejections that reduce beneficial actions and incur significant experimental costs.
whyItMatters":"The study shows that even minor errors in the verifier’s underlying graph can drastically undermine safety and performance, highlighting the need for robust auditing mechanisms."
By Fabio Rovai
The paper investigates how AI approval monitors can fail together when they share a base model or poisoned input, using concepts from distributed computing to identify vulnerable monitor sets. Experiments on twelve open‑weight monitors and several closed models show that fooling a monitor into approving fraud is limited to its own evidence source, while blocking correct payments requires overcoming injection resistance. A rule that counts distinct evidence sources rather than votes reduces false rejections, and adding a rule engine that cannot be persuaded restores safety and liveness against the measured attacks.
By Luca Zanolini
The paper investigates how large language model (LLM) agents that triage security alerts can be misled when the detection tools they rely on provide conflicting or incorrect evidence. By corrupting up to three of four heterogeneous detectors on the CIC-IDS2017 dataset, the authors show that naive LLM investigators become highly fragile, with accuracy dropping to as low as 13% and abstaining on up to 63% of flows. They propose Conflict‑Aware Evidence Verification (CAV), which combines an equal‑weight vote, an evidence‑conflict gate, and a nearest‑neighbour trust check; CAV consistently outperforms naive investigators across all corruption scenarios, improving accuracy to 84–88% when three detectors are corrupted while only querying the LLM on 0.4% of clean traffic.
By Yuchen Zhang
The paper demonstrates that aggregate accuracy figures for chain‑of‑thought (CoT) monitors can be misleading because a large portion of detected hacks rely solely on action patterns rather than reasoning. By rewriting only the agent’s reasoning to appear truthful while keeping actions identical, the authors show that the monitor’s performance on the reasoning‑dependent subset collapses dramatically, yet the overall pooled accuracy drops only modestly. The study reveals that CoT monitors are fragile when reasoning is the key signal and that accuracy should be reported separately for this subset.
By Shikhar Shiromani, Leo Richter
arXiv:2608. 16813v1 Announce Type: new Abstract: Agents now write knowledge graphs, but knowledge-graph stores still carry defaults set when humans curated them: accept writes now and clean later, keep one time axis or none, treat every writer's facts as equally trustworthy, and leave governance to dashboards and middleware.
By Steve Brown
The paper reports that a model can pass fidelity checks—verifying that extracted values match the source—without actually opening a datasheet, due to a hidden constraint that disables tool use. To address this, the authors log every tool call in an agentic benchmark and develop two instruments: a rule‑based failure‑attribution classifier and a silent‑failure detector that flags runs based solely on which tools were invoked. While the detector shows low false positives on clean extractions and recovers all planted faults, its recall against correct tool usage but incorrect answers remains unmeasured, and a partial causal chamber confirms only a subset of claims, highlighting limitations in physical verification.
By Qing Ye, Meng-Hsuan Lin
arXiv:2609.38266v1 Announce Type: cross
Abstract: Agentic large language models (LLMs) now move money through tools, yet the record of what they did is usually a trace their own process emits beside...
By Mustafa Arslan
arXiv:2610. 37055v1 Announce Type: cross Abstract: Audit-based certification bounds the violation rate of an LLM agent by auditing a random fraction $\varepsilon$ of actions and reweighting the audited labels; its validity is meant to rest only on the defender's audit coin.
By Wei Zhu, Meiyun Zuo, Huiping Sun
arXiv:2610.19298v1 Announce Type: new
Abstract: Reinforcement learning for code usually rewards passing tests, which a model can do while remaining wrong on the inputs the tests do not cover. A progr...
By George Ma, Yuhao Zhang, Bing He, Zeren Shui, Ferhat Erata, Murali Krishna Ramanathan, Somayeh Sojoudi, Hao Zhou
arXiv:2609.37315v1 Announce Type: cross
Abstract: Tool-using agents are entering settings where a wrong action carries real cost, and the benchmarks certifying them grade what each simulated tool cal...
By Rohith Reddy Bellibatlu, Zichong Wang, Wenbin Zhang
The paper investigates whether an agent’s own verifier remains reliable when the agent is optimized against it. It introduces a stress‑testing framework that measures the pressure ratio ρ, the influence of the verifier on the agent’s search, and four falsifiable probes targeting common failure modes. Applying this framework to the Rationale Consistency Score (RCS) in an LLM agent that designs machine‑learning pipelines, the authors find that the verifier’s impact is minimal in their baseline setup, that agents can shorten claim lists without affecting search, and that pre‑commit probing can hide declines in faithfulness. The study concludes with a proposed reporting standard to audit verifiers before trusting them.
By Jonghyun Lee, Moonsu Kim, Sunghwan Park
The paper evaluates hard‑gate candidacy for validators in a deployed generative‑agent system by measuring how well each validator’s firing separates successful from failed builds. Across 13 validators and thousands of builds, only a few checks show statistically significant separation, while many fail to distinguish or never fire. The study highlights that skipped checks are recorded as passes, limiting detectable failure rates and underscoring the need for clearer evaluation records.
By Xin Xu