{"total":15,"rows":[{"id":"2112.10664","title":"Proving Theorems using Incremental Learning and Hindsight Experience Replay","created":"2021-12-20","cited_by_count":13,"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":"2206.14298","title":"Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning","created":"2022-06-28","cited_by_count":3,"area":null},{"id":"2509.22626","title":"Learning Admissible Heuristics for A*: Theory and Practice","created":"2025-09-26","cited_by_count":2,"area":null},{"id":"2406.03361","title":"What Matters in Hierarchical Search for Combinatorial Reasoning Problems?","created":"2024-06-05","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":"2308.02666","title":"Solving Witness-type Triangle Puzzles Faster with an Automatically Learned Human-Explainable Predicate","created":"2023-08-04","cited_by_count":0,"area":null},{"id":"2412.02136","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","created":"2024-12-03","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}