Skip to content
SearchFR · Français
Get started

Not evaluated

Memory–sample lower bounds for noiseless Gaussian regression (family 140)

The gist

On October 6, 2026, OpenAI announced 6 manuscripts on memory-sample lower bounds for noiseless Gaussian regression, from an unreleased internal model.

DiscoverIA status on October 12, 2026: not evaluated, meaning no third-party evaluation found.

Status detailsDetails

AI draft, not reviewedWhat has not been reviewed?

Text written by an AI (DiscoverIA pipeline), on . The status and its sources come from the registry; only the explanatory text has not been reviewed. A reported error is corrected, then the text is reviewed.

FollowReport

Cite this entry

A single status snapshot since Oct 12, 2026: a citation always points to a dated snapshot.

Cite snapshot 1, Oct 12, 2026

APA citation with the dated link

DiscoverIA. (2026, October 12). Memory–sample lower bounds for noiseless Gaussian regression (family 140) [Status: Not evaluated, snapshot 1]. DiscoverIA registry. https://discoveria.ai/entry/oai-fam-140-memorysample-lower-bounds-noiseless-gaussian#releve-1

BibTeX @misc, key discoveria-oai-fam-140-memorysample-lower-bounds-noiseless-gaussian-r1

@misc{discoveria-oai-fam-140-memorysample-lower-bounds-noiseless-gaussian-r1,
  author       = {{DiscoverIA}},
  title        = {Memory–sample lower bounds for noiseless Gaussian regression (family 140)},
  howpublished = {DiscoverIA registry, entry oai-fam-140-memorysample-lower-bounds-noiseless-gaussian},
  note         = {Status “Not evaluated”, snapshot 1, recorded on October 12, 2026. New result},
  year         = {2026},
  url          = {https://discoveria.ai/entry/oai-fam-140-memorysample-lower-bounds-noiseless-gaussian#releve-1},
  urldate      = {2026-10-12}
}

Dated link opens this snapshot in the history

https://discoveria.ai/entry/oai-fam-140-memorysample-lower-bounds-noiseless-gaussian#releve-1

To understand ≈ 30 s reading time, estimated

What it changes

According to their titles, the manuscripts deal with memory, precision and information in noiseless Gaussian regression. This regression consists in recovering an unknown from Gaussian observations with no measurement error. If the manuscripts were correct, they would give lower bounds linking an algorithm's memory to the number of observations it needs.

What remains unclear

The Lean (a language in which a computer checks every step of a proof) is supplied by OpenAI itself and marked “unchecked” in formalization.yaml. No third-party verification is recorded. It has 8 Comparator statements for 6 manuscripts, and the sources read do not say how they relate to them.

For experts

Sources, method, key facts, status history, report an error

Status

Not evaluated

Recorded on · github.com · 140.md

Step 1 of 4 on the scale: not evaluated. Next step: under review.

  1. Announced
  2. Recordednot evaluated
  3. nextTo follow
What this status means

Source reading : Source read word for word (level 3 of 3)

The result is declared neither right nor wrong.

To move to “Under review”: a public review under way. To “Peer reviewed”: a journal publication or a review by named experts.

Full history

Proofs
manuscrit : Memory and precision in noiseless Gaussian regression (preprints/Memory-and-precision-in-noiseless-Gaussian-regression-September-27-2026), manuscrit : Posterior replicas and conditional information in Gaussian regression (preprints/Posterior-replicas-and-conditional-information-in-Gaussian-regression-September-27-2026), manuscrit : Localization costs and information growth for exact Gaussian observations (preprints/Localization-costs-and-information-growth-for-exact-Gaussian-observations-September-27-2026), manuscrit : Projection moments, positive cap domination, and Riesz estimates on the sphere (preprints/Projection-moments-positive-cap-domination-and-Riesz-estimates-on-the-sphere-September-27-2026), manuscrit : Replacing Gaussian observations in memory-constrained inference (preprints/Replacing-Gaussian-observations-in-memory-constrained-inference-September-27-2026), manuscrit : Subsphere methods for memory-sample lower bounds in noiseless Gaussian regression (preprints/Subsphere-methods-for-memory-sample-lower-bounds-in-noiseless-Gaussian-regression-September-27-2026), Lean fourni par le revendicateur : lean/docs/140.md, 8 énoncé(s) Comparator (non vérifié par un tiers)

Sources

Method

The openai/math repository contains 6 manuscripts dated September 27, 2026. Two of them are titled “Memory and precision in noiseless Gaussian regression” and “Subsphere methods for memory-sample lower bounds in noiseless Gaussian regression”. OpenAI attaches lean/docs/140.md and 8 Comparator files, for example lean/ComparatorChallenges/MemoryPrecision.lean. According to history.md, no revision is reported. DiscoverIA status: not evaluated, meaning that no third-party evaluation has been found in the sources read. Set on October 12, 2026 from github.com (page read, quotation checked word for word: “describes the scope of the Lean formalization”).

Limits

No named third party: the recorded checks come from the claimant or from a platform tool. The claimant supplies a Lean proof; as of this date, DiscoverIA has found no independent verification of this proof or of the result.

Key facts

Claimed by
OpenAI (unreleased internal model)
announced on Oct 6, 2026
Nature
new result
Field
Theoretical computer science
In openai/math
family 140, section “Theoretical computer science”, 6 manuscripts dated Sep 27, 2026
Lean proof
supplied by the claimant, marked “unchecked” (not reviewed) in its repository
Revisions
none reported by the claimant
Checked by
claimant (Lean supplied, not checked by a third party)
Sources
16 : 1 read word for word, 15 links only
This entry
AI draft, not reviewed

Status history

Only one observation so far.

  1. 01

    First observation:Not evaluatedCurrent status

    Family with a Lean proof supplied by the claimant. No third-party check read; the source marks this proof as not reviewed (“unchecked”).

    Source: github.comread word for word

An observation is added; none is ever erased.

In the same set

openai/math: 719 manuscripts in 372 families from an unreleased internal model · entry 136 of 372, by family number

See all 372 entries

Report an error or suggest a source

How DiscoverIA uses your address and how to exercise your rights: privacy policy.

Is your result listed?What each status requires, correcting this entry, replying to it.