A Four-Stage Decomposition of Word-Problem Solving and Mechanistic Fragility in LLM Math Reasoning

Zhongdi Qu, Carla P Gomes


Abstract
Large language models solve grade-school math word problems with high accuracy, yet a single irrelevant clause inserted into the problem can collapse it. We reconcile these observations with a mechanistic account. We show that the model’s internal computation decomposes into a four-stage sequential pipeline, Schema Abstraction, Operation Planning, Operand Binding, and Computation, each stage producing a distinct intermediate representation in an identifiable band of layers. Using the same scaffold to diagnose distractor-induced failure, we localize the corruption to a single stage, Operation Planning, implemented by a set of attention heads whose causal role we validate bidirectionally. In short, we provide a mechanistic interpretation of math word problem reasoning in LLMs, and their failure when distracted.
Anthology ID:
2026.findings-emnlp.820
Volume:
Findings of the Association for Computational Linguistics: EMNLP 2026
Month:
October
Year:
2026
Address:
Budapest, Hungary
Editors:
Hung-Yi Lee, Sunipa Dev, Jessy Li, Desmond Elliott
Venue:
Findings
SIG:
SIGDAT
Publisher:
Association for Computational Linguistics
Note:
Pages:
17383–17402
Language:
URL:
https://aclanthology.org/2026.findings-emnlp.820/
DOI:
Bibkey:
Cite (ACL):
Zhongdi Qu and Carla P Gomes. 2026. A Four-Stage Decomposition of Word-Problem Solving and Mechanistic Fragility in LLM Math Reasoning. In Findings of the Association for Computational Linguistics: EMNLP 2026, pages 17383–17402, Budapest, Hungary. Association for Computational Linguistics.
Cite (Informal):
A Four-Stage Decomposition of Word-Problem Solving and Mechanistic Fragility in LLM Math Reasoning (Qu & Gomes, Findings 2026)
Copy Citation:
PDF:
https://aclanthology.org/2026.findings-emnlp.820.pdf