跳到正文
arXiv cs.AI· Jingwei Ge, Na Xie, Li Li, Jiayang Li·· 1 小时前AI 评分45

Goemans 不可分流猜想:AI 辅助反例发现的剖析

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

AI 导读

一篇 arXiv 论文剖析 Dmitry Rybin 借助 ChatGPT 发现的七顶点反例,该反例推翻了 Goemans 关于单源流可无损转为不可分流的长期猜想。

正文 · 原文

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)

来源:arXiv cs.AI · arxiv.org