Not evaluated
Approximate counting and the perfect-matching entropy conjecture (family 113)
The gist
OpenAI claims, in two manuscripts announced on October 6, 2026, a fully polynomial randomized approximation scheme for perfect matchings, and a study of their polytope.
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-113-approximate-counting-perfect-matching-r1
@misc{discoveria-oai-fam-113-approximate-counting-perfect-matching-r1,
author = {{DiscoverIA}},
title = {Approximate counting and the perfect-matching entropy conjecture (family 113)},
howpublished = {DiscoverIA registry, entry oai-fam-113-approximate-counting-perfect-matching},
note = {Status “Not evaluated”, snapshot 1, recorded on October 12, 2026. New result},
year = {2026},
url = {https://discoveria.ai/entry/oai-fam-113-approximate-counting-perfect-matching#releve-1},
urldate = {2026-10-12}
}Dated link opens this snapshot in the history
To understand ≈ 30 s reading time, estimated
What it changes
If the first manuscript held, it would provide a randomized algorithm that estimates the number of perfect matchings of any graph (points joined by links). A perfect matching joins each point to exactly one other; the error of the estimate could be set as wished and the running time would stay polynomial. The second manuscript concerns the entropy and face dimension of the perfect-matching polytope (a solid with flat faces built from these matchings).
What remains unclear
The repository file formalization.yaml marks the Lean (a language in which a computer checks every step of a proof) supplied by OpenAI as “review: status: unchecked”. No third-party check has been read, so it is not known whether the manuscripts hold.
For experts
Sources, method, key facts, status history, report an error
Status
Not evaluated
Recorded on · github.com · 113.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 · A-Fully-Polynomial…link only, reading not recorded
- Repositorygithub.com · Entropy-and-Face…link only, reading not recorded
- Lean proofgithub.com · 113.mdpage read word for word
- Lean proofgithub.com · BinaryMatching.leanlink only, reading not recorded
- Lean proofgithub.com · MatchingEntropy.leanlink only, reading not recorded
- Lean proofgithub.com · MatchingEntropyBounds.leanlink only, reading not recorded
- Lean proofgithub.com · MatchingFPRAS.leanlink only, reading not recorded
- Lean proofgithub.com · SingletonLoopMatching.leanlink only, reading not recorded
- Lean proofgithub.com · TriangleFace.leanlink only, reading not recorded
Method
A manuscript dated September 23, 2026: “A Fully Polynomial Randomized Approximation Scheme for Perfect Matchings in General Graphs”. A second one, of the same date: “Entropy and Face Dimension of the Perfect-Matching Polytope”. The repository contains lean/docs/113.md and 6 Comparator statements. 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 113, section “Theoretical computer science”, 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
- 10 : 1 read word for word, 9 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 110 of 372, by family number
- Not evaluated : Optimal-order randomized k-server on arbitrary metrics (family 110)
- Not evaluated : One-sample matroid prophet inequalities against an almighty adversary (family 111)
- Not evaluated : Beyond the square-root exponent for depth-three circuits (family 112)
- Not evaluated : Approximate counting and the perfect-matching entropy conjecture (family 113)
- Not evaluated : Approximate counting of common integer polymatroid bases (family 114)
- Not evaluated : Sampling and counting contingency tables with arbitrary margins (family 115)
- Not evaluated : Uniform identity testing for noncommutative formulas (family 116)
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.