{"id":"W2148177011","doi":"10.1109/sfcs.2001.959906","title":"Approximating directed multicuts","year":2001,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Divide and conquer algorithms; Linear programming; Multi-commodity flow problem; Approximation algorithm; Flow (mathematics); Computer science; Mathematical optimization; Mathematics; Upper and lower bounds; Combinatorics; Discrete mathematics; Flow network; Algorithm","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.0001210206,0.00006890872,0.00007741326,0.00005737479,0.0001156096,0.0001021727,0.0004919853,0.00002133717,0.00007142661],"category_scores_gemma":[0.00003763693,0.00005881834,0.00003789686,0.0004471963,0.00002260707,0.0002512732,0.0001811079,0.00006650558,0.00007737091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008611574,"about_ca_system_score_gemma":0.000009082587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003659063,"about_ca_topic_score_gemma":0.00001021353,"domain_scores_codex":[0.9993188,0.00002256709,0.0001281105,0.000202462,0.0001382573,0.0001898047],"domain_scores_gemma":[0.9994953,0.00006905402,0.00002840223,0.0003165844,0.0000360783,0.00005454954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002383544,0.0001668569,0.002109528,0.00000875592,0.00001856482,0.00005422085,0.0008755075,0.00005836929,0.00079065,0.3767168,0.001780647,0.6174178],"study_design_scores_gemma":[0.0001853897,0.00001816553,0.002881524,0.000008057541,0.000001148959,0.00004558104,0.00002143997,0.9688386,0.000811305,0.01731932,0.009718316,0.0001511473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01117457,0.00002814826,0.9289752,0.0005362571,0.0002102741,0.00006685913,1.943601e-7,0.0009994593,0.05800908],"genre_scores_gemma":[0.2766212,0.000005932255,0.7216974,0.0003381651,0.00004923949,0.000006294998,7.040694e-7,0.000003680228,0.001277355],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9687802,"threshold_uncertainty_score":0.2398542,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02410645982831961,"score_gpt":0.2473935594959544,"score_spread":0.2232870996676348,"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."}}