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.
Sampling a nearly uniform Eulerian tour of a directed Eulerian multigraph was stuck at $mn$-type running times coming from arborescence sampling. A randomized algorithm achieves $\widetilde{O}(m^{3/2})$ worst case, breaking that barrier on sparse graphs.
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.
A clean division of labour, stated as such: the author conjectured the mixing theorem underlying the analysis, and GPT-5.5 Pro Extended produced its linear-algebra proof. Codex assisted with manuscript assembly.
Provider: OpenAI · Prompt public: unknown · Independence: unknown
Single-author arXiv preprint; not yet peer-reviewed.
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.