{"total":27,"rows":[{"id":"2506.03136","title":"Co-Evolving LLM Coder and Unit Tester via Reinforcement Learning","created":"2025-06-03","cited_by_count":56,"area":null},{"id":"2504.05408","title":"Frontier AI's Impact on the Cybersecurity Landscape","created":"2025-04-07","cited_by_count":21,"area":null},{"id":"2503.18809","title":"Classical Planning with LLM-Generated Heuristics: Challenging the State of the Art with Python Code","created":"2025-03-24","cited_by_count":18,"area":null},{"id":"2601.19697","title":"AlignCoder: Aligning Retrieval with Target Intent for Repository-Level Code Completion","created":"2026-01-27","cited_by_count":7,"area":null},{"id":"2506.00400","title":"Scaling Textual Gradients via Sampling-Based Momentum","created":"2025-05-31","cited_by_count":6,"area":null},{"id":"2511.16858","title":"Investigating Test Overfitting on SWE-bench","created":"2025-11-20","cited_by_count":6,"area":null},{"id":"2506.06052","title":"DCP-Bench-Open: Evaluating LLMs for Constraint Modelling of Discrete Combinatorial Problems","created":"2025-06-06","cited_by_count":4,"area":null},{"id":"2510.09595","title":"LiveOIBench: Can Large Language Models Outperform Human Contestants in Informatics Olympiads?","created":"2025-10-10","cited_by_count":4,"area":null},{"id":"2511.16005","title":"InfCode-C++: Intent-Guided Semantic Retrieval and AST-Structured Search for C++ Issue Resolution","created":"2025-11-20","cited_by_count":3,"area":null},{"id":"2602.06098","title":"A Theoretical Analysis of Test-Driven Code Generation","created":"2026-02-05","cited_by_count":3,"area":null},{"id":"2603.27448","title":"GIFT: Bootstrapping Image-to-CAD Program Synthesis via Geometric Feedback","created":"2026-03-28","cited_by_count":3,"area":null},{"id":"2604.03922","title":"ACES: Who Tests the Tests? Leave-One-Out AUC Consistency for Code Generation","created":"2026-04-05","cited_by_count":2,"area":null},{"id":"2604.16995","title":"SPS: Steering Probability Squeezing for Better Exploration in Reinforcement Learning for Large Language Models","created":"2026-04-18","cited_by_count":2,"area":null},{"id":"2505.13553","title":"Towards Functional Correctness of Large Code Models with Selective Generation","created":"2025-05-19","cited_by_count":1,"area":null},{"id":"2602.07670","title":"Surprisal-Guided Selection: Compute-Optimal Test-Time Strategies for Execution-Grounded Code Generation","created":"2026-02-07","cited_by_count":1,"area":null},{"id":"2604.15618","title":"Majority Voting for Code Generation","created":"2026-04-17","cited_by_count":1,"area":null},{"id":"2606.03852","title":"FLARE: Fine-Grained Diagnostic Feedback for LLM Code Refinement","created":"2026-06-02","cited_by_count":1,"area":null},{"id":"2608.18027","title":"Chain-of-Experience for Continual LLM Improvement","created":"2026-08-18","cited_by_count":1,"area":null},{"id":"2604.21598","title":"You Don't Need Public Tests to Generate Correct Code","created":"2026-04-23","cited_by_count":0,"area":null},{"id":"2605.22478","title":"DeliCIR: Memory-Guided Test-Time Deliberation via Multi-Agent Collaboration for Composed Image Retrieval","created":"2026-05-21","cited_by_count":0,"area":null},{"id":"2608.23632","title":"Function-Level Execution Feedback for Code Preference Optimization","created":"2026-08-23","cited_by_count":0,"area":null},{"id":"2609.09135","title":"Entropy-Regularized Rank-Masked Policy Optimization for Test-Time Reinforcement Learning in Code Generation","created":"2026-09-08","cited_by_count":0,"area":null},{"id":"2609.12489","title":"Confidence-Gated Transductive Test Generation for Code Reranking","created":"2026-09-11","cited_by_count":0,"area":null},{"id":"2609.21208","title":"Information-Gain Rewards over Diversity-Pruned Tests: GT-Anchored Verifier Co-Training for Reliable Code Generation","created":"2026-09-18","cited_by_count":0,"area":null},{"id":"2609.33192","title":"AG-CoT: Verified Algorithmic Traces for LLM Program Synthesis on Clifford Circuits","created":"2026-09-27","cited_by_count":0,"area":null},{"id":"2609.34717","title":"ReMCTS: Reflection-Enhanced Monte Carlo Tree Search for Code Generation","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.15372","title":"Fewer Bits, More Tries: Recovering Capability Under Memory Constraints","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}