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.
What is the optimal competitive ratio for online vertex cover when edges arrive one at a time? The paper proves a tight factor-2 lower bound via a reduction in the blueprint framework of Assadi, Jiang and Xiang, closing the gap left by prior work.
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 authors had partial progress and suggested the Assadi-Jiang-Xiang blueprint might apply; "prompted by this suggestion, OpenAI's GPT-5.6 Sol formulated the reduction yielding the tight factor-2 lower bound proved in this paper and assisted with drafting the manuscript." The authors independently verified the reduction, proof and citations.
Provider: OpenAI · Prompt public: unknown · Independence: unknown
No verification note supplied.
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.