{"total":16,"rows":[{"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":"2410.24080","title":"Graph Learning for Numeric Planning","created":"2024-10-31","cited_by_count":5,"area":null},{"id":"2508.07743","title":"Symmetry-Aware Transformer Training for Automated Planning","created":"2025-08-11","cited_by_count":5,"area":null},{"id":"2504.20318","title":"Leveraging Action Relational Structures for Integrated Learning and Planning","created":"2025-04-29","cited_by_count":4,"area":null},{"id":"2410.07923","title":"Deep Learning for Generalised Planning with Background Knowledge","created":"2024-10-10","cited_by_count":2,"area":null},{"id":"2504.19738","title":"Learning Efficiency Meets Symmetry Breaking","created":"2025-04-28","cited_by_count":2,"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":"2411.00577","title":"WLPlan: Relational Features for Symbolic Planning","created":"2024-11-01","cited_by_count":1,"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":"2506.11721","title":"Relational GNNs Cannot Learn $C_2$ Features for Planning","created":"2025-06-13","cited_by_count":0,"area":null},{"id":"2508.12840","title":"Scaling Multi-Agent Epistemic Planning through GNN-Derived Heuristics","created":"2025-08-18","cited_by_count":0,"area":null},{"id":"2508.18520","title":"Symmetry-Invariant Novelty Heuristics via Unsupervised Weisfeiler-Leman Features","created":"2025-08-25","cited_by_count":0,"area":null},{"id":"2602.23148","title":"On Sample-Efficient Generalized Planning via Learned Transition Models","created":"2026-02-26","cited_by_count":0,"area":null},{"id":"2605.18674","title":"Efficient Lookahead Encoding and Abstracted Width for Learning General Policies in Classical Planning","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2606.02438","title":"LLM-Evolved Pattern Generators for Optimal Classical Planning","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2606.04597","title":"Learning Admissible Heuristics via Cost Partitioning","created":"2026-06-03","cited_by_count":0,"area":null}],"next_cursor":null}