{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002336924,0.00245022,0.003926844,0.001555846,0.002325022,0.006144087,0.006861974,0.004430712,0.02403078],"category_scores_gemma":[0.01065367,0.00140146,0.002682163,0.003989316,0.003442356,0.01132488,0.006482502,0.006682512,0.001539781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003053301,"about_ca_system_score_gemma":0.00190067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002124391,"about_ca_topic_score_gemma":0.002784496,"domain_scores_codex":[0.9972037,0.0008604917,0.0001450797,0.0007604118,0.0004824183,0.0005480296],"domain_scores_gemma":[0.9917195,0.004550338,0.000846303,0.001221434,0.0007450887,0.0009173225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007452703,0.0003889916,0.002179529,0.001631679,0.0002444312,0.0006922218,0.0007567276,0.1755462,0.002527384,0.7022848,0.02928747,0.08371528],"study_design_scores_gemma":[0.0001547095,0.00005311316,0.0009156881,0.00008022618,0.00005466866,0.0004200718,0.0003387196,0.1421769,0.000876978,0.8489655,0.005914109,0.00004922543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3897227,0.00458983,0.5443865,0.01018223,0.0007829202,0.0007377847,0.00351025,0.0006790073,0.04540874],"genre_scores_gemma":[0.7605001,0.002742216,0.1825689,0.001274179,0.0008595798,0.0009615294,0.005076617,0.00056444,0.04545243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02403078,"threshold_uncertainty_score":0.08039093,"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."}}