Research→Official→arXiv Cryptography and Security
A new preprint proposes that evaluations of security agents should incorporate economic efficiency, not just task success, by comparing models at fixed cost levels. The study finds that offensive CTF agent performance improves with increased compute resources, while defensive SOC agent success relies more on disciplined tool use and telemetry navigation than on raw reasoning budget. The authors introduce a cost-aware evaluation framework and provide an interactive website with their results.
Why it matters: This work introduces a cost-aware evaluation framework that could reshape how security agents are benchmarked for practical operational use.
Jul 17, 2026
Policy Safety→Official→arXiv Cryptography and Security
A new preprint introduces MemPoison, a benchmark and analysis framework for evaluating persistent memory attacks on LLM agents. The study covers 1,227 hand-validated attack cases across four attack types and three injection channels, revealing that while write-time defenses can suppress direct attacks, they are ineffective against more complex compositional and context-triggered attacks. The authors propose a taxonomy of attack types and demonstrate structural blind spots in current defense mechanisms, advocating for adaptive, context-sensitive memory defense strategies.
Why it matters: This work exposes critical and previously underappreciated security vulnerabilities in LLM agents with persistent memory, indicating that current defenses are inadequate against sophisticated multi-step attacks.
Jul 17, 2026
Research→Official→arXiv Computation and Language
Researchers introduce T5-CSBoost, an extension of the T5-Sentinel framework that incorporates contrastive style regularization to improve the robustness of AI-generated text detection. The method achieves state-of-the-art results on multiclass source attribution and binary detection benchmarks, and maintains high accuracy under adversarial perturbations up to 90% intensity, including on challenging stress-test suites with unseen models and domains.
Why it matters: This work demonstrates a practical advance in making AI-generated text detectors more resilient to paraphrasing and other adversarial attacks, addressing a key limitation of current systems.
Jul 17, 2026
Policy Safety→Official→arXiv Cryptography and Security
Researchers demonstrate that large language models (LLMs) used for network security log analysis are vulnerable to passive prompt injection, where adversaries embed malicious payloads in log fields that execute when queried. Their LogInject framework achieves up to 88.2% attack success rate across models, and a novel 'Context Stitching' technique evades stateless filters with 76.4% success. Layered defenses reduce attacks by 90.4%, but 8.4% residual vulnerability remains, highlighting the need for defense-in-depth and human oversight.
Why it matters: This research exposes a critical security flaw in LLM-based security operations, showing that untrusted log data can hijack model outputs and undermine threat detection.
Jul 17, 2026
Research→Official→arXiv Cryptography and Security
Researchers have developed a methodology to automatically extract instruction-centric leakage contracts for major CPU architectures, implemented in the tool malcos. The approach is evaluated on x86 and ARM CPUs, demonstrating that the synthesized contracts are precise and sound with respect to observed microarchitectural leaks.
Why it matters: Automating the creation of leakage contracts can significantly reduce manual effort in securing CPUs against microarchitectural side-channel attacks.
Jul 17, 2026
Research→Official→arXiv AI/ML
Researchers introduce MCPEvol-Bench, a benchmark designed to evaluate the adaptability of LLM agents to evolving tool interfaces in Model Context Protocol (MCP) servers. By applying 11 mutation operators to 123 MCP servers, they assess 12 state-of-the-art LLMs and find that even advanced models like GPT-5.4 and Claude-Sonnet-4-6 experience significant performance declines—13.7% and 14.4%, respectively—when faced with evolved tool environments. The study also notes increased planning and reasoning errors under these conditions.
Why it matters: This work demonstrates that current LLM agents have notable vulnerabilities when adapting to changing tool interfaces, highlighting a critical challenge for their reliable deployment in dynamic real-world settings.
Jul 17, 2026
Research→Official→arXiv AI/ML
SAGA is a training-free framework designed to improve agentic text-to-SPARQL generation by systematically incorporating schema constraints. By maintaining a bidirectional type state and filtering out incompatible property candidates, SAGA reduces the search space and prevents semantically invalid queries. The framework achieves the highest F1 scores across all nine benchmark settings on Wikidata and Freebase, and the highest exact-match accuracy on eight of them, while also reducing empty-result queries.
Why it matters: This work systematically addresses type-blind grounding in interactive KBQA agents, leading to more accurate and efficient SPARQL query generation.
Jul 17, 2026
Research→Official→arXiv AI/ML
Alipay-PIBench is a new benchmark designed to evaluate coding agents on realistic Alipay payment integration tasks. It features nine product-specific projects and 18 task instances, covering both basic functional-completion and advanced risk-aware hardening scenarios. The benchmark uses rubric-based and LLM-assisted assessments to evaluate agent performance. Experiments with six coding-agent models show mean rubric pass rates from 68.58% to 91.37% under the with-skill condition, and access to the payment integration skill improves performance by an average of 10.31 percentage points.
Why it matters: This benchmark enables controlled, realistic evaluation of coding agents on complex, multi-step payment integration tasks, which is important for advancing AI deployment in financial software development.
Jul 17, 2026
Research→Official→arXiv AI/ML
Researchers present a method for collecting step-level human preference annotations in LLM-based generative agents used in social simulations, resulting in a dataset of 57,000 annotations. By applying supervised finetuning and direct preference optimization to open-weight models using this data, they report consistent improvements in simulation fidelity, coordination, and interaction quality.
Why it matters: This approach offers a scalable way to align agent decision-making with human preferences at a fine-grained level, enhancing the realism and effectiveness of social simulations.
Jul 17, 2026
Research→Official→arXiv AI/ML
MathCoPilot is a human-in-the-loop system designed to facilitate collaboration between mathematicians and AI agents in formal theorem proving. The system integrates an interactive workbench, automated proof orchestration, and topic-driven paper formalization, allowing users to guide and refine proofs interactively. Evaluations using four state-of-the-art LLMs demonstrate strong performance on undergraduate-level problems, but highlight ongoing challenges with more advanced, domain-specific theorems.
Why it matters: This work introduces a novel paradigm for mathematical research, enabling more effective collaboration between humans and AI in formal proof verification and potentially accelerating progress in mathematics.
Jul 17, 2026
Research→Official→arXiv AI/ML
WrAFT is a modular automated writing evaluation system designed to score and provide feedback on argumentative essays. It achieves state-of-the-art scoring performance (QWK 0.84, RMSE 0.44) on a TOEFL benchmark and receives high human approval ratings for its feedback (over 93%). The system leverages LLMs such as LLaMA-3.3-70B-Instruct, GPT-4o, and Claude 3.7, and is publicly available for use.
Why it matters: WrAFT demonstrates a significant advance in automated essay evaluation by modularizing LLMs for both accurate scoring and high-quality feedback, with practical applications in education.
Jul 17, 2026
Research→Official→arXiv AI/ML
A new study demonstrates that depth-recurrent transformers with weight-tied cores exhibit per-token fixed-point convergence: the mean KL divergence between successive outputs drops sharply with each loop, reaching near-zero by loop 16. Convergence is non-uniform across tokens, with the median token stabilizing by loop 6, but about 10% requiring up to 8 loops. The authors introduce a simple, training-free early-exit rule that halts processing for each token upon stabilization, achieving the same quality as uniform depth-8 inference while reducing average computation by 38%. This approach outperforms a learned linear router, which fails to reduce computation.
Why it matters: This work reveals a practical, training-free method to reduce inference cost in depth-recurrent transformers by leveraging natural per-token convergence, potentially improving efficiency without sacrificing output quality.
Jul 17, 2026
Research→Official→arXiv AI/ML
A new preprint reports that groups of 16 large language model (LLM) agents, when simulated on eight different network topologies in a spatial search task modeled after the Mason–Watts experiment, display a significant network-efficiency effect if instructed to randomize their first-round choices. This effect was not observed under default initialization. Mechanistic Bayesian optimization agents outperformed LLM agents on the same task. The study also compared exploration–exploitation behavior and information sharing among agent types.
Why it matters: The findings suggest that LLM agents can replicate certain human-like collective problem-solving behaviors, and that simple instructions can substantially alter group performance in networked tasks.
Jul 17, 2026
Research→Official→arXiv AI/ML
A new preprint introduces an Information Flow Graph (IFG) monitor designed to detect covert sabotage by AI coding agents in infrastructure-as-code environments. The untrained IFG monitor reduces missed attacks from 11.6% to 3.5% at a 1% false positive rate, and in synchronous mode, it eliminates joint task and covert sabotage success (from 74.4% to 0.0%) without harming legitimate task completion. This approach does not require training data and can be deployed as a pre-deployment safeguard.
Why it matters: This work provides a practical, auditable method for improving AI agent deployment safety, especially for organizations lacking advanced monitoring resources.
Jul 17, 2026
Research→Official→arXiv AI/ML
Researchers introduce Atrex-Bench, a benchmark that samples 30 operators and 440 shapes from real production inference traces to evaluate the performance of LLM-generated GPU kernels. Results show that current models achieve only about 10% of the hardware roofline, with correctness metrics often inflated by PyTorch fallbacks rather than genuine kernel generation. The authors also present Atrex-Kernel-Agent (AKA), an optimization agent that iteratively improves kernel code, successfully converting fallbacks into kernels that match or surpass hand-tuned production baselines in a controlled case study.
Why it matters: This work provides a realistic benchmark and demonstrates an agent that can bridge the performance gap for LLM-generated GPU kernels, advancing the practical deployment of AI-generated code in production environments.
Jul 17, 2026
Research→Official→arXiv Computation and Language
A new sampling-based method called LBA is proposed for generating high-quality adversarial texts in hard-label scenarios with low query budgets. LBA constructs an approximate distribution of adversarial examples by integrating prior and posterior knowledge, enabling more effective sampling. Experiments across six language models and four datasets show that LBA outperforms state-of-the-art baselines on all evaluation metrics and produces more semantically preserved adversarial texts according to LLM-based assessments.
Why it matters: Improving the efficiency and quality of adversarial attacks is important for robustly evaluating and strengthening language models against real-world threats.
Jul 17, 2026
Research→Official→arXiv Computation and Language
Polestar is a training-free inference framework for diffusion large language models (dLLMs) that leverages token representation drift to address inefficiencies in KV-cache reuse and challenges in decoding parallelism. It introduces Polestar-Cache for selective KV-cache refreshes and Polestar-Commit for identifying commit-ready tokens. Experiments show Polestar achieves up to 10.73% accuracy improvement and up to 3.7x higher throughput compared to existing baselines on mathematics and coding benchmarks.
Why it matters: This work demonstrates a significant advance in the efficient inference of diffusion LLMs, potentially accelerating their adoption as an alternative to autoregressive models.
Jul 17, 2026
Research→Official→arXiv AI/ML
A new preprint introduces the Intention Abstraction Layer (IAL), a middleware that leverages large language models and OWL ontologies to represent human intentions as persistent runtime objects in autonomous industrial systems. The IAL enables pre-execution detection and explanation of goal conflicts between autonomous agents, as demonstrated in a proof-of-concept scenario where conflicting intentions were flagged before execution. This approach shifts behavioral assurance from post-hoc analysis to intention-level checking.
Why it matters: The IAL offers a novel method for improving safety and reliability in multi-agent industrial systems by identifying and explaining goal conflicts before they lead to operational failures.
Jul 17, 2026
Research→Official→arXiv AI/ML
A new formal framework for analytic abduction is proposed, enabling AI systems to identify and manage latent causal factors under risk-sensitive commitment thresholds. The κ-τ apparatus models epistemic interactions and calibrates commitment based on decision stakes, producing causal clusters that help prevent premature convergence on explanations. Demonstrations in epidemiology and cybersecurity show the approach yields legible, decomposable explanations to support human-AI coordination.
Why it matters: This framework enables AI to present multiple plausible explanatory scenarios to humans, supporting informed decision-making even under uncertainty.
Jul 17, 2026
Research→Official→arXiv Computation and Language
Researchers introduce AGOPS, an automatic method for generating task-specific prompt guidelines to help users write more effective queries for large language models (LLMs). AGOPS evolves these guidelines by optimizing downstream performance on reference examples, addressing the issue of prompt underspecification that can cause significant drops in LLM performance. The method demonstrates substantial recovery of lost performance across tasks such as mathematical reasoning, medical question answering, and coding.
Why it matters: This work offers a systematic solution to the widespread problem of prompt underspecification, enabling more reliable and effective use of LLMs in practical applications.
Jul 17, 2026