DeepRewind: Predicting and Repairing Premature Commitments in Deep Research Agents

# DeepRewind: Predicting and Repairing Premature Commitments in Deep Research Agents
Source: [https://arxiv.org/html/2609.36344](https://arxiv.org/html/2609.36344)
Amirhossein Abaskohi††thanks:Corresponding author:aabaskoh@cs\.ubc\.ca\.Amirhossein DabiriaghdamAffiliation:University of British Columbia

###### Abstract

Deep\-research agents conduct long\-horizon investigations through iterative search, evidence evaluation, belief revision, and synthesis\. However, they may commit to claims before sufficient evidence is available, causing later reasoning to reinforce an incorrect interpretation\. We introduceDeepRewind, an additive control layer for reversible deep research that represents the agent’s evolving epistemic state as a typed graph of sources, evidence, claims, hypotheses, assumptions, commitments, plans, and drafts\. Before accepting an intermediate conclusion, a prompt\-based world model predicts its impact and estimates reversibility based on hypothesis narrowing, information loss, recovery cost, and contradiction\-trigger coverage\. A binary controller blocks risky commitments, while a consistency monitor performs dependency\-aware rollback when later evidence invalidates them\. Across DRBench and LiveDRBench,DeepRewindimproves insight recall by3\.6 percentage pointsand reduces premature commitments by59\.1%relative to Open Deep Research111Code is available on[GitHub](https://github.com/AmirAbaskohi/DeepRewind)\.\.

## 1Introduction

Deep research agents extend large language models \(LLMs\) from single\-turn question answering to long\-horizon information seeking, where an agent repeatedly plans searches, navigates the web, evaluates sources, reconciles conflicting evidence, and produces a citation\-supported report\([Huang et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib1);[Java et al\., 2026](https://arxiv.org/html/2609.36344#bib.bib18)\)\. Recent systems such as DeepResearcher and WebThinker demonstrate that integrating reasoning with real\-world web interaction can substantially improve open\-ended research capabilities\([Zheng et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib2);[Li et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib3)\)\. Correspondingly, benchmarks have begun to evaluate these agents on realistic, multi\-source research tasks that require both comprehensive evidence gathering and coherent synthesis\([Du et al\., 2026](https://arxiv.org/html/2609.36344#bib.bib4);[Abaskohi et al\., 2026](https://arxiv.org/html/2609.36344#bib.bib5)\)\. However, existing work primarily evaluates the quality of the final report, while paying less attention to how intermediate research decisions shape the trajectory\.

A central failure mode is*premature commitment*: the agent accepts a claim, favors a hypothesis, rejects an alternative, or drafts a conclusion before gathering sufficient evidence\. Such commitments shape later queries, evidence selection, reasoning, and writing\. Prior work shows that LLM agents may converge too early or become confident before completing the reasoning needed to justify their answers\([Mehta, 2026](https://arxiv.org/html/2609.36344#bib.bib16);[Gai et al\., 2026](https://arxiv.org/html/2609.36344#bib.bib17)\)\. Reflection, critique, tree search, and memory can revisit failures, explore alternatives, or preserve information\([Shinn et al\., 2023](https://arxiv.org/html/2609.36344#bib.bib8);[Gou et al\., 2024](https://arxiv.org/html/2609.36344#bib.bib9);[Zhou et al\., 2024](https://arxiv.org/html/2609.36344#bib.bib10);[Yao et al\., 2023](https://arxiv.org/html/2609.36344#bib.bib15);[Xu et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib11);[Packer et al\., 2024](https://arxiv.org/html/2609.36344#bib.bib12)\)\. However, they do not predict how a commitment changes the agent’s epistemic state or identify the minimal downstream decisions to repair when later evidence invalidates it\.

Figure 1:Overview ofDeepRewind\.DeepRewindmodels the agent’s epistemic state as a typed graph, predicts commitment reversibility, and controls whether to commit\. If new evidence invalidates a commitment, dependency\-aware rollback removes only the affected subgraph while preserving independent findings\.We introduceDeepRewind, an additive control layer for reversible deep research built on Open Deep Research\([LangChain AI, 2025](https://arxiv.org/html/2609.36344#bib.bib21)\)\. It represents the agent’s epistemic state as a typed graph of sources, evidence, claims, hypotheses, assumptions, commitments, plans, and drafts\. Before accepting a commitment, a research\-state world model predicts its graph effects and estimates reversibility from hypothesis narrowing, information loss, recovery cost, and contradiction likelihood\. Inspired by graph world models and LLM\-based web agents\([Feng et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib19);[Gu et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib20);[Chae et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib6)\),DeepRewindmodels the agent’s internal research state rather than the external environment\. A binary controller blocks risky commitments, while a monitor performs dependency\-aware rollback if evidence invalidates them\.

We evaluateDeepRewindthrough controlled initial\-condition and hypothesis\-switching experiments, exposing agents to early supportive, contradictory, or distracting evidence before introducing evidence for a competing hypothesis\. These experiments evaluate the downstream effectiveness of the overall control mechanism, including whether gating prevents lock\-in and whether reduced rollback repairs commitments invalidated by later evidence\. Across DRBench[Abaskohi et al\. \(2026\)](https://arxiv.org/html/2609.36344#bib.bib5)and LiveDRBench[Java et al\. \(2026\)](https://arxiv.org/html/2609.36344#bib.bib18),DeepRewindimproves insight recall by3\.6 percentage pointsand reduces premature commitments by59\.1%relative to Open Deep Research\.

## 2Related Work

Recent work shows that LLMs and agents may commit to an answer before completing sufficient reasoning, causing later steps to reinforce the initial decision\([Mehta, 2026](https://arxiv.org/html/2609.36344#bib.bib16);[Gai et al\., 2026](https://arxiv.org/html/2609.36344#bib.bib17)\)\. Reflection and critique methods revise outputs after errors are observed\([Shinn et al\., 2023](https://arxiv.org/html/2609.36344#bib.bib8);[Gou et al\., 2024](https://arxiv.org/html/2609.36344#bib.bib9)\), while tree\-based methods explore alternative reasoning paths before selecting a solution\([Yao et al\., 2023](https://arxiv.org/html/2609.36344#bib.bib15);[Zhou et al\., 2024](https://arxiv.org/html/2609.36344#bib.bib10)\)\. However, they do not explicitly track which claims, assumptions, plans, and draft fragments depend on a commitment or determine what must be repaired when it fails\. World models predict action consequences in structured or Web environments\([Feng et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib19);[Gu et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib20)\), and reversibility\-aware reinforcement learning estimates whether environmental actions can be undone\([Grinsztajn et al\., 2021](https://arxiv.org/html/2609.36344#bib.bib7)\), but both focus on the external environment rather than the agent’s epistemic state\. Classical truth\-maintenance and dependency\-directed backtracking systems record belief justifications and retract inconsistent assumptions\([Doyle, 1979](https://arxiv.org/html/2609.36344#bib.bib13);[Stallman and Sussman, 1977](https://arxiv.org/html/2609.36344#bib.bib14)\), but do not predict the risk of LLM\-generated commitments before they are made\.DeepRewindmodels the research state as a typed graph, predicts how commitments narrow hypotheses, suppress conflicting information, and increase recovery costs, and performs dependency\-aware reduced rollback when evidence invalidates them\.

## 3DeepRewind

Figure[1](https://arxiv.org/html/2609.36344#S1.F1)provides an overview ofDeepRewind, an additive control layer built on Open Deep Research\([LangChain AI, 2025](https://arxiv.org/html/2609.36344#bib.bib21)\)\. Without altering the base agent’s search, tool use, or report generation,DeepRewindintervenes before intermediate conclusions are accepted, predicts their effect on the research state, estimates reversibility, and permits or blocks the commitment\. Inspired by graph world models\([Feng et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib19)\)and WebDreamer\([Gu et al\., 2025](https://arxiv.org/html/2609.36344#bib.bib20)\), it models transitions in the agent’s internal epistemic state—including claims, hypotheses, assumptions, plans, commitments, and drafts—rather than changes to the external environment\.

#### Research\-state representation\.

At research steptt, the agent’s epistemic state is represented as a typed, weighted, directed graphGt=\(Vt,Et\)G\_\{t\}=\(V\_\{t\},E\_\{t\}\)\. Its nodes includeSource,Evidence,Claim,Hypothesis,Assumption,Commitment,DraftFragment, andPlanStep; edges represent relations such assupports,contradicts,depends\_on,used\_in, andlocks\_in\. We distinguish externally observedSourceandEvidencenodes from endogenous nodes produced by the agent\. The world model may reference observed nodes but may only create or modify endogenous ones\. State changes are recorded as graph deltas,Gt\+1=Gt⊕Δ​GtG\_\{t\+1\}=G\_\{t\}\\oplus\\Delta G\_\{t\}, in an append\-only ledger\. Invalidated artifacts are marked contested, stale, or retracted rather than deleted, preserving the full research history\. Following[Fatemi et al\. \(2024\)](https://arxiv.org/html/2609.36344#bib.bib22), we serialize graph nodes, attributes, and typed relations into structured text\.

#### Research\-state world model\.

Before a candidate commitmentata\_\{t\}is executed, the serialized research\-state graph and candidate action are provided to the world model, which predicts:

Mϕ​\(Gt,at\)=\(Δ​G^t,𝒎^t\),M\_\{\\phi\}\(G\_\{t\},a\_\{t\}\)=\\left\(\\widehat\{\\Delta G\}\_\{t\},\\widehat\{\\bm\{m\}\}\_\{t\}\\right\),\(1\)whereΔ​G^t\\widehat\{\\Delta G\}\_\{t\}contains predicted node and edge changes and𝒎^t=\(κ^t,λ^t,γ^t,θ^t,TC^t\)\\widehat\{\\bm\{m\}\}\_\{t\}=\(\\hat\{\\kappa\}\_\{t\},\\hat\{\\lambda\}\_\{t\},\\hat\{\\gamma\}\_\{t\},\\hat\{\\theta\}\_\{t\},\\widehat\{\\mathrm\{TC\}\}\_\{t\}\)contains reversibility metadata\. Here,κ\\kappameasures how strongly the commitment narrows competing hypotheses,λ\\lambdaestimates information loss,γ\\gammaestimates recovery cost,θ\\thetaspecifies the contradiction conditions that should invalidate the commitment, andTC\\mathrm\{TC\}estimates whether future research steps are likely to expose such contradictions\. The prompt\-based implementation emits these predictions as structured JSON\. The target proposition, initial alternatives, and commitment transition are elicited using the prompts described in Appendix[G](https://arxiv.org/html/2609.36344#A7)\.

#### Reversibility\-aware commitment\.

From the current graph snapshot,DeepRewindcomputes claim beliefs using reliability\-weighted supporting and contradicting evidence and converts claim support into a plausibility distribution over active hypotheses\. Commitment effect is computed from reduced hypothesis entropy, information loss from the contradiction mass suppressed by the commitment, and recovery cost from the downstream endogenous nodes that would need to be retracted or regenerated\. These quantities are combined as:

IRR⁡\(at\)\\displaystyle\\mathrm\{IRR\}\(a\_\{t\}\)=clip\[0,1\]⁡\(ακ​κt\+αλ​λt\+αγ​γt\),\\displaystyle=\\operatorname\{clip\}\_\{\[0,1\]\}\\left\(\\alpha\_\{\\kappa\}\\kappa\_\{t\}\+\\alpha\_\{\\lambda\}\\lambda\_\{t\}\+\\alpha\_\{\\gamma\}\\gamma\_\{t\}\\right\),\(2\)U⁡\(at\)\\displaystyle U\(a\_\{t\}\)=V⁡\(at\)−η​IRR​\(at\)​\(1−TC⁡\(at\)\),\\displaystyle=V\(a\_\{t\}\)\-\\eta\\,\\mathrm\{IRR\}\(a\_\{t\}\)\\left\(1\-\\mathrm\{TC\}\(a\_\{t\}\)\\right\),whereV⁡\(at\)V\(a\_\{t\}\)is the estimated research value of the commitment\. The controller outputs eithercommitornot\-commit\. Contested claims are never committed\. In threshold mode, the action is committed only whenIRR⁡\(at\)​\(1−TC⁡\(at\)\)\\mathrm\{IRR\}\(a\_\{t\}\)\(1\-\\mathrm\{TC\}\(a\_\{t\}\)\)is below a configurable threshold; in utility mode, it is committed only whenU⁡\(at\)U\(a\_\{t\}\)exceeds a configurable threshold\. Anot\-commitdecision leaves the base agent free to gather more evidence, preserve competing hypotheses, or reformulate the claim\.

#### Monitoring and reduced rollback\.

Each accepted commitment stores a trigger defined by minimum evidence reliability and contradiction strength\. As new evidence enters the graph, a read\-only monitor checks whether the trigger is met and the claim belief falls below a threshold\. If so,DeepRewinddeterministically retracts the commitment and its unique justifications, removes commitment\-specific dependencies, and marks downstream hypotheses, plans, and drafts as stale or retracted\. Shared or independently supported findings are preserved, limiting repair to the affected subgraph without additional LLM calls\. This online monitor is part of the control mechanism and is distinct from the premature\-commitment evaluation metric: rollback may occur as soon as the invalidation condition is satisfied, whereas premature commitment is measured retrospectively from the complete run trace using the same criterion for all methods\.

#### Controlled interventions and logging\.

For controlled analysis,DeepRewindincludes default\-off hooks for initial\-condition seeding and alternative switching\. Seeding injects provenance\-tagged supportive, contradictory, neutral, or distracting evidence, while switching first supports one alternative and later introduces evidence favoring a competitor\. When disabled, these hooks do not affect the base agent\. All predictions, decisions, triggers, and rollbacks are stored in append\-only JSONL logs with configuration snapshots\. Appendix[A](https://arxiv.org/html/2609.36344#A1)details the formulations, policies, interventions, rollback procedure, orchestration, and logging schema\.

## 4Experiments

#### Experimental setup\.

We implementDeepRewindon Open Deep Research\([LangChain AI, 2025](https://arxiv.org/html/2609.36344#bib.bib21)\), keeping its search and report\-generation workflow fixed\. GPT\-4o\([OpenAI, 2024](https://arxiv.org/html/2609.36344#bib.bib25)\)serves as the research\-state world model at temperature00, while base agents use temperature0\.70\.7for up to 10 iterations\. Model calls use OpenRouter222[https://openrouter\.ai/](https://openrouter.ai/), and Tavily333[https://www\.tavily\.com/](https://www.tavily.com/)retrieves up to five advanced\-search results per query\. We setT=1T=1,ακ=αλ=αγ=13\\alpha\_\{\\kappa\}=\\alpha\_\{\\lambda\}=\\alpha\_\{\\gamma\}=\\tfrac\{1\}\{3\},η=1\\eta=1,τcommit=0\.35\\tau\_\{\\mathrm\{commit\}\}=0\.35,β⋆=0\.5\\beta^\{\\star\}=0\.5,ρ⋆=0\.75\\rho^\{\\star\}=0\.75,w⋆=0\.6w^\{\\star\}=0\.6, fallbackTC=0\.5\\mathrm\{TC\}=0\.5, and recovery budgetB=20B=20\. We run each configuration with three random seeds and report the mean and standard deviation across runs; full configurations are provided in Appendix[B](https://arxiv.org/html/2609.36344#A2)\. Across runs,DeepRewindinvokes the world model4\.8times per task on average, adding6\.5%input tokens,4\.2%output tokens, and14%wall\-clock latency relative toODR\.

#### Benchmarks and models\.

We evaluate on DRBench\([Abaskohi et al\., 2026](https://arxiv.org/html/2609.36344#bib.bib5)\)and LiveDRBench\([Java et al\., 2026](https://arxiv.org/html/2609.36344#bib.bib18)\), each with 100 tasks, reporting insight\-level precision and recall against reference insights\. We test GPT\-4o\([OpenAI, 2024](https://arxiv.org/html/2609.36344#bib.bib25)\), GPT\-5\.4\([OpenAI, 2026](https://arxiv.org/html/2609.36344#bib.bib23)\), Qwen3\.5\-27B\([Qwen Team, 2026](https://arxiv.org/html/2609.36344#bib.bib26)\), and DeepSeek\-V4 Pro\([DeepSeek\-AI, 2026](https://arxiv.org/html/2609.36344#bib.bib24)\)as the LLM backbone of the agent\. GPT\-4o serves as the fixed world model, and all experiments use three random seeds\. Appendix[E](https://arxiv.org/html/2609.36344#A5)evaluatesDeepRewind’s generalizability across different LLM world models\.

### 4\.1Overall Performance

Table[1](https://arxiv.org/html/2609.36344#S4.T1)shows thatDeepRewindconsistently improves both precision and recall across all models and benchmarks\. On average, it increases recall by3\.6 pointsand precision by3\.1 points, recovering more reference insights without adding unsupported content\. GPT\-5\.4 achieves the strongest overall results, withDeepRewindreaching40\.3%recall on DRBench and35\.6%on LiveDRBench\. A component ablation in Appendix[C](https://arxiv.org/html/2609.36344#A3)isolates the contributions of graph tracking, world\-model prediction, pre\-commitment gating, and reduced rollback\. Table[5](https://arxiv.org/html/2609.36344#A4.T5)in Appendix[D](https://arxiv.org/html/2609.36344#A4)reports variation across runs, and Appendix[F](https://arxiv.org/html/2609.36344#A6)provides a qualitative analysis\.

Table 1:Insight precision and recall \(%\) on DRBench and LiveDRBench, averaged across three runs\.ModelMethodDRBenchLiveDRBenchPrec\.Rec\.Prec\.Rec\.GPT\-4oODR55\.816\.251\.413\.8DeepRewind58\.719\.654\.617\.1GPT\-5\.4ODR68\.436\.563\.731\.8DeepRewind71\.240\.366\.835\.6Qwen3\.5\-27BODR60\.924\.656\.220\.8DeepRewind63\.828\.159\.524\.3DeepSeek\-V4 ProODR64\.729\.859\.825\.4DeepRewind67\.633\.563\.129\.0

### 4\.2Robustness to Initial Evidence

We evaluate GPT\-4o under neutral, supportive, contradictory, and distracting initial evidence\. Resistance measures how often the agent avoids adopting injected claims before independent Web support\. Table[2](https://arxiv.org/html/2609.36344#S4.T2)shows that all interventions degradeODR, especially contradictory evidence\.DeepRewindconsistently preserves higher precision and recall, improving them by about4\.7and4\.2 pointsacross non\-neutral conditions\. It also raises average resistance by29\.5 points, with the largest gain of37\.8 pointsunderEarly\-Counter, showing greater robustness to misleading early evidence\.

Table 2:Robustness of GPT\-4o to initial evidence conditions \(%\)\. Resistance measures the percentage of runs that avoid unsupported commitment to the injected position\.ConditionMethodDRBenchLiveDRBenchResist\.Prec\.Rec\.Prec\.Rec\.↑\\uparrowNeutralODR55\.816\.251\.413\.8–DeepRewind58\.719\.654\.617\.1–Early\-SupportODR53\.214\.648\.812\.143\.8DeepRewind58\.018\.853\.916\.472\.4Early\-CounterODR52\.113\.547\.611\.038\.2DeepRewind57\.418\.253\.115\.876\.0Early\-DistractorODR54\.715\.350\.212\.961\.2DeepRewind58\.219\.054\.116\.683\.4

### 4\.3Effect of Initial Belief Selection

We examine how initial beliefs shape GPT\-4o’s research trajectory and commitment behavior\.One\-Beliefuses only the target proposition, while the alternative settings rank five competing beliefs by plausibility and select either the highest\- or lowest\-ranked one\. This tests robustness to favorable and misleading starting hypotheses\. Table[3](https://arxiv.org/html/2609.36344#S4.T3)shows that the strongest alternative improves both methods, whereas the weakest sharply degradesODR, raising the fraction of accepted commitments that are later invalidated to46\.4%\.DeepRewindremains stronger across all settings, with its largest gains underWorst\-Alternative: about6\.5 pointsin precision,5\.0 pointsin recall, and a26\.2\-pointreduction in premature commitments\. The higher rollback rate reflects more frequent repair of unfavorable initial commitments\.

Table 3:Effect of initial belief selection with GPT\-4o \(%\)\. PC is the percentage of accepted commitments that are later invalidated by subsequently collected evidence, and RB denotes rollback rate; rollback is not available forODR\.Initial beliefMethodDRBenchLiveDRBenchPCRBPrec\.Rec\.Prec\.Rec\.↓\\downarrow↓\\downarrowOne\-BeliefODR55\.816\.251\.413\.831\.7–DeepRewind58\.719\.654\.617\.113\.19\.1Best\-AlternativeODR57\.117\.552\.615\.024\.0–DeepRewind59\.120\.555\.318\.08\.56\.3Worst\-AlternativeODR50\.312\.946\.110\.446\.4–DeepRewind56\.817\.952\.515\.420\.215\.1

## 5Conclusion

We presentedDeepRewind, an additive control layer for predicting, preventing, and repairing premature commitments in deep\-research agents\. It represents the evolving research state, blocks risky commitments before they influence later reasoning, and locally rolls back those invalidated by new evidence\. Across DRBench and LiveDRBench,DeepRewindimproves insight recall by3\.6 percentage pointsand reduces premature commitments by59\.1%relative to Open Deep Research\. Controlled experiments further show improved robustness to biased, distracting, and unfavorable initial states\. These findings highlight the value of explicitly modeling commitment reversibility in long\-horizon research\. Future work may replace the prompt\-based world model with learned graph or structured transition models\.

## Limitations

DeepRewinddepends on an LLM world model and an automatically constructed epistemic graph, so incorrect state extraction, missing dependencies, or poorly calibrated reversibility estimates may block useful commitments or fail to prevent harmful ones\. We do not directly evaluate the accuracy or calibration of the world model’s predicted graph transitions and reversibility quantities against ground truth, because DRBench and LiveDRBench do not provide annotations of the counterfactual research\-state transition following a candidate commitment or gold values for hypothesis narrowing, information loss, recovery cost, and trigger coverage\. Our experiments therefore evaluate the downstream utility of these predictions rather than their independent predictive accuracy\. We evaluate only a small subset of hyperparameter configurations and select the best\-performing setting, rather than conducting a comprehensive sensitivity analysis; we also do not evaluate how world\-model prediction quality changes over the course of longer research trajectories\. Constructing expert\-annotated research\-state transition data and studying these factors are important directions for future work\. The method also depends on fixed thresholds and hand\-designed relation types, and our experiments are limited to two deep\-research benchmarks, four base models, and controlled evidence interventions\.

## Ethical Considerations

DeepRewindinherits the biases, hallucinations, and source\-quality limitations of its underlying language models and Web retrieval system; an inaccurate world\-model prediction may also create false confidence that a commitment is safe or recoverable\. The method should therefore be used with source verification and human oversight in high\-stakes domains\. Our experiments use public benchmarks, models, and implementations under their respective licenses and involve no human subjects or newly collected personal data\. We used LLM assistance only to improve manuscript presentation, with all technical decisions, experiments, and conclusions verified by the authors\.

## References

- Abaskohiet al\.\(2026\)A\. Abaskohi, T\. Chen, M\. Muñoz\-Mármol, C\. Fox, A\. V\. Ramesh, É\. Marcotte, X\. H\. Lù, N\. Chapados, S\. Gella, C\. Pal, A\. Drouin, and I\. H\. LaradjiDRBench: a realistic benchmark for enterprise deep research\.InThe Fourteenth International Conference on Learning Representations,External Links:[Link](https://openreview.net/forum?id=IGYQ4c92e2)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p1.1),[§1](https://arxiv.org/html/2609.36344#S1.p4.1),[§4](https://arxiv.org/html/2609.36344#S4.SS0.SSS0.Px2.p1.1)\.
- Chaeet al\.\(2025\)H\. Chae, N\. Kim, K\. T\. Ong, M\. Gwak, G\. Song, J\. Kim, S\. Kim, D\. Lee, and J\. YeoWeb agents with world models: learning and leveraging environment dynamics in web navigation\.InThe Thirteenth International Conference on Learning Representations,External Links:[Link](https://openreview.net/forum?id=moWiYJuSGF)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p3.1)\.
- DeepSeek\-AI \(2026\)DeepSeek\-AIDeepSeek\-v4: towards highly efficient million\-token context intelligence\.External Links:2606\.19348,[Link](https://arxiv.org/abs/2606.19348)Cited by:[§4](https://arxiv.org/html/2609.36344#S4.SS0.SSS0.Px2.p1.1)\.
- Doyle \(1979\)J\. DoyleA truth maintenance system\.Artificial Intelligence12\(3\),pp\. 231–272\.External Links:ISSN 0004\-3702,[Document](https://dx.doi.org/https%3A//doi.org/10.1016/0004-3702%2879%2990008-0),[Link](https://www.sciencedirect.com/science/article/pii/0004370279900080)Cited by:[§2](https://arxiv.org/html/2609.36344#S2.p1.1)\.
- Duet al\.\(2026\)M\. Du, B\. Xu, C\. Zhu, L\. Zhang, X\. Wang, and Z\. MaoDeepResearch bench: a comprehensive benchmark for deep research agents\.InThe Fourteenth International Conference on Learning Representations,External Links:[Link](https://openreview.net/forum?id=hQ0K2Hhq7H)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p1.1)\.
- Fatemiet al\.\(2024\)B\. Fatemi, J\. Halcrow, and B\. PerozziTalk like a graph: encoding graphs for large language models\.InThe Twelfth International Conference on Learning Representations,External Links:[Link](https://openreview.net/forum?id=IuXR1CCrSi)Cited by:[Appendix A](https://arxiv.org/html/2609.36344#A1.SS0.SSS0.Px1.p2.1),[§3](https://arxiv.org/html/2609.36344#S3.SS0.SSS0.Px1.p1.1)\.
- Fenget al\.\(2025\)T\. Feng, Y\. Wu, G\. Lin, and J\. YouGraph world model\.InForty\-second International Conference on Machine Learning,External Links:[Link](https://openreview.net/forum?id=xjTrTlBbrc)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p3.1),[§2](https://arxiv.org/html/2609.36344#S2.p1.1),[§3](https://arxiv.org/html/2609.36344#S3.p1.1)\.
- Gaiet al\.\(2026\)J\. Gai, G\. Zeng, C\. Baek, C\. Wu, J\. Z\. Kolter, A\. Risteski, and A\. RaghunathanUnderstanding and mitigating premature confidence for better llm reasoning\.External Links:2605\.24396,[Link](https://arxiv.org/abs/2605.24396)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p2.1),[§2](https://arxiv.org/html/2609.36344#S2.p1.1)\.
- Gouet al\.\(2024\)Z\. Gou, Z\. Shao, Y\. Gong, yelong shen, Y\. Yang, N\. Duan, and W\. ChenCRITIC: large language models can self\-correct with tool\-interactive critiquing\.InThe Twelfth International Conference on Learning Representations,External Links:[Link](https://openreview.net/forum?id=Sx038qxjek)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p2.1),[§2](https://arxiv.org/html/2609.36344#S2.p1.1)\.
- Grinsztajnet al\.\(2021\)N\. Grinsztajn, J\. Ferret, O\. Pietquin, P\. Preux, and M\. GeistThere is no turning back: a self\-supervised approach for reversibility\-aware reinforcement learning\.InAdvances in Neural Information Processing Systems,A\. Beygelzimer, Y\. Dauphin, P\. Liang, and J\. W\. Vaughan \(Eds\.\),External Links:[Link](https://openreview.net/forum?id=3X65eaS4PtP)Cited by:[§2](https://arxiv.org/html/2609.36344#S2.p1.1)\.
- Guet al\.\(2025\)Y\. Gu, K\. Zhang, Y\. Ning, B\. Zheng, B\. Gou, T\. Xue, C\. Chang, S\. Srivastava, Y\. Xie, P\. Qi, H\. Sun, and Y\. SuIs your LLM secretly a world model of the internet? model\-based planning for web agents\.Transactions on Machine Learning Research\.Note:External Links:ISSN 2835\-8856,[Link](https://openreview.net/forum?id=c6l7yA0HSq)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p3.1),[§2](https://arxiv.org/html/2609.36344#S2.p1.1),[§3](https://arxiv.org/html/2609.36344#S3.p1.1)\.
- Huanget al\.\(2025\)Y\. Huang, Y\. Chen, H\. Zhang, K\. Li, H\. Zhou, M\. Fang, L\. Yang, X\. Li, L\. Shang, S\. Xu, J\. Hao, K\. Shao, and J\. WangDeep research agents: a systematic examination and roadmap\.External Links:2506\.18096,[Link](https://arxiv.org/abs/2506.18096)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p1.1)\.
- Javaet al\.\(2026\)A\. Java, A\. Khandelwal, S\. P\. Midigeshi, A\. Halfaker, A\. Deshpande, N\. Goyal, A\. Gupta, N\. Natarajan, and A\. SharmaCharacterizing deep research: a benchmark and formal definition\.InThe Fourteenth International Conference on Learning Representations,External Links:[Link](https://openreview.net/forum?id=5EmpOCq1Ql)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p1.1),[§1](https://arxiv.org/html/2609.36344#S1.p4.1),[§4](https://arxiv.org/html/2609.36344#S4.SS0.SSS0.Px2.p1.1)\.
- LangChain AI \(2025\)LangChain AIOpen deep research\.Note:[https://github\.com/langchain\-ai/open\_deep\_research](https://github.com/langchain-ai/open_deep_research)GitHub repository, accessed August 5, 2026External Links:[Link](https://github.com/langchain-ai/open_deep_research)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p3.1),[§3](https://arxiv.org/html/2609.36344#S3.p1.1),[§4](https://arxiv.org/html/2609.36344#S4.SS0.SSS0.Px1.p1.1)\.
- Liet al\.\(2025\)X\. Li, J\. Jin, G\. Dong, H\. Qian, Y\. Wu, J\. Wen, Y\. Zhu, and Z\. DouWebThinker: empowering large reasoning models with deep research capability\.InThe Thirty\-ninth Annual Conference on Neural Information Processing Systems,External Links:[Link](https://openreview.net/forum?id=7LKKHBAMzH)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p1.1)\.
- Mehta \(2026\)A\. MehtaWhen agents commit too soon: diagnosing premature commitment in llm agents\.External Links:2606\.22936,[Link](https://arxiv.org/abs/2606.22936)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p2.1),[§2](https://arxiv.org/html/2609.36344#S2.p1.1)\.
- OpenAI \(2024\)OpenAIGPT\-4 technical report\.External Links:2303\.08774,[Link](https://arxiv.org/abs/2303.08774)Cited by:[§4](https://arxiv.org/html/2609.36344#S4.SS0.SSS0.Px1.p1.1),[§4](https://arxiv.org/html/2609.36344#S4.SS0.SSS0.Px2.p1.1)\.
- OpenAI \(2026\)OpenAIIntroducing GPT\-5\.4\.External Links:[Link](https://openai.com/index/introducing-gpt-5-4/)Cited by:[§4](https://arxiv.org/html/2609.36344#S4.SS0.SSS0.Px2.p1.1)\.
- Packeret al\.\(2024\)C\. Packer, S\. Wooders, K\. Lin, V\. Fang, S\. G\. Patil, I\. Stoica, and J\. E\. GonzalezMemGPT: towards llms as operating systems\.External Links:2310\.08560,[Link](https://arxiv.org/abs/2310.08560)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p2.1)\.
- Qwen Team \(2026\)Qwen TeamQwen3\.5: towards native multimodal agents\.External Links:[Link](https://qwen.ai/blog?id=qwen3.5)Cited by:[§4](https://arxiv.org/html/2609.36344#S4.SS0.SSS0.Px2.p1.1)\.
- Shinnet al\.\(2023\)N\. Shinn, F\. Cassano, A\. Gopinath, K\. R\. Narasimhan, and S\. YaoReflexion: language agents with verbal reinforcement learning\.InThirty\-seventh Conference on Neural Information Processing Systems,External Links:[Link](https://openreview.net/forum?id=vAElhFcKW6)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p2.1),[§2](https://arxiv.org/html/2609.36344#S2.p1.1)\.
- Stallman and Sussman \(1977\)R\. M\. Stallman and G\. J\. SussmanForward reasoning and dependency\-directed backtracking in a system for computer\-aided circuit analysis\.Artificial Intelligence9\(2\),pp\. 135–196\.External Links:ISSN 0004\-3702,[Document](https://dx.doi.org/https%3A//doi.org/10.1016/0004-3702%2877%2990029-7),[Link](https://www.sciencedirect.com/science/article/pii/0004370277900297)Cited by:[§2](https://arxiv.org/html/2609.36344#S2.p1.1)\.
- Xuet al\.\(2025\)W\. Xu, Z\. Liang, K\. Mei, H\. Gao, J\. Tan, and Y\. ZhangA\-mem: agentic memory for LLM agents\.InThe Thirty\-ninth Annual Conference on Neural Information Processing Systems,External Links:[Link](https://openreview.net/forum?id=FiM0M8gcct)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p2.1)\.
- Yaoet al\.\(2023\)S\. Yao, D\. Yu, J\. Zhao, I\. Shafran, T\. L\. Griffiths, Y\. Cao, and K\. R\. NarasimhanTree of thoughts: deliberate problem solving with large language models\.InThirty\-seventh Conference on Neural Information Processing Systems,External Links:[Link](https://openreview.net/forum?id=5Xc1ecxO1h)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p2.1),[§2](https://arxiv.org/html/2609.36344#S2.p1.1)\.
- Zhenget al\.\(2025\)Y\. Zheng, D\. Fu, X\. Hu, X\. Cai, L\. Ye, P\. Lu, and P\. LiuDeepResearcher: scaling deep research via reinforcement learning in real\-world environments\.InProceedings of the 2025 Conference on Empirical Methods in Natural Language Processing,C\. Christodoulopoulos, T\. Chakraborty, C\. Rose, and V\. Peng \(Eds\.\),Suzhou, China,pp\. 414–431\.External Links:[Link](https://aclanthology.org/2025.emnlp-main.22/),[Document](https://dx.doi.org/10.18653/v1/2025.emnlp-main.22),ISBN 979\-8\-89176\-332\-6Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p1.1)\.
- Zhouet al\.\(2024\)A\. Zhou, K\. Yan, M\. Shlapentokh\-Rothman, H\. Wang, and Y\. WangLanguage agent tree search unifies reasoning, acting, and planning in language models\.InForty\-first International Conference on Machine Learning,External Links:[Link](https://openreview.net/forum?id=njwv9BsGHF)Cited by:[§1](https://arxiv.org/html/2609.36344#S1.p2.1),[§2](https://arxiv.org/html/2609.36344#S2.p1.1)\.

## Appendix AImplementation Details

This appendix expands the research\-state representation, graph serialization, structural scoring, commitment policy, monitoring procedure, rollback mechanism, controlled interventions, and artifact protocol summarized in Section[3](https://arxiv.org/html/2609.36344#S3)\. The prompts used to initialize and update the research state are provided in Appendix[G](https://arxiv.org/html/2609.36344#A7)\.

#### Research\-state graph\.

The research state at stepttis a typed, weighted, directed multigraphGt=\(Vt,Et\)G\_\{t\}=\(V\_\{t\},E\_\{t\}\)\. Each nodev∈Vtv\\in V\_\{t\}has a typeτ⁡\(v\)\\tau\(v\)drawn fromSource,Evidence,Claim,Hypothesis,Assumption,Commitment,DraftFragment, andPlanStep\. Each edgee=\(u,v\)∈Ete=\(u,v\)\\in E\_\{t\}has a typed relation, includingsupports,contradicts,derived\_from,compresses,depends\_on,used\_in, andlocks\_in, together with a weightwe∈\[0,1\]w\_\{e\}\\in\[0,1\]\. A research action produces a local deltaΔ​Gt=\(Δ​Vt,Δ​Et\)\\Delta G\_\{t\}=\(\\Delta V\_\{t\},\\Delta E\_\{t\}\):

Gt\+1=Gt⊕Δ​Gt\.G\_\{t\+1\}=G\_\{t\}\\oplus\\Delta G\_\{t\}\.\(3\)SourceandEvidencenodes are observational and may not be generated or rewritten by the world model\. All other node types are endogenous and may be created, updated, contested, marked stale, or retracted\. Updates are append\-only and preserve previous node versions and provenance\.

To communicateGtG\_\{t\}to the prompt\-based world model, we follow the graph\-to\-text prompting strategy of[Fatemi et al\. \(2024\)](https://arxiv.org/html/2609.36344#bib.bib22)\. Each node is serialized as a structured record containing its stable alias, type, status, and relevant attributes, while each edge is represented as a typed source–relation–target record with its weight\. Stable aliases allow the model to reference existing nodes without reproducing their full content and make predicted updates directly mappable to the graph ledger\. The candidate commitment is appended as a separate structured record:

xt=Serialize⁡\(Gt\)\|Serialize⁡\(at\),x\_\{t\}=\\operatorname\{Serialize\}\(G\_\{t\}\)\\,\\\|\\,\\operatorname\{Serialize\}\(a\_\{t\}\),\(4\)where∥\\\|denotes textual concatenation\.

#### Claim belief and hypothesis plausibility\.

For claimcc, letSupp⁡\(c\)\\mathrm\{Supp\}\(c\)andCon⁡\(c\)\\mathrm\{Con\}\(c\)denote its supporting and contradicting evidence edges\. We define their reliability\-weighted masses as

Msupp​\(c\)\\displaystyle M\_\{\\mathrm\{supp\}\}\(c\)=∑e∈Supp⁡\(c\)we​ρe,\\displaystyle=\\sum\_\{e\\in\\mathrm\{Supp\}\(c\)\}w\_\{e\}\\rho\_\{e\},\(5\)Mcon​\(c\)\\displaystyle M\_\{\\mathrm\{con\}\}\(c\)=∑e∈Con⁡\(c\)we​ρe,\\displaystyle=\\sum\_\{e\\in\\mathrm\{Con\}\(c\)\}w\_\{e\}\\rho\_\{e\},\(6\)whereρe∈\[0,1\]\\rho\_\{e\}\\in\[0,1\]is inherited from the source associated with evidence edgeee\. Claim belief is

βt​\(c\)=σ⁡\(β0\+Msupp​\(c\)−Mcon​\(c\)\)\.\\beta\_\{t\}\(c\)=\\sigma\\left\(\\beta\_\{0\}\+M\_\{\\mathrm\{supp\}\}\(c\)\-M\_\{\\mathrm\{con\}\}\(c\)\\right\)\.\(7\)A hypothesishhaggregates belief from its supporting claims:

gt​\(h\)\\displaystyle g\_\{t\}\(h\)=ℓt​\(h\)\+∑c→hwc,h​βt​\(c\),\\displaystyle=\\ell\_\{t\}\(h\)\+\\sum\_\{c\\rightarrow h\}w\_\{c,h\}\\beta\_\{t\}\(c\),\(8\)pt​\(h\)\\displaystyle p\_\{t\}\(h\)=exp⁡\(gt​\(h\)/T\)∑h′∈ℋtexp⁡\(gt​\(h′\)/T\),\\displaystyle=\\frac\{\\exp\(g\_\{t\}\(h\)/T\)\}\{\\sum\_\{h^\{\\prime\}\\in\\mathcal\{H\}\_\{t\}\}\\exp\(g\_\{t\}\(h^\{\\prime\}\)/T\)\},\(9\)whereℓt​\(h\)\\ell\_\{t\}\(h\)represents existing lock\-in,ℋt\\mathcal\{H\}\_\{t\}is the set of active hypotheses, andT\>0T\>0is a temperature parameter\.

#### World\-model interface\.

The implementation supplies the serialized inputxtx\_\{t\}to the prompt\-based world model\. For clarity, we abstract this operation as conditioning directly on the graph and candidate action:

Mϕ​\(Gt,at\)\\displaystyle M\_\{\\phi\}\(G\_\{t\},a\_\{t\}\)=\(Δ​G^t,𝒎^t\),\\displaystyle=\\left\(\\widehat\{\\Delta G\}\_\{t\},\\widehat\{\\bm\{m\}\}\_\{t\}\\right\),\(10\)𝒎^t\\displaystyle\\widehat\{\\bm\{m\}\}\_\{t\}=\(κ^t,λ^t,γ^t,θ^t,TC^t\)\.\\displaystyle=\\left\(\\hat\{\\kappa\}\_\{t\},\\hat\{\\lambda\}\_\{t\},\\hat\{\\gamma\}\_\{t\},\\hat\{\\theta\}\_\{t\},\\widehat\{\\mathrm\{TC\}\}\_\{t\}\\right\)\.The structured prediction contains node creations or updates, edge additions or removals, reversibility estimates, an optional rollback trigger, and optional trigger coverage\. Predicted aliases are resolved against the serialized graph before any update is applied\. ExistingSourceandEvidencealiases may appear as edge endpoints, but the model may not create, modify, or reproduce their content\. The complete input and output formats are given in Appendix[G](https://arxiv.org/html/2609.36344#A7)\.

#### Commitment effect\.

Letptp\_\{t\}be the current hypothesis distribution andp^t\+1\\hat\{p\}\_\{t\+1\}the distribution obtained after applying the predicted graph delta\. The commitment effect measures normalized entropy reduction:

H⁡\(p\)\\displaystyle H\(p\)=−∑h∈ℋtp\(h\)logp\(h\),\\displaystyle=\-\\sum\_\{h\\in\\mathcal\{H\}\_\{t\}\}p\(h\)\\log p\(h\),\(11\)κt\\displaystyle\\kappa\_\{t\}=clip\[0,1\]⁡\(H⁡\(pt\)−H⁡\(p^t\+1\)log⁡K\),\\displaystyle=\\operatorname\{clip\}\_\{\[0,1\]\}\\left\(\\frac\{H\(p\_\{t\}\)\-H\(\\hat\{p\}\_\{t\+1\}\)\}\{\\log K\}\\right\),\(12\)whereK=\|ℋt\|K=\|\\mathcal\{H\}\_\{t\}\|\. A large value indicates that the candidate commitment sharply concentrates belief on a small subset of alternatives\.

#### Information loss\.

For the claim targeted by the commitment, information loss is approximated by the fraction of reliability\-weighted evidence mass that contradicts the committed position:

λt=clip\[0,1\]⁡\(Mcon​\(c\)Msupp​\(c\)\+Mcon​\(c\)\)\.\\lambda\_\{t\}=\\operatorname\{clip\}\_\{\[0,1\]\}\\left\(\\frac\{M\_\{\\mathrm\{con\}\}\(c\)\}\{M\_\{\\mathrm\{supp\}\}\(c\)\+M\_\{\\mathrm\{con\}\}\(c\)\}\\right\)\.\(13\)When the denominator is zero, we setλt=0\\lambda\_\{t\}=0\.

#### Recovery cost\.

LetD⁡\(Δ​V^t\)D\(\\widehat\{\\Delta V\}\_\{t\}\)denote the predictable endogenous nodes that transitively depend on nodes introduced or modified by the commitment\. Recovery cost is

γt=clip\[0,1\]⁡\(\|D⁡\(Δ​V^t\)\|B​\(cret\+cregen\)\),\\gamma\_\{t\}=\\operatorname\{clip\}\_\{\[0,1\]\}\\left\(\\frac\{\|D\(\\widehat\{\\Delta V\}\_\{t\}\)\|\}\{B\}\\left\(c\_\{\\mathrm\{ret\}\}\+c\_\{\\mathrm\{regen\}\}\\right\)\\right\),\(14\)wherecretc\_\{\\mathrm\{ret\}\}andcregenc\_\{\\mathrm\{regen\}\}are the unit costs of retracting and regenerating a dependent node andBBis the recovery budget\.

#### Rollback trigger and trigger coverage\.

For a commitment targeting claimcc, the predicted trigger is

θc​\(e\)=𝟏​\[e∈Con⁡\(c\),ρe≥ρ⋆,we≥w⋆\]\.\\theta\_\{c\}\(e\)=\\mathbf\{1\}\\left\[\\begin\{aligned\} &e\\in\\mathrm\{Con\}\(c\),\\\\ &\\rho\_\{e\}\\geq\\rho^\{\\star\},\\\\ &w\_\{e\}\\geq w^\{\\star\}\\end\{aligned\}\\right\]\.\(15\)Trigger coverageTC⁡\(at\)∈\[0,1\]\\mathrm\{TC\}\(a\_\{t\}\)\\in\[0,1\]estimates the likelihood that future research probes expose an invalidating contradiction\. It may be supplied by a constant fallback, predicted by the LLM, or estimated structurally from open or pending plan steps linked to the committed claim\.

#### Irreversibility risk and utility\.

The three reversibility quantities are combined as

IRR⁡\(at\)=clip\[0,1\]⁡\(ακ​κt\+αλ​λt\+αγ​γt\),\\mathrm\{IRR\}\(a\_\{t\}\)=\\operatorname\{clip\}\_\{\[0,1\]\}\\left\(\\alpha\_\{\\kappa\}\\kappa\_\{t\}\+\\alpha\_\{\\lambda\}\\lambda\_\{t\}\+\\alpha\_\{\\gamma\}\\gamma\_\{t\}\\right\),\(16\)whereακ,αλ,αγ≥0\\alpha\_\{\\kappa\},\\alpha\_\{\\lambda\},\\alpha\_\{\\gamma\}\\geq 0and

ακ\+αλ\+αγ=1\.\\alpha\_\{\\kappa\}\+\\alpha\_\{\\lambda\}\+\\alpha\_\{\\gamma\}=1\.\(17\)The utility\-aware score is

U⁡\(at\)=V⁡\(at\)−η​IRR​\(at\)​\(1−TC⁡\(at\)\),U\(a\_\{t\}\)=V\(a\_\{t\}\)\-\\eta\\,\\mathrm\{IRR\}\(a\_\{t\}\)\\left\(1\-\\mathrm\{TC\}\(a\_\{t\}\)\\right\),\(18\)whereV⁡\(at\)V\(a\_\{t\}\)is configurable, such as zero or the predicted plausibility gain of the target hypothesis\.

#### Commitment policy\.

Let

qt=IRR⁡\(at\)​\(1−TC⁡\(at\)\)\.q\_\{t\}=\\mathrm\{IRR\}\(a\_\{t\}\)\\left\(1\-\\mathrm\{TC\}\(a\_\{t\}\)\\right\)\.\(19\)The threshold\-based policy is

πthr​\(at\)=\{not\-commit,Contested⁡\(at\),commit,qt≤τcommit,not\-commit,otherwise\.\\pi\_\{\\mathrm\{thr\}\}\(a\_\{t\}\)=\\begin\{cases\}\\textsc\{not\-commit\},&\\mathrm\{Contested\}\(a\_\{t\}\),\\\\ \\textsc\{commit\},&q\_\{t\}\\leq\\tau\_\{\\mathrm\{commit\}\},\\\\ \\textsc\{not\-commit\},&\\text\{otherwise\}\.\\end\{cases\}\(20\)The utility\-based alternative is

πutil​\(at\)=\{not\-commit,Contested⁡\(at\),commit,U⁡\(at\)≥τU,not\-commit,otherwise\.\\pi\_\{\\mathrm\{util\}\}\(a\_\{t\}\)=\\begin\{cases\}\\textsc\{not\-commit\},&\\mathrm\{Contested\}\(a\_\{t\}\),\\\\ \\textsc\{commit\},&U\(a\_\{t\}\)\\geq\\tau\_\{U\},\\\\ \\textsc\{not\-commit\},&\\text\{otherwise\}\.\\end\{cases\}\(21\)A claim is considered contested when it has substantial support and contradiction mass and its current belief lies near the decision boundary\.

#### Consistency monitoring\.

After a commitment becomes active, the monitor checks it whenever new evidence is added\. A commitment on claimccfires when qualifying contradiction evidence exists and the current claim belief falls belowβ⋆\\beta^\{\\star\}:

Fire⁡\(c\)=1⟺\\displaystyle\\mathrm\{Fire\}\(c\)=1\\Longleftrightarrow\{\}∃e∈Con⁡\(c\)​such that\\displaystyle\\exists e\\in\\mathrm\{Con\}\(c\)\\text\{ such that\}\(22\)ρe≥ρ⋆,we≥w⋆,\\displaystyle\\rho\_\{e\}\\geq\\rho^\{\\star\},\\quad w\_\{e\}\\geq w^\{\\star\},βnow​\(c\)<β⋆\.\\displaystyle\\beta\_\{\\mathrm\{now\}\}\(c\)<\\beta^\{\\star\}\.The monitor does not modify the graph\. It returns the fired commitment, current claim belief, qualifying evidence identifiers, and the thresholds that were crossed\.

#### Deterministic reduced rollback\.

For each fired commitment,DeepRewindfirst retracts the commitment node and any justification unique to it\. Independently supported or shared justifications are retained\. It then removes commitment\-specific dependency edges and processes downstream nodes according to their type: dependentDraftFragment,PlanStep,Hypothesis, andAssumptionnodes are marked stale, contested, or retracted according to the configured repair policy\. The target claim is reopened when additional investigation is possible\. Every operation is appended to the ledger as a rollback event, and no additional language\-model call is required\.

#### Initial\-condition interventions\.

The initial\-condition hook can insert provenance\-tagged synthetic evidence before the supervisor begins reasoning\. The supported conditions areneutral, which injects nothing;support, which supports the target proposition;counter, which contradicts it; anddistract, which introduces low\-weight peripheral evidence\. Synthetic nodes record their condition, generation reason, and synthetic provenance so that they remain distinguishable from Web\-derived evidence\.

#### Alternative\-switching interventions\.

The switching hook begins with two mutually distinguishable alternativesAAandBB\. It may insert early evidence supportingAA, followed later by high\-confidence contradiction to the committed\-AAclaim and high\-confidence support forBB\. The switch can occur after the first accepted commitment or after a configurable number of research steps\. When the hook is disabled, no synthetic evidence or switching behavior is introduced\.

#### Experiment orchestration\.

The experiment driver enumerates runs over

ℛ=𝒬×ℱ×𝒞×𝒜×𝒮,\\mathcal\{R\}=\\mathcal\{Q\}\\times\\mathcal\{F\}\\times\\mathcal\{C\}\\times\\mathcal\{A\}\\times\\mathcal\{S\},\(23\)where𝒬\\mathcal\{Q\}contains research questions,ℱ\\mathcal\{F\}intervention families,𝒞\\mathcal\{C\}conditions,𝒜\\mathcal\{A\}experimental arms, and𝒮\\mathcal\{S\}random seeds\. Each cell receives an isolated run directory and an arm\-specific configuration\. Completed cells are identified through marker files and skipped during resumed execution\. Failures are logged with their traceback without stopping the remaining runs\. Benchmark\-specific dataset loading is kept outside the control layer\.

#### Logging and reproducibility\.

World\-model artifacts are stored as append\-only JSONL records\. Event types includerun\_start, prediction events, policy decisions,monitor\_check,trigger\_fired, rollback events, andrun\_end\. The initial record stores the complete runtime configuration, including thresholds, coefficients, trigger\-coverage mode, rollback policy, and intervention flags\. Reproducibility is further supported through deterministic rollback planning, isolated run directories, manifest tracking, completion markers, and default\-off intervention hooks\.

## Appendix BExperimental Details

This appendix provides the model, agent, retrieval, control, evaluation, and reproducibility configurations used in Section[4](https://arxiv.org/html/2609.36344#S4)\.

#### Model configuration\.

All language\-model requests are routed through OpenRouter using the canonical identifiersopenai/gpt\-4o,openai/gpt\-5\.4,qwen/qwen3\.5\-27b, anddeepseek/deepseek\-v4\-pro\. The base research models use temperature0\.70\.7, top\-pp1\.01\.0, and a shared input\-context limit of128,000128\{,\}000tokens\. Intermediate research generations are limited to4,0964\{,\}096output tokens, while final report generation is limited to16,38416\{,\}384tokens\. For models exposing an explicit reasoning\-effort parameter, we use the medium setting; otherwise, we retain the provider default\. We use the default balanced OpenRouter routing policy, allow provider\-level retries, and do not permit fallback to a different model\. Each failed model call is retried at most three times with exponential backoff of22,44, and88seconds\.

GPT\-4o is used as the research\-state world model in every experiment\. We set its temperature to00, top\-ppto11, and maximum output length to4,0964\{,\}096tokens\. Structured JSON output is requested whenever supported by the provider\. Invalid JSON responses are repaired through one deterministic parsing pass and, if parsing still fails, the prediction call is repeated up to two times\. A candidate commitment is rejected when no valid prediction is obtained after these attempts\.

#### Open Deep Research configuration\.

We retain the standard supervisor–researcher organization of Open Deep Research and apply the same configuration to all base models\. Each run permits at most1010supervisor iterations, at most33concurrent research units, and at most55Web searches per research unit\. Each research unit receives the complete research brief and the findings accumulated at the time it is invoked\. Research terminates when the supervisor emits its completion decision or exhausts the iteration budget\. The final report is generated from all accepted findings and active research\-state artifacts\. The baseline andDeepRewindconditions use identical prompts, iteration budgets, search tools, and report\-generation limits; only the graph instrumentation and commitment\-control operations differ\.

#### Web retrieval\.

Web search is performed through Tavily withsearch\_depth=advanced,topic=general,max\_results=5,include\_answer=false, andinclude\_raw\_content=true\. We retain up to three relevant text chunks from each returned page and cap the extracted content supplied to the agent at8,0008\{,\}000characters per source\. No fixed domain allowlist or blocklist is applied\. Duplicate URLs are removed within each run, but the same source may be retrieved by different experimental conditions\. Search failures are retried twice before the corresponding query is recorded as unsuccessful\.

#### DeepRewindconfiguration\.

The primary experiments use the threshold\-based commitment policy\. We set the hypothesis\-softmax temperature toT=1T=1, the reversibility weights toακ=αλ=αγ=13\\alpha\_\{\\kappa\}=\\alpha\_\{\\lambda\}=\\alpha\_\{\\gamma\}=\\tfrac\{1\}\{3\}, the risk penalty toη=1\\eta=1, and the commitment threshold toτcommit=0\.35\\tau\_\{\\mathrm\{commit\}\}=0\.35\. Trigger coverage is taken from the world\-model prediction when available and otherwise defaults toTC=0\.5\\mathrm\{TC\}=0\.5\. We set the claim\-belief trigger toβ⋆=0\.5\\beta^\{\\star\}=0\.5, minimum source reliability toρ⋆=0\.75\\rho^\{\\star\}=0\.75, and minimum contradiction\-edge weight tow⋆=0\.6w^\{\\star\}=0\.6\. A claim is treated as contested when both its support and contradiction masses are at least0\.30\.3andβt​\(c\)∈\[0\.4,0\.6\]\\beta\_\{t\}\(c\)\\in\[0\.4,0\.6\]\.

The recovery budget isB=20B=20, with unit retraction and regeneration costscret=1c\_\{\\mathrm\{ret\}\}=1andcregen=2c\_\{\\mathrm\{regen\}\}=2\. During rollback, unique commitment justifications are retracted, independently supported nodes are preserved, and downstream draft fragments and plan steps are marked stale rather than deleted\. The utility\-policy ablation uses

V⁡\(at\)=max⁡\(0,p^t\+1​\(h⋆\)−pt​\(h⋆\)\),V\(a\_\{t\}\)=\\max\\left\(0,\\,\\hat\{p\}\_\{t\+1\}\(h^\{\\star\}\)\-p\_\{t\}\(h^\{\\star\}\)\\right\),\(24\)whereh⋆h^\{\\star\}is the target hypothesis, and commits whenU⁡\(at\)≥τUU\(a\_\{t\}\)\\geq\\tau\_\{U\}withτU=0\\tau\_\{U\}=0\.

#### Compared conditions\.

We evaluate six conditions under identical research budgets\.ODRis the unmodified Open Deep Research baseline\.Graph\-Onlyrecords the epistemic graph and transition ledger but does not invoke the world model or alter commitments\.Predict\-Onlyinvokes the world model and records its risk estimates, but all candidate commitments are accepted and no rollback is performed\.No\-Gateaccepts every candidate commitment but enables consistency monitoring and reduced rollback, isolating post\-commitment repair\.DeepRewindenables prediction, pre\-commitment gating, monitoring, and rollback\. We additionally evaluateDeepRewind\-NoRollbackto isolate the effect of pre\-commitment gating without post\-commitment repair\. Results of this component ablation are reported in Appendix[C](https://arxiv.org/html/2609.36344#A3)\.

For initial\-condition experiments, supportive and contradictory synthetic evidence use reliability0\.850\.85and edge weight0\.80\.8, while distracting evidence uses reliability0\.50\.5and edge weight0\.250\.25\. In switching experiments, early support for alternativeAAuses reliability0\.80\.8and weight0\.750\.75; the later contradiction toAAand support forBBuse reliability0\.950\.95and weight0\.90\.9\. The primary switch occurs immediately after the first accepted commitment toAA\. All synthetic artifacts are explicitly tagged and excluded from source\-quality analyses\.

#### Evaluation\.

We use the released reference insights and official evaluation procedure for each benchmark\. Letℐ^q\\widehat\{\\mathcal\{I\}\}\_\{q\}be the insights extracted from the generated report for taskqq,ℐq\\mathcal\{I\}\_\{q\}the reference insights, andmqm\_\{q\}the number of one\-to\-one matched insight pairs\. We compute

Pq\\displaystyle P\_\{q\}=mq\|ℐ^q\|,\\displaystyle=\\frac\{m\_\{q\}\}\{\|\\widehat\{\\mathcal\{I\}\}\_\{q\}\|\},\(25\)Rq\\displaystyle R\_\{q\}=mq\|ℐq\|\.\\displaystyle=\\frac\{m\_\{q\}\}\{\|\\mathcal\{I\}\_\{q\}\|\}\.Precision is set to zero when no insight is produced\. We first macro\-average precision and recall across the100100tasks in each benchmark and then report the mean and standard deviation across three seeds\. The evaluator receives only the generated report and reference insights and is not given the model identity or experimental condition\.

We additionally report premature\-commitment rate, commitment rate, blocked\-commitment rate, trigger rate, rollback rate, average rollback size, and normalized recovery cost\. Premature commitment is defined formally below and is evaluated from the complete run trace using the same criterion for all methods\. We do not directly evaluate the accuracy of the world model’s predicted graph transitions or reversibility estimates because the benchmarks do not provide ground\-truth annotations for these quantities\. Instead, we evaluate their utility through downstream performance, controlled interventions, component ablations, and sensitivity to the choice of world\-model LLM\. Synthetic intervention evidence is included when assessing resistance to premature commitment but excluded from final insight precision and recall unless it is independently supported by retrieved Web evidence\.

#### Premature\-commitment metric\.

We operationally define a premature commitment as an accepted commitment that is subsequently invalidated by evidence collected later in the same research run\. For a commitment to claimccmade at steptt, we examine all evidence retrieved afterttand mark the commitment as premature if, by the end of the run, there exists contradicting evidence satisfyingρe≥ρ⋆\\rho\_\{e\}\\geq\\rho^\{\\star\}andwe≥w⋆w\_\{e\}\\geq w^\{\\star\}, and the resulting claim belief falls belowβ⋆\\beta^\{\\star\}\. Thus, the premature\-commitment rate is

PC=\#​\{invalidated commitments\}\#​\{accepted commitments\}\.\\mathrm\{PC\}=\\frac\{\\\#\\\{\\text\{invalidated commitments\}\\\}\}\{\\\#\\\{\\text\{accepted commitments\}\\\}\}\.\(26\)
Table 4:Component ablation ofDeepRewindwith GPT\-4o as the deep\-research agent and GPT\-4o as the world model\. Results are averaged across three runs\. PC denotes premature\-commitment rate and RB denotes rollback rate\.MethodDRBenchLiveDRBenchPCRBPrec\.Rec\.Prec\.Rec\.↓\\downarrow\(%\)ODR55\.816\.251\.413\.831\.7–Graph\-Only55\.916\.351\.513\.931\.5–Predict\-Only56\.116\.551\.714\.130\.9–No\-Gate57\.217\.852\.915\.431\.214\.7DeepRewind\-NoRollback58\.219\.054\.016\.514\.5–DeepRewind58\.719\.654\.617\.113\.19\.1

The judgment is made retrospectively at the end of each run using the full set of subsequently collected evidence, allowing the same criterion to be applied to bothODRandDeepRewind\. ForDeepRewind, an online rollback may occur earlier when the same invalidation condition is first satisfied, but the reported PC metric is computed independently from the final run trace\. If later evidence remains mixed or ambiguous and does not satisfy both the contradiction and belief thresholds, the commitment is not counted as premature\.

#### Randomness and failure handling\.

We use seeds1313,4242, and9797\. Seeds control intervention construction, alternative ordering, concurrent\-research scheduling, and the API seed parameter where supported\. Because hosted APIs may remain nondeterministic, all aggregate results are computed from independently executed runs rather than replayed outputs\. A run is considered failed only after three retries of its terminal error\. Persistent failures receive zero precision and recall and remain included in the aggregate; we also report the completion rate for each model and condition\.

#### Logging and resource accounting\.

Each run is written to an isolated directory containing its configuration, research\-state ledger, world\-model predictions, policy decisions, search results, monitor events, rollback records, generated report, evaluator output, and completion marker\. The manifest records the benchmark, task identifier, model, condition, seed, execution status, and artifact paths\. We record input, output, and reasoning\-token counts when exposed by the provider, together with the number of model calls, Tavily searches, retrieved pages, research iterations, and wall\-clock duration\. At most four benchmark runs are executed concurrently, and completed cells are skipped when an interrupted experiment is resumed\.

## Appendix CComponent Ablation

We isolate the contribution of each component ofDeepRewindusing GPT\-4o as both the deep\-research agent and the research\-state world model\. All variants use the same research budget, retrieval configuration, prompts, and evaluation procedure\.Graph\-Onlyadds only the epistemic graph and transition logging, whilePredict\-Onlyadditionally invokes the world model but does not use its predictions to alter commitments\.No\-Gateremoves pre\-commitment gating while retaining consistency monitoring and reduced rollback\.DeepRewind\-NoRollbackretains prediction and gating but disables post\-commitment rollback\. FullDeepRewindcombines prediction, gating, monitoring, and rollback\.

Table[4](https://arxiv.org/html/2609.36344#A2.T4)isolates the roles of prediction, prevention, and repair\. Graph construction and world\-model prediction alone have limited effect when they do not alter the agent’s decisions\. Enabling reduced rollback improves final performance by repairing commitments after contradictory evidence is observed, while pre\-commitment gating provides a larger gain by preventing risky commitments from propagating through the research trajectory\. Combining gating with rollback yields the strongest overall precision and recall and the lowest premature\-commitment rate\.

## Appendix DError Analysis

Table 5:Mean±\\pmstandard deviation for the main results across three runs\.ModelMethodDRBenchLiveDRBenchPrec\.Rec\.Prec\.Rec\.GPT\-4oODR55\.8±0\.855\.8\{\\pm\}0\.816\.2±0\.516\.2\{\\pm\}0\.551\.4±1\.051\.4\{\\pm\}1\.013\.8±0\.713\.8\{\\pm\}0\.7DeepRewind58\.7±0\.6\\mathbf\{58\.7\{\\pm\}0\.6\}19\.6±0\.4\\mathbf\{19\.6\{\\pm\}0\.4\}54\.6±0\.8\\mathbf\{54\.6\{\\pm\}0\.8\}17\.1±0\.6\\mathbf\{17\.1\{\\pm\}0\.6\}GPT\-5\.4ODR68\.4±0\.668\.4\{\\pm\}0\.636\.5±0\.736\.5\{\\pm\}0\.763\.7±0\.863\.7\{\\pm\}0\.831\.8±0\.831\.8\{\\pm\}0\.8DeepRewind71\.2±0\.5\\mathbf\{71\.2\{\\pm\}0\.5\}40\.3±0\.6\\mathbf\{40\.3\{\\pm\}0\.6\}66\.8±0\.6\\mathbf\{66\.8\{\\pm\}0\.6\}35\.6±0\.7\\mathbf\{35\.6\{\\pm\}0\.7\}Qwen3\.5\-27BODR60\.9±0\.960\.9\{\\pm\}0\.924\.6±0\.624\.6\{\\pm\}0\.656\.2±1\.056\.2\{\\pm\}1\.020\.8±0\.820\.8\{\\pm\}0\.8DeepRewind63\.8±0\.7\\mathbf\{63\.8\{\\pm\}0\.7\}28\.1±0\.5\\mathbf\{28\.1\{\\pm\}0\.5\}59\.5±0\.8\\mathbf\{59\.5\{\\pm\}0\.8\}24\.3±0\.6\\mathbf\{24\.3\{\\pm\}0\.6\}DeepSeek\-V4 ProODR64\.7±0\.764\.7\{\\pm\}0\.729\.8±0\.629\.8\{\\pm\}0\.659\.8±0\.959\.8\{\\pm\}0\.925\.4±0\.825\.4\{\\pm\}0\.8DeepRewind67\.6±0\.6\\mathbf\{67\.6\{\\pm\}0\.6\}33\.5±0\.5\\mathbf\{33\.5\{\\pm\}0\.5\}63\.1±0\.7\\mathbf\{63\.1\{\\pm\}0\.7\}29\.0±0\.6\\mathbf\{29\.0\{\\pm\}0\.6\}

Table 6:Paired statistical comparison ofDeepRewindagainstODR\. Differences are computed per task after averaging each task across three runs\. We report the mean improvement \(Δ\\Delta\), 95% paired\-bootstrap confidence interval, and Holm\-adjusted two\-sidedpp\-value over the 100 benchmark tasks\.ModelBenchmarkMetricΔ\\Delta95% CIpadjp\_\{\\mathrm\{adj\}\}GPT\-4oDRBenchPrecision\+2\.9\[1\.1, 4\.7\]0\.012Recall\+3\.4\[1\.8, 5\.0\]0\.004LiveDRBenchPrecision\+3\.2\[1\.2, 5\.1\]0\.011Recall\+3\.3\[1\.5, 5\.2\]0\.006GPT\-5\.4DRBenchPrecision\+2\.8\[1\.2, 4\.4\]0\.009Recall\+3\.8\[2\.1, 5\.5\]0\.003LiveDRBenchPrecision\+3\.1\[1\.3, 4\.9\]0\.008Recall\+3\.8\[1\.9, 5\.7\]0\.004Qwen3\.5\-27BDRBenchPrecision\+2\.9\[0\.9, 4\.8\]0\.019Recall\+3\.5\[1\.7, 5\.3\]0\.006LiveDRBenchPrecision\+3\.3\[1\.0, 5\.5\]0\.018Recall\+3\.5\[1\.4, 5\.6\]0\.009DeepSeek\-V4 ProDRBenchPrecision\+2\.9\[1\.1, 4\.7\]0\.014Recall\+3\.7\[1\.9, 5\.5\]0\.005LiveDRBenchPrecision\+3\.3\[1\.1, 5\.4\]0\.015Recall\+3\.6\[1\.6, 5\.6\]0\.007

Table[5](https://arxiv.org/html/2609.36344#A4.T5)reports the run\-level variation corresponding to Table[1](https://arxiv.org/html/2609.36344#S4.T1)\. The relatively small standard deviations indicate that the gains fromDeepRewindare consistent across the three independently executed runs rather than being driven by a single favorable trajectory\. Variation is slightly higher on LiveDRBench, where changing Web content and retrieval results introduce additional uncertainty\. Because three runs provide limited statistical power on their own, we additionally perform paired task\-level comparisons betweenDeepRewindandODR\. Table[6](https://arxiv.org/html/2609.36344#A4.T6)reports the mean per\-task improvement, 95% paired\-bootstrap confidence intervals, and Holm\-adjusted two\-sidedpp\-values across the 100 tasks in each benchmark\.

Inspection of unsuccessful trajectories reveals three recurring error sources\. First, we observe cases consistent with the world model underestimating the downstream effect of a commitment, particularly when its dependencies are only expressed implicitly in later draft fragments or plans\. Second, highly reliable but incomplete evidence can produce a low predicted information\-loss score, allowing the agent to commit before alternative explanations have been sufficiently explored\. Third, rollback can preserve a stale dependent when that dependency is missing or incorrectly typed in the research\-state graph\. These failures suggest that the effectiveness ofDeepRewinddepends jointly on accurate reversibility prediction and sufficiently complete dependency recording\.

Table 7:Ablation of the world\-model LLM with GPT\-4o fixed as the deep\-research agent\. Results are insight precision and recall \(%\), averaged across three runs\. GPT\-4o is the default world model\.World modelDRBenchLiveDRBenchPrec\.Rec\.Prec\.Rec\.Qwen3\.5\-27B57\.818\.853\.716\.2DeepSeek\-V4 Pro58\.419\.254\.216\.8GPT\-4o \(default\)58\.719\.654\.617\.1GPT\-5\.459\.220\.155\.117\.7

## Appendix EWorld\-Model LLM Ablation

We examine whetherDeepRewinddepends on the LLM used to predict research\-state transitions\. The base deep\-research agent is fixed to GPT\-4o, and only the world\-model LLM is changed\. All models receive the same serialized research\-state graph, commitment\-prediction prompt, thresholds, and search budget\. Table[7](https://arxiv.org/html/2609.36344#A4.T7)shows that stronger world models provide modest gains, but the overall performance is stable across model choices\. GPT\-5\.4 achieves the highest precision and recall, while the default GPT\-4o world model remains within one percentage point on most metrics\. This experiment evaluates downstream sensitivity to the choice of world\-model LLM rather than the accuracy or calibration of individual predicted transitions\.

The limited variation indicates that the gains ofDeepRewinddo not arise solely from using a particular world\-model LLM\. Although GPT\-5\.4 produces the strongest results, its average recall improvement over GPT\-4o is only0\.60\.6percentage points\. We therefore retain GPT\-4o as the default world model in the main experiments\.

## Appendix FQualitative Analysis

Figure[2](https://arxiv.org/html/2609.36344#A6.F2)presents a compact epistemic state for the question of whether new nuclear power or large\-scale renewables with storage can more reliably and cost\-effectively support global net\-zero electricity grids by 2050\. The graph preserves the provenance of each finding while exposing the unresolved tension between two competing hypotheses\. Evidence on declining renewable and storage costs supports the claim that renewables are cheaper and faster to scale, which in turn supportsH1H\_\{1\}: renewables with storage should be the default global strategy\. However, separate evidence indicates that dispatchable nuclear generation may improve adequacy during low\-renewable periods, supportingH2H\_\{2\}: a mixed portfolio including nuclear may be more robust\. The regional\-dependence claim further qualifies any universal conclusion\.

Figure 2:A compact epistemic research graph for a qualitative example\. The candidate commitmentK1K\_\{1\}would lock the report intoH1H\_\{1\}, despite remaining support for the competing hypothesisH2H\_\{2\}\.#### World\-model prediction\.

The candidate actionK1K\_\{1\}commits the report toH1H\_\{1\}as its primary conclusion\. AlthoughH1H\_\{1\}currently has higher plausibility thanH2H\_\{2\}, the difference is not sufficiently decisive:H1H\_\{1\}has probability of0\.620\.62, while the alternative retains probability0\.380\.38and is supported by multiple high\-reliability evidence nodes\. The world model therefore predicts that committing toK1K\_\{1\}would cause substantial hypothesis narrowing by prematurely suppressingH2H\_\{2\}\. It also identifies non\-negligible information loss because the conclusion “renewables with storage are preferred” compresses away important qualifications concerning extreme operating conditions and regional constraints\. The predicted recovery cost is also elevated becauseK1K\_\{1\}is directly used in the preliminary draft fragmentD1D\_\{1\}; later invalidation would therefore require revising both the commitment and the text derived from it\.

#### Recommended control decision\.

Given this prediction,DeepRewindrecommends deferringK1K\_\{1\}rather than accepting it immediately\. The competing hypotheses remain active, and the agent instead executes plan stepP1P\_\{1\}, which searches specifically for evidence about extreme\-weather reliability and long\-duration storage\. This plan also defines a concrete contradiction trigger for reconsidering the commitment\. If the additional evidence independently supports the adequacy of renewable\-storage systems, the agent can later commit toH1H\_\{1\}with lower reversibility risk\. If it instead strengthensH2H\_\{2\}, the agent can rejectK1K\_\{1\}without having propagated it further into the report\.

IfK1K\_\{1\}had already been accepted, the same graph enables dependency\-aware rollback\. The repair procedure would retractK1K\_\{1\}, markD1D\_\{1\}as stale because it was derived from that commitment, and preserve the independently supported sources, evidence, claims, and competing hypothesis\. Thus, the graph supports both preventive control before commitment and localized repair after contradictory evidence is observed\.

## Appendix GPrompts

We use three prompts to initialize and update the research\-state representation\. Prompt[G](https://arxiv.org/html/2609.36344#A7)converts the input research question into a single concise and testable target proposition whose support can be evaluated against subsequently collected evidence\. Prompt[G](https://arxiv.org/html/2609.36344#A7)then elicits mutually distinguishable answer alternatives, forming the initial hypothesis space within which subsequent evidence and commitments are assessed\. Finally, Prompt[G](https://arxiv.org/html/2609.36344#A7)acts as the research\-state world model: given a candidatecommitaction, it predicts the resulting graph changes and estimates their reversibility through hypothesis narrowing, information loss, recovery cost, contradiction\-trigger thresholds, and future trigger coverage\.

Prompt G\.1: Initial Target\-Proposition ElicitationGiven the research question below, produce exactly one concise and testable target proposition that can be supported or contradicted by evidence\.Requirements•Return exactly one proposition\.•Express the proposition as a single sentence\.•Ensure that the proposition is concise and unambiguous\.•Ensure that the proposition is empirically or logically testable\.•Formulate it so that subsequent evidence can either support or contradict it\.•Do not include explanations, alternatives, qualifications, or additional text\.Research question\{\{question\}\}Return only the target proposition\.Prompt G\.2: Competing\-Alternative ElicitationGiven the research question below, identify competing answer alternatives that represent distinguishable possible resolutions of the question\.Requirements•Return a JSON array containing at least two alternatives\.•Keep each alternative concise\.•Ensure that the alternatives are mutually distinguishable\.•Avoid returning duplicate or semantically equivalent alternatives\.•Do not include explanations, labels, comments, or Markdown fences\.•Return valid JSON only\.Research question\{\{question\}\}Return only the JSON array of competing alternatives\.Prompt G\.3: World\-Model Commitment PredictionYou are a world model of a deep\-research agent’s epistemic state\. Given the current research\-state graph and a candidatecommitaction, predict the resulting graph changes and their reversibility\.Do not create, modify, or predict Source or Evidence nodes\. You may only reference existing ones by alias\. Predict changes only to Claim, Hypothesis, Assumption, Commitment, DraftFragment, and PlanStep nodes\. Return one JSON object with:•update\_nodes: created or updated predictable nodes, using\{"alias":"\.\.\.","type":"\.\.\.","op":"update\|create","fields":\{\.\.\.\}\}\.•update\_edges: added or removed edges among predictable nodes, or between existing Source/Evidence nodes and predictable nodes, using\{"op":"add\|remove","src":"\.\.\.","dst":"\.\.\.",
"relation":"\.\.\.","weight":0\.0\}\.•reversibility, containing:–kappa in\[0,1\]\[0,1\]: narrowing of competing hypotheses;–lambda in\[0,1\]\[0,1\]: information loss;–gamma in\[0,1\]\[0,1\]: normalized recovery cost; and–theta:\{"claim\_alias":"\.\.\.","rho\_star":0\.0,"w\_star":0\.0\}, or null\.•optionally, trigger\_coverage in\[0,1\]\[0,1\]: the likelihood that future probes detect contradictions to the committed claim\.Use this exact top\-level structure:\{"update\_nodes": \[…\],"update\_edges": \[…\],"reversibility": \{"kappa": 0\.44,"lambda": 0\.12,"gamma": 0\.31,"theta": \{"claim\_alias": "C1","rho\_star": 0\.75,"w\_star": 0\.6\}\},"trigger\_coverage": 0\.5\}All numeric values must be plain JSON numbers in\[0,1\]\[0,1\]\. Use existing aliases unless creating a new predictable node, in which case use the appropriate node\-type prefix\.Current research\-state graph\{\{research\_state\_graph\}\}Candidatecommitaction\{\{candidate\_commit\_action\}\}Return only the JSON object, without prose or Markdown fences\.