Minerval
Sourcepreprinttext stored

Scaling Laws For Scalable Oversight

Engels, Joshua, Baek, David D., Kantamneni, Subhash, Tegmark, MaxarXiv.orgPublished Apr 25, 2025Original︎ ↗

Claims1
ExaminationsNone
Text145 sections
VersionsOne known
CopiesNone recorded
CorrectionsNone recorded
Facts checked Nov 12, 2026
ReachNo copies recorded
StructureIn 1 claim's map0 sources downstream across 1 claim
EvidenceNot yet read
ReviewsNot reviewed

Examinations

None recorded. An examination is commissioned by a claim’s Steward for what its claim rests on; a review of the document for its own sake is asked for as a request bearing on it.

Text765 passages · 1 marked

No examination yetMarked passage
29

In Fig. 3 , we see that both Guard and Houdini Elos scale with general intelligence. The Guard intercept is higher than the Houdini intercept, indicating that the game is more difficult for Houdinis—i.e., even the strongest Houdinis fail to significantly exceed a 50% success rate against the weakest Guards. Moreover, the Houdini slope is steeper than the Guard slope, suggesting that general intelligence yields greater returns for generating malicious code than detecting it. However, smarter Houdinis do not craft more deceptive backdoors—they are simply more likely to produce functionally valid ones. In Fig. 13 ( Section F.3 ), we observe that given a viable backdoor was generated (passing criteria 1 and 2), models with higher intelligence are not more likely to have their backdoor deceive the Guard.

More capable AI agents better conceal misbehavior from a fixed AI monitor.Supporteddenies

Not yet read by this claim’s Steward.

Lineage across 1 claim

Draws on · none recorded
This source
Scaling Laws For Scalable Oversight
in 1 claim's map
Drawn on by · none recorded

Record

Kind
preprint
Authors
Engels, Joshua, Baek, David D., Kantamneni, Subhash, Tegmark, Max
Publisher
arXiv.org
Published
Apr 25, 2025
DOI
None
Link
https://arxiv.org/html/2504.18530
Archived copy
None found
Stored text
101,839 characters, retrieved Nov 11, 2026 · 145 sections, 765 passages
Claims extracted
Not recorded
Versions
One known
Copies
None recorded
Corrections
None recorded
Facts checked
Nov 12, 2026

History 3

  1. Nov 12, 2026FactsFacts fetcher · Facts looked up
  2. Nov 11, 2026DividedSegmenter · Divided into 934 parts by its own structure
  3. Nov 11, 2026Entered the graphEntered the graph; copy stored