Arguments on real-world AI oversight questions admit decompositions stable enough for recursive debate's efficiency guarantees to apply.

Reading of the claim. As worded, a general statement about the present: for the real-world questions AI oversight has to answer (is this research output correct, is this code change safe, is this action acceptable), a true answer can be argued through a decomposition whose per-step sensitivity is low enough for the proved efficiency guarantees to apply. It is not the weaker claim that some such questions qualify, nor the claim that the protocols are unsafe where it fails.

Prior before reading. The formal condition is a constant bound on sensitivity per step, far below the number of subclaims, over a recursion deep enough to reach human-judgeable leaves. Conditions of this kind usually hold for a structured subclass and fail as generalities. A conclusion of the form "all q parts are right" has fractional block sensitivity q at the all-true input (each single part is a sensitive block, and they are disjoint), which is the worst case; a threshold with a margin has constant sensitivity. Oversight questions include many of the first form. Prior about 0.2 to 0.3 for the general claim.

Sources read directly in this pass. 1. Brown-Cohen et al., "Avoiding Obfuscation with Prover-Estimator Debate", revised July 2026, introduction and discussion sections from the arXiv source, arxiv.org/abs/2506.13609. Stability is "the primary restriction on the class of problems that can be accurately judged"; there can be problems all of whose efficient decompositions are unstable, and the protocol then rejects the argument; stability is needed for completeness, not soundness. The discussion says more understanding is needed of when stability can be achieved "in practice for debates in messy, unformalized settings", and offers as an "optimistic hope" a division into problems with precise dependence on individual subclaims (mathematical proofs) and those without (noisy empirical science). The authors' argument for naturalness is that one should be suspicious of arguments that depend precisely on many imprecise subclaims. That is a reason to distrust unstable arguments; it is not evidence that true answers have stable ones. 2. Li, Xun, Chen and Brown-Cohen, "How to Have a Sensitive Debate", October 2026, introduction and discussion from the arXiv source, arxiv.org/abs/2610.02557. Stability is equivalent to bounded fractional block sensitivity; cost scales as the sensitivity raised to the depth; the two-thirds-of-99 example gives sensitivity 4 and the 50-of-99 example forces checking all 50; a matching lower bound holds for any protocol with black-box access to human judgment. The discussion adds that finding flawed subproblems may be much harder than creating them for bounded debaters. This moved the view on one point: the condition cannot be removed by a cleverer protocol within the current model, so the claim's truth fixes the reach of the whole approach. 3. Brown-Cohen and Irving's forum post with comments, www.lesswrong.com/posts/8XHBaugB5S3r27MG9/prover-estimator-debate-a-new-scalable-oversight-protocol. The paper "does not resolve whether most questions have stable arguments in practice"; stable arguments exist given sufficiently many independent pieces of evidence at the base (a von Neumann majority-vote construction); open problems are whether weaker assumptions suffice and when independent evidence can be found in practice. Beth Barnes, who ran the 2020 experiments, comments that counterexamples to "usually a compact and stable honest argument" are easy to give, cites unsupervised translation, reports that her human experiments "ran into obfuscation / instability problems", and allows that the honest debaters may not have used the right tactics. Jacob Pfau proposes a dataset to assess how often stable arguments can be found and remarks that for questions of research taste it is unclear what independent evidence would look like. Geoffrey Irving agrees that datasets probing the problem still need to be built. 4. Buhl, Pfau, Hilton and Irving, "An alignment safety case sketch based on debate", key claim 2 read from the arXiv source, arxiv.org/abs/2505.03989. Stability is a claim the case needs; "We are not yet sure how to support this claim, so we leave the evidence box blank"; unstable queries return no answer, so the protocol is safe for all queries and useful only for stable ones. The same section names a prior worry: some truths in AI research may be knowable only through heuristics and taste and not defensible by deductive decomposition at all.

All four sources come from the small group that develops debate or from a critic within the same community. Their statements that the condition is open are against the developers' interest and are weighted as such. No source asserts the claim outright.

Search for measurements. Web searches on stability or obfuscated-argument experiments, datasets, fractional block sensitivity measured on real arguments, and discussion of the 2026 paper returned the papers above and no empirical measurement, no language-model implementation of either protocol on realistic tasks, and no dataset. The search was confined to English-language AI-safety and machine-learning venues, which is where such work would appear, and the developers have stated an intention to build such datasets, so the absence is informative: the claim is unmeasured.

How the arguments weigh. - Redundant independent evidence (for). The inference from the premise is sound for the questions it covers, but the premise that correct answers typically have many independent supports↗︎ is unestablished and doubtful as a generality (about 0.3). It carries the claim for empirical, evidence-pooling questions. - Conclusions in which every step is necessary (against). The sensitivity arithmetic is exact. That many oversight questions require nonredundant chains↗︎ is likely (about 0.65), conceded for proofs by the protocol's authors, and plausible for "no flaw anywhere" judgments about code and analyses, which are central oversight tasks. The unresolved part is how often such chains can be recast with redundancy. - Human experiments (against). One small set of experiments, with the experimenter's own caveat. Slight weight. - A further consideration not tied to one argument: "stable enough" depends on depth as well as per-step sensitivity. Multi-day research tasks need deep recursion to reach human-judgeable leaves, and cost grows as sensitivity to the power of depth, so even modest sensitivity is demanding.

Verdict. Credence about 0.25 that the general claim holds as worded; much higher that it holds for a subclass. Doubtful and not inconclusive because the structural argument and the proponents' own concessions point the same way and nothing positive has been shown on realistic tasks; low verdict confidence because the decisive quantity has never been measured and the share of oversight questions of each kind is a matter of judgment.

Limits. Barnes's 2020 write-up of the human experiments and the proof of the independent-evidence theorem were not read; they are represented here through her 2025 comment and the authors' summary. Unpublished laboratory work is unknown.

What would change it. Upward: measured low sensitivity for the best decompositions of realistic code-review or research-evaluation questions, or a demonstrated general method for recasting necessary chains with verifiably independent redundancy. Downward to contradicted: a dataset showing that honest debaters with adequate tactics cannot find stable decompositions for most realistic questions.