id stringlengths 19 33 | arxiv_id stringlengths 12 12 | title stringlengths 26 165 | domain stringclasses 8
values | primary_category stringclasses 34
values | paper_type stringclasses 2
values | error_type stringclasses 5
values | error_category stringclasses 4
values | in_frontier_subset bool 2
classes | license stringclasses 4
values | text_included bool 2
classes | clean_paper stringlengths 23.8k 558k ⌀ | perturbed_paper stringlengths 20.5k 558k ⌀ | review_input stringlengths 20.5k 59.7k ⌀ | clean_sha256 stringlengths 64 64 | perturbed_sha256 stringlengths 64 64 | review_input_sha256 stringlengths 64 64 | n_perturbations int64 6 20 | n_scored int64 5 20 | perturbations listlengths 6 20 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2604.17935v1__claim_theoretical | 2604.17935v1 | How Much Cache Does Reasoning Need? Depth-Cache Tradeoffs in KV-Compressed Transformers | cs.CC | cs.LG | theoretical | claim_theoretical | Claim | true | http://creativecommons.org/licenses/by-nc-sa/4.0/ | true | "\\documentclass[11pt]{article}\n\n\\usepackage[letterpaper, margin=1in]{geometry}\n\\usepackage{ams(...TRUNCATED) | "\\documentclass[11pt]{article}\n\n\\usepackage[letterpaper, margin=1in]{geometry}\n\\usepackage{ams(...TRUNCATED) | "\\documentclass[11pt]{article}\n\n\\usepackage[letterpaper, margin=1in]{geometry}\n\\usepackage{ams(...TRUNCATED) | 4daec7d4a4799ba274d3167da529c046d119fa0a5386fd0ed1fcaac611fd2054 | e901528f6050eed7eca02ee795841e59439073dbd197aa9878b327f4d095bc1d | ec563eb68cb4a7a3b75148ff3319430b222b700c0b948562347f5624ab91c4c8 | 13 | 10 | [{"perturbation_id":"P000_S0001","error_subtype":"incorrect_claim_theoretical","original":"\\begin{d(...TRUNCATED) |
2604.18661v1__claim_theoretical | 2604.18661v1 | "Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Li(...TRUNCATED) | cs.CC | cs.DS | theoretical | claim_theoretical | Claim | true | http://creativecommons.org/licenses/by/4.0/ | true | "\\documentclass[11pt]{article}\n\n\\usepackage[a4paper,margin=1in]{geometry}\n\\usepackage[T1]{font(...TRUNCATED) | "\\documentclass[11pt]{article}\n\n\\usepackage[a4paper,margin=1in]{geometry}\n\\usepackage[T1]{font(...TRUNCATED) | "\\documentclass[11pt]{article}\n\n\\usepackage[a4paper,margin=1in]{geometry}\n\\usepackage[T1]{font(...TRUNCATED) | c1fee6b9f8bf66d998f81f086016aa77809db3e94e23f35d07f6eb069f6a62d0 | 9e98f01052db3929c553125c4fc96059e57c2b1c25a2d930a36a76edaf467b16 | 9420de02f9b7dee8375d95546e937e7cd274046bb35107422f0005cd4916c1cf | 14 | 14 | [{"perturbation_id":"P002_S0004","error_subtype":"incorrect_claim_theoretical","original":"\\begin{t(...TRUNCATED) |
2604.19872v1__claim_theoretical | 2604.19872v1 | Border subrank of higher order tensors and algebras | cs.CC | math.AG | theoretical | claim_theoretical | Claim | false | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | false | null | null | null | c6dfd637083217cc1087d3143ad61cc9c817cef2a2a41818a4c5da653e1d4f5b | 9d4487133fb01b57f49a9a984d68fc2198297132d0aa264f4647b4a75571ad1f | cea0fa9dc69f04d76352a3b9960fbfc9c4060af25860c27ebc807bc14a07cac3 | 14 | 7 | [{"perturbation_id":"P000_S0000","error_subtype":"incorrect_claim_theoretical","original":"\\begin{t(...TRUNCATED) |
2604.21531v1__claim_theoretical | 2604.21531v1 | Kernelization Bounds for Constrained Coloring | cs.CC | cs.CC | theoretical | claim_theoretical | Claim | false | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | false | null | null | null | 8e88ebab469e52a45fe196d05df86319261c6bb063059c2191783e5d7fc25aa4 | a148bc552f58b55c67414c25fb8f947830a32fa8f8690512013715c16d69c070 | f27894fa6a3994929dd528630819837927dbb1f38d1353e70ae1095da05ea4f1 | 12 | 8 | [{"perturbation_id":"P000_S0000","error_subtype":"incorrect_claim_theoretical","original":"\\begin{d(...TRUNCATED) |
2604.21831v1__claim_theoretical | 2604.21831v1 | Complexity Classes Arising from Circuits over Finite Algebraic Structures | cs.CC | cs.CC | theoretical | claim_theoretical | Claim | false | http://creativecommons.org/licenses/by/4.0/ | true | "\n\\documentclass{amsart}\n%%\n\\usepackage{amsthm}\n\\usepackage{amssymb}\n\\usepackage{amsaddr}\n(...TRUNCATED) | "\n\\documentclass{amsart}\n%%\n\\usepackage{amsthm}\n\\usepackage{amssymb}\n\\usepackage{amsaddr}\n(...TRUNCATED) | "\n\\documentclass{amsart}\n%%\n\\usepackage{amsthm}\n\\usepackage{amssymb}\n\\usepackage{amsaddr}\n(...TRUNCATED) | 41206688aaa16612c7fa421cbd92db8f7407d0232c87996c6efc4bfc79868a8b | 85e195bd594f945cbf52d761845fff8e81d2f742e59db06cf99ec94791d4281f | d576666a10cb9e3542a17f1459797c70a35d0ba1e297914125c196ad248e6f57 | 12 | 5 | [{"perturbation_id":"P000_S0000","error_subtype":"incorrect_claim_theoretical","original":"\\begin{d(...TRUNCATED) |
2604.24325v1__claim_theoretical | 2604.24325v1 | Identification to Subclasses of Chordal Graphs | cs.CC | cs.DS | theoretical | claim_theoretical | Claim | false | http://creativecommons.org/licenses/by/4.0/ | true | "\\documentclass[10pt,letterpaper]{article}\n\n\\bibliographystyle{plainurl}\n\n\\usepackage{\namsfo(...TRUNCATED) | "\\documentclass[10pt,letterpaper]{article}\n\n\\bibliographystyle{plainurl}\n\n\\usepackage{\namsfo(...TRUNCATED) | "\\documentclass[10pt,letterpaper]{article}\n\n\\bibliographystyle{plainurl}\n\n\\usepackage{\namsfo(...TRUNCATED) | 492df61a4dd15602dd5c16a29aa72ce4e7a550caeaa7e39f8051421cb5148b75 | 13d9f36f9fe8812a535ded988b918f505c1efeed18823db0e9d73185f46bde9d | 8fd537e122c031e4bf7727616d137d3f5f0d62dbd29ae25a7dde148bfcfb1a1a | 20 | 5 | [{"perturbation_id":"P009_S0019","error_subtype":"incorrect_claim_theoretical","original":"\\begin{l(...TRUNCATED) |
2604.25251v1__claim_theoretical | 2604.25251v1 | From Gödel incompleteness to the consistency of circuit lower bounds | cs.CC | math.LO | theoretical | claim_theoretical | Claim | false | http://creativecommons.org/licenses/by-nc-sa/4.0/ | true | "\\documentclass[12pt]{article}\n\n\\usepackage{fullpage}\n\\usepackage{amsmath,amsthm,amssymb,MnSym(...TRUNCATED) | "\\documentclass[12pt]{article}\n\n\\usepackage{fullpage}\n\\usepackage{amsmath,amsthm,amssymb,MnSym(...TRUNCATED) | "\\documentclass[12pt]{article}\n\n\\usepackage{fullpage}\n\\usepackage{amsmath,amsthm,amssymb,MnSym(...TRUNCATED) | 4ae8e822faf97ece8108aeccceba4c4eaa7284ff507ffa233b9f89356e1820f3 | c2c1b235af2c3288fe0571c29402dabf31cdfa21ce3eebbdd351b022472185f4 | 9d3cfbb6ef8905a84c75d2d80acb62c586626f72035fece4c906160883271903 | 15 | 5 | [{"perturbation_id":"P003_S0004","error_subtype":"incorrect_claim_theoretical","original":"\\begin{t(...TRUNCATED) |
2604.17935v1__logic | 2604.17935v1 | How Much Cache Does Reasoning Need? Depth-Cache Tradeoffs in KV-Compressed Transformers | cs.CC | cs.LG | theoretical | logic | Reasoning | true | http://creativecommons.org/licenses/by-nc-sa/4.0/ | true | "\\documentclass[11pt]{article}\n\n\\usepackage[letterpaper, margin=1in]{geometry}\n\\usepackage{ams(...TRUNCATED) | "\\documentclass[11pt]{article}\n\n\\usepackage[letterpaper, margin=1in]{geometry}\n\\usepackage{ams(...TRUNCATED) | "\\documentclass[11pt]{article}\n\n\\usepackage[letterpaper, margin=1in]{geometry}\n\\usepackage{ams(...TRUNCATED) | 4daec7d4a4799ba274d3167da529c046d119fa0a5386fd0ed1fcaac611fd2054 | 3eef6e6a138e4a16f1624c3aa37ac0a050c0de525752a045c625a39833112b0b | 500fa2748529c92ef6813323e1f8767990ba9e2f8a52eaf2f022bab87ed5bd10 | 15 | 6 | [{"perturbation_id":"P000_S0000","error_subtype":"circular_reasoning","original":"\\begin{proof}\nTh(...TRUNCATED) |
2604.18661v1__logic | 2604.18661v1 | "Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Li(...TRUNCATED) | cs.CC | cs.DS | theoretical | logic | Reasoning | true | http://creativecommons.org/licenses/by/4.0/ | true | "\\documentclass[11pt]{article}\n\n\\usepackage[a4paper,margin=1in]{geometry}\n\\usepackage[T1]{font(...TRUNCATED) | "\\documentclass[11pt]{article}\n\n\\usepackage[a4paper,margin=1in]{geometry}\n\\usepackage[T1]{font(...TRUNCATED) | "\\documentclass[11pt]{article}\n\n\\usepackage[a4paper,margin=1in]{geometry}\n\\usepackage[T1]{font(...TRUNCATED) | c1fee6b9f8bf66d998f81f086016aa77809db3e94e23f35d07f6eb069f6a62d0 | ac1c9021a57dfa8aee2273ebb2481565dc1c25c1b642d24cb6fde246637b02de | 2be936fd0bb70e2a8efa9b3e6bd0b44f91af27aaae2ce452ec1b4284c55ae1d7 | 14 | 14 | [{"perturbation_id":"P000_S0000","error_subtype":"missing_case","original":"\\begin{proof}\nFor ever(...TRUNCATED) |
2604.19872v1__logic | 2604.19872v1 | Border subrank of higher order tensors and algebras | cs.CC | math.AG | theoretical | logic | Reasoning | false | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | false | null | null | null | c6dfd637083217cc1087d3143ad61cc9c817cef2a2a41818a4c5da653e1d4f5b | 4107ec371d4b887ebf3332df1d0642379e08cd62d57131171b86a8b4838fef32 | f2710ed0113e8c786488e5710c0cdf8657bc3b388e2cec9490c63fd52ef5af29 | 18 | 8 | [{"perturbation_id":"P000_S0000","error_subtype":"circular_reasoning","original":"\\begin{proof}\n (...TRUNCATED) |
OpenAIReview Perturbation Benchmark
This benchmark measures how well an AI review system finds errors in scientific papers. We took 72 recent arXiv papers with full LaTeX source and injected known errors into them. A review system reads the perturbed paper, and recall is the share of injected errors that its comments identify.
The benchmark accompanies the OpenAIReview paper and code: https://github.com/ChicagoHAI/OpenAIReview
Contents
- 72 papers from eight arXiv subject classes: cs.CC, cs.LG, econ.EM, hep-ex, math, physics.atm-clus, q-bio.GN and stat.AP.
- 170 rows. Each row is one paper with one error category injected, so a paper appears once per category.
- 2,337 scored errors (2,651 injected in total, see
scoredbelow). - 24 papers form the frontier subset (
in_frontier_subset), where the paper also ran GPT-5.5 and Claude Opus 4.7.
| Error category | Rows | What changes |
|---|---|---|
| Surface | 69 | A local math edit: a sign or operator, an index or subscript, a numeric parameter, or a computation |
| Claim | 61 | A false theoretical claim (a perturbed definition or theorem statement) or a false empirical claim |
| Experimental | 35 | A reversed causal claim, a misinterpreted result, or p-hacking |
| Reasoning | 5 | Circular reasoning, an invalid implication, an induction error, or a missing case in a proof |
Columns
| Column | Description |
|---|---|
id |
<arxiv_id>__<error_type> |
arxiv_id, title |
Source paper |
domain |
The arXiv listing the paper was sampled from |
primary_category |
The paper's primary arXiv category |
paper_type |
theoretical or empirical, which sets the error types injected |
error_type, error_category |
Error type of this row (surface, claim_theoretical, statement_empirical, logic, experimental) and its category |
in_frontier_subset |
Whether the paper is in the 24-paper frontier subset |
license, text_included |
arXiv license of the source paper, and whether the three text columns are filled |
clean_paper |
The original paper as LaTeX, flattened by the OpenAIReview parser |
perturbed_paper |
clean_paper with every edit in perturbations applied |
review_input |
perturbed_paper cut to its first 13,000 tokens (cl100k_base). This is the text review systems were given |
clean_sha256, perturbed_sha256, review_input_sha256 |
Hashes of the three texts, for checking rebuilt copies |
n_perturbations, n_scored |
Number of edits, and number that fall inside review_input |
perturbations |
List of edits, in document order (fields below) |
Each item in perturbations has:
| Field | Description |
|---|---|
perturbation_id |
Identifier within the row |
error_subtype |
Specific error, for example operator_or_sign or causal_reversed |
original, perturbed |
The text before and after the edit |
offset |
Character offset of original in clean_paper |
why_wrong |
Why the edited text is wrong. Scoring compares review comments against this |
verifier_quote, verifier_reason |
The passage a verifier model used to confirm the error is real, and its reasoning |
scored |
Whether the edit falls inside review_input and counts toward recall |
Getting the text for every row
Only 44 papers (107 rows) carry a license that allows sharing a modified copy (CC BY or CC BY-NC-SA).
For the other 28 papers (63 rows), the text columns are empty and the rows keep the edits, offsets and hashes.
rebuild.py downloads each paper's source from arXiv, rebuilds all three texts and checks them against the hashes:
pip install openaireview==0.3.0 datasets
python rebuild.py --out rebuilt.jsonl
Running a review system
Give review_input to the review system, then match each comment against the scored edits.
The paper counts an error as detected when a comment quotes text overlapping the edit and an LLM judge (Gemini 3 Flash) rates the comment's explanation at least 4 out of 5 against why_wrong.
The scoring code is benchmarks/perturbation/score.py in the GitHub repository.
How the errors were made
Gemini 3 Flash proposed edits for candidate spans in each paper, and Claude Sonnet 4.6 kept only edits it judged to be real and substantive errors.
Papers were then cut to 13,000 tokens, and rows with fewer than 5 errors left in that range were removed.
We sampled 74 papers, and 2 lost every row to that filter, which leaves 72.
One edit replaced \right with a carriage return followed by ight, from a JSON escaping error during generation. The benchmark read papers in text mode, so the carriage return became a newline, and the data here matches what review systems saw.
License
Each row is a derivative of one arXiv paper and keeps that paper's license, given in the license column.
Rows from CC BY-NC-SA papers may be used only for noncommercial purposes and shared under the same license.
- Downloads last month
- 74