Conjecture · version 2

The exact-cost rounding conjecture

Statement

Every feasible fractional single-source flow x with nonnegative rational costs admits an unsplittable routing P with load_P(a) ≤ x(a) + d_max on every arc and total cost at most the cost of x.

Assumptions

  • Finite directed network; feasible single-source flow and nonnegative rational capacities/costs.
  • Each terminal demand is positive and must be sent along one path.
  • d_max is the largest terminal demand.

Scope

Goemans’ cost-enhanced assertion is refuted; the original congestion-only theorem is not.

Evidence

Source reports

Formal proofs

Connections

In this problem · publication v6 · Selected context

Cost-preserving unsplittable flow →

Primary formulation · Disproved

Relationship not independently reviewed. This concerns its use in this problem.

Sources

A Formal Counterexample to the Cost-Preserving Single-Source Unsplittable Flow Conjecture →

Arthur Freitas Ramos · David Barros Hulak · Ruy Jose Guerra Barretto de Queiroz · Published · Publication date Jul 22, 2026

Public formal source; execution and statement correspondence are separate checks.

Revision & attribution

Source revision: 80985fd56a4cb63a90176bf4bfe456eaff949bfd. Observed Oct 13, 2026.

The AFP authors credit AI assistance for proof engineering and attribute the July counterexample announcement to Dmitry Rybin.

Cost-counterexample Isabelle theory: 80985fd56a4cb63a90176bf4bfe456eaff949bfd.

Independent Lean verification of Goemans’ cost counterexample →

Jason Hickey · Project documentation · Publication date Aug 1, 2026

Public formal source; execution and statement correspondence are separate checks.

Revision & attribution

Source revision: ffba3523f0edd14be3460d039f22a6b98c02fd9e. Observed Oct 13, 2026.

Jason Hickey credits Claude for the verification work and credits Dmitry Rybin’s GPT-5.6 Pro session for the original counterexample.

Cost-counterexample Lean submission: ffba3523f0edd14be3460d039f22a6b98c02fd9e.

Single-Source Unsplittable Flows in Planar Graphs →

Vera Traub · Laura Vargas Koch · Rico Zenklusen · Preprint · Publication date Aug 4, 2023

Revision & attribution

Source revision: 2023-08-04. Observed Oct 13, 2026.

No specific AI contribution is attributed by this source record.

History

Statement versions

Statement versions and problem publication versions are separate. A new publication can update context or sources while retaining the same statement.

Assessment history · 1

Assessments retained in these publication records. Earlier statement versions retain their own source histories.

Record details
Claim ID
claim-flow-cost-preserving-rounding
Statement version
2
SHA-256
92cdc8ef784c2f171649cf03c2088e033afeb540f929abc7e805bb70e953767c

Publication records