{"schema_version":"source-reader-v1","record":{"source_id":"dinitz-garg-goemans-flow-literature","versions":[{"work":{"authors":["Vera Traub","Laura Vargas Koch","Rico Zenklusen"],"kind":"research_paper","publication":"preprint","publication_note":"Source publication and attributed assessments are distinct from independent OpenMath review.","ai_role":"not_reported","ai_note":"No specific AI contribution is attributed by this source record.","artifacts":[],"published":{"value":"2023-08-04"}},"id":"dinitz-garg-goemans-flow:source:literature:v1","source_id":"dinitz-garg-goemans-flow-literature","title":"Single-Source Unsplittable Flows in Planar Graphs","owner":"Vera Traub, Laura Vargas Koch, Rico Zenklusen","url":"https://arxiv.org/abs/2308.02651v1","subject_scope":"The paper states the original congestion theorem, Goemans’ cost-enhanced conjecture and a planar theorem with twice the largest-demand allowance.","revision":"2023-08-04","content_sha256":"e3eb8327bf995c16d44182dda5f82950c40f8e7bfdf9af97ac20dc380f0723bd","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://arxiv.org/abs/2308.02651v1","attribution":"Vera Traub, Laura Vargas Koch, Rico Zenklusen","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:literature:v1","source_version_id":"dinitz-garg-goemans-flow:source:literature:v1","item_id":"literature","url":"https://arxiv.org/abs/2308.02651v1","wording":"The paper states the original congestion theorem, Goemans’ cost-enhanced conjecture and a planar theorem with twice the largest-demand allowance.","wording_kind":"paraphrase","locator":"Definition 1.1, Theorem 1.2, Conjecture 1.3 and Theorem 1.8","supersedes":null}],"problems":[{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9}],"selected_version_id":"dinitz-garg-goemans-flow:source:literature:v1","available_versions":[{"id":"dinitz-garg-goemans-flow:source:literature:v1","revision":"2023-08-04","observed_on":"2026-10-13","title":"Single-Source Unsplittable Flows in Planar Graphs","publication":"preprint","content_sha256":"e3eb8327bf995c16d44182dda5f82950c40f8e7bfdf9af97ac20dc380f0723bd","used_in_current_publications":true}],"usages":[{"id":"source-use-38da621e42cf169ccebb","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9},"kind":"assessment","title":"Original congestion-only theorem","claim":{"id":"claim-flow-congestion-only-rounding","version":1,"slug":"flow-congestion-only-rounding","title":"The original congestion guarantee"},"fragment":"claim-flow-congestion-only-rounding","assessment":{"id":"dinitz-garg-goemans-flow:report:congestion:v1","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","state":"resolved","source_label":"Original congestion-only theorem","scope":"No cost-preservation assertion.","source_date":"2023-08-04","observed_on":"2026-10-13","evidence_url":"https://arxiv.org/abs/2308.02651v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-d27408dcda1f64e13c80","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9},"kind":"assessment","title":"Planar cost theorem with doubled allowance","claim":{"id":"claim-flow-planar-two-demand-allowance","version":1,"slug":"flow-planar-two-demand-allowance","title":"Preserving cost with twice the allowance in planar graphs"},"fragment":"claim-flow-planar-two-demand-allowance","assessment":{"id":"dinitz-garg-goemans-flow:report:planar:v1","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","state":"resolved","source_label":"Planar cost theorem with doubled allowance","scope":"Planar instances with upper and lower deviation at most 2 d_max.","source_date":"2023-08-04","observed_on":"2026-10-13","evidence_url":"https://arxiv.org/abs/2308.02651v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-8b3bd4348a21b247424a","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9},"kind":"definition","title":"Unsplittable routing","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-19ae5a6153ea6ccc8d80","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9},"kind":"milestone","title":"The original congestion theorem","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-a806a26890780fa714b9","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9},"kind":"milestone","title":"A planar theorem preserves cost with a larger allowance","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-4b616c16a5a04ad8b270","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9},"kind":"question","title":"Cost-preserving unsplittable flow","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-fc555dd9e154a4b61e9b","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9},"kind":"reading","title":"Consult the original question and its hypotheses.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-2fb8dce6d297aeea045d","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9},"kind":"statement","title":"The original congestion guarantee","claim":{"id":"claim-flow-congestion-only-rounding","version":1,"slug":"flow-congestion-only-rounding","title":"The original congestion guarantee"},"fragment":"claim-flow-congestion-only-rounding","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-4418065cf81d46379873","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9},"kind":"statement","title":"Preserving cost with twice the allowance in planar graphs","claim":{"id":"claim-flow-planar-two-demand-allowance","version":1,"slug":"flow-planar-two-demand-allowance","title":"Preserving cost with twice the allowance in planar graphs"},"fragment":"claim-flow-planar-two-demand-allowance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-a43a41a1541844bbee54","entry_id":"dinitz-garg-goemans-flow:entry:literature:v1","problem":{"slug":"dinitz-garg-goemans-flow","title":"Cost-preserving unsplittable flow","publication_version":9},"kind":"statement","title":"The exact-cost rounding conjecture","claim":{"id":"claim-flow-cost-preserving-rounding","version":2,"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":[],"linked_sources":[]}}