The Arborescence-Sampling Barrier for Eulerian Tours
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.
Exact FrontierDelta
Scope and record
Occurred: May 28, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. Imported under CC BY 4.0.
Canonical aliases: The Arborescence-Sampling Barrier for Eulerian Tours · Eulerian tour sampling
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
Nima Anari
human · human collaborator
GPT-5.5 Pro Extended
model · ai model contributor · OpenAI
Codex
model · ai model contributor · OpenAI
Lineage and corrections
This event attributed to Nima Anari
This event attributed to Codex
This event attributed to GPT-5.5 Pro Extended