{"id":"W4379622149","doi":"10.1016/j.dam.2023.05.022","title":"A local search approximation algorithm for the multiway cut problem","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Approximation algorithm; Combinatorics; Heuristic; Set (abstract data type); Local search (optimization); Algorithm; Graph; Discrete mathematics; Mathematical optimization; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0008521766,0.0001949408,0.0002152441,0.0001198403,0.0004531188,0.0002459615,0.001174425,0.00007175804,0.000006996549],"category_scores_gemma":[0.00001771779,0.0001353391,0.0001267704,0.0008757546,0.0001606239,0.0001522763,0.0004594677,0.0001801748,0.0001472049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002958213,"about_ca_system_score_gemma":0.0000448194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005965492,"about_ca_topic_score_gemma":0.000003384358,"domain_scores_codex":[0.9983435,0.00001604581,0.000331482,0.0003680942,0.0004758004,0.0004650841],"domain_scores_gemma":[0.9982992,0.0007080493,0.00009496497,0.0007439769,0.00007882526,0.00007498652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000183211,0.00005144584,2.484416e-7,0.0001410675,0.00003634566,0.000001297718,0.003246729,0.000989661,0.0001545556,0.6295724,0.0008889915,0.3649155],"study_design_scores_gemma":[0.0002903256,0.00002403485,0.000008170553,0.00001931575,0.00001200332,0.000004627105,0.0009388628,0.8100781,0.001430128,0.1856309,0.001403803,0.0001597122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001122843,0.00002041763,0.9952919,0.000708451,0.0001123994,0.001338835,0.00002302864,0.0004881166,0.001904559],"genre_scores_gemma":[0.01555993,0.00002045075,0.9830853,0.0001079069,0.00008997795,0.0007781769,0.00003479621,0.00003085851,0.0002926128],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8090884,"threshold_uncertainty_score":0.5518968,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03813232295211413,"score_gpt":0.2843878693129333,"score_spread":0.2462555463608191,"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."}}