{"id":"W3022167047","doi":"","title":"Computational study of valid inequalities for the maximum \\(k\\)-cut problem","year":2016,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Clique; Vertex (graph theory); Combinatorics; Focus (optics); Graph; Maximum cut; Inequality; Set (abstract data type); Semidefinite programming; Relaxation (psychology); Discrete mathematics; Mathematical optimization; Computer science; 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.001045082,0.0002407095,0.0003075497,0.0002686606,0.0003641283,0.0001528195,0.001581937,0.0000877733,0.00001163585],"category_scores_gemma":[0.0001232048,0.0001514758,0.0001739171,0.0005176111,0.0001477622,0.0004291349,0.0004865474,0.0001399829,0.000003548497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000105716,"about_ca_system_score_gemma":0.0001633462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001920153,"about_ca_topic_score_gemma":0.0009462828,"domain_scores_codex":[0.9978759,0.0001645657,0.00056255,0.0004270344,0.0004958285,0.000474141],"domain_scores_gemma":[0.9971815,0.001226039,0.0002764007,0.0009407545,0.0002668808,0.0001083755],"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.00008737405,0.001160529,0.01012342,0.00006179988,0.0002005408,0.000009835673,0.00302024,0.007845658,0.0005416529,0.8150827,0.002466819,0.1593994],"study_design_scores_gemma":[0.002596477,0.001433981,0.02390617,0.0001101107,0.00005373431,0.00006435871,0.0008950194,0.377167,0.003004582,0.5866034,0.003526992,0.0006381485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03308294,0.0002018062,0.9592138,0.005434726,0.0001351614,0.001411952,0.00005617744,0.0003588156,0.0001046042],"genre_scores_gemma":[0.7748175,0.00001996666,0.2235666,0.0004776815,0.00007614834,0.0007560079,0.00000285806,0.000021356,0.0002618727],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7417346,"threshold_uncertainty_score":0.6177005,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02945433607970233,"score_gpt":0.2649790175313498,"score_spread":0.2355246814516475,"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."}}