← Back to article

Equation 12 · The Hardest Unsolved Problems in Open-Weight AI

What does this equation mean?

sobs=(1−c) strue+c.s_{\text{obs}} = (1 - c)\, s_{\text{true}} + c.

Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.

Inputs and operations(1 - c) s_true + c
Result or conditions_obs
How to read the two sides of this formula. Follow the article passage for the meaning of each quantity.

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.

Read it piece by piece

sobss_{\text{obs}}

Symbol s_obs

sos_obs is part of the quantity the equation computes from the expression on the right.

Understand this part →

cc

Symbol c

c is one of the signed contributions combined to compute the quantity on the left.

Understand this part →

strues_{\text{true}}

Symbol s_true

the underlying capability the benchmark intends to measure.

Understand this part →

=

=

The expressions on both sides represent the same quantity under the stated assumptions.

Understand this part →

See an illustrated explanation →
addition

addition

Add the term after the plus sign to the term or group before it.

Understand this part →

subtraction

subtraction

Subtract the following term or group from the preceding one. A leading minus marks a negative quantity.

Understand this part →

subscript

subscript

The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.

Understand this part →

How to interpret it

Read it with the definitions, units, and assumptions supplied by the article.

What the article says around this equation

A simple decomposition makes clear why this is a measurement problem and not merely an inconvenience. Let sobss_{\text{obs}} be an observed benchmark score, strues_{\text{true}} the underlying capability the benchmark intends to measure, and c the fraction of test instances the model has effectively memorized, whether verbatim or through a rephrased variant. If a memorized instance is answered correctly with certainty, then approximately sobs=(1−c) strue+cs_{\text{obs}} = (1 - c)\, s_{\text{true}} + c. Every published leaderboard number implicitly assumes c ≈\approx 0 . The methods above show that assumption is not something the field can currently verify for a given open-weight release, only something it can occasionally catch violated in…
Read the full surrounding passage
A simple decomposition makes clear why this is a measurement problem and not merely an inconvenience. Let sobss_{\text{obs}} be an observed benchmark score, strues_{\text{true}} the underlying capability the benchmark intends to measure, and c the fraction of test instances the model has effectively memorized, whether verbatim or through a rephrased variant. If a memorized instance is answered correctly with certainty, then approximately sobs=(1−c) strue+cs_{\text{obs}} = (1 - c)\, s_{\text{true}} + c. Every published leaderboard number implicitly assumes c ≈\approx 0 . The methods above show that assumption is not something the field can currently verify for a given open-weight release, only something it can occasionally catch violated in specific, published cases — which is a different and much weaker guarantee than a general bound on c .

Read the equation in its article →

Sources cited in the article section

These citations give research context. Read each source to check which claims it supports.

Return to The Hardest Unsolved Problems in Open-Weight AI

See this formula across 1 published context →

Browse the mathematical compendium →