mlsanityData to 7 Oct 2026

When the Canonical Completion Is Wrong: Formalizing and Measuring the Jump in Large Language Models

arXiv 2608.26187 ↗First posted 22 Aug 2026cs.CL cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Whether large language models (LLMs) can perform the abductive leap from evidence to a new system of axioms, commonly referred to as a jump, has recently attracted considerable debate. A prominent position holds that LLMs are structurally incapable of such jumps, while recent studies challenge both its mechanism and empirical evidence. One of the main reasons why the debate remains open is the difficulty of defining the jump precisely enough to test it. In this paper, we attempt to develop a formal account of the jump in four steps and measure the second. These steps ask what the default completion of partial data is, when the constraints exclude it, whether the new structure agrees with later observations, and how successive jumps compound. We define a jump instance as a finite extension problem whose constraints exclude the canonical completions given by the Kan extensions and leave one correct completion up to renaming. In this setting, a model with a canonical default performs the second step by producing the correct completion under the constraints. We evaluate fourteen models across three certified families. The canonical completion returns once in 13,300 constrained answers across all runs. Several calibrated models also give the correct completion reliably, including three API models that solve 159 of 162 primary chain trials, suggesting that they can jump at this step. We further formalize the third and fourth steps, whose empirical evaluation remains future work. We hope our work paves the path for formalizing and measuring the full jump in the future. The code of the paper is available at https://github.com/EEthanShi/kan-jump-test.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 54 references that are in the map. First posted on arXiv 22 Aug 2026.

Builds on

18 of 54 references.

References · 18

  1. 2025AlphaEvolve: A coding agent for scientific and algorithmic discoverycited by 763
  2. 2023Faith and Fate: Limits of Transformers on Compositionalitycited by 496
  3. 2023The ConceptARC Benchmark: Evaluating Understanding and Generalization in the ARC Domaincited by 97
  4. 2017Backprop as Functor: A compositional perspective on supervised learningcited by 44
  5. 2022On the Power of Foundation Modelscited by 37
  6. 2024Position: Categorical Deep Learning is an Algebraic Theory of All Architecturescited by 32
  7. 2021An enriched category theory of language: from syntax to semanticscited by 21
  8. 2025GEAR: A General Evaluation Framework for Abductive Reasoningcited by 6
  9. 2026Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world modelscited by 6
  10. 2026Emergent Analogical Reasoning in Transformerscited by 5
  11. 2026Wiring the 'Why': A Unified Taxonomy and Survey of Abductive Reasoning in LLMscited by 5
  12. 2025Do Language Models Follow Occam's Razor? An Evaluation of Parsimony in Inductive and Abductive Reasoningcited by 4
6 more
  1. 2025Abductive Logical Rule Induction by Bridging Inductive Logic Programming and Multimodal Large Language Modelscited by 3
  2. 2026DeFAb: A Verifiable Benchmark for Defeasible Abduction in Foundation Modelscited by 3
  3. 2026Abduction Without a Body? Representational Grounding and the Abduction Loop for Scientific Hypothesis Generationcited by 2
  4. 2025Generics and Default Reasoning in Large Language Modelscited by 1
  5. 2026Learning in Infinitesimal Non-Compositional Sketchescited by 1
  6. 2026Assessing LLMs' mathematical abilities requires understanding the various mechanisms of mathematical creativitycited by 1

Built on by

Not cited yet.