{"total":16,"rows":[{"id":"2507.18107","title":"T2VWorldBench: A Benchmark for Evaluating World Knowledge in Text-to-Video Generation","created":"2025-07-24","cited_by_count":19,"area":null},{"id":"2412.18040","title":"Theoretical Constraints on the Expressive Power of $\\mathsf{RoPE}$-based Tensor Attention Transformers","created":"2024-12-23","cited_by_count":12,"area":null},{"id":"2501.04299","title":"Circuit Complexity Bounds for Visual Autoregressive Model","created":"2025-01-08","cited_by_count":10,"area":null},{"id":"2505.04946","title":"T2VTextBench: A Human Evaluation Benchmark for Textual Control in Video Generation Models","created":"2025-05-08","cited_by_count":10,"area":null},{"id":"2504.13558","title":"Transformers Can Overcome the Curse of Dimensionality: A Theoretical Study from an Approximation Perspective","created":"2025-04-18","cited_by_count":5,"area":null},{"id":"2504.12175","title":"Approximation Bounds for Transformer Networks with Application to Regression","created":"2025-04-16","cited_by_count":4,"area":null},{"id":"2509.00421","title":"Memory Limitations of Prompt Tuning in Transformers","created":"2025-08-30","cited_by_count":4,"area":null},{"id":"2502.16912","title":"When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?","created":"2025-02-24","cited_by_count":3,"area":null},{"id":"2506.23551","title":"A unified framework for establishing the universal approximation of transformer-type architectures","created":"2025-06-30","cited_by_count":2,"area":null},{"id":"2608.09558","title":"Training-Free Universal Approximation by Prompting Random Transformers","created":"2026-08-10","cited_by_count":1,"area":null},{"id":"2510.05494","title":"Fundamental Limits of Crystalline Equivariant Graph Neural Networks: A Circuit Complexity Perspective","created":"2025-10-07","cited_by_count":0,"area":null},{"id":"2604.24878","title":"Transformer Approximations from ReLUs","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2605.07463","title":"Approximation Error Upper and Lower Bounds for H\\\"{o}lder Class with Transformers","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2605.22223","title":"How Many Different Outputs Can a Transformer Generate?","created":"2026-05-21","cited_by_count":0,"area":null},{"id":"2609.32302","title":"On the Capability and Limitation of Hard Prompt","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.36766","title":"When Can Prefixes Compile LoRA? Exact Resource-Capped Tests for Frozen Attention","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}