{"list":"other","total":52,"rows":[{"id":"2506.13131","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","created":"2025-06-16","cited_by_count":867},{"id":"2110.11334","title":"Generalized Out-of-Distribution Detection: A Survey","created":"2021-10-21","cited_by_count":802},{"id":"2406.00515","title":"A Survey on Large Language Models for Code Generation","created":"2024-06-01","cited_by_count":658},{"id":"2309.16797","title":"Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution","created":"2023-09-28","cited_by_count":551},{"id":"2507.19457","title":"GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning","created":"2025-07-25","cited_by_count":542},{"id":"2504.08066","title":"The AI Scientist-v2: Workshop-Level Automated Scientific Discovery via Agentic Tree Search","created":"2025-04-10","cited_by_count":422},{"id":"2402.01145","title":"ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution","created":"2024-02-02","cited_by_count":276},{"id":"2401.02051","title":"Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model","created":"2024-01-04","cited_by_count":268},{"id":"2407.13168","title":"SciCode: A Research Coding Benchmark Curated by Scientists","created":"2024-07-18","cited_by_count":178},{"id":"2509.19349","title":"ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolution","created":"2025-09-17","cited_by_count":174},{"id":"2606.15497","title":"Towards End-to-End Automation of AI Research","created":"2026-03-31","cited_by_count":159},{"id":"2511.23473","title":"ThetaEvolve: Test-time Learning on Open Problems","created":"2025-11-28","cited_by_count":64},{"id":"2504.05108","title":"Algorithm Discovery With LLMs: Evolutionary Search Meets Reinforcement Learning","created":"2025-04-07","cited_by_count":46},{"id":"2510.14150","title":"CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimization","created":"2025-10-15","cited_by_count":44},{"id":"2506.09050","title":"ALE-Bench: A Benchmark for Long-Horizon Objective-Driven Algorithm Engineering","created":"2025-06-10","cited_by_count":39},{"id":"2412.17287","title":"LLM4AD: A Platform for Algorithm Design with Large Language Model","created":"2024-12-23","cited_by_count":33},{"id":"2502.14297","title":"Evaluating Sakana's AI Scientist: Bold Claims, Mixed Results, and a Promising Future?","created":"2025-02-20","cited_by_count":32},{"id":"2507.15887","title":"AlgoTune: Can Language Models Speed Up General-Purpose Numerical Programs?","created":"2025-07-19","cited_by_count":27},{"id":"2406.04824","title":"FunBO: Discovering Acquisition Functions for Bayesian Optimization with FunSearch","created":"2024-06-07","cited_by_count":23},{"id":"2510.06056","title":"Scientific Algorithm Discovery by Augmenting AlphaEvolve with Deep Research","created":"2025-10-07","cited_by_count":19},{"id":"2507.21184","title":"Can Language Models Discover Scaling Laws?","created":"2025-07-27","cited_by_count":13},{"id":"2511.05597","title":"From Prompts to Power: Measuring the Energy Footprint of LLM Inference","created":"2025-11-05","cited_by_count":12},{"id":"2511.17592","title":"GigaEvo: An Open Source Optimization Framework Powered By LLMs And Evolution Algorithms","created":"2025-11-17","cited_by_count":11},{"id":"2106.08696","title":"High-Quality Hypergraph Partitioning","created":"2021-06-16","cited_by_count":10},{"id":"2512.00651","title":"Large Language Models for Software Engineering: A Reproducibility Crisis","created":"2025-11-29","cited_by_count":8},{"id":"2604.23472","title":"Escher-Loop: Mutual Evolution by Closed-Loop Self-Referential Optimization","created":"2026-04-25","cited_by_count":8},{"id":"1709.08949","title":"Computing Tree Decompositions with FlowCutter: PACE 2017 Submission","created":"2017-09-26","cited_by_count":7},{"id":"2602.08253","title":"G-LNS: Generative Large Neighborhood Search for LLM-Based Automatic Heuristic Design","created":"2026-02-09","cited_by_count":7},{"id":"2204.09052","title":"Optimizing Tensor Network Contraction Using Reinforcement Learning","created":"2022-04-18","cited_by_count":5},{"id":"2402.02456","title":"tnGPS: Discovering Unknown Tensor Network Structure Search Algorithms via Large Language Models (LLMs)","created":"2024-02-04","cited_by_count":5},{"id":"2505.23537","title":"Domain-Aware Tensor Network Structure Search","created":"2025-05-29","cited_by_count":5},{"id":"2511.20987","title":"Even with AI, Bijection Discovery is Still Hard: The Opportunities and Challenges of OpenEvolve for Novel Bijection Construction","created":"2025-11-26","cited_by_count":5},{"id":"1704.05286","title":"Positive-instance driven dynamic programming for treewidth","created":"2017-04-18","cited_by_count":4},{"id":"2503.21455","title":"Code Review Comprehension: Reviewing Strategies Seen Through Code Comprehension Theories","created":"2025-03-27","cited_by_count":4},{"id":"2505.20242","title":"RedAHD: Reduction-Based End-to-End Automatic Heuristic Design with Large Language Models","created":"2025-05-26","cited_by_count":4},{"id":"2511.07463","title":"Dynamic Stability of LLM-Generated Code","created":"2025-11-07","cited_by_count":4},{"id":"2511.16964","title":"Optimizing PyTorch Inference with LLM-Based Multi-Agent Systems","created":"2025-11-21","cited_by_count":4},{"id":"2603.00214","title":"Agentic Scientific Simulation: Execution-Grounded Model Construction and Reconstruction","created":"2026-02-27","cited_by_count":4},{"id":"2605.01120","title":"New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search","created":"2026-05-01","cited_by_count":4},{"id":"1906.00013","title":"Parameterization of tensor network contraction","created":"2019-05-31","cited_by_count":3},{"id":"2001.08063","title":"Algorithms for Tensor Network Contraction Ordering","created":"2020-01-15","cited_by_count":3},{"id":"2602.00755","title":"Evolving Interpretable Constitutions for Multi-Agent Coordination","created":"2026-01-31","cited_by_count":3},{"id":"2604.26591","title":"MappingEvolve: LLM-Driven Code Evolution for Technology Mapping","created":"2026-04-29","cited_by_count":3},{"id":"1807.04599","title":"Benchmarking treewidth as a practical component of tensor-network--based quantum simulation","created":"2018-07-12","cited_by_count":2},{"id":"2209.12332","title":"On the Optimal Linear Contraction Order of Tree Tensor Networks, and Beyond","created":"2022-09-25","cited_by_count":2},{"id":"2405.06271","title":"Code Compass: A Study on the Challenges of Navigating Unfamiliar Codebases","created":"2024-05-10","cited_by_count":2},{"id":"2508.20729","title":"Re4: Scientific Computing Agent with Rewriting, Resolution, Review and Revision","created":"2025-08-28","cited_by_count":2},{"id":"2604.15468","title":"The Semi-Executable Stack: Agentic Software Engineering and the Expanding Scope of SE","created":"2026-04-16","cited_by_count":2},{"id":"2209.02895","title":"Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation","created":"2022-09-07","cited_by_count":1},{"id":"2504.19225","title":"Providing Information About Implemented Algorithms Improves Program Comprehension: A Controlled Experiment","created":"2025-04-27","cited_by_count":1},{"id":"2604.12601","title":"LLM-Guided Prompt Evolution for Password Guessing","created":"2026-04-14","cited_by_count":1},{"id":"2605.05921","title":"Intentmaking and Sensemaking: Human Interaction with AI-Guided Mathematical Discovery","created":"2026-05-07","cited_by_count":1}],"next_cursor":null}