{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00133266,0.001136154,0.001708907,0.001149983,0.001217817,0.005107108,0.003918099,0.003218264,0.01373277],"category_scores_gemma":[0.008650244,0.001043952,0.001002644,0.003112511,0.00193162,0.007245388,0.002176851,0.004432309,0.001279139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002196022,"about_ca_system_score_gemma":0.001819354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001817058,"about_ca_topic_score_gemma":0.001988578,"domain_scores_codex":[0.9986385,0.0004002,0.00006213152,0.0004099226,0.0002721394,0.0002171095],"domain_scores_gemma":[0.9942286,0.004138719,0.0004365166,0.0004169998,0.0003744027,0.0004047411],"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.0005078846,0.0002806368,0.001181664,0.001083671,0.0001292248,0.0002724736,0.0002201292,0.2499371,0.00173757,0.6102939,0.04270573,0.09165004],"study_design_scores_gemma":[0.00006106285,0.00003522606,0.0004031871,0.00007444382,0.00003717695,0.000275799,0.0001071846,0.2716936,0.0008084516,0.7182884,0.008183212,0.00003237566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1046565,0.0030151,0.801531,0.009166197,0.0005110804,0.0002748637,0.003280707,0.0006954009,0.07686911],"genre_scores_gemma":[0.7050945,0.002881951,0.2423432,0.001473761,0.0009688666,0.0005183289,0.003169997,0.0005949657,0.04295443],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01373277,"threshold_uncertainty_score":0.04594064,"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."}}