{"id":"W2096411231","doi":"10.1007/s10107-005-0668-2","title":"Optimal 3-terminal cuts and linear programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Mathematics; Minimum weight; Linear programming relaxation; Linear programming; Terminal (telecommunication); Combinatorics; Maximum cut; Minimum cut; Relaxation (psychology); Approximation algorithm; Mathematical optimization; Undirected graph; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science","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.0004810137,0.0002188932,0.0002633114,0.0001031719,0.0002612207,0.0004255563,0.0005900282,0.00008069144,0.00002819827],"category_scores_gemma":[0.00009190659,0.0001925387,0.00009869347,0.0003252781,0.0001975046,0.000513818,0.0004856231,0.000261865,0.00009231803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002426899,"about_ca_system_score_gemma":0.00002332891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002321058,"about_ca_topic_score_gemma":0.000001675997,"domain_scores_codex":[0.9982135,0.00003963995,0.0003671558,0.000457417,0.0003561012,0.0005661864],"domain_scores_gemma":[0.9990599,0.0001574481,0.00007945028,0.0004238281,0.00005184425,0.0002275681],"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.000002611523,0.0002056277,0.00004837938,0.00008401298,0.00001350379,0.00003428698,0.000908608,0.00001731327,0.00001846986,0.1019265,0.00002814687,0.8967126],"study_design_scores_gemma":[0.0007389887,0.0003850676,0.0001239739,0.0002350088,0.00003705246,0.000995871,0.0002094683,0.8171588,0.0006765522,0.02917353,0.1494646,0.0008011725],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03560758,0.0002048111,0.9609431,0.001244361,0.00007421493,0.0004084067,6.000484e-7,0.0005569782,0.0009599217],"genre_scores_gemma":[0.1447344,0.000003483486,0.8547391,0.00009271436,0.0001805603,0.0000510213,0.000001115363,0.00001404907,0.0001835432],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8959114,"threshold_uncertainty_score":0.7851501,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02734908984770169,"score_gpt":0.2849792314044849,"score_spread":0.2576301415567833,"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."}}