GlassGSM

Meaning-preserving "twins" of the 1,319 GSM8K test problems, each labeled with whether the solver (gpt-4o-mini) that solved the original problem fails on the twin. The data supports the study of conditional causal difficulty (how fragile a task a model can already solve is to a rewrite that leaves the answer unchanged) and was released with the paper Fragility Is Not Reducible to Hardness: Conditional Causal Difficulty for LLMs. It is the grade-school companion of GlassMATH.

Code: https://github.com/upwork-corp/Conditional_Causal_Difficulty_for_LLMs/tree/initial-release (training and evaluation of Frail-π, and the scripts that build this release).

Anonymous release for double-blind review. Authors, affiliations, and canonical links will be added after the review period.

What is in a row

A base is an original GSM8K problem. A twin is the same problem after one perturbation that must not change the gold answer. Each twin was posed to the solver and compared against the solver's result on the base problem.

family	what is done
entity_rename	person names are replaced with names from a neutral pool
sentence_reorder	the problem's sentences are reordered
injection	one or more setup sentences from a different GSM8K problem are injected; injection_ops is how many (1, 3, 5, 7, or 9)

Fragility rises with perturbation dose: the original GSM-IC leaves 3.7% of problems fragile, while GlassGSM raises this to 44.9% over the pooled doses (see the table below).

Configs

config	one row is	rows
glassgsm	one twin × one run setting m	32,858
glassgsm_bases	one base problem × m, with base-level aggregates	6,595
glassgsm_pooled	one base problem, pooled over all doses (unique twin texts)	1,319

Each config has a single split named full. No train/test split is shipped; the paper uses repeated random problem-level splits, so split by base_id, never by row: all twins of a base share a label structure and a base text.

Twin fields (glassgsm)

field	type	meaning
uid	string	unique row key solver/m{m}/twin_id (twin_id alone is only unique within one m)
base_id	string	original problem id; gsmic_adv-N is index N of the GSM8K test split
twin_id	string	twin id within a run
m	int	run setting (1, 3, 5, 7, 9), see below
solver	string	solver model whose outputs produced the labels (gpt-4o-mini for every row)
family / injection_ops / operator		perturbation family, number of injected sentences (null for non-injection), and the raw operator tag
complexity, complexity_score		declared complexity proxy: a heuristic score in [0, 1] computed from the problem text (it correlates with problem length); complexity is medium for every row
base_text, twin_text	string	original and perturbed problem
gold_answer	string	final answer, extracted from GSM8K (####)
base_solved	bool	the solver answered the base correctly (modal answer of 5 samples at temperature 0.2)
delta	int	Y(base) - Y(twin) in {-1, 0, 1}; 1 means the twin is wrong where the base was right
broke	bool	delta == 1. It implies base_solved. Fragility is defined on rows where base_solved is true

Base fields (glassgsm_bases)

base_id, m, solver, complexity, complexity_score, base_text, gold_answer, base_solved plus n_twins, d_obs (mean delta over the base's twins) and d_wc (max delta). They are exact aggregates of the twin rows, shipped separately so they do not leak into twin-level modeling as if they were per-twin labels.

Pooled fields (glassgsm_pooled)

base_id, solver, complexity_score, base_text, gold_answer, base_solved (majority over the five doses), n_unique_twins (twins pooled over all doses, deduplicated on (base_id, twin_text)), pi (break rate over those twins, the CCD; meaningful only where base_solved), d_obs (mean delta), fragile (d_obs > 0.05, the paper's definition, over all problems) and ccd_fragile (base_solved and pi > 0.05).

The run setting m

m is the dose: each file holds m twins per base problem (fewer for a small number of problems), split across the three families; the injection family draws its twins from runs whose injection size is at most m. Rows carry both the file-level m and the twin's own injection_ops. The twin sets at different m are resamples of the same audited pool (no new LLM calls), not independent draws, so treat them as the same problems seen at different perturbation budgets. Do not treat the five dose files as independent samples, and do not key on twin_id across doses: the same id is reused with different text at different m (3,857 ids), so deduplicate on (base_id, twin_text). Pooled over doses there are 18,309 unique twins (13.9 per problem), not the 32,858 rows.

Statistics

Break rate = share of twins on a solved base that the solver gets wrong. Fragile problems = share of all problems whose mean effect d_obs exceeds 0.05 (the paper's definition). CCD-fragile = share of solved problems whose break rate pi exceeds 0.05.

Solver: gpt-4o-mini (temperature 0.2, 5 samples per prompt, modal answer).

m	twins	base problems	break rate on solved bases	fragile problems	zero-effect problems
1	1,319	1,319	6.6%	6.2%	92.0%
3	3,957	1,319	8.8%	17.8%	79.3%
5	6,594	1,319	10.7%	27.4%	69.7%
7	9,210	1,319	11.6%	34.1%	62.9%
9	11,778	1,319	12.5%	39.6%	56.9%
pooled	18,309 unique	1,319	n/a	44.9%	48.6%

Pooled over doses, 47.7% of the 1,242 solved problems are CCD-fragile. Fragility rises steadily with dose. The pooled row is the GlassGSM row of the paper's Table 1 (44.9% fragile, 48.6% zero-effect, 13.9 unique twins per problem); the original GSM-IC leaves 3.7% of problems fragile. Per-dose figures come from the glassgsm config and the pooled figures from glassgsm_pooled.

Construction and audit

Twins come from the three operator families above: entity renaming and sentence reordering are produced by deterministic surface operators, and injection splices in setup sentences drawn from other GSM8K problems. Before release every (base, twin) pair is passed through a full-corpus filter: an LLM adjudicator checks that the twin does not change or invalidate the gold answer, and deterministic checks drop pairs with entity-name collisions, gold-answer-number collisions, or an extra question. This corpus is the audited, resampled mix of those surviving pairs (no new LLM calls were made to build it). For the m=9 generation file the audit saw 39,211 pairs and dropped 4,858 (12.4%): 4,738 gold-answer collisions, 95 LLM contradictions, 35 entity collisions and 1 unparsed response (11 pairs hit two reasons); the released m=9 file resamples at most nine of the 34,353 kept pairs per problem. The audit is a best-effort filter, not a proof of zero contamination; a 1,000-pair human spot-check (drawn from both GlassGSM and GlassMATH) agreed with the LLM verdicts on every audited kept pair. Details are in the paper's appendix.

Intended use and limitations

• Intended for research on robustness and per-instance difficulty prediction for LLMs.
• Labels are solver-relative. They describe fragility of gpt-4o-mini under the stated decoding setup, not an intrinsic property of a problem, and transfer across solvers is only partial.
• The solver labels carry sampling noise: re-solving an unperturbed base breaks about 1.1% of the time.
• Twins are machine-generated and may contain residual answer-changing text despite the audit.
• The base problems come from the public GSM8K test set. Do not use this data to train models you intend to evaluate on GSM8K.

Provenance and licensing

Base problems and gold answers originate from GSM8K (MIT); injected sentences also come from GSM8K. Perturbations and labels are new. The release is under the MIT license; the upstream notice is reproduced in NOTICE.md.

Loading

from datasets import load_dataset

twins = load_dataset("reza2ei/GlassGSM", "glassgsm", split="full")
solved = twins.filter(lambda r: r["solver"] == "gpt-4o-mini" and r["m"] == 9 and r["base_solved"])

Citation

@inproceedings{anonymous2027fragility,
  title     = {Fragility Is Not Reducible to Hardness: Conditional Causal Difficulty for {LLM}s},
  author    = {Anonymous},
  booktitle = {International Conference on Learning Representations},
  year      = {2027}
}