{"total":13,"rows":[{"id":"2510.19315","title":"Transformers are Inherently Succinct","created":"2025-10-22","cited_by_count":4,"area":null},{"id":"2603.02238","title":"Length Generalization Bounds for Transformers","created":"2026-02-13","cited_by_count":4,"area":null},{"id":"2605.00768","title":"Characterizing the Expressivity of Local Attention in Transformers","created":"2026-05-01","cited_by_count":3,"area":null},{"id":"2508.01067","title":"Expressive Power of Graph Transformers via Logic","created":"2025-08-01","cited_by_count":2,"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.11909","title":"Disentangling the Expressivity of RoPE","created":"2026-08-12","cited_by_count":1,"area":null},{"id":"2602.16473","title":"Synthesis and Verification of Transformer Programs (Technical Report)","created":"2026-02-18","cited_by_count":0,"area":null},{"id":"2605.07705","title":"Encoder-Decoder Transformers: Logical Characterizations and Periodicity","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2606.09822","title":"Causally Evaluating the Learnability of Formal Language Tasks","created":"2026-06-08","cited_by_count":0,"area":null},{"id":"2607.21574","title":"Surprisal Theory is Tautological (without Rational Grounding)","created":"2026-07-23","cited_by_count":0,"area":null},{"id":"2607.26988","title":"A Compositional Theory of Causally Masked Transformers","created":"2026-07-29","cited_by_count":0,"area":null},{"id":"2609.08851","title":"Length Generalization for Transformers via Compression","created":"2026-09-08","cited_by_count":0,"area":null},{"id":"2609.11132","title":"How Wrong Can a Good Predictor Be? Diverging Updates with Vanishing Predictive KL","created":"2026-09-10","cited_by_count":0,"area":null}],"next_cursor":null}