The Gold Rush in AI4Math, II: What are signatures of AI-assisted Proofs?
Abstract
The growing use of AI in mathematics raises a question: can we detect AI involvement in proofs, separately from AI assistance with writing? Historical arXiv papers, recent papers disclosing substantive AI use, and manuscripts released by OpenAI provide a rich empirical basis for studying this question. However, several challenges remain: lack of matched case-control pairs; potential incompleteness of disclosure; and lack of ready-to-use features designed to capture signals of AI involvement in proofs. To address these challenges, we construct five cohorts comprising 8,281 papers by combining existing manuscripts with those we produced using generative AI. These cohorts span different levels of AI involvement and include matched pairs of papers addressing the same research problems. We then introduce ProofTrace, a framework that represents each paper as a graph of immediate proof support (GIPS) and extracts interpretable features of mathematical organization. Our study yields three discoveries. First, principal-component projections of our features reveal a qualitative gradient of AI involvement, where AI-reworded papers remain close to human papers, the two AI-generated cohorts depart in broadly shared directions, and papers disclosing substantive AI use occupy intermediate positions which shifts toward AI-generated cohorts over time. Second, we identify recurring signatures of AI-generated proofs, such as fewer externally cited results, greater reliance on intermediate conclusions, and altered graph connectivity; many of these signatures persist under controls for research field, manuscript length, or graph size. Finally, in a separate detection experiment, ProofTrace distinguishes human-written papers from those disclosing substantive AI use. Its performance remains stable under AI rewording, whereas the performance of state-of-the-art text-based detectors declines sharply.
Figures & tables
| Family | Count | Example measurement | Example value |
|---|---|---|---|
| References | 38 | Cited-result nodes / all nodes | |
| Organization | 82 | Fraction of dependencies whose premise first appears later in the text | |
| Node Statistics | 28 | Intermediate conclusions / stated results | |
| Edge Statistics | 86 | Maximum in-degree / mean in-degree | |
| Graph Motifs | 34 | Feed-forward triangles / directed two-step walks | |
| Global Topology | 74 | Nodes in the largest weakly connected component / all nodes |
| Original | Reworded | |||
| Method / variant | AUROC | AP | AUROC | AP |
| Pretrained and zero-shot baselines | ||||
| MELD (pretrained) | 0.7904 | 0.7602 | 0.1618 | 0.3369 |
| ModernBERT-MAGE (pretrained) | 0.4513 | 0.4889 | 0.4149 | 0.4360 |
| DETree (pretrained) | 0.4220 | 0.4505 | 0.4183 | 0.4494 |
| ToS (pretrained) | 0.4128 | 0.4349 | 0.1930 | 0.3425 |
Appendix figures & tables11 assets
Supplementary material from the paper’s appendix.
Appendix
| Attribute | Content |
|---|---|
| id | The parser’s label of a stated result (e.g., Lemma 2.4, or U1, U2, … if it has no number). Intermediate conclusions are labeled I1, I2, and so on. |
| kind | stated if the result is explicitly stated as a theorem, lemma, proposition, corollary, claim, fact or observation. Otherwise intermediate . |
| statement_lines | For a stated result, where the parser finds its statement. For an intermediate conclusion, each sentence that asserts it, with its displays. |
| proof_lines | The ranges from where the paper starts to establish the conclusion to where it is established, including deferred parts. Empty if the paper gives no proof. |
| summary | For a stated result, its statement as the parser finds it. For an intermediate conclusion, the conclusion in at most two sentences. |
| evidence | One quotation. For a stated result, we quote from its proof. For an intermediate conclusion, we quote the clause that asserts it. |
| Attribute | Content |
|---|---|
| source | The identifier of the result used as a direct premise. |
| target | The identifier of another result whose written argument directly uses the conclusion of the source. |
| use_lines | The ranges where the target argument uses the premise. |
| evidence | One verbatim quotation where the target argument uses the premise. |
| Attribute | Content |
|---|---|
| id | Corollary 2.2 |
| kind | stated |
| summary | Corollary 2.2. Let be an arbitrary time scale and be an arbitrary nonnegative constant. Then we have where |
| evidence | 2. Now suppose and that holds. Then \begin{split}&\int_{a}^{t_{n-(k+1)}}\cdots\int_{a}^{t_{n-1}}c~\Delta t_{n}\cdots\Delta t_{n-k}\\ \leq&\int_{a}^{t_{n-(k+1)}}\frac{c(t_{n-k}-a)^{k}}{k!}\Delta t_{n-k}\leq\int_{a}^{t_{n-(k+1)}}\frac{c(t_{n-k}-a)^{k}}{k!}\mathrm{d}t_{n-k}=\frac{c(t_{n-(k+1)}-a)^{k+1}}{(k+1)!}.\end{split} Thus, holds. |
| id | I44 |
| kind | intermediate |
| Feature | Human | AI-rebuilt | ||
|---|---|---|---|---|
| References | ||||
| Externally cited-result fraction | 0.061 | 0.002 | ||
| Fraction of nodes that are externally cited results. | ||||
| Cited-node fraction | 0.061 | 0.002 | ||
| Fraction of nodes that are cited. | ||||
| Cited-to-uncited edge fraction | 0.066 | 0.002 | ||
Robustness of Machine-Generated Text Detection
Robustness of machine-generated text detection studies whether AI-text detectors remain reliable across shifts, edits, languages, and adversarial attacks.
See all 98 papers