arXiv:2611.23244v1 Announce Type: new Abstract: Goemans conjectured that any fractional single-source flow could be converted into an unsplittable flow without increasing total cost and while increasing any arc load by at most the largest demand. Recently, Dmitry Rybin announced a seven-vertex counterexample found through an interaction with ChatGPT, which disproved this long-standing conjecture. However, the interaction did not reveal why this particular topology and its demand, fractional-flow, and cost choices work together, whether the example belongs to a broader family, or which structural features determine where counterexamples can occur. It also left unclear why the AI-assisted search succeeded where earlier human efforts had not. In this paper, we develop a forward counterexample construction pipeline. It starts from an arborescence on which failure is impossible and adds terminal-entering shortcut arcs. The resulting load constraints define a finite set of admissible route choices; their convex hull, the conflict polytope, yields exact conditions for demands, fractional flows, and costs. Starting from a simple arborescence, the pipeline selects Rybin's topology and characterizes all counterexamples it supports. Experiments further demonstrate the pipeline's transferability: when instructed to follow it while varying the initial arborescence and shortcut placement, ChatGPT produced counterexamples on topologies genuinely different from Rybin's and found valid constructions starting from 93 other rooted arborescence shapes. The theory also explains why the original example was difficult to discover through blind enumeration and suggests that Rybin's interaction lies between blind enumeration and a complete theory-guided construction.
Goemans's Unsplittable-Flow Conjecture: The Anatomy of AI-Assisted Counterexample Discovery
A new arXiv paper (2611.23244v1) explains the seven-vertex counterexample to Goemans's unsplittable-flow conjecture that Dmitry Rybin found through an interaction with ChatGPT, and shows the approach generalizes: when instructed to follow the paper's forward construction pipeline, ChatGPT produced valid counterexamples on topologies different from Rybin's and found constructions starting from 93 other rooted arborescence shapes. The pipeline begins with an arborescence on which failure is impossible, adds terminal-entering shortcut arcs, and uses the convex hull of the resulting admissible route choices — the conflict polytope — to derive exact conditions on demands, fractional flows and costs. The authors say the theory explains why the original example resisted blind enumeration and places Rybin's ChatGPT interaction between blind enumeration and fully theory-guided construction.
A forward construction pipeline — start from an arborescence where failure is impossible, add terminal-entering shortcut arcs, and solve the conflict polytope for exact demand, fractional-flow and cost conditions — let ChatGPT find valid counterexamples from 93 rooted arborescence shapes beyond Rybi
Run your AI side-project on zahid.host
EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.