Strong large language models (LLMs) often achieve high scores on many benchmarks, yet can fail on closely related, sometimes easier, problems near their apparent capability boundary, a phenomenon known as jagged intelligence that reveals reasoning weaknesses masked by aggregate scores. Existing evaluations of jagged intelligence rely on manually designed benchmark-adjacent rewrites, which are hard to scale and quickly saturate as models improve. To address this challenge, we propose Automated Weakness Exploration (AWE), a fully automated framework for constructing and maintaining jaggedness evaluations. Using AWE, we construct JaggedBench with 1,142 verified capability-adjacent variants and evaluate 24 state-of-the-art models. On the primary evaluation set AIME 2025, benchmark-adjacent rewrites induce an average OG-to-RW relative drop of approximately 25% in Avg@k across 24 models, with consistent degradation observed across math, code, science, and knowledge domains. We identify 18 recurring failure modes. Our analysis shows that increasing reasoning intensity and scaling model size improve average performance and reduce failure frequency, yet the underlying failure-mode categories largely persist. Overall, these findings indicate that standard benchmark scores can present an overly optimistic view of reliability near the capability boundary. JaggedBench provides a more faithful and scalable lens for evaluating boundary robustness, enabling systematic diagnosis of boundary failures and longitudinal tracking of persistent weaknesses as models evolve. We release the benchmark, code, and subsequent updates at https://jaggedbench.github.io/.

Parallel thinking offers a promising avenue for scaling test-time compute in Large Language Models (LLMs), enabling them to explore diverse solution paths simultaneously before aggregating them into a final answer. However, coordinating the exploration and aggregation stages remains challenging, as simple aggregation techniques often incur information loss, failing to preserve the subtle, decision-relevant signals generated during exploration. To overcome this, we propose Rhombus, a parallel thinking framework that explicitly incentivizes coordination between components via end-to-end reinforcement learning. Rhombus employs multiple parallel Proposers to generate compact, decision-focused reasoning cues and a central Synthesizer to integrate them into final predictions, utilizing co-training under a shared task reward to align their interaction. Across challenging mathematical reasoning benchmarks, Rhombus improves accuracy by 6.0% over long chain-of-thought baselines while reducing wall-clock latency by 39.4% under matched token budgets. Our work demonstrates that explicit communication optimization is essential for realizing the accuracy and efficiency gains of parallel reasoning.

Reinforcement Learning with Verifiable Rewards (RLVR) has propelled Large Language Models in complex reasoning, yet its scalability is often hindered by a training bottleneck where performance plateaus as policy entropy collapses, signaling a loss of exploration. While previous methods attempt to maintain high entropy, we argue that unselective entropy maximization risks amplifying irrelevant noise rather than fostering meaningful exploration. In this paper, we identify a deeper issue: the gradual elimination of valuable low-probability exploratory tokens, which we term reasoning sparks, driven by RLVR over-penalization. To address this, we introduce Low-probability Regularization (Lp-Reg). Leveraging the statistical distinction where reasoning sparks exhibit higher probabilities than noise, Lp-Reg filters out the extremely low-probability noise tokens and prevents the suppression of potentially valuable low-probability candidates. Experiments demonstrate that Lp-Reg enables stable on-policy training for over 3,000 steps (81,204 GPU-hours), sustaining exploration in regimes where baselines typically collapse. Validated across extensive evaluations totaling over 300,000 cumulative GPU-hours, Lp-Reg demonstrates highly competitive performance in off-policy settings and consistently achieves state-of-the-art results in on-policy training across diverse model families, sizes, and domains, with relative accuracy improvements ranging from 3.06% to 7.98%.

Large Language Models (LLMs) increasingly generate executable visual artifacts, yet established code benchmarks largely overlook the visual fidelity and interaction behavior that shape user experience. We introduce ArtifactsBench, a benchmark and automated multimodal evaluation framework for visual code generation. The framework executes each artifact and records three staged screenshots—before, during, and after a scripted interaction—then scores the evidence and source code with a checklist-guided Multimodal LLM (MLLM) referee. ArtifactsBench contains 1,825 tasks across nine domains and evaluates more than 30 LLMs. On a 280-query, six-model expert study, three staged screenshots yield 90.95% referee–human Pair ACC. Across the models shared with WebDev Arena, ArtifactsBench reaches 94.4% normalized Footrule consistency with that public human-preference ranking. We release the benchmark, evaluation harness, and baseline results at https://artifactsbenchmark.github.io/.

Recent progress in large language models (LLMs) is largely driven by scaling training compute through either pre-training with next-token prediction (NTP) or post-training with reinforcement learning (RL). The former contributes to learning broad knowledge and skills from general data, while struggling with data inefficiency and catastrophic forgetting in continual learning settings. The latter incentivizes reasoning capabilities with strong generalization, but is constrained by limited data availability due to its reliance on human annotation. To alleviate these issues, we propose Reinforcement Learning on Pre-Training data (RLPT), which combines the advantages of learning from general data and RL. In particular, RLPT derives reward signals directly from general text data through a next-segment reasoning objective, rewarding the policy for correctly predicting next text segments conditioned on the prefix text. Experiments across multiple benchmarks and models demonstrate the effectiveness of . For example, RLPT yields substantial improvements in continual pre-training (+4.6%) and provides a strong foundation for post-training (+3.4%) on Qwen3-8B-Base.

LLM agents have emerged as powerful systems for tackling multi-turn tasks by interleaving internal reasoning and external tool interactions. Agentic Reinforcement Learning has recently drawn significant research attention as a critical post-training paradigm to further refine these capabilities. In this paper, we present AT²PO (Agentic Turn-based Policy Optimization via Tree Search), a unified framework for multi-turn agentic RL that addresses three core challenges: limited exploration diversity, sparse credit assignment, and misaligned policy optimization. AT²PO introduces a turn-level tree structure that jointly enables Entropy-Guided Tree Expansion for strategic exploration and Turn-wise Credit Assignment for fine-grained reward propagation from sparse outcomes. Complementing this, we propose Agentic Turn-based Policy Optimization, a turn-level learning objective that aligns policy updates with the natural decision granularity of agentic interactions. ATPO is orthogonal to tree search and can be readily integrated into any multi-turn RL pipeline. Experiments across seven benchmarks demonstrate consistent improvements over the state-of-the-art baseline by up to 1.84 percentage points in average, with ablation studies validating the effectiveness of each component.