{"total":67,"rows":[{"id":"2502.17416","title":"Reasoning with Latent Thoughts: On the Power of Looped Transformers","created":"2025-02-24","cited_by_count":240,"area":"lr"},{"id":"2504.01990","title":"Advances and Challenges in Foundation Agents: From Brain-Inspired Intelligence to Evolutionary, Collaborative, and Safe Systems","created":"2025-03-31","cited_by_count":126,"area":"agents"},{"id":"2406.09170","title":"Test of Time: A Benchmark for Evaluating LLMs on Temporal Reasoning","created":"2024-06-13","cited_by_count":88,"area":"lr"},{"id":"2505.12514","title":"Reasoning by Superposition: A Theoretical Perspective on Chain of Continuous Thought","created":"2025-05-18","cited_by_count":77,"area":"lr"},{"id":"2503.03961","title":"A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers","created":"2025-03-05","cited_by_count":53,"area":null},{"id":"2406.10727","title":"Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights","created":"2024-06-15","cited_by_count":44,"area":null},{"id":"2406.06467","title":"How Far Can Transformers Reason? The Globality Barrier and Inductive Scratchpad","created":"2024-06-10","cited_by_count":36,"area":null},{"id":"2505.19488","title":"Understanding Transformer from the Perspective of Associative Memory","created":"2025-05-26","cited_by_count":34,"area":null},{"id":"2504.15266","title":"Roll the dice & look before you leap: Going beyond the creative limits of next-token prediction","created":"2025-04-21","cited_by_count":29,"area":null},{"id":"2406.04229","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","created":"2024-06-06","cited_by_count":28,"area":"lr"},{"id":"2502.01694","title":"Metastable Dynamics of Chain-of-Thought Reasoning: Provable Benefits of Search, RL and Distillation","created":"2025-02-02","cited_by_count":25,"area":"lr"},{"id":"2410.19034","title":"Mixture of Parrots: Experts improve memorization more than reasoning","created":"2024-10-24","cited_by_count":21,"area":"moe"},{"id":"2412.04703","title":"Transformers Struggle to Learn to Search","created":"2024-12-06","cited_by_count":19,"area":null},{"id":"2509.25239","title":"A Formal Comparison Between Chain of Thought and Latent Thought","created":"2025-09-25","cited_by_count":15,"area":"lr"},{"id":"2407.01214","title":"Revisiting Random Walks for Learning on Graphs","created":"2024-07-01","cited_by_count":13,"area":null},{"id":"2505.21825","title":"Let Me Think! A Long Chain-of-Thought Can Be Worth Exponentially Many Short Ones","created":"2025-05-27","cited_by_count":13,"area":"lr"},{"id":"2507.12549","title":"The Serial Scaling Hypothesis","created":"2025-07-16","cited_by_count":13,"area":null},{"id":"2410.18032","title":"GraphTeam: Facilitating Large Language Model-based Graph Analysis via Multi-Agent Collaboration","created":"2024-10-23","cited_by_count":12,"area":"agents"},{"id":"2503.01805","title":"Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers","created":"2025-03-03","cited_by_count":11,"area":null},{"id":"2408.09529","title":"Revisiting the Graph Reasoning Ability of Large Language Models: Case Studies in Translation, Connectivity and Shortest Path","created":"2024-08-18","cited_by_count":10,"area":"lr"},{"id":"2602.03655","title":"Sequential Group Composition: A Window into the Mechanics of Deep Learning","created":"2026-02-03","cited_by_count":10,"area":null},{"id":"2502.11607","title":"GraphThought: Graph Combinatorial Optimization with Thought Generation","created":"2025-02-17","cited_by_count":9,"area":"lr"},{"id":"2505.08140","title":"Lost in Transmission: When and Why LLMs Fail to Reason Globally","created":"2025-05-13","cited_by_count":9,"area":"lr"},{"id":"2505.24067","title":"Primal-Dual Neural Algorithmic Reasoning","created":"2025-05-29","cited_by_count":9,"area":null},{"id":"2410.01985","title":"Lost-in-Distance: Impact of Contextual Proximity on LLM Performance in Graph Tasks","created":"2024-10-02","cited_by_count":8,"area":null},{"id":"2504.04702","title":"Provable Failure of Language Models in Learning Majority Boolean Logic via Gradient Descent","created":"2025-04-07","cited_by_count":8,"area":"lr"},{"id":"2501.02393","title":"Graph-Aware Isomorphic Attention for Adaptive Dynamics in Transformers","created":"2025-01-04","cited_by_count":7,"area":null},{"id":"2408.13863","title":"CodeGraph: Enhancing Graph Reasoning of LLMs with Code","created":"2024-08-25","cited_by_count":6,"area":"lr"},{"id":"2411.15671","title":"Best of Both Worlds: Advantages of Hybrid Graph Sequence Models","created":"2024-11-23","cited_by_count":6,"area":null},{"id":"2503.01544","title":"Compositional Reasoning with Transformers, RNNs, and Chain of Thought","created":"2025-03-03","cited_by_count":6,"area":"lr"},{"id":"2510.00368","title":"The Transformer Cookbook","created":"2025-10-01","cited_by_count":6,"area":null},{"id":"2601.15158","title":"Outcome-Based RL Provably Leads Transformers to Reason, but Only With the Right Data","created":"2026-01-21","cited_by_count":6,"area":"lr"},{"id":"2505.14840","title":"Subquadratic Algorithms and Hardness for Attention with Any Temperature","created":"2025-05-20","cited_by_count":5,"area":null},{"id":"2507.07544","title":"Position: We Need An Algorithmic Understanding of Generative AI","created":"2025-07-10","cited_by_count":5,"area":null},{"id":"2407.02678","title":"Reasoning in Large Language Models: A Geometric Perspective","created":"2024-07-02","cited_by_count":4,"area":"lr"},{"id":"2509.22613","title":"Benefits and Pitfalls of Reinforcement Learning for Language Model Planning: A Theoretical Perspective","created":"2025-09-26","cited_by_count":4,"area":null},{"id":"2510.25626","title":"Are Language Models Efficient Reasoners? A Perspective from Logic Programming","created":"2025-10-29","cited_by_count":4,"area":"lr"},{"id":"2511.07368","title":"Distributional Biases in Post-Training: A Markovian Analysis of Reasoning Trajectories","created":"2025-11-10","cited_by_count":4,"area":"lr"},{"id":"2602.19980","title":"Discrete Diffusion Models Exploit Asymmetry to Solve Lookahead Planning Tasks","created":"2026-02-23","cited_by_count":4,"area":"diffusion"},{"id":"2410.22372","title":"A Hierarchical Language Model For Interpretable Graph Reasoning","created":"2024-10-29","cited_by_count":3,"area":"lr"},{"id":"2411.13028","title":"A Theory for Compressibility of Graph Transformers for Transductive Learning","created":"2024-11-20","cited_by_count":3,"area":null},{"id":"2503.10542","title":"Language Models, Graph Searching, and Supervision Adulteration: When More Supervision is Less and How to Make More More","created":"2025-03-13","cited_by_count":3,"area":null},{"id":"2506.05393","title":"Are Large Language Models Good Temporal Graph Learners?","created":"2025-06-03","cited_by_count":3,"area":null},{"id":"2509.09001","title":"Fast attention mechanisms: a tale of parallelism","created":"2025-09-10","cited_by_count":3,"area":null},{"id":"2509.20336","title":"Uncovering Graph Reasoning in Decoder-only Transformers with Circuit Tracing","created":"2025-09-24","cited_by_count":3,"area":"lr"},{"id":"2411.07467","title":"Machines and Mathematical Mutations: Using GNNs to Characterize Quiver Mutation Classes","created":"2024-11-12","cited_by_count":2,"area":null},{"id":"2507.05362","title":"On the Bias of Next-Token Predictors Toward Systematically Inefficient Reasoning: A Shortest-Path Case Study","created":"2025-07-07","cited_by_count":2,"area":"lr"},{"id":"2511.08028","title":"Generalizable Insights for Graph Transformers in Theory and Practice","created":"2025-11-11","cited_by_count":2,"area":null},{"id":"2605.22471","title":"Lost in Tokenization: Fundamental Trade-offs in Graph Tokenization for Transformers","created":"2026-05-21","cited_by_count":2,"area":null},{"id":"2606.22938","title":"Provable Benefits of RLVR over SFT for Reasoning Models: Learning to Backtrack Efficiently","created":"2026-06-22","cited_by_count":2,"area":"lr"},{"id":"2503.06917","title":"Sample-Efficient Optimization over Generative Priors via Coarse Learnability","created":"2025-03-10","cited_by_count":1,"area":null},{"id":"2506.20575","title":"Exploring Graph-Transformer Out-of-Distribution Generalization Abilities","created":"2025-06-25","cited_by_count":1,"area":null},{"id":"2602.02707","title":"Every Bit Counts: A Theoretical Study of Precision-Expressivity Tradeoffs in Quantized Transformers","created":"2026-02-02","cited_by_count":1,"area":null},{"id":"2602.10386","title":"Colorful Talks with Graphs: Human-Interpretable Graph Encodings for Large Language Models","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2602.22225","title":"SmartChunk Retrieval: Query-Aware Chunk Compression with Planning for Efficient Document RAG","created":"2025-12-17","cited_by_count":1,"area":"rag"},{"id":"2605.06239","title":"When Graph Language Models Go Beyond Memorization","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2509.22343","title":"Transformers Can Learn Connectivity in Some Graphs but Not Others","created":"2025-09-26","cited_by_count":0,"area":"lr"},{"id":"2510.08613","title":"GraphGhost: Tracing Structures Behind Large Language Models","created":"2025-10-07","cited_by_count":0,"area":"lr"},{"id":"2602.01553","title":"Plain Transformers are Surprisingly Powerful Link Predictors","created":"2026-02-02","cited_by_count":0,"area":null},{"id":"2602.13155","title":"Learning to Approximate Uniform Facility Location via Graph Neural Networks","created":"2026-02-13","cited_by_count":0,"area":null},{"id":"2604.03557","title":"When Do Hallucinations Arise? A Graph Perspective on the Evolution of Path Reuse and Path Compression","created":"2026-04-04","cited_by_count":0,"area":"lr"},{"id":"2604.12426","title":"Do Transformers Use their Depth Adaptively? Evidence from a Relational Reasoning Task","created":"2026-04-14","cited_by_count":0,"area":"lr"},{"id":"2606.06865","title":"Are Large Language Models Suitable for Graph Computation? Progress and Prospects","created":"2026-06-05","cited_by_count":0,"area":null},{"id":"2609.12265","title":"GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs","created":"2026-09-10","cited_by_count":0,"area":"lr"},{"id":"2609.38446","title":"What Pretraining and Midtraining Make Learnable from Rewards?","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.14456","title":"Learning to Extrapolate in Depth with Looped Transformers","created":"2026-10-10","cited_by_count":0,"area":null},{"id":"2610.15185","title":"DeltaNet-PC: Test-Time Memory Without Backpropagation Through Time","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}