{"id":"W2004699374","doi":"10.1007/s10107-007-0139-z","title":"The capacitated max k-cut problem","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Mathematics; Numerical analysis; Combinatorics; Mathematical optimization; Applied mathematics; Mathematical analysis","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.001794204,0.0001454016,0.0001477302,0.00005703116,0.0005513353,0.0004810508,0.00100302,0.00005512451,0.00001192378],"category_scores_gemma":[0.0001472897,0.00009365304,0.0001008813,0.0005633464,0.0002277835,0.0001975672,0.000264055,0.0002420087,0.0001421526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002944866,"about_ca_system_score_gemma":0.00001928721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005081996,"about_ca_topic_score_gemma":0.00001522954,"domain_scores_codex":[0.9982876,0.00003885002,0.0003791707,0.0002678289,0.000397864,0.0006287455],"domain_scores_gemma":[0.998495,0.0006645271,0.0000797245,0.0005436481,0.00007635459,0.0001407441],"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.000001681791,0.00005943056,0.000009342439,0.00002266184,0.00001079203,0.00001437343,0.0005142931,7.040428e-7,0.0000256555,0.6283948,0.00009651299,0.3708497],"study_design_scores_gemma":[0.0001958116,0.00009241127,0.0000642466,0.00006094587,0.00000779859,0.00009503213,0.0002663057,0.02150583,0.0008616429,0.9158579,0.0607347,0.0002573722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001920671,0.00009030262,0.9837331,0.001079509,0.0001457019,0.0003617746,2.509177e-7,0.0004245661,0.01224414],"genre_scores_gemma":[0.1654365,0.000003336262,0.8337209,0.0001275154,0.00008447522,0.00004274692,8.270512e-7,0.00001554227,0.0005681489],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3705923,"threshold_uncertainty_score":0.4638784,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02300466748477017,"score_gpt":0.2664882864225961,"score_spread":0.2434836189378259,"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."}}