This is a seminar, not a database. Post the unfinished thing, say what would count as progress, and find someone to work with. Reading is open to everyone.
open questions
816 machine checks are recorded here, and no person has reviewed a single one of them. 6 below, changing daily.
- unfiledErdős Problem #351posed by Paul Erdős, Ronald Graham
“VibeMathed records no statement for this problem. See erdosproblems.com for the original.”
Lean attempted this, and the only judgement on it reads machine: correct. 1 machine check, credited to no account. No person has looked.
- unfiled
“In the circle of Kummer's regular primes and Vandiver's conjecture, the paper proves that almost all primes are partially regular, yielding a partial Vandiver theorem for a density-one set of primes, with consequences…”
Lean attempted this, and the only judgement on it reads machine: partially-checked. 1 machine check, credited to no account. No person has looked.
- math.COOn the complete width and edge clique cover problemsposed by Van Bang Le, Sheng-Lung Peng
“Equivalently, what is the com putational complexity of EDGE CLIQUE COVER on C_4 -free graphs?”
GPT-5.5 xhigh (SMD judge 1) attempted this, and the only judgement on it reads machine: correct. 1 machine check, credited to no account. No person has looked.
- math.COSOME NEW RESULTS ON THE CURLING NUMBER OF GRAPHSposed by N. K. Sudev, C. Susanth, K. P. Chithra, Johan Kok, Sunny Joseph Kalayathankal
“Determine the compound curling numbers different products of graphs in which one graph is a regular graph.”
GPT-5.5 xhigh (SMD judge 1) attempted this, and the only judgement on it reads machine: correct. 1 machine check, credited to no account. No person has looked.
- math.COPattern-Avoiding Polytopesposed by Robert Davis, Bruce Sagan
“Is there a nice combinatorial proof for the number of interior lattice points of P_n(132,312) ?”
GPT-5.5 xhigh (SMD judge 1) attempted this, and the only judgement on it reads machine: correct. 1 machine check, credited to no account. No person has looked.
- unfiled
“For an extension G = A rtimes B of elementary abelian p-groups with a ∈ A satisfying C_B(a) = 1, must H = ⟨ a, B⟩ satisfy rank(Z(H) ∩ H') ≤ rank(B)? An explicit extension violates the bound.”
Lean attempted this, and the only judgement on it reads machine: correct. 1 machine check, credited to no account. No person has looked.
discussion
Nobody has posted yet. Above are 6 problems carrying a machine check that no person has examined — pick one and say whether it holds.
looking for people
Nobody is asking for help yet. If you are starting something, say so — it takes a title, one sentence on what would count as progress, and one thing somebody else could do. start a project →
collections
- far
Open problems stated in published papers, attacked by a model and judged by a second model. Every judgement in this collection is a machine judgement.
- vibemathedVibeMathed586 problems
Mathematics resolved with AI involvement, catalogued by vibemathed.com with the model, the human collaborators and the verification status recorded for each result. Imported under CC BY 4.0.
Both are machine-run. Neither has been read by a person here.
the corpus
how this works
- Reading needs no account. Posting needs a verified address; recognised institution domains are automatic and everything else is reviewed by a person.
- A machine judgement is labelled as one wherever it appears and credits no account. Human reviews and machine checks are counted apart and are never added together.
- Nothing here is ever closed automatically. A project that has gone quiet says so, and stays.
- Disclose AI involvement on every attempt. If you do not understand the mathematics yourself, do not post it here.