The paper asks whether reinforcement learning on a small set of expert-built coding tasks can teach a generalizable ability to finish agentic work, rather than merely overfitting to a benchmark format. The authors post-train Kimi K2.7 Code with one epoch of GSPO on a rank-32 LoRA adapter using 1,700 tasks graded by hidden tests and pass-to-pass regressions, then measure transfer to six external benchmarks spanning three agent harnesses, multiple domains, and horizons up to multi-hour builds. The results matter because they probe whether RLVR on narrow, high-quality data yields broad agentic competence or just domain tuning.

Coding agents for Lean can produce compiler-passing proofs that do not match the intended theorem or rely on hidden assumptions. Forall-Lean-Agent tackles this by binding verifier results, fresh review, and artifact digests into a traceable acceptance protocol that works with any frontend. The paper evaluates the harness on software-verification and mathematics benchmarks and argues that auditable execution improves correctness guarantees and efficiency, though its empirical claims are stronger on integrity than on controlled performance gains.

This paper investigates which static analysis alert removals actually reduce bug rates—a critical question since developers constantly face noisy linting warnings. The author employs three complementary methods: a randomized controlled trial with 521 manual interventions, labeling functions to identify intervention-like events in 8,245 natural commits, and supervised learning to predict beneficial removals. The core finding is that removing complexity alerts (too-many-branches, too-many-nested-blocks) via method extraction reduces bug tendency by 4.1–5.5 percentage points, offering evidence-based guidance for prioritizing refactoring efforts.

This paper addresses paper-code consistency detection in bioinformatics, tackling the reproducibility crisis where algorithmic descriptions in publications often diverge from software implementations. The authors introduce BioCon, a benchmark of 48 bioinformatics projects with expert-annotated sentence-code pairs, and propose a cross-modal framework using UniXcoder with weighted focal loss. While the task is important for computational biology reproducibility, claims of novelty require qualification given concurrent efforts in the broader scientific community.

As AI agents move from human-supervised copilots to fully autonomous infrastructure, organizations face a critical observability gap: existing systems capture computational state and execution traces but lack structured records of the agent's reasoning. This paper introduces the Agent Execution Record (AER), a schema-level primitive that captures intent, observation, and inference as first-class queryable fields at execution time. The core claim is that reasoning provenance cannot be faithfully reconstructed from state checkpoints due to fundamental non-identifiability (intent multiplicity, observation ambiguity, inference volatility). If validated, AERs would enable population-level behavioral analytics—systematic comparison of reasoning patterns across thousands of investigations, confidence calibration against expert judgments, and counterfactual regression testing via mock replay—that existing tooling achieves only through fragile post-hoc extraction.

MIST addresses the challenge of generating high-quality SQL test cases for Database Management Systems using lightweight Large Language Models. The framework combines a feature-guided synthesis stage that leverages hierarchical documentation structures with error feedback, and a Monte Carlo Tree Search-based mutation stage to overcome coverage plateaus. This two-pronged approach aims to achieve high code coverage in resource-constrained industrial environments where only small LLMs can be deployed locally.

This paper addresses the challenge of efficient failure management in LLM-based Multi-Agent Systems (MASs). Existing approaches rely on expensive per-trace reasoning with large judge LLMs, which is slow and unstable. The core contribution is EAGER, a framework that uses unsupervised reasoning-scoped contrastive learning to encode intra-agent and inter-agent dynamics into embeddings, enabling real-time step-wise failure detection and reflexive mitigation guided by historical patterns rather than costly LLM inference.

This paper tackles the persistent bottleneck of Multidisciplinary Software Development (MSD), where domain experts and software developers must manually coordinate across heterogeneous artifacts and incompatible formalisms. The authors model MSD workflows as a directed dependency graph $\mathcal{G}=(\mathcal{V},\mathcal{R})$ and propose an iterative optimization framework that replaces manual translation nodes with LLM-powered services. This matters because their approach reduces per-API development time from approximately 5 hours to under 7 minutes while maintaining production-quality code, demonstrating that workflow-level automation—not just coding assistance—can unlock substantial efficiency gains in industrial settings.

Modern failure management pipelines tightly couple task-specific models with modality-specific encoders, blocking reuse across systems. RuntimeSlicer proposes a unified runtime state representation that encodes metrics, traces, and logs into a single embedding via Unified Runtime Contrastive Learning, then adapts to downstream tasks through State-Aware Task-Oriented Tuning. The core value is decoupling representation learning from failure management tasks—if it generalizes, teams could freeze the embedding backbone and ship lightweight task heads.

DomAgent addresses the challenge of generating code for specialized domains like truck control systems or data science libraries, where generic LLMs often fail due to lack of domain knowledge. The system combines structured knowledge graphs (top-down reasoning) with case-based retrieval (bottom-up learning) through a novel DomRetriever module that iteratively refines context via LLM-based review. Experiments on both the DS-1000 benchmark and a real-world truck software dataset demonstrate substantial improvements, enabling small 7B-8B parameter models to approach or exceed the performance of proprietary systems like GPT-4o.

The paper tackles the labor-intensive challenge of creating software architecture views, which are essential for documentation but often become outdated—75\% are never updated after creation. The authors conduct a large-scale empirical study evaluating whether LLMs and agentic approaches can automate view generation from source code, testing 3 LLMs across 3 prompting strategies and 2 agentic approaches on 340 repositories. This matters because as systems grow complex, automated view generation could bridge the gap between implementation and architectural documentation, potentially alleviating the manual burden that leads to outdated artifacts.

This paper reports that an autonomous AI ecosystem (SUBSTRATE S3) independently discovered the need for Z3 SMT-based formal verification across six distinct domains—ranging from LLM code to tool APIs to hardware assembly—without being explicitly instructed to do so. The authors treat this convergence as evidence that formal verification "emerges" as a fundamental property of AI systems reasoning about safety. They then present substrate-guard, a unified Python framework implementing Z3 verification across five AI output classes. The claim matters because if true, it would suggest AI systems naturally recognize the limitations of empirical testing and converge on mathematical proof as a safety mechanism.