Skip to content
AI News HubLIVE
Original source2 min read

Goemans's Unsplittable-Flow Conjecture: The Anatomy of AI-Assisted Counterexample Discovery

Summary

A new paper analyzes the seven-vertex counterexample to Goemans's unsplittable-flow conjecture found by Dmitry Rybin via ChatGPT, and develops a forward construction pipeline that characterizes all counterexamples for a given topology. The pipeline, based on adding shortcut arcs to an arborescence and using a conflict polytope, is shown to be transferable: ChatGPT produced counterexamples on 93 other arborescence shapes, explaining why the original example was hard to find by blind enumeration.

SourcearXiv Machine LearningAuthor: Jingwei Ge, Na Xie, Li Li, Jiayang Li
Goemans's Unsplittable-Flow Conjecture: The Anatomy of AI-Assisted Counterexample Discovery
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 4 Sep 2026]

Title:Goemans's Unsplittable-Flow Conjecture: The Anatomy of AI-Assisted Counterexample Discovery

View a PDF of the paper titled Goemans's Unsplittable-Flow Conjecture: The Anatomy of AI-Assisted Counterexample Discovery, by Jingwei Ge and Na Xie and Li Li and Jiayang Li

View PDF HTML (experimental)

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.

Subjects:

Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Combinatorics (math.CO)

Cite as: arXiv:2611.23244 [cs.LG]

(or arXiv:2611.23244v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.23244

arXiv-issued DOI via DataCite

Submission history

From: Jiayang Li [view email] [v1] Fri, 4 Sep 2026 02:51:20 UTC (287 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Goemans's Unsplittable-Flow Conjecture: The Anatomy of AI-Assisted Counterexample Discovery, by Jingwei Ge and Na Xie and Li Li and Jiayang Li

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.LG

new | recent | 2026-11

Change to browse by:

cs cs.AI math math.CO

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • The paper proposes a forward counterexample construction pipeline that starts from an arborescence and adds shortcut arcs, using a conflict polytope to derive exact conditions for demands, flows, and costs.
  • The pipeline recovers Rybin's seven-vertex counterexample and characterizes all counterexamples it supports, and ChatGPT following the pipeline found valid constructions on 93 other rooted arborescence shapes.
  • The theory explains why the original counterexample was difficult to discover by blind enumeration and positions Rybin's interaction between blind enumeration and fully theory-guided construction.

Highlights and analysis are generated automatically and may contain errors. Check the original source.