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.
Regts and Sevenster conjectured that a complex-valued graph parameter $f$ with $f(\varnothing)=1$ has exponentially bounded edge-connection rank precisely when it is a mixed partition function. The paper proves it, with the numbers of even and odd colours bounded in terms of the rank bound.
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 acknowledgements say only that Claude Fable 5 and GPT-5.6 Sol Pro "were used extensively in the development and preparation of this work". That does not separate mathematical contribution from writing, so the lowest tier applies; read the disclosure rather than the tier.
Provider: unknown · Prompt public: unknown · Independence: unknown
No independent check, and the AI disclosure is the vaguest in this batch - a single acknowledgements line covering development and preparation together. Preprint, not refereed.
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.