cff-version: 1.2.0 message: If you use this dataset, please cite both the dataset and the accompanying paper. type: dataset title: 'Procedural Math Reasoning Robustness: dataset for "From Recognition to Reconstruction: Towards Robust Procedural Mathematical Reasoning"' version: 1.0.0 date-released: '2026-11-12' license: CC-BY-SA-4.0 authors: &id001 - family-names: Mazdarani given-names: Fateme affiliation: Clemson University - family-names: Toxtli given-names: Carlos affiliation: Clemson University orcid: https://orcid.org/0000-0002-9430-2661 abstract: A procedural-robustness panel of 2,800 mathematical statements (1,400 equivalent reformulations of named theorems and 1,400 constructed contrasts) with reference theorem labels and ordered transformation sequences, 44,800 scored outputs from four open-weight models under four conditions (closed-book and retrieval-augmented), the retrieval corpora (306 theorem cards, 17 operation cards) and the full protocol (prompts, output schema, operation vocabulary and run settings). keywords: - mathematics - theorem-recognition - procedural-reasoning - retrieval-augmented-generation - robustness doi: 10.5281/zenodo.24179015 url: https://huggingface.co/datasets/ai4he/procedural-math-reasoning-robustness preferred-citation: type: conference-paper title: 'From Recognition to Reconstruction: Towards Robust Procedural Mathematical Reasoning' authors: *id001 year: 2026 collection-title: 4th Workshop on Mathematical Natural Language Processing (MathNLP 2026), EMNLP 2026 url: https://www.carlostoxtli.com/papers/mathnlp2026-from-recognition-to-reconstruction.pdf