{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004272271,0.00222305,0.001638926,0.002399939,0.002021489,0.004107007,0.002652502,0.001606688,0.007916282],"category_scores_gemma":[0.02475592,0.001207663,0.002170797,0.002404887,0.003959335,0.01210924,0.005508597,0.006537986,0.001456292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002608886,"about_ca_system_score_gemma":0.001816551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001743991,"about_ca_topic_score_gemma":0.001553399,"domain_scores_codex":[0.9966109,0.0006880189,0.0001671545,0.0008657321,0.000951443,0.0007167356],"domain_scores_gemma":[0.9806671,0.01406346,0.001274282,0.001572154,0.001510166,0.0009127663],"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.0006445833,0.0004536698,0.002840043,0.001265681,0.0001579375,0.0004636074,0.001452223,0.2411902,0.01352984,0.6578488,0.0106215,0.06953188],"study_design_scores_gemma":[0.00007174101,0.0001701319,0.0008621003,0.0001477519,0.00009532234,0.0003104763,0.0003570277,0.414921,0.00644907,0.5684115,0.008147313,0.00005657079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09222925,0.002602713,0.8675771,0.002018973,0.000176975,0.0002472666,0.0006628212,0.0007909667,0.03369396],"genre_scores_gemma":[0.7211766,0.004004462,0.2628692,0.0009690095,0.0006625405,0.0006690917,0.001256968,0.0004863846,0.007905684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007916282,"threshold_uncertainty_score":0.02648258,"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."}}