{"id":"W1973129994","doi":"10.1007/bf02896389","title":"Generalizedk-multiway cut problems","year":2006,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Theory of computation; Vertex (graph theory); Combinatorics; Local search (optimization); Set (abstract data type); Simple (philosophy); Greedy algorithm; Approximation algorithm; Graph; Independent set; Discrete mathematics; Mathematical optimization; 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.0004750926,0.0001275781,0.0002767366,0.0001197897,0.0001578154,0.0002157063,0.0004543511,0.00003897623,0.000002622592],"category_scores_gemma":[0.000006364679,0.0001024323,0.00008095663,0.0001976591,0.00004211168,0.0001094407,0.0002084363,0.0001750415,0.000001847268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357677,"about_ca_system_score_gemma":0.00002481275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004334142,"about_ca_topic_score_gemma":0.000001080196,"domain_scores_codex":[0.9988247,0.000006976455,0.0005580005,0.000134356,0.0002798665,0.0001961282],"domain_scores_gemma":[0.999064,0.0001183543,0.0004828013,0.0001810243,0.0000913547,0.00006241625],"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.000003194725,0.0002107972,0.0000127205,0.00009259477,0.00003005908,0.00001547183,0.00149372,0.005672701,0.002687916,0.9267803,0.0006489377,0.06235155],"study_design_scores_gemma":[0.0006369006,0.00006352583,0.0001025656,0.0001114325,0.00001541678,0.0002724758,0.00008185663,0.5300707,0.002472486,0.4640768,0.001891254,0.0002045997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06932693,0.0002421534,0.9258514,0.0001566958,0.0001660364,0.00008500937,3.79647e-7,0.00003540017,0.004135968],"genre_scores_gemma":[0.3006709,0.00001239986,0.6990094,0.00006046948,0.0002235511,5.054542e-7,2.344852e-7,0.000007189849,0.00001533442],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.524398,"threshold_uncertainty_score":0.4177068,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01644197876137178,"score_gpt":0.2269823976478452,"score_spread":0.2105404188864735,"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."}}