{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001270472,0.0009708618,0.001129306,0.001279229,0.001030345,0.001818845,0.002418162,0.001374422,0.004002431],"category_scores_gemma":[0.0100412,0.000642372,0.0006965306,0.002416224,0.001008312,0.002572641,0.002191127,0.001466648,0.0005951716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002070204,"about_ca_system_score_gemma":0.000960815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003937961,"about_ca_topic_score_gemma":0.005149527,"domain_scores_codex":[0.9988493,0.0003048653,0.00004703713,0.0002743781,0.0003024544,0.0002219423],"domain_scores_gemma":[0.9959921,0.002503486,0.0003345509,0.0005570024,0.0004311901,0.0001815848],"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.0003111444,0.00009270234,0.001910075,0.0002259872,0.00005076473,0.0001705649,0.0002035724,0.7609855,0.00217778,0.1515392,0.005302821,0.07702987],"study_design_scores_gemma":[0.00001109706,0.00002135171,0.0001234816,0.00001786006,0.00001038228,0.00006244572,0.00004415127,0.9490017,0.001206029,0.04755003,0.001945831,0.000005503675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1371221,0.001195173,0.841604,0.0005724783,0.0001117647,0.000130852,0.0004878982,0.0008522426,0.01792346],"genre_scores_gemma":[0.6718522,0.0007264412,0.3193847,0.0002109717,0.00007425095,0.0001734711,0.0007692322,0.0002243945,0.006584393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004002431,"threshold_uncertainty_score":0.01502043,"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."}}