{"total":17,"rows":[{"id":"2403.07974","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","created":"2024-03-12","cited_by_count":2004,"area":"lr"},{"id":"2203.07814","title":"Competition-Level Code Generation with AlphaCode","created":"2022-02-08","cited_by_count":1462,"area":"lr"},{"id":"2310.01714","title":"Large Language Models as Analogical Reasoners","created":"2023-10-03","cited_by_count":107,"area":"lr"},{"id":"2505.17813","title":"Don't Overthink it. Preferring Shorter Thinking Chains for Improved LLM Reasoning","created":"2025-05-23","cited_by_count":85,"area":"lr"},{"id":"2412.13147","title":"Are Your LLMs Capable of Stable Reasoning?","created":"2024-12-17","cited_by_count":65,"area":"lr"},{"id":"2404.14662","title":"NExT: Teaching Large Language Models to Reason about Code Execution","created":"2024-04-23","cited_by_count":63,"area":"lr"},{"id":"2501.18101","title":"Diverse Preference Optimization","created":"2025-01-30","cited_by_count":52,"area":"lr"},{"id":"2409.09584","title":"RethinkMCTS: Refining Erroneous Thoughts in Monte Carlo Tree Search for Code Generation","created":"2024-09-15","cited_by_count":26,"area":"lr"},{"id":"2506.16395","title":"OJBench: A Competition Level Code Benchmark For Large Language Models","created":"2025-06-19","cited_by_count":26,"area":"lr"},{"id":"2505.17659","title":"Plan-R1: Safe and Feasible Trajectory Planning as Language Modeling","created":"2025-05-23","cited_by_count":20,"area":"lr"},{"id":"2502.20868","title":"ProBench: Benchmarking Large Language Models in Competitive Programming","created":"2025-02-28","cited_by_count":15,"area":"lr"},{"id":"2510.04265","title":"Don't Pass@k: A Bayesian Framework for Large Language Model Evaluation","created":"2025-10-05","cited_by_count":15,"area":"lr"},{"id":"2509.24261","title":"Risk-Sensitive RL for Alleviating Exploration Dilemmas in Large Language Models","created":"2025-09-29","cited_by_count":14,"area":"lr"},{"id":"2506.10979","title":"How Well Can Reasoning Models Identify and Recover from Unhelpful Thoughts?","created":"2025-06-12","cited_by_count":11,"area":"lr"},{"id":"2510.23049","title":"Advantage Shaping as Surrogate Reward Maximization: Unifying Pass@K Policy Gradients","created":"2025-10-27","cited_by_count":11,"area":"lr"},{"id":"2411.11053","title":"SRA-MCTS: Self-driven Reasoning Augmentation with Monte Carlo Tree Search for Code Generation","created":"2024-11-17","cited_by_count":10,"area":"lr"},{"id":"2602.21189","title":"Why Pass@k Optimization Can Degrade Pass@1: Prompt Interference in LLM Post-training","created":"2026-02-24","cited_by_count":8,"area":"lr"}],"next_cursor":null}