{"total":18,"rows":[{"id":"2606.18206","title":"Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformers","created":"2026-06-16","cited_by_count":28,"area":null},{"id":"2604.21254","title":"Hyperloop Transformers","created":"2026-04-23","cited_by_count":12,"area":null},{"id":"2607.20519","title":"Adaptive Depth in Looped Transformers: Diagnosing Learned Halting Gates and Trajectory Readouts","created":"2026-07-08","cited_by_count":12,"area":null},{"id":"2608.18222","title":"Think Shallow, Solve Deep: Controlling Recurrent Dynamics for Reliable Test-Time Depth","created":"2026-08-18","cited_by_count":9,"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":"2608.09444","title":"Depth-adaptive Inference of Looped Language Models via Continuous Depth Batching","created":"2026-08-10","cited_by_count":6,"area":null},{"id":"2608.11233","title":"Retrofitting Recurrent Depth into a Pretrained Language Model: Installation, Extrapolation, Transfer, and Retention at Two Parameter Budgets","created":"2026-07-31","cited_by_count":6,"area":null},{"id":"2606.24898","title":"Dense Supervision Is Not Enough: The Readout Blind Spot in Looped Language Models","created":"2026-06-12","cited_by_count":5,"area":null},{"id":"2605.06322","title":"SMolLM: Small Language Models Learn Small Molecular Grammar","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2606.20737","title":"Repeated Shared Access Enables Grokking, but Edit Propagation Depends on an Addressable Memory","created":"2026-06-17","cited_by_count":0,"area":null},{"id":"2607.10681","title":"LayerNorm as Implicit Gain Control in Looped Transformers","created":"2026-07-12","cited_by_count":0,"area":null},{"id":"2609.09691","title":"Looped GPT-BERT: Trading Parameters for Computation in Small Language Modeling","created":"2026-09-09","cited_by_count":0,"area":null},{"id":"2609.19521","title":"Storing Is Not Remembering: LSTM-UT and Bounded Gated Memory for Looped Transformers","created":"2026-09-17","cited_by_count":0,"area":null},{"id":"2609.32457","title":"Write Back the $\\Delta$: Revisiting the Same Tokens with Fresh Representations","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.36585","title":"Transformers Stop Thinking Too Early, and a Tiny LoRA Fixes It","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2609.36636","title":"What Makes Recurrence Effective in Looped Language Models?","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.03626","title":"Depth as Time in One-Step Generative Models","created":"2026-10-02","cited_by_count":0,"area":null},{"id":"2610.16415","title":"Chain Dimension Scaling: Communication-Efficient Loop-Style Scaling for Industrial Short-Video Ranking","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}