{"schema_version":"source-reader-v1","record":{"source_id":"dinitz-garg-goemans-flow-isabelle","versions":[{"work":{"authors":["Arthur Freitas Ramos","David Barros Hulak","Ruy Jose Guerra Barretto de Queiroz"],"kind":"research_project","publication":"published","publication_note":"Public formal source; execution and statement correspondence are separate checks.","ai_role":"self_reported","ai_note":"The AFP authors credit AI assistance for proof engineering and attribute the July counterexample announcement to Dmitry Rybin.","artifacts":[{"kind":"formal_code","title":"A Formal Counterexample to the Cost-Preserving Single-Source Unsplittable Flow Conjecture — pinned source","url":"https://github.com/isabelle-prover/mirror-afp-devel/blob/80985fd56a4cb63a90176bf4bfe456eaff949bfd/thys/Dinitz_Garg_Goemans_Counterexample/Dinitz_Garg_Goemans_Counterexample.thy","version":"80985fd56a4cb63a90176bf4bfe456eaff949bfd","assessment":"not_executed","note":"Exact source inspected; OpenMath has not executed this formal proof project.","sha256":"7ff973cdf50586f3082fc514278e7b8a67e014170cf327bb54bb3676690a5cf7"}],"published":{"value":"2026-07-22"}},"id":"dinitz-garg-goemans-flow:source:isabelle:v1","source_id":"dinitz-garg-goemans-flow-isabelle","title":"A Formal Counterexample to the Cost-Preserving Single-Source Unsplittable Flow Conjecture","owner":"Arthur Freitas Ramos, David Barros Hulak, Ruy Jose Guerra Barretto de Queiroz","url":"https://isa-afp.org/entries/Dinitz_Garg_Goemans_Counterexample.html","subject_scope":"A directed seven-vertex, nine-arc instance has fractional cost 58 and no congestion-allowed unsplittable routing of cost below 60.","revision":"80985fd56a4cb63a90176bf4bfe456eaff949bfd","content_sha256":"7ff973cdf50586f3082fc514278e7b8a67e014170cf327bb54bb3676690a5cf7","update_method":"Compare the exact source and publish a new immutable curation revision.","identifier_policy":"Stable source identity with exact versioned passages.","observed_on":"2026-10-13","source_updated_on":null,"rights":"metadata-link","license":"Original source license and document rights apply.","terms_url":"https://isa-afp.org/entries/Dinitz_Garg_Goemans_Counterexample.html","attribution":"Arthur Freitas Ramos, David Barros Hulak, Ruy Jose Guerra Barretto de Queiroz","rights_note":"OpenMath supplies its own mathematical paraphrases and links; proof text is not republished.","check_interval_days":90}],"entries":[{"id":"dinitz-garg-goemans-flow:entry:isabelle:v1","source_version_id":"dinitz-garg-goemans-flow:source:isabelle:v1","item_id":"isabelle","url":"https://isa-afp.org/entries/Dinitz_Garg_Goemans_Counterexample.html","wording":"A directed seven-vertex, nine-arc instance has fractional cost 58 and no congestion-allowed unsplittable routing of cost below 60.","wording_kind":"paraphrase","locator":"Generic path-flow model; directed graph realization; bounded_unsplittable_cost and dinitz_garg_goemans_cost_counterexample","supersedes":null}],"problems":[{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3}],"selected_version_id":"dinitz-garg-goemans-flow:source:isabelle:v1","available_versions":[{"id":"dinitz-garg-goemans-flow:source:isabelle:v2","revision":"80985fd56a4cb63a90176bf4bfe456eaff949bfd","observed_on":"2026-10-13","title":"A Formal Counterexample to the Cost-Preserving Single-Source Unsplittable Flow Conjecture","publication":"published","content_sha256":null,"used_in_current_publications":true},{"id":"dinitz-garg-goemans-flow:source:isabelle:v1","revision":"80985fd56a4cb63a90176bf4bfe456eaff949bfd","observed_on":"2026-10-13","title":"A Formal Counterexample to the Cost-Preserving Single-Source Unsplittable Flow Conjecture","publication":"published","content_sha256":"7ff973cdf50586f3082fc514278e7b8a67e014170cf327bb54bb3676690a5cf7","used_in_current_publications":false}],"usages":[{"id":"source-use-6e263ac72c374fa9a397","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3},"kind":"activity","title":"Reproduce the two formal evidence paths","claim":null,"fragment":"activity","assessment":null,"superseded":false,"formalization":null,"update":{"id":"dinitz-garg-goemans-flow-verification","title":"Reproduce the two formal evidence paths","kind":"formalization","source_entry_ids":["dinitz-garg-goemans-flow:entry:isabelle:v1","dinitz-garg-goemans-flow:entry:lean:v1"],"summary":"The AFP theory and the Lean project expose independent definitions, path enumerations and theorem targets.","limitation":"Local finite arithmetic checks are not execution of either proof assistant.","related_claim_ids":["claim-flow-seven-vertex-counterexample"]}},{"id":"source-use-9d8abf42b82910cf7d50","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3},"kind":"assessment","title":"Seven-vertex cost gap formally verified","claim":{"id":"claim-flow-seven-vertex-counterexample","version":1,"slug":"flow-seven-vertex-counterexample","title":"Fractional cost 58 versus unsplittable cost 60"},"fragment":"claim-flow-seven-vertex-counterexample","assessment":{"id":"dinitz-garg-goemans-flow:report:witness:v1","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","state":"resolved","source_label":"Seven-vertex cost gap formally verified","scope":"Fractional cost 58; maximum demand 15; allowed unsplittable cost at least 60.","source_date":"2026-07-22","observed_on":"2026-10-13","evidence_url":"https://isa-afp.org/entries/Dinitz_Garg_Goemans_Counterexample.html","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-dfc6536c86400c02a775","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3},"kind":"assessment","title":"Cost-preserving rounding conjecture refuted","claim":{"id":"claim-flow-cost-preserving-rounding","version":1,"slug":"flow-cost-preserving-rounding","title":"The exact-cost rounding conjecture"},"fragment":"claim-flow-cost-preserving-rounding","assessment":{"id":"dinitz-garg-goemans-flow:report:refutation:v1","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","state":"refuted","source_label":"Cost-preserving rounding conjecture refuted","scope":"The conjunction of a largest-demand congestion allowance and preservation of fractional cost.","source_date":"2026-07-22","observed_on":"2026-10-13","evidence_url":"https://isa-afp.org/entries/Dinitz_Garg_Goemans_Counterexample.html","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-18087e9829d3807d75b3","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3},"kind":"formalization","title":"Isabelle/HOL: the cost conjecture is false","claim":{"id":"claim-flow-cost-preserving-rounding","version":1,"slug":"flow-cost-preserving-rounding","title":"The exact-cost rounding conjecture"},"fragment":"claim-flow-cost-preserving-rounding","assessment":null,"superseded":false,"formalization":{"title":"Isabelle/HOL: the cost conjecture is false","url":"https://github.com/isabelle-prover/mirror-afp-devel/blob/80985fd56a4cb63a90176bf4bfe456eaff949bfd/thys/Dinitz_Garg_Goemans_Counterexample/Dinitz_Garg_Goemans_Counterexample.thy","note":"The finite path-flow model is realized as the directed network earlier in the theory. This corollary proves the negation of cost-preserving rounding with the non-strict largest-demand allowance; it does not prove the positive conjecture.","target":{"id":"claim-flow-cost-preserving-rounding","version":1},"proof_status":"reported_complete","source_entry_ids":["dinitz-garg-goemans-flow:entry:isabelle:v1"],"declaration":"Dinitz_Garg_Goemans_Counterexample.weak_dgg_cost_conjecture_false","source_commit":"80985fd56a4cb63a90176bf4bfe456eaff949bfd","alignment":"staff_linked","checked_on":"2026-10-13"},"update":null},{"id":"source-use-5ed47e889e5e0074ede0","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3},"kind":"formalization","title":"Isabelle/HOL: the finite cost counterexample","claim":{"id":"claim-flow-seven-vertex-counterexample","version":1,"slug":"flow-seven-vertex-counterexample","title":"Fractional cost 58 versus unsplittable cost 60"},"fragment":"claim-flow-seven-vertex-counterexample","assessment":null,"superseded":false,"formalization":{"title":"Isabelle/HOL: the finite cost counterexample","url":"https://github.com/isabelle-prover/mirror-afp-devel/blob/80985fd56a4cb63a90176bf4bfe456eaff949bfd/thys/Dinitz_Garg_Goemans_Counterexample/Dinitz_Garg_Goemans_Counterexample.thy","note":"This exact lower-bound endpoint is combined with the theory’s explicit graph realization, fractional feasibility and cost-58 lemmas. It proves a cost of at least 60 under the non-strict additive allowance, rather than by itself specifying the full network. It is an Isabelle/HOL artifact, not a Lean theorem.","target":{"id":"claim-flow-seven-vertex-counterexample","version":1},"proof_status":"reported_complete","source_entry_ids":["dinitz-garg-goemans-flow:entry:isabelle:v1"],"declaration":"Dinitz_Garg_Goemans_Counterexample.bounded_unsplittable_cost","source_commit":"80985fd56a4cb63a90176bf4bfe456eaff949bfd","alignment":"staff_linked","checked_on":"2026-10-13"},"update":null},{"id":"source-use-34bcc428d6928ef3f159","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3},"kind":"milestone","title":"Rybin announces the finite counterexample","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-65b11ef5df2230e50274","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3},"kind":"milestone","title":"The AFP records an Isabelle verification","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-bf08d53c75e4d3f190c7","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3},"kind":"question","title":"Cost-preserving unsplittable flow","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-8be4e37f4b6141de5055","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3},"kind":"statement","title":"Fractional cost 58 versus unsplittable cost 60","claim":{"id":"claim-flow-seven-vertex-counterexample","version":1,"slug":"flow-seven-vertex-counterexample","title":"Fractional cost 58 versus unsplittable cost 60"},"fragment":"claim-flow-seven-vertex-counterexample","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-c7d595f59b1f1b9a8bb7","entry_id":"dinitz-garg-goemans-flow:entry:isabelle:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":3},"kind":"statement","title":"The exact-cost rounding conjecture","claim":{"id":"claim-flow-cost-preserving-rounding","version":1,"slug":"flow-cost-preserving-rounding","title":"The exact-cost rounding conjecture"},"fragment":"claim-flow-cost-preserving-rounding","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[{"id":"dinitz-garg-goemans-flow:entry:isabelle:v1","source_version_id":"dinitz-garg-goemans-flow:source:isabelle:v1","item_id":"isabelle","url":"https://isa-afp.org/entries/Dinitz_Garg_Goemans_Counterexample.html","wording":"A directed seven-vertex, nine-arc instance has fractional cost 58 and no congestion-allowed unsplittable routing of cost below 60.","wording_kind":"paraphrase","locator":"Generic path-flow model; directed graph realization; bounded_unsplittable_cost and dinitz_garg_goemans_cost_counterexample","supersedes":null}],"linked_sources":[{"work":{"authors":["Arthur Freitas Ramos","David Barros Hulak","Ruy Jose Guerra Barretto de Queiroz"],"kind":"research_project","publication":"published","publication_note":"Public formal source; execution and statement correspondence are separate checks.","ai_role":"self_reported","ai_note":"The AFP authors credit AI assistance for proof engineering and attribute the July counterexample announcement to Dmitry Rybin.","artifacts":[{"kind":"formal_code","title":"A Formal Counterexample to the Cost-Preserving Single-Source Unsplittable Flow Conjecture — pinned source","url":"https://github.com/isabelle-prover/mirror-afp-devel/blob/80985fd56a4cb63a90176bf4bfe456eaff949bfd/thys/Dinitz_Garg_Goemans_Counterexample/Dinitz_Garg_Goemans_Counterexample.thy","version":"80985fd56a4cb63a90176bf4bfe456eaff949bfd","assessment":"not_executed","note":"Exact source inspected; OpenMath has not executed this formal proof project.","sha256":"7ff973cdf50586f3082fc514278e7b8a67e014170cf327bb54bb3676690a5cf7"}],"published":{"value":"2026-07-22"}},"id":"dinitz-garg-goemans-flow:source:isabelle:v1","source_id":"dinitz-garg-goemans-flow-isabelle","title":"A Formal Counterexample to the Cost-Preserving Single-Source Unsplittable Flow Conjecture","owner":"Arthur Freitas Ramos, David Barros Hulak, Ruy Jose Guerra Barretto de Queiroz","url":"https://isa-afp.org/entries/Dinitz_Garg_Goemans_Counterexample.html","subject_scope":"A directed seven-vertex, nine-arc instance has fractional cost 58 and no congestion-allowed unsplittable routing of cost below 60.","revision":"80985fd56a4cb63a90176bf4bfe456eaff949bfd","content_sha256":"7ff973cdf50586f3082fc514278e7b8a67e014170cf327bb54bb3676690a5cf7","update_method":"Compare the exact source and publish a new immutable curation revision.","identifier_policy":"Stable source identity with exact versioned passages.","observed_on":"2026-10-13","source_updated_on":null,"rights":"metadata-link","license":"Original source license and document rights apply.","terms_url":"https://isa-afp.org/entries/Dinitz_Garg_Goemans_Counterexample.html","attribution":"Arthur Freitas Ramos, David Barros Hulak, Ruy Jose Guerra Barretto de Queiroz","rights_note":"OpenMath supplies its own mathematical paraphrases and links; proof text is not republished.","check_interval_days":90}]}}