{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00430209,0.001654153,0.00132441,0.001306871,0.0009171955,0.002557747,0.002729402,0.001487773,0.007155569],"category_scores_gemma":[0.02416518,0.0007221751,0.001304189,0.001850167,0.001582779,0.003322573,0.00146128,0.002435577,0.0004315352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002139669,"about_ca_system_score_gemma":0.002576777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007022846,"about_ca_topic_score_gemma":0.01002991,"domain_scores_codex":[0.9978951,0.001095673,0.000102674,0.0002677692,0.0003324636,0.0003062736],"domain_scores_gemma":[0.954208,0.04128807,0.001624591,0.001381554,0.0008928916,0.0006048335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001445513,0.000686222,0.004740444,0.0007513908,0.0001566812,0.000168877,0.0001592223,0.9046056,0.001443534,0.03502208,0.009219842,0.0416006],"study_design_scores_gemma":[0.0001130828,0.00007283023,0.0003432645,0.00002337123,0.00001869602,0.00003423179,0.00005091643,0.9831666,0.0005491871,0.01515894,0.0004611618,0.000007649562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7831462,0.001826753,0.1804405,0.004545315,0.0002201588,0.0003432057,0.002484532,0.001225589,0.02576776],"genre_scores_gemma":[0.8127273,0.0004301872,0.1798494,0.000500159,0.00008376683,0.0002989091,0.003338008,0.0003111446,0.002461016],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.007155569,"threshold_uncertainty_score":0.02393776,"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."}}