Skip to content
SearchFR · Français
Get started

Not evaluated

The Benjamini–Schramm nonuniqueness conjecture (family 214)

The gist

On October 6, 2026, OpenAI announced, for the Benjamini–Schramm nonuniqueness conjecture, a manuscript on nonuniqueness of percolation on nonamenable quasi-transitive graphs.

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). The Benjamini–Schramm nonuniqueness conjecture (family 214) [Status: Not evaluated, snapshot 1]. DiscoverIA registry. https://discoveria.ai/entry/oai-fam-214-benjaminischramm-nonuniqueness-conjecture#releve-1

BibTeX @misc, key discoveria-oai-fam-214-benjaminischramm-nonuniqueness-conjecture-r1

@misc{discoveria-oai-fam-214-benjaminischramm-nonuniqueness-conjecture-r1,
  author       = {{DiscoverIA}},
  title        = {The Benjamini–Schramm nonuniqueness conjecture (family 214)},
  howpublished = {DiscoverIA registry, entry oai-fam-214-benjaminischramm-nonuniqueness-conjecture},
  note         = {Status “Not evaluated”, snapshot 1, recorded on October 12, 2026. New result},
  year         = {2026},
  url          = {https://discoveria.ai/entry/oai-fam-214-benjaminischramm-nonuniqueness-conjecture#releve-1},
  urldate      = {2026-10-12}
}

Dated link opens this snapshot in the history

https://discoveria.ai/entry/oai-fam-214-benjaminischramm-nonuniqueness-conjecture#releve-1

To understand ≈ 20 s reading time, estimated

What it changes

Percolation consists in keeping or erasing each edge of a graph at random. Nonuniqueness refers to the random graph containing more than one infinite cluster (a set of vertices linked to one another). If the manuscript were correct, it would show that such a situation can occur, in the precise form it states.

What remains unclear

The Lean (a language in which a computer checks every step of a proof) is supplied by OpenAI: the repository marks its review “unchecked”, and no third-party verification has been found.

For experts

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

Status

Not evaluated

Recorded on · github.com · 214.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 : Nonuniqueness of percolation on nonamenable quasi-transitive graphs (preprints/Nonuniqueness-of-percolation-on-nonamenable-quasi-transitive-graphs-September-24-2026), Lean fourni par le revendicateur : lean/docs/214.md, 2 énoncé(s) Comparator (non vérifié par un tiers)

Sources

Method

The manuscript “Nonuniqueness of percolation on nonamenable quasi-transitive graphs” is dated September 24, 2026; family 214 has only this one. The repository contains lean/docs/214.md and two Comparator statements (BenjaminiSchramm.lean and CayleyPercolation.lean, in lean/ComparatorChallenges). The family is absent from the sources of formalization.yaml, and history.md reports no revision of the manuscript. 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
Mathematics (Probability and statistical mechanics)
In openai/math
family 214, section “Probability and statistical mechanics”, 1 manuscript dated Sep 24, 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
5 : 1 read word for word, 4 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 208 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.