{"total":30,"rows":[{"id":"2506.12027","title":"Constant Bit-size Transformers Are Turing Complete","created":"2025-05-22","cited_by_count":19,"area":null},{"id":"2510.01098","title":"Theory of Scaling Laws for In-Context Regression: Depth, Width, Context and Time","created":"2025-10-01","cited_by_count":16,"area":null},{"id":"2504.07866","title":"Pangu Ultra: Pushing the Limits of Dense Large Language Models on Ascend NPUs","created":"2025-04-10","cited_by_count":13,"area":null},{"id":"2507.12549","title":"The Serial Scaling Hypothesis","created":"2025-07-16","cited_by_count":13,"area":null},{"id":"2505.14925","title":"Too Long, Didn't Model: Decomposing LLM Long-Context Understanding With Novels","created":"2025-05-20","cited_by_count":9,"area":null},{"id":"2510.24966","title":"Sequences of Logits Reveal the Low Rank Structure of Language Models","created":"2025-10-28","cited_by_count":9,"area":null},{"id":"2603.03612","title":"Why Are Linear RNNs More Parallelizable?","created":"2026-03-04","cited_by_count":8,"area":null},{"id":"2509.22445","title":"Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformers","created":"2025-09-26","cited_by_count":6,"area":null},{"id":"2510.00368","title":"The Transformer Cookbook","created":"2025-10-01","cited_by_count":6,"area":null},{"id":"2607.20594","title":"When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers","created":"2026-07-22","cited_by_count":6,"area":null},{"id":"2510.05364","title":"The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures","created":"2025-10-06","cited_by_count":4,"area":null},{"id":"2601.01754","title":"Context-Free Recognition with Transformers","created":"2026-01-05","cited_by_count":4,"area":null},{"id":"2603.23998","title":"Sparse Growing Transformer: Training-Time Sparse Depth Allocation via Progressive Attention Looping","created":"2026-03-25","cited_by_count":3,"area":null},{"id":"2604.17121","title":"The Topological Trouble With Transformers","created":"2026-04-18","cited_by_count":3,"area":null},{"id":"2604.18839","title":"One Step Forward and K Steps Back: Better Reasoning with Denoising Recursion Models","created":"2026-04-20","cited_by_count":3,"area":null},{"id":"2605.09867","title":"Continuous Latent Contexts Enable Efficient Online Learning in Transformers","created":"2026-05-11","cited_by_count":3,"area":null},{"id":"2601.18858","title":"Representational Homomorphism Predicts and Improves Compositional Generalization In Transformer Language Model","created":"2026-01-26","cited_by_count":2,"area":null},{"id":"2512.14531","title":"VersatileFFN: Achieving Parameter Efficiency in LLMs via Adaptive Wide-and-Deep Reuse","created":"2025-12-16","cited_by_count":1,"area":null},{"id":"2601.14175","title":"A model of errors in transformers","created":"2026-01-20","cited_by_count":1,"area":null},{"id":"2605.30523","title":"Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2608.04243","title":"Attention-based representations for multi-task computation","created":"2026-08-04","cited_by_count":1,"area":null},{"id":"2605.26099","title":"Do Language Models Need Sleep? Offline Recurrence for Improved Online Inference","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.01532","title":"Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2608.31067","title":"Universal Transformers for Circuit Computations: Perfect Length Generalization in Tiny Transformers","created":"2026-08-31","cited_by_count":0,"area":null},{"id":"2609.14500","title":"When does a scaling result justify a different allocation? A critical review of resource-allocation evidence for AI systems","created":"2026-09-13","cited_by_count":0,"area":null},{"id":"2609.29951","title":"Tracking States or Tracking Cosets? An Algebraic Account of Learned State Tracking","created":"2026-09-24","cited_by_count":0,"area":null},{"id":"2609.38149","title":"Pretraining Latent Information Feedback Transformers with Teacher Supervision","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.02909","title":"Constraint-Aware Training","created":"2026-10-02","cited_by_count":0,"area":null},{"id":"2610.14030","title":"Rotate the Loop: Blockwise Conformality for Looped Transformers","created":"2026-09-30","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}],"next_cursor":null}