{"id":"W1995031698","doi":"10.1145/1255443.1255444","title":"(Almost) Tight bounds and existence theorems for single-commodity confluent flows","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Flow (mathematics); Maximum flow problem; Flow network; Sink (geography); Computer science; Combinatorics; Geometry","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.001543086,0.0000979492,0.0001718976,0.00006725118,0.0002573414,0.0001700108,0.002777531,0.00004032373,0.000003971049],"category_scores_gemma":[0.0005574126,0.00006037315,0.0001630651,0.0001807434,0.000138334,0.0003033685,0.0007551278,0.0002053704,9.491878e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004199811,"about_ca_system_score_gemma":0.0000430761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003697337,"about_ca_topic_score_gemma":0.000009936301,"domain_scores_codex":[0.9989851,0.00004856294,0.0003292669,0.0001261881,0.0002958614,0.000214995],"domain_scores_gemma":[0.9980867,0.0004890297,0.0002945096,0.0008581,0.0001773291,0.00009432847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004728714,0.001122638,0.006046903,0.0001416912,0.0003476115,0.0001508363,0.007613789,0.0001640697,0.05501791,0.6165915,0.01299852,0.2993317],"study_design_scores_gemma":[0.001078628,0.0005081972,0.01074925,0.0001387633,0.00003331596,0.001211979,0.00009335503,0.006688903,0.01444475,0.8769405,0.0878667,0.0002456035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4975898,0.0009443056,0.4871409,0.009364105,0.003113888,0.0002391314,0.000006705695,0.00002922655,0.001571953],"genre_scores_gemma":[0.8105734,0.00002095191,0.1879542,0.0009015481,0.0004214185,0.000001101082,2.451575e-7,0.000007770699,0.0001193854],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3129836,"threshold_uncertainty_score":0.516139,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0438101471097265,"score_gpt":0.276298589715113,"score_spread":0.2324884426053865,"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."}}