While reasoning in LLMs plays a natural role in math, code generation, and multi-hop factual questions, its effect on simple, single-hop factual questions remains unclear. Such questions do not require step-by-step logical decomposition, making the utility of reasoning highly counterintuitive. Nevertheless, we find that enabling reasoning substantially expands the capability boundary of the model's parametric knowledge recall, unlocking correct answers that are otherwise effectively unreachable. Why does reasoning aid parametric knowledge recall when there are no complex reasoning steps to be done? To answer this, we design a series of hypothesis-driven controlled experiments, and identify two key driving mechanisms: (1) a computational buffer effect, where the model uses the generated reasoning tokens to perform latent computation independent of their semantic content; and (2) factual priming, where generating topically related facts acts as a semantic bridge that facilitates correct answer retrieval. Importantly, this latter generative self-retrieval mechanism carries inherent risks: we demonstrate that hallucinating intermediate facts during reasoning increases the likelihood of hallucinations in the final answer. Finally, we show that our insights can be harnessed to directly improve model accuracy by prioritizing reasoning trajectories that contain hallucination-free factual statements.
Figures & tables
Figure 1: Pass@ k curves across two closed-book QA benchmarks and three LLMs, comparing the same models with reasoning OFF vs ON .
Figure 2: Ω in all models and datasets (§ 2 ). Models organized from the most (left) to the least effective (right) in terms of pass@ 1 .
Figure 3: Reasoning Effectiveness on different question types in SimpleQA-Verified , with 95% confidence intervals.
Figure 4: Computation buffer effect on Gemini-2.5-Flash (§ 5.1 ). ON Single Dummy overrides the thinking trace with a short dummy sequence. ON Dummy does the same, but repeats the short dummy sequence to match the length of the original trace.
Figure 5: Reasoning effectiveness (Equation 1 ) as a function of the input length in tokens when conditioning on dummy reasoning trace (see § 5.1 ). ON Dummy X overrides the reasoning trace with a short dummy sequence which is repeated such that the input length will be X.
Figure 6: Factual priming effect on Gemini-2.5-Flash (§ 5.2 ), conditioning on facts recalled during reasoning, with reasoning either OFF ( OFF Facts ) or ON ( ON Facts ).
Figure 7: Within-question comparison of correct final-answer rates in clean (x-axis) vs. hallucinated (y-axis) reasoning traces. Each question is one point; red examples lie above the no-effect diagonal, green below.
Strategy
SimpleQA-Verified
EntityQuestions
Regular
27.9
56.9
Only Facts
30.2 (+8.2%)
58.4 (+2.6%)
Only Correct Facts
31.3 (+12.2%)
59.8 (+5.1%)
Table 1: Expected accuracy under test-time selection criteria based on factual recall and factual correctness.
Figure 8: Case study for the effectiveness of the computational buffer effect.
Figure 9: Case study for the effectiveness of factual priming.
Appendix figures & tables3 assets
Supplementary material from the paper’s appendix.
Appendix
Relation
Question Template
P176
Which company is [X] produced by?
P264
What music label is [X] represented by?
P50
Who is the author of [X]?
P26
Who is [X] married to?
Appendix
Table 2: Overview of the relations that we use from the EntityQuestions dataset and their corresponding question templates.
Figure 14: Factual priming effect on Gemini-2.5-Flash (§ 5.2 ), conditioning on facts recalled during reasoning, with reasoning OFF . OFF Facts is our main baseline used throughout the paper, while OFF Facts Conservative is provided as additional reference with conservative filtering, where each mention of the answer is removed (see § A.4.2 .
Figure 17: The effect of increasing compute. dummy_X overrides the thinking trace with a short dummy sequence which is repeated such that the total input length will be X.
Reinforcement learning (RL) has achieved remarkable success in LLM reasoning, but whether it can also improve direct recall of parametric knowledge remains an open question. We study this question in a controlled zero-shot, one-hop, closed-book QA setting with no chain-of-thought, training only on binary correctness rewards and applying fact-level train-test deduplication to ensure gains reflect improved recall rather than reasoning or memorization. Across three model families and multiple factual QA benchmarks, RL yields ~27% average relative gains, surpassing both training- and inference-time baselines alike. Mechanistically, RL primarily redistributes probability mass over existing knowledge rather than acquiring new facts, moving correct answers from the low-probability tail into reliable greedy generations. Our data-attribution study reveals that the hardest examples are the most informative: those whose answers never appear in 128 pre-RL samples (only ~18% of training data) drive ~83% of the gain, since rare correct rollouts still emerge during training and get reinforced. Together, these findings broaden the role of RL beyond reasoning, repositioning it as a tool for unlocking rather than acquiring latent parametric knowledge.
Wanli Yang, Hongyu Zang, Junwei Zhang +5
University of Chinese Academy of Sciences · State Key Laboratory of AI Safety, Institute of Computing Technology, CAS
Large Language Models (LLMs) perform well on reasoning benchmarks, but it remains unclear whether this reflects genuine contextual reasoning or reliance on facts memorized in their parameters. We investigate this by distinguishing two possibilities: a broad memorization bias, where familiar content improves reasoning performance, and the Strong Parametric Shortcut Hypothesis, where models skip reasoning entirely and recall stored answers. To test these effects, we introduce MemoReason, a human-curated benchmark that pairs factual reasoning tasks with structurally identical \fictitiousterm{} versions where real entities like people, companies, or dates are systematically replaced by \fictitiousterm{} ones of the same type. This \scorerevision{preserves task structure and specified reasoning operations} while varying the familiarity of the context, allowing controlled measurement of how the parametric memory affects reasoning. \revision{Our evaluation of recent LLMs reveals consistent and statistically significant performance drops of up to 15.7% in the fictitious setting, demonstrating a clear memorization bias.} However, a targeted analysis of \revision{questions failed in the fictitious setting} shows that models rarely respond with the corresponding factual answer, indicating that direct parametric shortcuts are not the dominant failure mode. These findings suggest that parametric memory influences reasoning through mechanisms more complex than simple factual recall. MemoReason provides a controlled framework for studying these mechanisms and for extending paired factual-fictitious{} evaluation to broader reasoning settings.
Zineddine Tighidet, Andrea Mogini, Jiali Mei +2
BNP Paribas Paris, France · Sorbonne Université Paris, France · Criteo AI Lab
Reinforcement learning (RL) is often credited with improving language model reasoning at the expense of knowledge. We challenge this narrative by showing that reasoning models consistently outperform their instruction-tuned versions on pure knowledge recall tasks. These gains do not reflect newly acquired information, but rather an improved procedural skill in navigating and searching existing knowledge hierarchies within the model parameters. Structured prompting, which explicitly guides models through hierarchical traversal -- recovers most of the instruct-reasoning gap across five model families. A controlled RL experiment on unseen, non-extractable facts improves recall of held-out frequent but previously inaccessible facts, ruling out simple data exposure. On depth-stratified retrieval tasks, reasoning models exhibit superior traversal as retrieval depth grows. Layerwise activation analysis further shows that while factual representations maintain high cosine similarity between instruct and reasoning models, query representations diverge noticeably, indicating that reasoning primarily reshapes how models traverse knowledge rather than the knowledge representation itself. Finally, we find that distilled models often fail to match reasoning models on knowledge recall because they imitate self-correction without acquiring the exploratory behavior needed for hierarchical navigation. Together, these findings suggest that improving factual recall in LLMs depends not only on expanding what models know but also on teaching them to navigate it -- motivating future post-training methods that optimize traversal.
Renfei Zhang, Manasa Kaniselvan, Rylan Schaeffer abd Niloofar Mireshghallah
Carnegie Mellon University · MIT · Stanford University