{"id":"W7111085514","doi":"10.4230/lipics.fsttcs.2025.40","title":"Improved Upper Bounds on Multiflow-Multicut Gaps in Cactus Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Upper and lower bounds; Rounding; Graph; Cactus; Set (abstract data type); Path (computing); Graph theory","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00274557,0.002333589,0.00199175,0.003105945,0.002142061,0.004172812,0.004299277,0.001807533,0.009036832],"category_scores_gemma":[0.01508598,0.001009127,0.001306112,0.003271807,0.002117857,0.008606552,0.005414499,0.004717187,0.001309445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003804794,"about_ca_system_score_gemma":0.001707313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002673685,"about_ca_topic_score_gemma":0.003734739,"domain_scores_codex":[0.9964623,0.000585708,0.0001246522,0.0006607121,0.001050759,0.001115966],"domain_scores_gemma":[0.9866941,0.008810353,0.0009958177,0.001672213,0.0009240429,0.0009034845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001572061,0.0005303192,0.003717734,0.001394285,0.0001527325,0.0004877713,0.0008628232,0.4822039,0.01498892,0.3215988,0.02430404,0.1481866],"study_design_scores_gemma":[0.00008420741,0.0002793401,0.001639452,0.0002878546,0.00009241885,0.0004673857,0.0003464593,0.6715586,0.01099248,0.3009408,0.01322136,0.00008969493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3358881,0.01650644,0.5527926,0.004812644,0.0006200814,0.0004068748,0.002370309,0.004319571,0.08228342],"genre_scores_gemma":[0.8372329,0.003041378,0.14918,0.0009351081,0.0004566522,0.0003413293,0.001311479,0.0007872079,0.006714011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009036832,"threshold_uncertainty_score":0.03023124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01033793124144836,"score_gpt":0.2653205778688018,"score_spread":0.2549826466273534,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}