When 2D Tasks Meet 1D Serialization: On Serialization Friction in Structured Tasks
Not on the map. Why?
Abstract (arXiv)
In the LLM era, many symbolic and structured problems are presented to models through 1D text serialization. Yet some such problems are natively two-dimensional: their relevant relations, such as row--column correspondence or spatial adjacency, are defined by position in a 2D layout rather than by sequential order. This raises a representational question: does preserving the same symbolic entries in a 1D sequence also preserve the relational structure needed for computation? We study this issue through the lens of serialization friction: the representational mismatch in which the same underlying task instances and entries are still present, but relations that depend on layout become implicit under 1D serialization. The study uses a controlled synthetic testbed of three tasks: matrix transpose, Conway's Game of Life, and LU decomposition. In each task, the same instances are presented either as 1D text serialization or as their native 2D layout rendered as an image. Across this testbed, 1D serialization degrades more sharply as task size grows, and errors under serialization exhibit spatially structured patterns, suggesting that this presentation choice is consequential within our testbed. To further interpret these results, we add supplementary analyses that include a within-visual probe and an additional comparison of the two input presentations under the mixed-training transpose setting. These findings suggest that, for layout-defined tasks, reducing inputs to 1D serialization is not a neutral choice of representation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 34 references that are in the map. First posted on arXiv 29 Apr 2026.
Builds on
25 of 34 references.
References · 25
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
- 2024HybridFlow: A Flexible and Efficient RLHF Frameworkcited by 2,057
- 2024ChatGLM: A Family of Large Language Models from GLM-130B to GLM-4 All Toolscited by 1,121
- 2022LayoutLMv3: Pre-training for Document AI with Unified Text and Image Maskingcited by 485
- 2020TAPAS: Weakly Supervised Table Parsing via Pre-trainingcited by 434
- 2021OCR-free Document Understanding Transformercited by 407
- 2020TaBERT: Pretraining for Joint Understanding of Textual and Tabular Datacited by 398
- 2022Pix2Struct: Screenshot Parsing as Pretraining for Visual Language Understandingcited by 366
- 2025DeepSeek-OCR: Contexts Optical Compressioncited by 183
13 more
- 2023Talk like a Graph: Encoding Graphs for Large Language Modelscited by 176
- 2023Table Meets LLM: Can Large Language Models Understand Structured Table Data? A Benchmark and Empirical Studycited by 116
- 2020TUTA: Tree-based Transformers for Generally Structured Table Pre-trainingcited by 100
- 2025Glyph: Scaling Context Windows via Visual-Text Compressioncited by 49
- 2025Depth-Breadth Synergy in RLVR: Unlocking LLM Reasoning Gains with Adaptive Explorationcited by 43
- 2024GITA: Graph to Visual and Textual Integration for Vision-Language Graph Reasoningcited by 33
- 2025Visual Structures Helps Visual Reasoning: Addressing the Binding Problem in VLMscited by 15
- 2025Revisiting the Othello World Model Hypothesiscited by 11
- 2025VTCBench: Can Vision-Language Models Understand Long Context with Vision-Text Compression?cited by 11
- 2026VISTA-Bench: Do Vision-Language Models Really Understand Visualized Text as Well as Pure Text?cited by 8
- 2026Reading, Not Thinking: Understanding and Bridging the Modality Gap When Text Becomes Pixels in Multimodal LLMscited by 7
- 2026MetaOthello: A Controlled Study of Multiple World Models in Transformerscited by 4
- 2026Topo-RAG: Topology-aware retrieval for hybrid text-table documentscited by 1
Built on by
Not cited yet.