Problem detail · source-aware
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Among classes of tournaments for which neither hardness nor polynomial-time solvability of isomorphism was known, bounded VC dimension stood out as an open problem of Neuen and Grohe. Resolved: isomorphism of tournaments of VC dimension $d$ is decidable in time $n^{O(d \log d)}$, so automorphism groups of bounded-VC tournaments are computable in polynomial time; isomorphism of tournaments of bounded chromatic number is also polynomial-time decidable.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
The statement of AI use names two specific steps: the proof of one preliminary lemma (the tournament VC-dimension lemma) was provided by Claude Sonnet 5, and the proof of a second bound was simplified by it. Named model-contributed lemmas inside a human-led argument.
Provider: Anthropic · Prompt public: unknown · Independence: unknown
Checked by this site on 17 August 2026 against the paper's LaTeX (arXiv:2608.14486, Rassmann-Schweitzer): the statement of AI use is verbatim, with the two lemmas identified by reference, and the abstract states the Neuen-Grohe attribution. The algorithm was not checked here. Days-old preprint, no independent review.
Correctness: unknown · statement fidelity: unaudited · peer review: none
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Source-reported tools: argument.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.