{"total":14,"rows":[{"id":"2103.11505","title":"Policy-Guided Heuristic Search with Guarantees","created":"2021-03-21","cited_by_count":20,"area":null},{"id":"2510.12066","title":"AI Agents as Universal Task Solvers","created":"2025-10-14","cited_by_count":9,"area":null},{"id":"2305.16945","title":"Levin Tree Search with Context Models","created":"2023-05-26","cited_by_count":7,"area":null},{"id":"2310.12819","title":"Hybrid Search for Efficient Planning with Completeness Guarantees","created":"2023-10-19","cited_by_count":6,"area":null},{"id":"2104.10535","title":"Exploiting Learned Policies in Focal Search","created":"2021-04-21","cited_by_count":3,"area":null},{"id":"2210.14055","title":"Policy-Guided Lazy Search with Feedback for Task and Motion Planning","created":"2022-10-25","cited_by_count":1,"area":null},{"id":"2412.05196","title":"Exponential Speedups by Rerooting Levin Tree Search","created":"2024-12-06","cited_by_count":1,"area":null},{"id":"2506.07255","title":"Subgoal-Guided Policy Heuristic Search with Learned Subgoals","created":"2025-06-08","cited_by_count":1,"area":null},{"id":"2109.15147","title":"Reinforcement Learning with Information-Theoretic Actuation","created":"2021-09-30","cited_by_count":0,"area":null},{"id":"2209.03393","title":"The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems","created":"2022-09-07","cited_by_count":0,"area":null},{"id":"2302.00384","title":"Alphazzle: Jigsaw Puzzle Solver with Deep Monte-Carlo Tree Search","created":"2023-02-01","cited_by_count":0,"area":null},{"id":"2604.14345","title":"PAC-CF: Calibrating Irreversible Frontier Pruning in LLM-Guided Search","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2605.30664","title":"Structure-Induced Information for Rerooting Levin Tree Search","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2609.25575","title":"Direct Optimization of Generators for Search in Automated Theorem Proving","created":"2026-09-22","cited_by_count":0,"area":null}],"next_cursor":null}