{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006808814,0.0005658946,0.0006137702,0.001140948,0.0004857887,0.0007151444,0.00209176,0.0003043955,0.00002343782],"category_scores_gemma":[0.0001728506,0.0005251256,0.0004314162,0.001227931,0.000207689,0.001493688,0.0007238091,0.0007802999,0.00008142584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002318026,"about_ca_system_score_gemma":0.0001624036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001044342,"about_ca_topic_score_gemma":0.0001449114,"domain_scores_codex":[0.9964233,0.00006269327,0.00133984,0.0005442943,0.0004918276,0.001138035],"domain_scores_gemma":[0.9974602,0.0003668461,0.0002990097,0.001419524,0.0002395061,0.0002149192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008798638,0.004644002,0.03100557,0.002557354,0.0008956384,0.00006666082,0.03286326,0.001134382,0.0007323732,0.6314986,0.01847137,0.2752509],"study_design_scores_gemma":[0.00992988,0.0005853313,0.01050862,0.0007481902,0.0000436841,0.00003105913,0.001012551,0.8519325,0.003451649,0.02211472,0.09820569,0.001436159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5322283,0.0002793508,0.4225585,0.003275485,0.01054097,0.005146132,0.0007448551,0.001289211,0.02393726],"genre_scores_gemma":[0.9224268,0.00007834104,0.07100477,0.004789751,0.00009979668,0.0003454481,0.0002045441,0.00004771668,0.001002897],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8507981,"threshold_uncertainty_score":0.99972,"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."}}