Not evaluated
Bounded-distortion L_1 embeddings of planar and bounded-treewidth graphs (family 089)
The gist
On October 6, 2026, OpenAI announced, with an unreleased internal model, two manuscripts on L1 embeddings of planar graphs and of graphs of bounded treewidth.
DiscoverIA status on October 12, 2026: not evaluated, meaning no third-party evaluation found.
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.
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
BibTeX @misc, key discoveria-oai-fam-089-bounded-distortion-l-1-embeddings-planar-r1
@misc{discoveria-oai-fam-089-bounded-distortion-l-1-embeddings-planar-r1,
author = {{DiscoverIA}},
title = {Bounded-distortion L_1 embeddings of planar and bounded-treewidth graphs (family 089)},
howpublished = {DiscoverIA registry, entry oai-fam-089-bounded-distortion-l-1-embeddings-planar},
note = {Status “Not evaluated”, snapshot 1, recorded on October 12, 2026. New result},
year = {2026},
url = {https://discoveria.ai/entry/oai-fam-089-bounded-distortion-l-1-embeddings-planar#releve-1},
urldate = {2026-10-12}
}Dated link opens this snapshot in the history
To understand ≈ 30 s reading time, estimated
What it changes
Embedding a metric into L1 means placing its points in a space where distance is the sum of the differences in coordinates; the distortion measures how much distances are changed. If the manuscript held, planar graph metrics would embed into L1 with constant distortion, that is, bounded by a factor that does not depend on the size of the graph. The second manuscript deals with L1 embeddings of graphs of bounded treewidth, a measure of how much a graph resembles a tree.
What remains unclear
The Lean (a language in which a computer checks every step of a proof) is supplied by OpenAI itself, and its tracking file carries the mention “unchecked”. No third-party verification is recorded. It is not known how far the 2 Lean statements cover the manuscripts.
For experts
Sources, method, key facts, status history, report an error
Status
Not evaluated
Recorded on · github.com · 089.md
Step 1 of 4 on the scale: not evaluated. Next step: under review.
- Announced
- Recordednot evaluated
- 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.
Sources
- Main sourcegithub.com · CONTENTS.mdlink only, reading not recorded
- Repositorygithub.com · Planar-Graph-Metrics…link only, reading not recorded
- Repositorygithub.com · L1-Embeddings-of-Graphs…link only, reading not recorded
- Lean proofgithub.com · 089.mdpage read word for word
- Lean proofgithub.com · BoundedTreewidthL1.leanlink only, reading not recorded
- Lean proofgithub.com · PlanarL1.leanlink only, reading not recorded
Method
The openai/math repository contains two manuscripts dated September 23, 2026: “Planar Graph Metrics Embed into L1 with Constant Distortion” and “L1 Embeddings of Graphs of Bounded Treewidth”. The file lean/docs/089.md describes the scope of the Lean formalisation, with 2 Comparator statements. The family is among the sources of formalization.yaml, and history.md reports no revision. 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 (Convex and metric geometry)
- In openai/math
- family 089, section “Convex and metric geometry”, 2 manuscripts dated Sep 23, 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
- 6 : 1 read word for word, 5 links only
- This entry
- AI draft, not reviewed
Status history
Only one observation so far.
- 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 86 of 372, by family number
- Not evaluated : An L³ bound for the trilinear Hilbert transform (family 086)
- Not evaluated : The Mahler conjectures and symplectic width (family 087)
- Not evaluated : Petty's projection-volume conjecture and simplex counterexamples (family 088)
- Not evaluated : Bounded-distortion L_1 embeddings of planar and bounded-treewidth graphs (family 089)
- Not evaluated : Universal optimality of the triangular lattice (family 090)
- Not evaluated : The logarithmic Brunn–Minkowski conjecture (family 091)
- Not evaluated : The optimal order of convex-body covering density (family 092)
Report an error or suggest a source
Thank you, your message was sent.
Sending failed. Try again, or write to contact@discoveria.ai.
Is your result listed?What each status requires, correcting this entry, replying to it.