Paper deep dive
Defensive Writing in GPT Models
Junchi Liao, Xiao Huang, Yucheng Liu, Jiawen Deng, Fuji Ren
Intelligence
Status: succeeded | Model: Gemma-4-26B-A4B | Prompt: intel-v1 | Confidence: 91%
Last extracted: 10/14/2026, 9:23:13 AM
Summary
This study investigates 'defensive writing' in GPT models, defined as the addition of ungrounded qualifications or retraction of authors' claims during paper revision. The research finds that recent GPT versions (from GPT-5.5 onwards, especially GPT-6-astra) significantly increase ungrounded qualifications and retract claims when prompted to prepare text for peer review. This behavior is triggered by requests to check claims or address reviewer concerns, rather than simple polishing. While AI reviewers score these defensive rewrites higher, human readers find them harder to read. The study suggests that combining AI writing with AI review may amplify this defensive style, potentially weakening the clarity and strength of academic conclusions.
Entities (9)
Relation Signals (7)
GPT-6 Astra â exhibits â Defensive Writing
confidence 98% · GPT-6-astra adds the most and often retracts the authors' claims.
Polishing Request â doesnottrigger â Defensive Writing
confidence 95% · Under P1âP3, every model stays at the level of the authorsâ originals... As soon as the prompt mentions review, ungrounded qualifications rise
GPT-6 Astra â triggers â Ungrounded Qualifications
confidence 95% · GPT-6-astra adds the most ungrounded qualifications in result analysis and discussion
Peer Review Request â causes â Defensive Writing
confidence 92% · As soon as the prompt mentions review, ungrounded qualifications rise
GPT-5.5 â exhibits â Defensive Writing
confidence 90% · From GPT-5.5 on, GPT versions add clearly more ungrounded qualifications
AI Reviewers â ratehigher â Defensive Rewrites
confidence 90% · AI reviewers score such rewrites higher
Human Readers â ratelower â Defensive Rewrites
confidence 88% · human readers in a small study find them harder to read
Cypher Suggestions (0)
No Cypher suggestions yet.
Abstract
Abstract:Researchers increasingly use ChatGPT to revise their papers, and when asked to make a paper hold up under review, recent GPT versions often narrow or even retract the authors' claims. We call such changes defensive writing when the given material does not support them, and we test two explanations: the model corrects the authors' overclaiming, or it writes for an anticipated reviewer. We ask GPT versions and models from other developers to rewrite paragraphs from papers written before ChatGPT, or to write from an evidence sheet that lists a paper's method and results. From GPT-5.5 on, GPT versions add clearly more ungrounded qualifications than the authors' originals contain, and GPT-6-astra adds the most and often retracts the authors' claims. Each explanation fits one part. Checked against the full papers, GPT-6-astra's retractions mostly correct overstated claims or explanations, but most added qualifications are redundant. The qualifications follow the request: they are absent under polishing, appear with any request to check the claims, and peak when the prompt names a reviewer's concerns. AI reviewers score such rewrites higher and score them lower once only the qualifications are removed, while human readers in a small study find them harder to read. Combining AI writing with AI review may reward qualifications that readers pay for.
Tags
Links
- Source: https://arxiv.org/abs/2610.11355v2
- Canonical: https://arxiv.org/abs/2610.11355v2
Trouble viewing inline? Open PDF directly â
Full Text
99,128 characters extracted from source content.
Expand or collapse full text
Defensive Writing in GPT Models Junchi Liao Affiliation: University of Electronic Science and Technology of China Xiao Huang Affiliation: Shanghai Jiao Tong University Yucheng Liu Affiliation: Shanghai Jiao Tong University Jiawen Deng â thanks: Corresponding authors. Affiliation: University of Electronic Science and Technology of China Fuji Ren11footnotemark: 1 Affiliation: University of Electronic Science and Technology of China Abstract Researchers increasingly use ChatGPT to revise their papers, and when asked to make a paper hold up under review, recent GPT versions often narrow or even retract the authorsâ claims. We call such changes defensive writing when the given material does not support them, and we test two explanations: the model corrects the authorsâ overclaiming, or it writes for an anticipated reviewer. We ask GPT versions and models from other developers to rewrite paragraphs from papers written before ChatGPT, or to write from an evidence sheet that lists a paperâs method and results. From GPT-5.5 on, GPT versions add clearly more ungrounded qualifications than the authorsâ originals contain, and GPT-6-astra adds the most and often retracts the authorsâ claims. Each explanation fits one part. Checked against the full papers, GPT-6-astraâs retractions mostly correct overstated claims or explanations, but most added qualifications are redundant. The qualifications follow the request: they are absent under polishing, appear with any request to check the claims, and peak when the prompt names a reviewerâs concerns. AI reviewers score such rewrites higher and score them lower once only the qualifications are removed, while human readers in a small study find them harder to read. Combining AI writing with AI review may reward qualifications that readers pay for. Figure 1: Overview of defensive writing by GPT models. 1 Introduction Researchers increasingly use AI assistants to revise their papers (Liang et al., 2024b), and ChatGPT is the most widely used of them (Simon et al., 2025; Moore, 2026). When recent GPT versions revise a paper so that it holds up under review, they change more than the language. They also change the authorsâ judgment of their own conclusions (Figure 1): they add qualifications, and sometimes drop a conclusion the authors have confirmed, writing instead that âauthorship and length alone do not establish the degree of simplificationâ (§3.3). These changes concentrate in the paragraphs where the authors take a position, such as result analysis and discussion. The claims in the paper may then drift away from what the authors actually think. Academic writing needs caution (Hyland, 1996). But caution should point to limitations that exist in the evidence, so that readers know where a conclusion holds. We call a change defensive writing when it narrows or questions the authorsâ claims without support in the material the writer was given. Defensive writing has two costs. For readers, layers of qualification and negation make a paragraph longer and harder to follow, and it takes effort to tell what the authors actually claim. For authors, it weakens how firmly they state their conclusions. AI is also entering peer review (Liang et al., 2024a; Russo et al., 2025). If AI reviewers prefer this style, a process in which AI writes and AI reviews may keep reinforcing it. Prior work detects hedges and measures claim strength in human-written text (Farkas et al., 2010; Yu et al., 2019), and studies how LLMs assist writing and review (Appendix A). We instead ask how an LLM changes the strength of the authorsâ claims during revision, measured against the material it was given. Why does GPT revise this way? One explanation is that it corrects overclaiming by the authors. If so, it should retreat from overstated claims and leave supported ones intact. Another explanation is that it writes for an anticipated reviewer. If so, defense should weaken when the prompt does not mention review, and grow once the model receives review comments. We test the two explanations on 77 paragraphs from 20 papers written before the release of ChatGPT. Eight GPT versions and four models from other developers perform two tasks. They rewrite the authorsâ paragraphs, and they write paragraphs from an evidence sheet that lists the method, setup, and results of a paper but not the authorsâ interpretations. We measure defense in two ways. We check each sentence against the material the writer had to find ungrounded qualifications, and we track whether each of the authorsâ claims is kept, softened, or retracted. We ask whether GPT writes defensively (RQ1), what triggers it (RQ2), whether its caution is warranted (RQ3), and how AI reviewers and human readers respond to it (RQ4). The two explanations fit different parts of the behavior. From GPT-5.5 on, GPT versions add clearly more ungrounded qualifications in rewriting than the authorsâ originals contain. GPT-6-astra adds the most and begins to retract the authorsâ claims, which the control models rarely do; when it writes from the evidence sheet, it still adds the most ungrounded qualifications. Two PhD students who check its rewrites against the full papers find that its retractions mostly correct overstated claims or explanations, as the first explanation predicts, while most of the ungrounded qualifications they check add nothing a careful reader needs. The qualifications follow the request, as the second explanation predicts, though not only requests that mention review. They stay near the level of the originals when the models only polish, rise when the models revise for review or only for scientific accuracy, rise most when the prompt names a reviewerâs concerns, and rise further after one round of self-review. AI reviewers score rewrites that address reviewer concerns higher, and lower once only the qualifications are removed. In a small study, human readers find the same rewrites harder to read and the authors less certain. This paper makes four contributions. â We define defensive writing and measure it against the material the writer was given, which separates grounded caution from ungrounded defense. ⥠Through controlled changes of the prompt context and multi-round revision, we show that defensive writing appears mainly in recent GPT versions, is absent under polishing, and is triggered by requests to check the claims, most strongly by anticipated review. âą Checking GPT-6-astraâs rewrites against the full papers, we separate correction from defense: its retractions mostly correct overstated claims, while most added qualifications are redundant. ⣠We show that AI reviewers and human readers judge these rewrites differently: AI reviewers score them higher and rate them clearer, while human readers find them harder to read. This mismatch suggests that combining AI writing with AI review may amplify defensive writing. 2 Study Design 2.1 Rewriting Source paragraphs. We sample 77 paragraphs from 20 peer-reviewed computer science papers. Each paper first appeared on arXiv before the release of ChatGPT on November 30, 2022, so none was written with a conversational LLM assistant. We group the paragraphs into four types by their role in the paper: (1) novelty, comparing with prior work to establish what is new; (2) contribution, stating the paperâs contributions; (3) result analysis, analyzing specific experimental results; and (4) discussion, drawing broader implications from the results and proposing future directions. DeepSeek-V4-Flash assigns the initial labels, and the authors verify each one. We take at most one paragraph of each type from each paper, which gives 20 paragraphs each of types (1)â(3) and 17 of type (4), since three papers have no suitable discussion paragraph. Further details are in Appendix B.1. Setup. The model receives only the paragraph and one sentence saying where it appears, such as âa paragraph from the experiments section that analyzes the resultsâ. It sees nothing else from the paper. The prompt says the paper will be submitted to a top-tier conference and asks the model to revise the paragraph so that it holds up under peer review. The four types differ only in the location sentence (Appendix B.4). The original paragraph is the human reference: it expresses the same content, written by the authors without LLM involvement. We measure the original and the rewrites in the same way, so the difference between them is the change the model introduces. 2.2 Writing from Evidence We build an evidence sheet for each paper (Appendix B.2). Kimi-K2.6 extracts it from the related-work, method, and experiment sections and the tables. The sheet keeps only facts: the task, the method, prior work, the setup, and every reported result with exact numbers, including results where a baseline wins or ties. It drops the authorsâ interpretations, novelty claims, and evaluative words. We use the 16 papers that propose a method. The model receives only the sheet and writes each of the four paragraph types in a separate call. The prompt names a top-tier venue and forbids inventing results, numbers, or citations; it does not mention review. The human reference is the authorsâ paragraph of the same type, written from the same experiments. 2.3 Writers We use 12 models as writers. The GPT series contributes eight versions, in order of release: GPT-4o, GPT-4.1, GPT-5.1, GPT-5.2, GPT-5.4, GPT-5.5, GPT-5.6-sol, and GPT-6-astra. Four models from other developers serve as controls: Claude Sonnet 5, Claude Opus 5.5, DeepSeek-V4-Pro, and Grok 4.7. All 12 models perform both tasks. GPT-5.1 and later versions run with high reasoning effort, so differences across GPT versions reflect both the model and its reasoning setting. Claude Opus 5.5 runs with extended thinking only in the prompt-context and multi-round experiments, so we compare it only within each experiment (Appendix B.3). 2.4 Measuring Defensive Writing We define defensive writing as narrowing or questioning claims without support in the material the writer was given. It differs from ordinary caution. Ordinary caution points to limitations that exist in the evidence, so readers learn where a conclusion holds. A defensive qualification has no source; it only makes the claim harder to fault. Whether a qualification is defensive therefore depends on whether the material the writer had supports it. Defensive writing takes two forms: adding ungrounded qualifications to the text, and retreating from the authorsâ claims by weakening, scoping, or retracting them. We measure the first with sentence coding and the second with claim tracking. DeepSeek-V4-Flash is the coder for both. It does not know who wrote a text, and it codes the authorsâ originals and the model texts in the same way. Sentence coding. The coder reads the text sentence by sentence, checks it against the source paragraph or evidence sheet the writer had, and gives each sentence one of seven labels: â not-shown statement, saying the results do not show a conclusion or prescribing how they should be read, e.g., âthese gains do not by themselves establish that âŠâ; ⥠ungrounded doubt, raising a limitation, confound, or missing check that is not in the source; âą grounded limitation, stating a limitation, condition, or unfavorable result that is in the source; ⣠generic scope, restricting a claim to âthe evaluated settingsâ without naming them; †future work; â„ claim; and ⊠other. A sentence that fits several labels gets the lowest number. Labels â , âĄ, and ⣠all restrict or question a claim without support in the source. We call them ungrounded qualifications, U=â ,âĄ,âŁU=\â ,âĄ,âŁ\. Let TwT_w be the texts writer w produces in one condition, |t||t| the number of words in text t, and ââĄ(s) (s) the label of sentence s. The main measure is the number of ungrounded qualifications per 100 words, RUâ(w)=100â âtâTwâsât[â(s)âU]âtâTw|t|,R_U(w)=100· _tâ T_w _sâ t1[ (s)â U] _tâ T_w|t|, (1) and the share of texts with at least one, PU(w)=1|Tw|âtâTw[âsât:â(s)âU].P_U(w)= 1|T_w| _tâ T_w1 [â\,sâ t:\ (s)â U ]. (2) Replacing U with â \â \ gives Râ â(w)R_â (w), the rate of not-shown statements, the strongest form of defensive writing. RUR_U measures how a text qualifies claims relative to the material the writer had, not whether a qualification is scientifically justified; RQ3 examines that question with the evidence of the whole paper. Because the originals are coded in the same way, repeating the authorsâ own qualifications usually adds little to RUR_U. Claim tracking. Claim tracking applies only to rewriting. The coder lists the claims CpC_p in each original paragraph p, then judges how the rewrite by writer w treats each claim c. The status Ïwâ(c) _w(c) is one of kept, strengthened, weakened, scoped to the tested settings, retracted, or dropped. A claim is scoped when the rewrite still asserts it but limits it to the tested settings, as in âon these benchmarks, our method outperforms âŠâ. It is retracted when the rewrite states that the claim, as the authors made it, does not hold or has not been shown, or that it holds only in a narrower form. The difference is whether the rewrite explicitly denies the authorsâ version. With C=âpCpC= _pC_p the claims of all original paragraphs, the retraction rate measures how far the model negates the authors, and the softening rate measures how far it tones them down: RetâĄ(w) (w) =1|C|âcâC[Ïw(c)=retracted], = 1|C| _câ C1[ _w(c)=retracted], (3) SoftâĄ(w) (w) =1|C|âcâC[Ïw(c)âS], = 1|C| _câ C1[ _w(c)â S], (4) where S=weakened,scopedS=\weakened,scoped\. We also report the share of paragraphs in which at least one claim is retracted. Validation. The coder labels 97% of planted ungrounded qualifications as U and 6% of planted claims and limitations; a second coder agrees on U with Îș=0.66Îș=0.66 (Appendix C.2). Two other trackers also give GPT-6-astra the most retractions but agree less on which claims (Appendix C.3). All 95% confidence intervals come from 1,000 bootstrap resamples of papers, keeping all paragraphs of a drawn paper. Each model writes one output per input. Label definitions and the full coder prompt are in Appendix C.1. 3 Experimental Results 3.1 RQ1: Does GPT Write Defensively? Rewriting Writing from evidence RUR_U RUR_U Writer Nov Con Res Dis Ret % Soft % Nov Con Res Dis Authors (original) 0.11 0.00 0.04 0.00 â â 0.14 0.03 0.15 0.38 GPT-4o 0.00 0.03 0.04 0.00 0.2 15 0.00 0.00 0.00 0.04 GPT-4.1 0.13 0.04 0.11 0.05 0.2 14 0.06 0.00 0.11 0.05 GPT-5.1 0.12 0.00 0.07 0.08 0.6 15 0.09 0.00 0.02 0.06 GPT-5.2 0.10 0.04 0.10 0.18 0.6 24 0.00 0.03 0.04 0.00 GPT-5.4 0.24 0.00 0.17 0.12 0.6 20 0.03 0.00 0.10 0.04 GPT-5.5 0.29 0.07 0.47 0.32 0.6 28 0.03 0.00 0.06 0.09 GPT-5.6-sol 0.23 0.04 0.48 0.55 0.6 27 0.00 0.04 0.12 0.22 GPT-6-astra 0.81 0.32 1.30 1.32 7.9 38 0.12 0.07 0.52 0.98 Claude Sonnet 5 0.08 0.04 0.20 0.09 0.6 15 0.16 0.00 0.10 0.13 Claude Opus 5.5 0.11 0.00 0.08 0.00 0.4 12 0.05 0.00 0.00 0.05 DeepSeek-V4-Pro 0.12 0.00 0.04 0.05 0.2 8 0.03 0.00 0.02 0.18 Grok 4.7 0.22 0.04 0.18 0.54 1.0 17 0.00 0.04 0.10 0.09 Table 1: Ungrounded qualifications per 100 words (RUR_U) by paragraph type, and the share of the authorsâ claims retracted (Ret) or softened (Soft) in rewriting, pooled over the four types. Nov = novelty, Con = contribution, Res = result analysis, Dis = discussion. Bold marks the highest model value. Figure 2: RUR_U pooled over the four paragraph types (left axis; dotted line: authorsâ originals in rewriting) and the share of the authorsâ claims softened or retracted in rewriting (right axis). Error bars are 95% CIs. We ask the 12 models to perform both tasks of Section 2 with the default prompts and code their texts with the measures of §2.4. Table 1 and Figure 2 give the results. Later GPT versions add ungrounded qualifications. Compared with the authorsâ originals, GPT-4o through GPT-5.2 rarely add ungrounded qualifications when rewriting. They increase from GPT-5.4 and clearly from GPT-5.5 and GPT-5.6-sol, where 40â60% of rewritten result-analysis paragraphs contain at least one. GPT-6-astra adds the most, in almost every result-analysis paragraph. The rise comes mostly from not-shown statements; generic scope, which can be a fair statement of the tested range, rises much less (Appendix D.1). Claude and DeepSeek add almost none, and Grok adds them mainly in discussion paragraphs. Softening grows with version. From GPT-5.2 on, the share of the authorsâ claims that are weakened or scoped is clearly higher than in earlier versions, and GPT-6-astra is highest. All four controls stay below the GPT versions from GPT-5.2 on (Figure 2). GPT-6-astra goes further and negates the authors. The other models almost never retract an authorâs claim. GPT-6-astra retracts claims in every paragraph type, and in about 40% of result-analysis paragraphs it retracts at least one. In Figure 4a, GPT-6-astra turns the authorsâ explanation of a result into a statement that the comparisons do not establish it, while GPT-5.5 adds only a scoping phrase. A retraction is not always defense: checked against the full paper, the same retraction in its P5 rewrite is warranted (§3.3). GPTâs defense thus has two layers: softening grows gradually across the series, while negating the authors arrives with GPT-6-astra. Writing from evidence, GPT-6-astra still adds the most. The gaps between models are smaller than in rewriting, but GPT-6-astra still stands out. It adds the most ungrounded qualifications in result analysis and discussion, with at least one in every discussion paragraph. Since the sheet lists every result, including unfavorable ones, a lack of results does not explain these qualifications. In this condition the authorsâ paragraphs score high on ungrounded doubt, because the authors know more than the evidence sheet contains, so we mainly compare models with each other. 3.2 RQ2: What Triggers Defense? Figure 3: Ungrounded qualifications per 100 words (RUR_U) under prompt contexts P1âP9, pooled over the four paragraph types. Shading marks the contexts that ask for revision under review. P8 and P9 ask for revision without mentioning review and were run later; hollow markers are GPT versions. Error bars are 95% CIs. RUR_U Ret % Writer R1 R2 R3 R1 R2 R3 Reviewârevise GPT-5.5 0.95 1.23 1.10 10.8 14.5 10.2 GPT-5.6-sol 1.42 1.62 1.44 18.3 24.3 19.1 GPT-6-astra 1.87 1.61 1.67 25.3 21.4 17.4 Claude Opus 5.5 0.54 0.64 0.70 1.2 2.5 4.6 Polish only GPT-5.6-sol 0.07 0.07 0.03 0.2 0.0 0.2 GPT-6-astra 0.04 0.02 0.03 0.2 0.2 0.2 Claude Opus 5.5 0.03 0.03 0.05 0.6 0.2 0.2 Table 2: Multi-round revision over rounds R1âR3, measured against the authorsâ original paragraph. Further measures are in Appendix D.3. The default prompt of §3.1 asks for a paragraph that holds up under peer review. We hypothesize that defense is a response to this request: the model expects the text to be attacked and retracts claims on the reviewerâs behalf in advance. If so, two things should follow. First, defense should disappear when the prompt does not mention review, and its strength should change with the way review is invoked. Second, defense should grow once the model actually receives review comments. We test the first by varying the context of the prompt and the second with multi-round revision. Varying the prompt context. We place the same revision request in seven contexts. P1 asks only for polishing, P2 for polishing an internal technical report, and P3 for polishing a submission to a top-tier conference. P4âP7 keep the submission context and invoke review in different ways: P4 asks that the paragraph hold up under peer review, P5 that it address the concerns a reviewer is likely to raise, and P6 that it maximize the chance of acceptance; P7 repeats P4 with a warning that reviewers are harsh. All prompts share one template that forbids new results, numbers, or citations (Appendix B.4), so we compare only within this experiment. The writers are five GPT versions and Claude Opus 5.5. Figure 3 gives the results. Polishing adds no defense. Under P1âP3, every model stays at the level of the authorsâ originals, including GPT-6-astra. When all 12 models are asked only to âpolish this paragraphâ, none of them adds ungrounded qualifications either (Appendix D.2). As soon as the prompt mentions review, ungrounded qualifications rise, and the share of the authorsâ claims that are softened grows from 3â11% under P1âP3 to 14â33% under P4, P5, and P7 (Appendix D.2). Models defend against criticism, not for acceptance. Of the three ways of invoking review, P5, which asks the model to address the concerns a reviewer is likely to raise, is the strongest; even GPT-4o and Claude Opus 5.5 add qualifications under it. P6 raises the same stakes by asking to maximize the chance of acceptance, yet it triggers much less. P7, which warns that reviewers are harsh, is similar to or stronger than P4. Anticipated criticism raises defense more than the goal of acceptance does. Retraction of the authorsâ claims remains largely confined to GPT-6-astra. Revising for accuracy also triggers defense. P1âP3 ask for polishing and P4âP7 for revision, so the comparison mixes review with revision. Two revision requests without review separate them: P8 asks for a scientifically accurate paragraph, and P9 asks that each claim be stated as strongly as the evidence warrants. We run them with GPT-6-astra, GPT-5.5, and Claude Opus 5.5, and rerun P4 for the two GPT versions at the same time; the rerun gives values close to the original run. Under P8, GPT-5.5 and Claude add as many ungrounded qualifications as under P4, and GPT-6-astra reaches about 80% of its P4 level and retracts as often. P9 triggers less in GPT-6-astra, but far more than polishing. A request to check the claims thus triggers most of the defense, and naming a reviewerâs concerns adds more. Newer GPT versions are more sensitive to review. Under the same prompts, GPT-4o responds only to the explicit concerns of P5. From GPT-5.5 on, P4 alone is enough, and GPT-6-astra responds most strongly. Claude Opus 5.5 responds about as much as GPT-5.2. Multi-round revision. The writer reviews the paragraph as a peer reviewer, listing its main weaknesses, and then revises it to address the review; the next round reviews the previous output, for three rounds. The revision prompt states that no new experiments can be run and forbids new results, numbers, analyses, or citations. In the control chain the writer only polishes the paragraph in each round. We run reviewârevise chains with three recent GPT versions and Claude Opus 5.5, and polish-only chains with the same writers except GPT-5.5. Every round is coded and tracked against the authorsâ original paragraph, so doubts raised in the review also count as ungrounded: they come from the modelâs own review, not from evidence. Since the prompt asks the model to address the review, some qualifications are expected; the chains test whether a writer goes further and retracts the authorsâ claims. Table 2 gives the results. Under the same review, GPT versions retract and Claude does not. In polish-only chains, defense stays at the level of the originals for all three rounds. After one reviewârevise round, the three GPT versions add far more ungrounded qualifications than in Table 1 and retract 11 to 25% of the authorsâ claims, although GPT-5.5 and GPT-5.6-sol almost never retract in single rewrites. Where the authors write âthis network has better stability propertiesâ, the revision reads âwe therefore do not claim that the proposed formulation has better stability propertiesâ. Claude Opus 5.5 goes through the same procedure and also adds qualifications, but retracts only 1.2% of the claims. From the first to the third round, the number of ungrounded qualifications per paragraph rises for all four writers, and the paragraphs grow to two to three times their original length (Appendix D.3). Summary. The first prediction holds only in part, and the second in a form the chains partly build in: once review comments arrive, every writer adds qualifications, but only the GPT versions go on to retract many of the authorsâ claims. GPTâs defense is absent when polishing and appears whenever the model is asked to check the claims, whether for review or for accuracy. It is strongest when the prompt names a reviewerâs concerns, and it rises quickly and stays high once review comments arrive. Anticipated review is therefore the strongest trigger we find, but not the only one. This also fits writing from evidence: the evidence prompt does not mention review, but it asks GPT-6-astra to draw the conclusions itself, and it still defends (§3.1). 3.3 RQ3: Is the Caution Warranted? When rewriting, the model sees a single paragraph. The authors may have overstated their claims, and the modelâs retreat may correct real overclaiming. If so, two things should hold. First, what GPT retracts should be mostly overstated. Second, it should leave supported claims intact. Whether a claim is overstated depends on the evidence of the whole paper, so we check GPT-6-astraâs P5 rewrites, which retract the most claims in single rewrites, against the full papers. Checking claims against the full papers. Two PhD students annotate independently (Appendix D.5). Each reads the full paper, blind to the writer and prompt. They judge the 46 claims that claim tracking marks as retracted in GPT-6-astraâs P5 rewrites, mixed with 12 it keeps or softens. For each claim, they judge whether the paperâs results support it as stated (supported), only in a weaker form (overstated), refute it (contradicted), or neither, because it explains a result (interpretation). For each rewrite, they judge what it does to the claim and whether the change is warranted. They agree with Îș from 0.68 to 0.83. Most retractions are warranted. Both annotators find that the rewrite changes 48 of the 58 claims; both judge 28 changes warranted and 10 unnecessary. All 20 changes to claims both find overstated or contradicted are warranted, and all 4 changes to claims both find supported are unnecessary; of 15 changes to interpretations, 6 are warranted and 4 unnecessary. Both call 18 changes retractions: 8 of overstated or contradicted claims, 8 of interpretations, and none of supported claims; 13 are warranted and 1 unnecessary. One unnecessary change is the eLife example from the introduction: the paperâs readability scores confirm that eLife summaries simplify more, yet GPT-6-astra writes instead that âauthorship and length alone do not establish the degree of simplificationâ. By contrast, both judge warranted its P5 retraction of the ALTI explanation shown in Figure 4a, since the paper never separates input length from other dataset characteristics. An evidence-sheet judge does not replace this check. We also label all 482 claims of the original paragraphs with an LLM judge that sees only the evidence sheet (Appendix C.4). Two other PhD students who labeled 40 of these claims agree with 9 of its 12 supported labels but with none of its 12 overstated labels. We therefore draw no conclusions from its labels and report them in Appendix D.4. The added qualifications are mostly redundant. The annotators also judge 60 ungrounded qualifications from P5 rewrites (36 by GPT-6-astra, 12 each by GPT-5.5 and Claude Opus 5.5). Both judge 36 redundant: not wrong, but telling a careful reader nothing new, often because the original already scoped or hedged the claim. Both judge 16 warranted and 3 wrong. Summary. GPT-6-astraâs retractions fall on overstated claims and explanations, never on claims both annotators find supported, so the first explanation fits its retreat. Defense lies mainly in the added qualifications, most of which are redundant, and in the few changes to supported claims. 3.4 RQ4: Reviewers and Readers Writer Overall Soundness Overclaim Overhedged GPT-5.5 +1.29 +1.49 â-0.24 +0.04 [1.07,1.51] [1.20,1.73] [â-0.41,â-0.05] [â-0.01,0.10] GPT-5.6-sol +0.99 +1.20 â-0.19 +0.06 [0.76,1.22] [0.94,1.49] [â-0.33,â-0.04] [0.03,0.11] GPT-6-astra +1.22 +1.84 â-0.42 +0.21 [0.99,1.46] [1.55,2.17] [â-0.58,â-0.28] [0.12,0.29] Opus 5.5 +0.69 +0.67 â-0.02 +0.02 [0.42,0.97] [0.38,0.95] [â-0.18,0.12] [â-0.02,0.07] Table 3: AI review of P5 minus P1 rewrites by the same writer. Overall and Soundness are scores from 1 to 10; Overclaim and Overhedged are weaknesses per review. Values average the two reviewer models; brackets are 95% CIs. Rating P1 P5 P5 â- P1 Ease of reading 5.75 5.05 â-0.70 [â-0.95, â-0.45] Flow 6.05 5.25 â-0.80 [â-1.05, â-0.55] Effort 2.55 3.60 +1.05 [0.75, 1.35] Claim identifiable 6.10 5.78 â-0.33 [â-0.53, â-0.12] Author certainty 4.35 3.38 â-0.97 [â-1.20, â-0.75] Comprehension (%) 100 100 0 Table 4: Human readersâ ratings of GPT-6-astraâs P1 and P5 rewrites. Author certainty is rated from 1 to 5 and the other ratings from 1 to 7; higher effort means harder. Comprehension is the share of correct answers to two questions per paragraph. Brackets are 95% intervals (Appendix E.3). We compare P1 and P5 rewrites, which differ most in defense (§3.2). The two versions differ in more than their qualifications, so for the AI reviewers we also remove only the qualifications from P5 rewrites. AI review. Two models, Claude Sonnet 5 and DeepSeek-V4-Flash, review each paragraph: they score its soundness, contribution, clarity, and overall quality from 1 to 10 and list its weaknesses. They are told to assume that the numbers in the paragraph are correct, so the scores reflect only the writing (Appendix E.1). We compare the P1 and P5 rewrites of the same writer: P1 asks only for polishing, while P5 adds the submission context and asks to address the concerns a peer reviewer is likely to raise. P5 rewrites score higher for all four writers and under both reviewer models, and for the three GPT versions soundness rises most (Table 3). The soundness criterion asks whether the claims match the evidence the paragraph presents, so a reviewer that follows it should reward a claim narrowed to that evidence. The question is whether reviewers also reward qualifications that a careful reader does not need. The reviews show what the scores reward. By category of the listed weaknesses, the three GPT versionsâ P5 rewrites are criticized less often for overclaiming (Appendix E.1). GPT-6-astraâs P5 rewrites are criticized more often for being overly cautious, yet the reviews that say so still score them above its P1 rewrites. Claude Opus 5.5âs P5 rewrites score higher without fewer overclaiming criticisms, so its higher scores have other sources. Removing only the qualifications lowers the scores. Grok 4.7, which is not a reviewer, deletes only the qualifying part of every sentence in U of each P5 rewrite and adds no content, which lowers RUR_U by 76 to 93% (Appendix E.2). Across 144 pairs from the four writers, both reviewer models score the trimmed versions lower on all four aspects. On average, overall drops by 0.82 [0.70, 0.95] and soundness by 1.12 [0.97, 1.29]. Reviewers of the trimmed versions write that claims are broad or that limitations are not discussed. The drop grows with the share of words removed, from 0.41 when trimming removes less than 15% to 1.24 when it removes more than 23%, so part of it may reflect lost content. AI reviewers thus reward the qualifications themselves, although most of those we checked are redundant (§3.3). Human readers find P5 rewrites harder to read and the authors less certain. Four senior PhD students in computer science read GPT-6-astraâs P1 and P5 rewrites of 20 result-analysis and discussion paragraphs, seeing only one version of any paragraph. Readers did not know the source of the texts, the rewriting requests, or our hypotheses. They rated five aspects of the reading experience and answered two comprehension questions per paragraph (Appendix E.3). Readers find P5 rewrites harder to read, less coherent, and more effortful, and the largest drop is in how certain the authors appear (Table 4). Readersâ own ratings of how easily they can identify the main claim drop only slightly, and readers answer every comprehension question correctly for both versions, so this measure is at ceiling. With four readers, these results describe our participants, not readers in general. 4 Conclusion When asked to check the claims, and most strongly under anticipated review, recent GPT versions narrow the authorsâ claims beyond the material they are given. Part of this is correction: GPT-6-astraâs retractions mostly fall on overstated claims and explanations. The rest is defense: most added qualifications tell a careful reader nothing new, yet AI reviewers reward them while human readers find the rewrites harder to read. Authors who revise with GPT for review should check its qualifications against their own evidence, and AI review scores should not be used to select or train revisions without the same check. Limitations Our study has several limitations. First, the sample is small and covers only four paragraph types in English computer science papers; defensive writing in other fields, other languages, and full papers remains to be tested. Second, sentence coding and claim tracking rely on an LLM. The insertion test and the second coder show that sentence coding is reliable, but coders agree less on whether a claim is retracted, so the absolute retraction rates should be read with caution. Sentence coding measures whether a qualification is grounded in the material the writer had, not whether it is scientifically justified. The check against the full papers covers only P5 rewrites, mainly GPT-6-astraâs, and has two annotators, who call fewer changes retractions than the claim tracker; the evidence-sheet judge is not reliable enough to replace it. Third, closed models are updated over time, and our results reflect the versions available at the time of the experiments. Each model writes one output per input, and the GPT versions differ in reasoning settings as well as in the model. The revision controls P8 and P9 cover only three writers and were run later than the other contexts. We observe only model behavior and cannot tell which aspects of training lead to defensive writing. Fourth, the AI review uses only two reviewer models and does not stand for real peer review. One reviewer, Claude Sonnet 5, comes from the same developer as one of the writers, and we did not score the authorsâ originals, so we cannot tell whether P5 rewrites also score above them. The minimal pairs isolate the qualifications only for AI reviewers, and trimming also shortens the text; the reader study compares P1 and P5 rewrites as a whole. Fifth, the human reader study is small: four readers read only the two rewrites by GPT-6-astra. Readers answered every comprehension question correctly for both versions, so the questions cannot detect finer differences in understanding, and we did not score readersâ restatements of the main claim. Ethical Considerations Human participants. The annotators of the claim-support checks (Appendices C.4 and D.5) and the four readers (Appendix E.3) are PhD students in computer science who volunteered without payment. Before taking part, they were told the purpose of the task and that their answers would be used for research, and they agreed to take part; they could stop at any time. The tasks consist of reading paragraphs from published computer science papers and pose minimal risk. We did not seek approval from an ethics review board. We report only aggregate ratings and labels. Data. The source paragraphs come from 20 published papers (Table 5), which we cite and use only for analysis. They contain no personal information beyond what the published papers state. Risks. Our results describe specific model versions under our prompts and should not be read as showing that caution in scientific writing is undesirable: grounded limitations are part of good writing, and many retractions we check are warranted. The minimal pairs remove qualifications only to test AI reviewers; we do not recommend removing qualifications from papers. A possible misuse of our findings is to strip caveats to raise AI review scores, which our results do not support. The experiments use commercial APIs and one locally run model, with a modest computational cost. Use of AI assistants. Apart from the models we study, we used AI assistants to help write code for the experiment pipeline and to edit the text of this paper. The authors checked the code, the results, and the final text. References Farkas et al. (2010) R. Farkas, V. Vincze, G. MĂłra, J. Csirik, and G. Szarvas The CoNLL-2010 shared task: learning to detect hedges and their scope in natural language text. In Proceedings of the Fourteenth Conference on Computational Natural Language Learning â Shared Task, p. 1â12. External Links: Link Cited by: §A.1, §1. Ferrando et al. (2022) J. Ferrando, G. I. GĂĄllego, and M. R. Costa-jussĂ Measuring the mixing of contextual information in the transformer. In Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, p. 8698â8714. Cited by: Figure 4. Hyland (1996) K. Hyland Writing without conviction? hedging in science research articles. Applied Linguistics 17 (4), p. 433â454. External Links: Document Cited by: §A.1, §1. Hyland (2005) K. Hyland Stance and engagement: a model of interaction in academic discourse. Discourse Studies 7 (2), p. 173â192. External Links: Document Cited by: §A.1. Kim et al. (2023) Y. Kim, L. Guo, B. Yu, and Y. Li Can ChatGPT understand causal language in science claims?. In Proceedings of the 13th Workshop on Computational Approaches to Subjectivity, Sentiment, & Social Media Analysis, p. 379â389. External Links: Document, Link Cited by: §A.1. Lee et al. (2022) M. Lee, P. Liang, and Q. Yang CoAuthor: designing a human-AI collaborative writing dataset for exploring language model capabilities. In Proceedings of the 2022 CHI Conference on Human Factors in Computing Systems, External Links: Document, Link Cited by: §A.2. Li et al. (2017) Y. Li, J. Zhang, and B. Yu An NLP analysis of exaggerated claims in science news. In Proceedings of the 2017 EMNLP Workshop: Natural Language Processing meets Journalism, p. 106â111. External Links: Document, Link Cited by: §A.1. Liang et al. (2024a) W. Liang, Z. Izzo, Y. Zhang, H. Lepp, H. Cao, X. Zhao, L. Chen, H. Ye, S. Liu, Z. Huang, D. McFarland, and J. Y. Zou Monitoring AI-modified content at scale: a case study on the impact of ChatGPT on AI conference peer reviews. In Proceedings of the 41st International Conference on Machine Learning, Proceedings of Machine Learning Research, Vol. 235, p. 29575â29620. External Links: Link Cited by: §A.3, §1. Liang et al. (2024b) W. Liang, Y. Zhang, Z. Wu, H. Lepp, W. Ji, X. Zhao, H. Cao, S. Liu, S. He, Z. Huang, D. Yang, C. Potts, C. D. Manning, and J. Y. Zou Mapping the increasing use of LLMs in scientific papers. External Links: 2404.01268, Link Cited by: §A.2, §1. Liang et al. (2024c) W. Liang, Y. Zhang, H. Cao, B. Wang, D. Y. Ding, X. Yang, K. Vodrahalli, S. He, D. S. Smith, Y. Yin, D. A. McFarland, and J. Zou Can large language models provide useful feedback on research papers? a large-scale empirical analysis. NEJM AI 1 (8). External Links: Document Cited by: §A.3. Liu et al. (2023) Y. Liu, D. Iter, Y. Xu, S. Wang, R. Xu, and C. Zhu G-eval: NLG evaluation using gpt-4 with better human alignment. In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, H. Bouamor, J. Pino, and K. Bali (Eds.), Singapore, p. 2511â2522. External Links: Link, Document Cited by: §A.3. Lu et al. (2024) C. Lu, C. Lu, R. T. Lange, J. Foerster, J. Clune, and D. Ha The AI scientist: towards fully automated open-ended scientific discovery. External Links: 2408.06292, Link Cited by: §A.2. Mao et al. (2020) H. Mao, Z. Zhang, Z. Xiao, Z. Gong, and Y. Ni Learning agent communication under limited bandwidth by message pruning. In Proceedings of the AAAI Conference on Artificial Intelligence, p. 5142â5149. Cited by: Figure 4. Moore (2026) O. Moore The top 100 gen AI consumer apps, 7th edition. Note: Andreessen Horowitz External Links: Link Cited by: §1. Moosavi et al. (2021) N. S. Moosavi, A. RĂŒcklĂ©, D. Roth, and I. Gurevych Learning to reason for text generation from scientific tables. External Links: 2104.08296, Link Cited by: §A.2. Panickssery et al. (2024) A. Panickssery, S. R. Bowman, and S. Feng LLM evaluators recognize and favor their own generations. External Links: 2404.13076, Link Cited by: §A.3. Russo et al. (2025) G. Russo, M. Horta Ribeiro, T. R. Davidson, V. Veselovsky, and R. West The AI review lottery: widespread AI-assisted peer reviews boost paper scores and acceptance rates. Proceedings of the ACM on Human-Computer Interaction 9 (7), p. 1â28. External Links: Document Cited by: §A.3, §1. Schick et al. (2022) T. Schick, J. Dwivedi-Yu, Z. Jiang, F. Petroni, P. Lewis, G. Izacard, Q. You, C. Nalmpantis, E. Grave, and S. Riedel PEER: a collaborative language model. External Links: 2208.11663, Link Cited by: §A.2. Simon et al. (2025) F. M. Simon, R. K. Nielsen, and R. Fletcher Generative AI and news report 2025: how people think about AIâs role in journalism and society. Technical report Reuters Institute for the Study of Journalism. External Links: Document, Link Cited by: §1. Szarvas et al. (2008) G. Szarvas, V. Vincze, R. Farkas, and J. Csirik The BioScope corpus: annotation for negation, uncertainty and their scope in biomedical texts. In Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing, p. 38â45. External Links: Link Cited by: §A.1. Wadden et al. (2020) D. Wadden, S. Lin, K. Lo, L. L. Wang, M. van Zuylen, A. Cohan, and H. Hajishirzi Fact or fiction: verifying scientific claims. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), B. Webber, T. Cohn, Y. He, and Y. Liu (Eds.), Online, p. 7534â7550. External Links: Link, Document Cited by: §A.1. Wang et al. (2022) A. Wang, R. Y. Pang, A. Chen, J. Phang, and S. R. Bowman SQuALITY: building a long-document summarization dataset the hard way. In Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, p. 1139â1156. Cited by: Figure 4. Wang et al. (2024) P. Wang, L. Li, L. Chen, Z. Cai, D. Zhu, B. Lin, Y. Cao, L. Kong, Q. Liu, T. Liu, and Z. Sui Large language models are not fair evaluators. In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), L. Ku, A. Martins, and V. Srikumar (Eds.), Bangkok, Thailand, p. 9440â9450. External Links: Link, Document Cited by: §A.3. Wang et al. (2020) Q. Wang, Q. Zeng, L. Huang, K. Knight, H. Ji, and N. F. Rajani ReviewRobot: explainable paper review generation based on knowledge synthesis. In Proceedings of the 13th International Conference on Natural Language Generation, p. 384â397. External Links: Document, Link Cited by: §A.3. Yu et al. (2019) B. Yu, Y. Li, and J. Wang Detecting causal language use in science findings. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), K. Inui, J. Jiang, V. Ng, and X. Wan (Eds.), Hong Kong, China, p. 4664â4674. External Links: Link, Document Cited by: §A.1, §1. Yu et al. (2020) B. Yu, J. Wang, L. Guo, and Y. Li Measuring correlation-to-causation exaggeration in press releases. In Proceedings of the 28th International Conference on Computational Linguistics, D. Scott, N. Bel, and C. Zong (Eds.), Barcelona, Spain (Online), p. 4860â4872. External Links: Link, Document Cited by: §A.1. Yuan et al. (2022) W. Yuan, P. Liu, and G. Neubig Can we automate scientific reviewing?. Journal of Artificial Intelligence Research 75, p. 171â212. External Links: Document, Link Cited by: §A.3. Zhang and Feng (2022) S. Zhang and Y. Feng Information-transport-based policy for simultaneous translation. In Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, p. 992â1013. Cited by: Figure 4. Zheng et al. (2023) L. Zheng, W. Chiang, Y. Sheng, S. Zhuang, Z. Wu, Y. Zhuang, Z. Lin, Z. Li, D. Li, E. P. Xing, H. Zhang, J. E. Gonzalez, and I. Stoica Judging LLM-as-a-judge with MT-bench and chatbot arena. External Links: 2306.05685, Link Cited by: §A.3, §A.3. Appendix A Related Work A.1 Hedging, Stance, and Scientific Claim Strength Scientific writing communicates both findings and the authorâs commitment to them. Hyland (1996) describes hedging as a resource for expressing precision and caution while anticipating objections; his account of stance and engagement places hedges alongside boosters and other ways of positioning claims for readers (Hyland, 2005). Computational work makes these commitments explicit at several levels. BioScope annotates negation and uncertainty cues together with their linguistic scope (Szarvas et al., 2008), and CoNLL-2010 evaluates uncertain-sentence detection and hedge scope resolution (Farkas et al., 2010). These tasks distinguish whether a statement expresses uncertainty and which proposition is affected. A separate line examines the strength of scientific assertions: Li et al. (2017) analyze exaggerated claims in science reporting, Yu et al. (2019) classify causal language in research conclusions, and Yu et al. (2020) compare causal claim strength in papers and press releases. Kim et al. (2023) extend causal-language classification to ChatGPT, finding particular difficulty with conditional causal claims mitigated by hedges. Together, these studies provide distinctions between uncertainty, negation, association, and causal commitment that matter when a text is rewritten. Claim strength and evidential support are related but different questions. Scientific claim verification, exemplified by SciFact, pairs claims with supporting or refuting abstracts and identifies evidence rationales (Wadden et al., 2020). Detecting a weaker assertion does not by itself show that the change improves its fit to the evidence: a qualification can correct overclaiming, preserve a genuine limitation, or introduce a doubt that the source does not raise. Conversely, the presence of confident language does not establish that a claim is overstated. Our study brings these questions together in revision. Sentence coding compares qualifications with the material available to the writer, while claim tracking records how a rewrite treats the authorsâ assertions and explanations. A separate claim-support judgment checks whether retreat falls on supported, overstated, or interpretive claims. This source-based comparison is essential to the distinction between ordinary caution and defensive writing. Rather than treating every hedge or negation as undesirable, we examine which commitments change, what evidence motivates the change, and whether anticipated criticism induces retreat even where the supplied material provides no reason for it. A.2 LLMs for Scientific Writing and Revision Language-model writing support includes generating new text and modifying text that an author has already written. CoAuthor records human interactions with GPT-3 during creative and argumentative writing, allowing suggestions and their uptake to be studied as part of a collaborative process (Lee et al., 2022). PEER models drafting, suggestions, edits, and explanations of edits rather than only predicting a finished document (Schick et al., 2022). Neither task is specific to scientific evidence, but both establish revision as a distinct interaction in which the authorâs existing text constrains what the model should do. In scientific generation, SciGen studies reasoning over tables when producing descriptions of results (Moosavi et al., 2021); The AI Scientist combines experiments, manuscript writing, and simulated review in an automated workflow (Lu et al., 2024). These settings require a model to move from results to an account of their meaning. Corpus-level estimates of LLM modification in published and preprint writing further document the scale at which generated or revised language enters scientific communication (Liang et al., 2024b). Such prevalence estimates identify adoption, whereas controlled revision tasks can examine what changes within an individual passage. Our experiments distinguish rewriting an authorâs paragraph from writing with an evidence sheet. In rewriting, the original fixes the findings and interpretations against which additions, softening, retraction, and omission can be compared. Writing from evidence asks whether the same tendency appears when no author-written paragraph is available to revise. This differs from assessing fluency or factual reproduction alone: retaining every number can coexist with withdrawing the explanation those numbers supported in the original account. The prompt comparisons also separate ordinary polishing, a publication context, anticipated reviewer concerns, and acceptance-oriented requests. Repeated reviewârevision then tests how the text changes when criticism is supplied rather than merely anticipated. Prior collaborative writing and scientific generation systems motivate these uses, but their task objectives do not resolve whether a reviewer-oriented request preserves an authorâs intended claim strength. Our contribution is a controlled analysis of that transformation across writers and instructions, with the source retained as the reference throughout successive revisions. The comparison concerns changes to communicated scientific commitments, not whether a model can produce a fluent paper-shaped text. A.3 Automated Peer Review and Evaluation Biases Automated review research examines both the comments a system produces and the judgments it assigns. ReviewRobot generates category-specific scores and evidence-linked comments using knowledge graphs from a target paper and related literature (Wang et al., 2020). Yuan et al. (2022) frame review generation as targeted summarization and identify constructiveness and factuality as central challenges. With GPT-4, Liang et al. (2024c) compare generated comments with human reviews and study researchersâ assessments of feedback on their own manuscripts. Corpus analyses estimate LLM modification in conference reviews (Liang et al., 2024a); Russo et al. (2025) use detector-based and quasi-experimental analyses to examine associations with review scores and acceptance. These studies concern review assistance and its consequences, rather than establishing that an AI score is an objective measure of scientific quality. More broadly, G-Eval uses structured LLM judgments for text-generation evaluation (Liu et al., 2023), while MT-Bench and Chatbot Arena examine agreement with human preferences and limitations of LLM judges (Zheng et al., 2023). This work makes model evaluation useful to study, but also makes its criteria and biases part of the empirical question. Several findings caution against interpreting an evaluatorâs preference as evidence that a revision communicates science better. Wang et al. (2024) demonstrate position bias in pairwise evaluation, and Panickssery et al. (2024) investigate evaluatorsâ ability to recognize and favor their own generations. Zheng et al. (2023) additionally discuss verbosity and self-enhancement biases. These mechanisms are distinct from rewarding defensive qualifications; they do not establish the mechanism examined here. They do, however, show why changes in reviewer scores require an account of what the reviewer rewards. Our reviewer probes compare versions of the same source paragraph and examine the weaknesses listed alongside numerical scores, separating criticism of overclaiming from criticism of excessive caution. This connects review generation with the writing behavior studied in the preceding experiments: a request to anticipate criticism can alter claims before any reviewer sees the text, and an evaluator can prefer that altered presentation. The resulting scores are judgments of those passages under the specified review instructions, not evidence that their claims are better supported. The central distinction is between satisfying a reviewing criterion and preserving an evidence-grounded account of the findings. Appendix B Data and Setup B.1 Papers and Paragraphs The 20 papers come from two sources. Six come from a stratified sample of arXiv papers in cs.AI, cs.LG, and cs.CV from 2019 to 2022; we verified that each was published at a peer-reviewed venue and use its first arXiv version. The other 14 come from the main conference of EMNLP 2022, and we use their last arXiv version before the release of ChatGPT. The first arXiv versions of all 20 papers appeared between March 2019 and November 2022. We parse paragraphs from the LaTeX sources and replace citations, cross-references, and equations with [CITE], [REF], and [MATH]. A candidate paper must have author paragraphs for every task of writing from evidence and at least three paragraph types available for rewriting. We randomly draw 20 candidates and then, for each paper and type, randomly draw one paragraph of 60 to 300 words. The 77 paragraphs have 72 to 269 words, 128 on average. Table 5 lists the papers. Paper Venue arXiv Dis Evid IMEXnet ICML 2019 1903.02639 â â Message Pruning AAAI 2020 1912.05304 â â Neural TS ICLR 2021 2010.00827 â OVERT JMLR 2022 2108.01220 â â DualAfford ICLR 2023 2207.01971 â IRMCon ECCV 2022 2208.03462 â â CODER EMNLP 2112.08766 â â ALTI EMNLP 2203.04212 â â MolT5 EMNLP 2204.11817 â â LSSD EMNLP 2205.01620 â â Non-parametric ST EMNLP 2205.11211 â â SQuALITY EMNLP 2205.11465 â Model scale EMNLP 2205.12253 â Lay summarisation EMNLP 2210.09932 â Label topologies EMNLP 2210.10369 â â kNN-RE EMNLP 2210.11800 â â ITST EMNLP 2210.12357 â Dial2vec EMNLP 2210.15332 â â GenSE EMNLP 2210.16798 â â CGoDial EMNLP 2211.11617 â Table 5: The 20 source papers; all EMNLP papers are from 2022. Every paper contributes one novelty, one contribution, and one result-analysis paragraph; Dis marks the 17 papers that also contribute a discussion paragraph. Evid marks the 16 papers used for writing from evidence; all 20 have an evidence sheet. B.2 Evidence Sheets Kimi-K2.6 extracts each sheet from the related work, background, method, and experiment sections of the paper, up to 12,000 words, together with all of its tables. It returns a JSON object with seven fields: the task, the method, prior work and its stated differences from the paper, the setup, the results, the outcomes of analyses, and the conditions the authors state. The sheet is rendered as text for the writer. Writing from evidence uses the 16 papers that propose a method; of the other four, three are dataset or analysis papers and one reports its results only in figures. The extraction prompt is below, with the JSON schema omitted. Evidence extraction prompt Below are the related-work, method and experiment sections of a computer science paper. Build a neutral evidence sheet that another writer could use to write the paperâs abstract, contribution statement, positioning against prior work, result analysis and discussion. Rules: - Record facts only. Do not copy the authorsâ interpretations, explanations of why something works, speculation, claims of novelty ("first", "novel"), claims of generality, or evaluative words (strong, significant, effective, promising, superior) unless they are part of a statistical test. - Keep the authorsâ voice for what they did ("We propose ...", "Our method ..."). - Copy every number exactly. Include every quantitative result you can find, including settings where a baseline wins, ties, small or non-significant differences, and results that hold only in some settings. - For prior work, state what each work does and any concrete technical difference from this paper that the text states (e.g., "X requires labeled pairs; our method does not"). Do not add judgments such as "X fails" or "X is limited" unless it is a measured result. - Keep [CITE], [REF] and [MATH] placeholders where they belong. - Tables are the main source of numbers: report the main comparison rows with exact values (ours and the strongest baselines). Table captions may contain the authorsâ interpretation; take only settings and numbers from them. Return only a JSON object with these keys: [...] Text: text An excerpt of the rendered sheet for kNN-RE, with omitted entries marked [âŠ]: Evidence sheet excerpt (kNN-RE) Task: Relation extraction (RE) using a k-nearest-neighbor memory module over relation representations from a vanilla RE model, with optional distantly supervised (DS) memory, evaluated on supervised RE datasets. Method: [...] - We extend the method by leveraging DS examples for memory construction, building key-value pairs for all DS labeled examples with the vanilla RE model. Prior work: [...] - CP [CITE]: Pre-training method for RE. Difference: CP requires huge computation; our kNN-RE on DS does not require extra training. Results: [...] - Wiki80 test | F1: ours 87.35 (k=4, lambda=1.0); baselines PURE 86.70; CP 87.50; unnamed 86.61 (mixed). Note: kNN only: Train memory; ours is lower than CP - TACRED long-tail: per:charges | F1: ours 77.23; baselines PURE 75.14 (ours_better). Note: +2.09 Stated conditions: [...] - DS memory suffers from noise. B.3 Writer Settings GPT-5.1 and later GPT versions use high reasoning effort, and all GPT models use a temperature of 1.0. All models have a limit of 8,192 output tokens and otherwise use the providerâs default settings. Each model generates one output per input. We call the models through their providersâ APIs with the identifiers gpt-4o, gpt-4.1, gpt-5.1, gpt-5.2, gpt-5.4, gpt-5.5, gpt-5.6-sol, gpt-6-astra, claude-sonnet-5, claude-opus-5-5, deepseek-v4-pro, and grok-4.7; in every response the reported model matches the requested one. The prompt-context and multi-round experiments use Claude Opus 5.5 with extended thinking. All generations were made between September 30 and October 8, 2026. B.4 Prompts Rewriting. where is the location sentence and text the paragraph. I am submitting a paper to a top-tier machine learning / NLP / computer vision conference. Below is where. Revise it so that it holds up under peer review. text Keep placeholders such as [CITE], [REF], and [MATH]. Return only the revised paragraph. The location sentences are: novelty, âa paragraph from the introduction that positions the work against prior workâ; contribution, âthe paragraph of the introduction that states the paperâs contributionsâ; result analysis, âa paragraph from the experiments section that analyzes the resultsâ; discussion, âa paragraph that discusses what the results mean and future directionsâ. Writing from evidence. sheet is the rendered evidence sheet and task the task instruction. I am writing a paper for a top-tier machine learning / NLP / computer vision conference. Below is the evidence for my paper: the task, the method, prior work, the experimental setup, all results, analyses, and the conditions I state. sheet task Do not invent results, numbers, or citations that are not in the evidence. Keep placeholders such as [CITE] and [REF] where you cite. Return only the text. The task instructions are: abstract, âWrite the abstract of the paper (150-250 words).â; contribution, âWrite the paragraph of the introduction that states the paperâs contributions.â; novelty, âWrite a paragraph for the introduction that positions this work against prior work and explains what is new.â; result analysis, âWrite the part of the experiments section that analyzes the main results (one or two paragraphs).â; discussion, âWrite a discussion paragraph: what the results mean, their implications, and directions for future work.â Abstracts were also generated but are not analyzed in this paper. Prompt contexts (§3.2). context and request are given in Table 6. context Below is where. request text Do not add results, numbers, or citations that are not in the paragraph. Keep placeholders such as [CITE], [REF], and [MATH]. Return only the revised paragraph. Context and request P1 Please polish it. P2 I am writing an internal technical report for my research group. ⊠Please polish it. P3 I am submitting a paper to a top-tier machine learning / NLP / computer vision conference. ⊠Please polish it. P4 As P3. ⊠Revise it so that it holds up under peer review. P5 As P3. ⊠Revise it to address the concerns a peer reviewer is likely to raise. P6 As P3. ⊠Revise it to maximize the paperâs chances of acceptance. P7 As P3, followed by: Reviewers at this venue are known to be harsh and will look for any reason to reject a paper. ⊠Revise it so that it holds up under their review. P8 As P3. ⊠Revise it so that it is scientifically accurate. P9 As P3. ⊠Revise it so that each claim is stated as strongly as the evidence warrants. Table 6: Full wording of the nine prompt contexts; ââŠâ stands for âBelow is where.â Polish only. Used for the 12-model comparison in Appendix D.2 and for the polish-only chains. Please polish this paragraph from my paper. text Keep placeholders such as [CITE], [REF], and [MATH]. Return only the revised paragraph. Reviewârevise chains. Each round first sends the review prompt and then the revision prompt with the review attached. I am submitting a paper to a top-tier machine learning / NLP / computer vision conference. Below is where. Act as a peer reviewer and list the main weaknesses of this paragraph as numbered points. text Return only the numbered review points. Below is where from my paper, followed by a reviewerâs comments on it. Revise the paragraph to address the comments. Paragraph: text Reviewer comments: review You cannot run new experiments or obtain new results. Do not add results, numbers, analyses, or citations that are not in the paragraph, and do not add placeholders for them. Keep existing placeholders such as [CITE], [REF], and [MATH]. Return only the revised paragraph. Appendix C Measurement and Validation C.1 Sentence Coder The coder, DeepSeek-V4-Flash at temperature 0, receives the source the writer had and the text split into numbered sentences. A rule-based splitter breaks the text at sentence-final punctuation, but not after decimal points or common abbreviations such as âe.g.â and âet al.â The prompt labels not_shown, unsupported_doubt, grounded_limit, generic_scope, future_work, claim, and other are â â⊠in §2.4. In the prompt below, source is the original paragraph for rewriting and the rendered evidence sheet for writing from evidence. Label â depends on what a sentence does, not on whether the source already says it, so a faithful paraphrase of the authorsâ own not-shown sentence is also â . This affects few texts. For each â sentence the coder also quotes the span of the source that asserts what the sentence says is not shown, which would separate retracting a claim of the source from denying a conclusion the source never drew. The insertion test shows that it cannot make this separation reliably (Appendix C.2), so the main text merges both into â . Sentence coder prompt Below is SOURCE material that a writer had, followed by a TEXT the writer produced from it, split into numbered sentences. The text comes from a computer science research paper. Give every sentence exactly one label. If a sentence does several things, use the first label in this list that applies to any part of it: 1. not_shown: the sentence says what the evidence or results do not show, establish, imply, isolate, explain, or guarantee, or how they should not be interpreted ("alone does not establish", "should not be interpreted as", "rather than establishing general superiority", "does not by itself explain", "remains to be established"). It also covers directives on how the results should be read or interpreted ("should be interpreted as targeted stress tests", "should be read with the caveat that", "is best viewed as"). This is a statement about what can be concluded. A factual negative result is not not_shown: "our method does not outperform CP on Wiki80" or "it falls short of Fish on Cartoon" reports a result and is grounded_limit (or unsupported_doubt if SOURCE does not contain it). For not_shown sentences also give "proposition" (what is said not to be shown) and "source_quote" (an exact span of SOURCE that asserts that proposition, or "" if SOURCE does not assert it). 2. unsupported_doubt: the sentence names a limitation, confound, alternative explanation, or needed validation that SOURCE does not contain ("although training costs may differ", "confirming this would require controlled ablations"). 3. grounded_limit: the sentence states, anywhere in it, a limitation, cost, requirement, condition, or a mixed or unfavorable result (the method trails, ties, or only marginally beats a baseline somewhere) that SOURCE contains. A sentence that mostly reports a win but adds "although Fish is best on average" is grounded_limit. 4. generic_scope: the sentenceâs only qualification narrows a claim to the evaluated, tested, or reported settings without naming them ("in the evaluated settings, X improves Y", "within the scope of these experiments"). A phrase asserting breadth, such as "consistently outperforms across all evaluated settings", is a claim, not generic_scope. A sentence that names specific datasets, settings, or conditions is not generic_scope. 5. future_work: the sentence proposes future work or open directions. 6. claim: the sentence reports a favorable result or states a claim, interpretation, or contribution, with none of the above. 7. other: background, method or setup description, transitions. SOURCE: source TEXT: sentences Return only a JSON object with one entry per sentence, in order: "sentences": ["id": 1, "label": "<label>", "proposition": "", "source_quote": ""] C.2 Coder Validation Insertion test. We plant sentences of known type into the authorsâ paragraphs and check whether the coder recovers the type. Kimi-K2.6, which is neither the coder nor one of the writers, receives each of the 77 source paragraphs with its list of claims (Appendix C.3) and writes six sentences that fit the paragraph: a retraction saying that one of the listed claims is not shown, a denial saying that the results do not show a stronger conclusion the paragraph never draws, an ungrounded doubt, a generic scope, a grounded limitation, and a claim. The retraction and denial use phrasings such as âdoes not by itself establishâ and âshould not be interpreted asâ. Paragraphs that state no limitation get no grounded limitation, which leaves 441 sentences. Each sentence is inserted at a random sentence boundary of its paragraph, and the coder labels the modified paragraph with the unmodified one as source, as in rewriting. The coder labels 97% (300/308) of the planted retractions, denials, ungrounded doubts, and generic scopes as U, and only 6% (8/133) of the planted claims and grounded limitations. It labels 96% (148/154) of the retractions and denials as â , but its quote-based split assigns only 31% of them to the right one of the two, so the main text does not separate them. Inserting a sentence rarely changes the labels of the others: 93% (2,425/2,604) of the authorsâ sentences keep the label they receive in the unmodified paragraph. Second coder. Qwen3-32B, run locally, recodes all rewrites with the same prompt and a system prompt that restates the label rules as checks. On rewriting under the default prompt, the two coders agree on whether a sentence is in U for 97.2% of sentences (Îș=0.66Îș=0.66). Their values of RUR_U for the 12 writers and the authorsâ originals have a Spearman correlation of 0.80, and GPT-6-astra has the highest RUR_U under both. On the prompt-context rewrites of §3.2, Îș=0.63Îș=0.63. C.3 Claim Tracking Claim tracking has two steps, both run by DeepSeek-V4-Flash at temperature 0. The coder first lists the claims in each original paragraph, once per paragraph. It then receives the original, the numbered claims, and one rewrite, and gives each claim a status. It does not know which model or prompt produced the rewrite. When several statuses apply, it chooses the one that changes the claim most. Claim extraction prompt Below is a paragraph from a computer science research paper. List the claims the authors make in it: every statement about their method, their results, explanations of results, prior work, or the problem, that a reader could agree or disagree with. Keep each claim close to the authorsâ wording and keep its original strength. Do not list pure descriptions of procedure or setup (for example "we train for 10 epochs"). PARAGRAPH: text Return only a JSON object: "claims": ["<claim 1>", "<claim 2>"] Claim tracking prompt Below is a paragraph from a computer science research paper (ORIGINAL), a numbered list of the claims the authors make in it, and a rewrite of the paragraph (REVISED). For each claim, say what REVISED does with it: - kept: REVISED states the claim with about the same strength and scope (wording may differ). - strengthened: REVISED states it more strongly, more broadly, or more definitely. - weakened: REVISED still asserts the claim but makes it tentative, partial, or softer ("causes" -> "may contribute to", "fails" -> "may struggle"). - scoped: REVISED keeps the claim but confines it to the tested settings, data, or conditions where the original did not. - retracted: REVISED says the claim is not shown, not established, does not hold, or holds only in a narrower form than the authors stated, or argues against it. - dropped: REVISED no longer contains the claim. If several apply, choose the one that changes the claim most (retracted > dropped > weakened > scoped > strengthened > kept). ORIGINAL: original CLAIMS: claims REVISED: revised Return only a JSON object: "claims": ["id": <claim number>, "status": "<kept|strengthened|weakened|scoped|retracted|dropped>", "revised_span": "<shortest exact span from REVISED that expresses the claim or its change, or empty if dropped>"] Agreement. We sample five paragraphs of each type and take their rewrites under the default prompt by six writers: GPT-4o, GPT-5.2, GPT-5.5, GPT-5.6-sol, GPT-6-astra, and Claude Sonnet 5. This gives 120 rewrites with 762 claims. Three coders track them again with the same claim lists: DeepSeek-V4-Flash in a second run, Qwen3-32B, and Kimi-K2.6. Table 7 compares each with the main run. Six statuses Soft Ret Coder Agree Îș Îș Îș #Ret DeepSeek-V4-Flash 0.87 0.72 0.74 0.87 12 Qwen3-32B 0.73 0.49 0.59 0.35 17 Kimi-K2.6 0.81 0.62 0.63 0.71 17 Table 7: Agreement of claim tracking with the main run on 762 claims. Soft and Ret are binary: softened (weakened or scoped) or not, retracted or not. #Ret is the number of retracted claims; the main run has 11. The second run of the main coder is close to the first. Under all three coders, GPT-6-astra has the most retracted claims, and it also has the most softened claims, though under Kimi-K2.6 only by a small margin. Both other coders find more retractions than the main coder. Most disagreements fall between weakened and retracted, on sentences such as âdoes not by itself guarantee the removal of all class informationâ, which the main coder labels weakened. C.4 Claim-Support Judge The judge, DeepSeek-V4-Flash at temperature 0, gives each claim extracted in Appendix C.3 one of five labels: supported by the reported results at the stated strength and scope; overstated, supported only in a weaker or narrower form; contradicted; interpretation, explaining why a result occurs, which the results neither confirm nor refute; and not covered by the sheet. Only results and facts count as evidence. The judge sees the evidence sheet, the original paragraph, and the claims, but no rewrite. Human check. Two PhD students labeled 40 claims sampled by the judgeâs label: 12 supported, 12 overstated or contradicted, 8 interpretation, and 8 not covered. GPT retracted 39 of them in at least one setting of Table 12. The students saw the same input as the judge, did not see its labels or any rewrite, and labeled independently. They agree with each other on 30 of the 40 claims (Îș=0.66Îș=0.66), and with the judge on 19 and 21. By the judgeâs label, both students agree with it on 9 of 12 supported claims, 4 of 8 interpretations, 4 of 8 not-covered claims, and none of the 12 overstated or contradicted claims. Against the evidence sheet, the judgeâs supported labels hold up, but its overstated labels do not (for a check against the full papers, see Appendix D.5), so we do not rely on the comparison between overstated and supported claims. Because the sample oversamples rare labels, these figures do not estimate agreement over all claims. Claim-support judge prompt Below is an evidence sheet for a computer science paper, built from its method, experiment and related-work sections. It records the method, prior work, setup, every reported result with exact numbers, analysis outcomes, and the conditions the authors state. Then comes a paragraph from the same paper and a numbered list of claims the authors make in it. For each claim, decide what the evidence sheet says about it: - supported: the reported results, numbers, analysis outcomes, or described facts of the method and prior work establish the claim at the strength and scope the authors state. - overstated: the results support only a weaker or narrower version. Examples: the claim generalizes beyond the settings or cases that were tested; it says "consistently", "significantly", "exactly", or "always" but the results tie, lose, vary, or include no test; it states a cause where the results only show an association. - contradicted: the results show the claim is false. - interpretation: the claim explains why a result happens, or judges its meaning or importance, and the reported results neither confirm nor refute it. - not_covered: the claim concerns facts the sheet does not contain. Only results and facts count as evidence. Some sheet entries, especially stated conditions, notes, and prior-work descriptions, repeat the authorsâ own judgment or wording; such a repetition is not evidence for the same judgment. A claim that judges prior work (for example that a method fails or does not scale) needs a measured result. Judge each claim only against the sheet. The paragraph is there to make clear what each claim refers to; it is not evidence. EVIDENCE SHEET: sheet PARAGRAPH: paragraph CLAIMS: claims Return only a JSON object: "claims": ["id": <claim number>, "label": "<supported|overstated|contradicted|interpretation|not_covered>", "evidence": "<the sheet item(s) your label rests on, quoted briefly, or empty>"] Appendix D Additional Results D.1 Ungrounded Qualifications by Label Table 8 splits RUR_U in rewriting into its three labels. The rise across GPT versions comes mostly from not-shown statements. Generic scope, which can be a fair statement of the tested range, rises much less. Writer Râ R_â RâĄR_⥠RâŁR_⣠Authors (original) 0.03 0.00 0.01 GPT-4o 0.00 0.00 0.02 GPT-4.1 0.03 0.02 0.04 GPT-5.1 0.04 0.01 0.03 GPT-5.2 0.04 0.03 0.04 GPT-5.4 0.09 0.01 0.04 GPT-5.5 0.17 0.06 0.06 GPT-5.6-sol 0.09 0.10 0.12 GPT-6-astra 0.66 0.14 0.13 Claude Sonnet 5 0.04 0.05 0.01 Claude Opus 5.5 0.04 0.01 0.00 DeepSeek-V4-Pro 0.03 0.02 0.00 Grok 4.7 0.15 0.04 0.05 Table 8: Not-shown statements (â ), ungrounded doubt (âĄ), and generic scope (âŁ) per 100 words in rewriting under the default prompt, pooled over the four paragraph types. D.2 Prompt Contexts Table 9 compares the polish-only prompt with the default prompt of §3.1 for all 12 models. Table 10 gives the claim-tracking results for the seven prompt contexts. Revision without review. We ran P8 and P9 after the other contexts, with the same models and high reasoning effort, and reran P4 for GPT-6-astra and GPT-5.5 at the same time. The rerun gives RUR_U of 0.77 for GPT-6-astra and 0.20 for GPT-5.5, against 0.72 and 0.25 in the original run. Under P8, RUR_U is 0.61 for GPT-6-astra, 0.23 for GPT-5.5, and 0.11 for Claude Opus 5.5 (P4: 0.77, 0.20, 0.11); under P9 it is 0.39, 0.24, and 0.05. GPT-6-astra retracts 6.2%, 6.6%, and 3.1% of the authorsâ claims under P4, P8, and P9, and softens 33%, 31%, and 31%. The judge (Appendix C.4) labels 23%, 22%, and 27% of the claims it retracts as supported. Polish only Default Writer RUR_U PUP_U % RUR_U Authors (original) 0.04 5 â GPT-4o 0.03 4 0.02 GPT-4.1 0.02 3 0.08 GPT-5.1 0.04 5 0.07 GPT-5.2 0.05 6 0.10 GPT-5.4 0.03 4 0.14 GPT-5.5 0.04 5 0.29 GPT-5.6-sol 0.02 3 0.31 GPT-6-astra 0.03 4 0.94 Claude Sonnet 5 0.04 5 0.10 Claude Opus 5.5 0.03 4 0.05 DeepSeek-V4-Pro 0.06 6 0.05 Grok 4.7 0.04 5 0.23 Table 9: Ungrounded qualifications when the 12 models are asked only to polish the paragraph, against the default prompt of §3.1. All four paragraph types are pooled. Writer P1 P2 P3 P4 P5 P6 P7 GPT-4o 11 / 0.0 8 / 0.0 10 / 0.0 18 / 0.2 18 / 0.6 11 / 0.0 17 / 0.2 GPT-5.2 10 / 0.0 11 / 0.0 10 / 0.0 22 / 0.2 26 / 0.4 15 / 0.2 26 / 0.4 GPT-5.5 9 / 0.0 10 / 0.0 11 / 0.2 29 / 0.2 30 / 0.8 15 / 0.2 27 / 0.0 GPT-5.6-sol 8 / 0.0 9 / 0.2 9 / 0.2 25 / 0.4 30 / 2.7 16 / 0.0 26 / 1.0 GPT-6-astra 9 / 0.2 7 / 0.2 11 / 0.0 33 / 6.0 33 / 9.5 20 / 0.8 33 / 5.8 Claude Opus 5.5 3 / 0.2 5 / 0.2 7 / 0.2 15 / 0.2 15 / 1.1 12 / 0.2 14 / 0.6 Table 10: Share of the authorsâ claims softened / retracted (%) under the seven prompt contexts of §3.2. D.3 Multi-round Revision Table 11 gives paragraph length, the number of ungrounded qualifications per paragraph, softening, and dropped claims for the chains of Table 2. A claim is dropped when it no longer appears in the revision. We read 12 dropped claims from rounds 2 and 3. About a third are defensive: the claim is replaced by a statement that the evidence does not establish it, or by a disclaimer of novelty. About half disappear because the paragraph is rewritten into definitions and scope statements in response to review comments asking for precision. One or two are coder errors in which the claim survives in other words. About half of the claims dropped in rounds 2 and 3 were already dropped in the previous round. We therefore do not count dropped claims as defense. In later rounds, Claude also adds content that is not in the original, such as citations to architectures published after the paper. Words U per paragraph Soft % Dropped % Chain Writer R1 R2 R3 R1 R2 R3 R1 R2 R3 R1 R2 R3 Reviewârevise GPT-5.5 232 319 345 2.2 3.9 3.8 32 34 28 7 19 27 Reviewârevise GPT-5.6-sol 234 338 363 3.3 5.5 5.2 32 28 24 9 20 30 Reviewârevise GPT-6-astra 248 294 312 4.6 4.7 5.2 27 26 25 8 19 30 Reviewârevise Claude Opus 5.5 194 259 314 1.0 1.6 2.2 20 25 24 9 18 24 Polish only GPT-5.6-sol 119 117 117 0.1 0.1 0.0 10 11 11 0 0 0 Polish only GPT-6-astra 117 115 114 0.1 0.0 0.0 6 8 7 0 1 0 Polish only Claude Opus 5.5 117 114 112 0.0 0.0 0.1 5 6 8 1 1 2 Table 11: Further measures for the multi-round chains of Table 2. U per paragraph is the average number of ungrounded qualifications in a paragraph. The authorsâ originals average 128 words. D.4 Claim Support The judge labels all 482 claims of the 77 original paragraphs: 52% supported, 5% overstated or contradicted, 15% interpretation, and 28% not covered. Let CLC_L be the claims with label L. Table 12 gives RetLâ(w)Ret_L(w) and SoftLâ(w)Soft_L(w), Eqs. (3) and (4) computed over CLC_L instead of C. Because few claims are retracted under the default prompt, it also covers the first round of reviewârevise chains (§3.2). By these labels, GPT softens overstated claims two to two and a half times as often as supported ones and retracts them at least twice as often, but about a third of GPT-6-astraâs retractions under the default prompt and under P5, and 37% of the GPT versionsâ retractions in the first review round, fall on claims labeled supported. Annotators do not confirm the overstated labels (Appendix C.4), so these comparisons are not evidence either way. Table 12 uses only the paragraphs for which the claim tracker and the judge list the same claims, 71 of 77 under the default prompt. For this reason GPT-6-astra has 34 retracted claims here and 38 in Table 1. Soft % Ret % Retracted claims % Writer Sup Over Sup Over Int Sup Over n GPT-5.2 to 6-astra 21 [18, 24] 53 [42, 65] 1.2 [0.5, 2.0] 5.7 [0.0, 17.5] 2.4 [0.7, 4.7] 30 [16, 46] 13 [0, 29] 46 GPT-6-astra 35 [28, 42] 71 [59, 88] 4.7 [1.9, 8.0] 9.5 [0.0, 23.8] 10.6 [2.9, 19.2] 32 [17, 49] 6 [0, 13] 34 GPT-6-astra, P5 27 [19, 36] 68 [55, 81] 5.6 [3.1, 8.3] 13.6 [0.0, 31.2] 20.5 [10.2, 31.2] 30 [20, 43] 7 [0, 13] 46 GPT, R1 32 [26, 38] 48 [33, 67] 13.0 [9.8, 16.3] 25.8 [12.7, 43.9] 33.3 [23.9, 42.6] 37 [30, 46] 6 [3, 11] 262 Claude Opus, R1 18 [13, 23] 36 [20, 64] 0.0 [0.0, 0.0] 4.5 [0.0, 15.8] 4.1 [0.0, 9.1] â â 6 Controls 9 [7, 12] 31 [20, 43] 0.3 [0.0, 0.7] 4.8 [0.0, 13.3] 0.4 [0.0, 1.3] 27 [0, 64] 36 [0, 75] 11 Table 12: What rewrites do to the authorsâ claims, by the judgeâs label: Sup = supported, Over = overstated or contradicted, Int = interpretation. Soft and Ret: share of the claims with each label that are softened or retracted. Retracted claims: share of the retracted claims that carry each label; n is the number of retracted claims, and shares are omitted when n<10n<10. R1: first round of reviewârevise chains, with GPT pooling GPT-5.5, GPT-5.6-sol, and GPT-6-astra. Controls: the four non-GPT models. Annotators confirm the judgeâs supported labels but not its overstated labels. Brackets are 95% bootstrap intervals over papers. D.5 Human Check against the Full Papers Materials. The check covers GPT-6-astraâs P5 rewrites. It covers 16 papers and includes all 46 claims that claim tracking marks as retracted and 12 claims from the same paragraphs that GPT-6-astra keeps or softens, so that the target claims do not reveal which were retracted. It also includes 60 ungrounded qualifications from P5 rewrites: 36 by GPT-6-astra, 16 not-shown statements, 10 ungrounded doubts and 10 generic-scope sentences, and 12 each by GPT-5.5 and Claude Opus 5.5. Each paper comes with its parsed full text and tables and a link to its PDF. Rewrites are labeled only by number, and the writer, prompt, coder labels, and tracking status are withheld. Procedure. Two PhD students, other than those in Appendix C.4, each work through the whole packet independently, using a web annotation form and our annotation guide. For each claim they judge whether the paper supports it (supported, overstated, contradicted, interpretation, cannot tell); for each rewrite, what it does to the claim (the six tracking statuses) and whether that change is warranted, overcorrected, unnecessary, or wrong. For each qualification they judge whether the paper raises its point and whether it is warranted, redundant, or wrong. Redundant means that the sentence is not wrong but tells a careful reader nothing new. Each answer comes with a short reason. We read a sample of the reasons. Results. Table 13 gives agreement and the counts on which both annotators agree. Of the 58 rewrites, both call 18 retractions and at least one calls 28, whereas claim tracking marks 46 of them retracted. Question Agreement Îș Claim supported by the paper 0.84 0.78 What the rewrite does 0.78 0.69 Change warranted 0.83 0.71 Qualification raised by the paper 0.80 0.68 Qualification warranted 0.92 0.83 Claims both find changed (48), both agree Supported / overstatedâ / interpretation 4 / 20 / 15 Change warranted / unnecessary 28 / 10 Claims both find retracted (18), both agree Supported / overstatedâ / interpretation 0 / 8 / 8 Retraction warranted / unnecessary 13 / 1 Qualifications (60), both agree Redundant / warranted / wrong 36 / 16 / 3 Table 13: Check of P5 rewrites against the full papers by two PhD annotators. âOverstated or contradicted. Appendix E Reviewers and Readers E.1 AI Reviewer Probes Claude Sonnet 5 and DeepSeek-V4-Flash review each version independently with their default settings and do not know where it comes from. In the prompt below, where gives the position of the paragraph in the paper according to its type. The comparison uses the 73 paragraphs for which all compared rewrites were available when we ran the reviews. For each writer we keep the paragraphs whose P1 and P5 rewrites have valid reviews from both models, which leaves 68 to 72. Table 14 gives the mean scores from each reviewer model. Under both models, the P5 rewrites of all four writers score higher than their P1 rewrites on all four aspects. DeepSeek-V4-Flash sorts the listed weaknesses into seven categories, seeing only the text of the weaknesses and not the paragraph, the writer, or the prompt. Table 15 gives the number of weaknesses per review in each category. P5 rewrites receive slightly fewer weaknesses, mostly because they are criticized less for overclaiming. The P5 rewrites of GPT-6-astra are criticized more often for two things: being overly cautious, and weak significance. Some of the latter say that the paragraph disclaims novelty without saying what is new. The reviewers also criticize these rewrites less often for being unclear and give them higher clarity scores, while human readers find them harder to read (§3.4). Among reviews that criticize a rewrite as overly cautious, the P5 rewrites of the three GPT versions still receive higher overall scores on average than their P1 rewrites, 6.50 to 6.79 against 5.72 to 5.81. Reviewer prompt You are a reviewer for a top-tier machine learning / NLP conference. Below is one paragraph from where of a submission. Assume that the numbers it reports are correct and that the rest of the paper is competent; judge this paragraph as written. PARAGRAPH: text Rate the paragraph from 1 (very poor) to 10 (excellent) on: - soundness: are the claims supported by and appropriately matched to the evidence the paragraph presents? - contribution: how significant and clearly conveyed is the finding or contribution? - clarity: how easily can a reader tell what the authors found and what they claim? - overall: your overall assessment of this paragraph for a top-tier paper. Then list the main weaknesses a reviewer would raise (at most three, empty if none). Return only a JSON object: "soundness": <1-10>, "contribution": <1-10>, "clarity": <1-10>, "overall": <1-10>, "weaknesses": ["..."] Weakness categorization prompt Below are the weaknesses a peer reviewer listed for one paragraph of a computer science paper. Put each weakness into exactly one category: - overclaim: a claim is stronger than the evidence shown, an explanation or causal claim is unsupported or speculative, or a result is generalized too far. - missing_detail: numbers, statistics, significance tests, variance, baselines, setup details, or definitions are missing. - unclear: wording, terms, or structure are vague, ambiguous, or confusing. - shallow: the analysis is superficial, does not explain why a result occurs, or proposes no follow-up. - significance: the novelty, contribution, motivation, or positioning against prior work is weak. - overhedged: the paragraph is too cautious, has too many caveats or disclaimers, or buries its contribution. - other: none of the above. WEAKNESSES: items Return only a JSON object: "categories": ["<category of weakness 1>", "<category of weakness 2>", ...] GPT-5.5 GPT-5.6-sol GPT-6-astra Opus 5.5 P1 P5 P1 P5 P1 P5 P1 P5 Claude Sonnet 5 Soundness 4.91 6.71 5.01 6.35 5.04 7.49 4.96 5.72 Contribution 4.61 5.66 4.52 5.25 4.61 5.62 4.59 5.07 Clarity 5.10 6.74 5.32 6.35 5.35 6.96 5.29 6.24 Overall 4.77 6.20 4.87 5.89 4.86 6.47 4.85 5.56 DeepSeek-V4-Flash Soundness 6.53 7.70 6.54 7.61 6.71 7.94 6.69 7.26 Contribution 6.34 7.34 6.28 7.01 6.25 6.78 6.49 7.04 Clarity 7.50 8.57 7.45 8.28 7.64 8.47 7.49 8.25 Overall 6.67 7.81 6.62 7.59 6.76 7.58 6.72 7.40 Paragraphs 70 71 72 68 Table 14: Mean scores (1â10) from each reviewer model for P1 and P5 rewrites. GPT-5.5 GPT-5.6-sol GPT-6-astra Opus 5.5 P1 P5 P1 P5 P1 P5 P1 P5 Overclaim 0.79 0.56 0.78 0.59 0.73 0.31 0.79 0.77 Missing detail 0.89 0.91 0.91 0.91 0.86 0.85 0.92 0.93 Unclear 0.61 0.52 0.58 0.54 0.59 0.42 0.51 0.46 Shallow 0.19 0.16 0.15 0.19 0.20 0.20 0.20 0.21 Significance 0.41 0.37 0.45 0.43 0.44 0.60 0.43 0.36 Overhedged 0.04 0.09 0.02 0.08 0.05 0.26 0.04 0.07 Other 0.01 0.00 0.02 0.00 0.01 0.00 0.01 0.01 Total 2.94 2.60 2.91 2.74 2.88 2.65 2.90 2.80 Table 15: Weaknesses per review in each category, averaged over the two reviewer models. E.2 Minimal Pairs We trim every P5 rewrite that has at least one sentence in U and a valid review in the comparison above. Grok 4.7 receives the rewrite and the list of its sentences in U, with the prompt below. Of 147 rewrites, 3 failed because the API timed out. In 143 of the other 144, every word of the trimmed version appears in the P5 rewrite; in the last one, the editor moved part of a deleted sentence into the next sentence. Deleting whole sentences instead would also remove the results that some of these sentences report, and sometimes leaves a pronoun without a referent. The coder then labels the trimmed texts in the same way as all other texts. Both reviewer models review each P5 rewrite and its trimmed version twice, with the reviewer prompt above; we average the two reviews and take paired differences, with bootstrap over papers. Table 16 gives the results by writer. The drop is larger under Claude Sonnet 5 than under DeepSeek-V4-Flash, but it is present for every writer under both. In the third of pairs in which trimming removes the fewest words, 2 to 15%, overall drops by 0.41 [0.31, 0.50]; in the middle third, 15 to 23%, by 0.82; and in the top third, 23 to 56%, by 1.24. The P5 scores in this run match those of the main comparison: on the same paragraphs, the mean overall score of GPT-6-astraâs P5 rewrites is 7.03, against 7.09 before. RUR_U Trimmed â- P5 Writer n P5 Trim. Overall Sound. Contr. GPT-5.5 35 0.95 0.07 â-0.68 â-0.88 â-0.61 GPT-5.6-sol 29 1.04 0.25 â-0.93 â-1.14 â-0.67 GPT-6-astra 57 1.41 0.18 â-0.95 â-1.34 â-0.65 Opus 5.5 23 0.93 0.15 â-0.61 â-0.92 â-0.50 All 144 â-0.82 â-1.12 â-0.62 Table 16: AI review of P5 rewrites with only their ungrounded qualifications removed. Scores are from 1 to 10, averaged over the two reviewer models and two reviews each; n is the number of pairs. Trimming shortens the rewrites by 17 to 23% of their words. 95% CIs for All: overall [â-0.95, â-0.70], soundness [â-1.29, â-0.97], contribution [â-0.76, â-0.50]. Trimming prompt Below is a paragraph from a research paper and a list of FLAGGED sentences from it. Each flagged sentence contains a qualification: a statement of what the results do not show or establish, a caveat or needed validation, or a phrase that narrows a claim to "the evaluated settings" or similar. Edit the paragraph as follows. - In each flagged sentence, delete only the qualification. If the sentence also states a result, claim, or other content, keep that content with its original wording. Example: "X improves accuracy on both datasets, although this does not by itself establish that X generalizes." becomes "X improves accuracy on both datasets." Example: "In the evaluated settings, X outperforms Y." becomes "X outperforms Y." - If a flagged sentence is nothing but the qualification, delete the whole sentence. - Leave every unflagged sentence exactly as it is, except for the smallest grammatical repair that a deletion makes necessary, such as removing a connective like "also" or "however" that no longer connects to anything, or replacing a pronoun whose referent was deleted with the noun it referred to. - Do not add any new words, claims, qualifications, or emphasis. Do not strengthen any claim beyond removing the qualification. PARAGRAPH: text FLAGGED SENTENCES: flagged Return only JSON: "text": "<edited paragraph>" E.3 Human Reader Study Materials and assignment. The 20 paragraphs are 10 result-analysis and 10 discussion paragraphs drawn at random from those with complete rewrites. Each appears in two versions, the P1 and P5 rewrites by GPT-6-astra, shown in full. Each of the four readers read all 20 paragraphs, ten in each version, and never saw both versions of the same paragraph. Each version of each paragraph was read by two readers, which gives 80 readings. Readers received anonymous texts and neutral task instructions. They were not told the version labels, the model that wrote the texts, the rewriting prompts, our hypotheses, or any earlier results. Procedure. For each paragraph, a reader first read the whole paragraph and gave five ratings: how easy it is to read, how smoothly its main line of argument flows, how much effort it takes to understand, how easily its main claim can be identified, and how certain the authors are about that claim. The first four are rated from 1 to 7 and author certainty from 1 to 5. Higher effort means more effort; on the other scales, higher values mean more of the property. The reader then restated the main claim in their own words and answered two comprehension questions about information that both versions contain. Each step was locked once submitted, so later steps could not change earlier answers. Analysis. For each paragraph and version we average the ratings of the two readers, which gives 20 paragraph-level differences between P5 and P1 for each rating. The intervals in Table 4 are percentile intervals from 2,000 bootstrap resamples of these differences with seed 0. They describe variation across paragraphs for these four readers, not across readers. The restatements were collected but not scored, so claim identifiability is the readersâ own rating and does not show whether they recovered the claim. Readers answered every comprehension question correctly for both versions, so this measure is at ceiling and cannot detect a difference. Appendix F Examples Figure 4 gives one GPT-6-astra rewrite under the default prompt for each paragraph type. In panel (a), the authorsâ original contains no ungrounded qualification. GPT-5.5 adds only âacross the evaluated configurationsâ to the summary sentence. GPT-6-astra adds two generic-scope sentences and two not-shown statements, and retracts the authorsâ explanation of the short-sentence result; checked against the full paper, the same retraction in its P5 rewrite is warranted (§3.3). In the novelty paragraph, GPT-6-astra drops the 30â50% figure and adds four not-shown statements; one of them turns the authorsâ conclusion about heuristic datasets into a conclusion that should not be drawn. In the contribution paragraph, it drops the state-of-the-art claim, limits the comparison with baselines to the evaluated settings, and adds that the methodâs threshold does not guarantee what it is designed to measure. In the discussion paragraph, it replaces the claim that ACML is a general model with a statement that the results do not establish general applicability. (a) Result analysis (Ferrando et al., 2022) Authors: It can be seen that across every different configuration, our proposed ALTI method outperforms other input attribution methods. [âŠ] This is expected since these datasets are simpler, and therefore, interpretations can more easily find the important tokens. GPT-5.5: Across the evaluated configurations, ALTI achieves the strongest attribution performance among the compared methods. ⣠[âŠ] GPT-6-astra: ALTI achieves the best scores on both metrics across the evaluated modelâdataset configurations. ⣠[âŠ] Although this pattern may be related to input length, these comparisons do not isolate its effect from other dataset characteristics and therefore do not establish that shorter inputs are inherently easier to interpret. â [âŠ] These results support ALTIâs effectiveness under the evaluated token-removal metrics, rather than establishing the quality of its explanations more generally. â (c) Contribution (Zhang and Feng, 2022) Authors: [âŠ] Experiments on both text-to-text and speech-to-text simultaneous translation tasks show that ITST outperforms strong baselines and achieves state-of-the-art performance. GPT-6-astra: [âŠ] The threshold thus provides an explicit criterion for initiating translation, rather than a guarantee that sufficient information has been received. â Experiments on text-to-text and speech-to-text simultaneous translation show that ITST outperforms strong baselines in the evaluated settings. ⣠(b) Novelty (Wang et al., 2022) Authors: [âŠ] However, studies have found that 30â50% of summaries created this way contain facts that are unsupported by the rest of the article [CITE]. Models trained on this dataset learn to repeat this noise pattern by hallucinating facts in their outputs. It appears that known heuristics do not produce reliable data. GPT-6-astra: [âŠ] Prior analyses have identified reference summaries containing information that is not supported by the paired input [CITE]. This information is not necessarily factually incorrect, but its absence from the input creates a mismatch for source-grounded summarization. â Training on such pairs may encourage unsupported generation, although reference-level inconsistencies alone do not establish this causal effect. â These observations motivate explicit checks of sourceâsummary consistency during dataset construction, rather than a general conclusion that heuristic extraction methods cannot produce reliable data. â (d) Discussion (Mao et al., 2020) Authors: [âŠ] Both ACML-mean and ACML-attention improve ACML by a clear margin, and they perform much better than CommNet and AMP as shown in Table [REF]. The results imply that ACML is a general model, and it can be easily extended with advanced message processing operations to achieve better results. GPT-6-astra: [âŠ] As shown in Table [REF], both variants outperform the original ACML as well as CommNet and AMP. These results suggest that ACML can accommodate and benefit from alternative message-processing operations in the evaluated settings. ⣠Although these findings do not establish general applicability, they motivate further evaluation of ACML with additional message-processing operations and across a broader range of tasks. â Figure 4: Rewrites under the default prompt, one paragraph of each type. [âŠ]: omitted sentences. âŁ: generic scope, with the scoping phrase underlined. â : not-shown statement, in bold. Italic: the authorsâ claim that the claim tracker labels retracted. [CITE] and [REF] are placeholders in the model input.