# ACED: Reference-Anchored Aggregation of Natural-Language and Executable Evidence for Mathematical Reasoning

arXiv: https://arxiv.org/abs/2610.16635 · HTML: https://mlsanity.com/paper/2610.16635/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Placed in Mathematical reasoning, one of 17 directions in LLM reasoning.
- Builds on 12 of its 25 references that are in the map.
- First posted on arXiv 12 Oct 2026.

## Placed in

- LLM reasoning / [Mathematical reasoning](https://mlsanity.com/lr/mathematical-reasoning/)

## Builds on (most cited first, 12 of 12)

- [Training Verifiers to Solve Math Word Problems](https://mlsanity.com/paper/2110.14168/) (2021)
- [Let's Verify Step by Step](https://mlsanity.com/paper/2305.20050/) (2023)
- [Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Tasks](https://mlsanity.com/paper/2211.12588/) (2022)
- [Large Language Monkeys: Scaling Inference Compute with Repeated Sampling](https://mlsanity.com/paper/2407.21787/) (2024)
- [Are NLP Models really able to Solve Simple Math Word Problems?](https://mlsanity.com/paper/2103.07191/) (2021)
- [GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models](https://mlsanity.com/paper/2410.05229/) (2024)
- [Solving General Arithmetic Word Problems](https://mlsanity.com/paper/1608.01413/) (2016)
- [A Diverse Corpus for Evaluating and Developing English Math Word Problem Solvers](https://mlsanity.com/paper/2106.15772/) (2021)
- [Let's Sample Step by Step: Adaptive-Consistency for Efficient Reasoning and Coding with LLMs](https://mlsanity.com/paper/2305.11860/) (2023)
- [Self-Consistency Boosts Calibration for Math Reasoning](https://mlsanity.com/paper/2403.09849/) (2024)
- [Not All Votes Count! Programs as Verifiers Improve Self-Consistency of Language Models for Math Reasoning](https://mlsanity.com/paper/2410.12608/) (2024)
- [Self-Consistency from Only Two Samples: CoT-PoT Ensembling for Efficient LLM Reasoning](https://mlsanity.com/paper/2604.17433/) (2026)

## Abstract (arXiv)

Natural-language self-consistency and executable programs provide complementary test-time evidence for mathematical reasoning, yet either channel may support the same semantic error. Thus we propose ACED, a reference-anchored framework that treats the self-consistency answer as the default and executable outputs as supporting evidence rather than interchangeable votes. ACED converts source-specific answer counts into smoothed supports, combines them through a weighted logarithmic pool, and overrides the reference only when a calibrated relative-evidence margin is exceeded. The same rule supports both candidate selection and admission of executable-only answers. Across five math word-problem benchmarks, ACED matches or outperforms the corresponding baselines. On GSM8K, ACED-CANDIDATE recovers 89.7% of the attainable candidate-set gain with only three damaging overrides, while ACED-ALL reaches 86.9% accuracy versus 82.6% for direct Program-of-Thought aggregation. These results show that preserving evidence provenance enables more reliable integration of natural-language and executable reasoning.