{"id":"W2902000811","doi":"10.1016/j.ejor.2020.09.017","title":"An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs","year":2020,"lang":"en","type":"preprint","venue":"European Journal of Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Universitetet i Bergen; Türkiye Bilimler Akademisi","keywords":"Graph coloring; Fractional coloring; Combinatorics; Greedy coloring; Perfect graph; Mathematics; List coloring; Complete coloring; Graph partition; Discrete mathematics; Graph; Algorithm; Computer science; Graph power; Line graph","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":["metaresearch","scholarly_communication","research_integrity"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.05698788,0.000262946,0.0005131877,0.001858811,0.0009266098,0.002008804,0.002895977,0.00007669163,0.0001293937],"category_scores_gemma":[0.01102582,0.0001709286,0.0002716026,0.002758609,0.0002033396,0.0004068871,0.0008653799,0.004286495,0.0002513352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001961081,"about_ca_system_score_gemma":0.001616866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008178836,"about_ca_topic_score_gemma":0.00002810685,"domain_scores_codex":[0.986911,0.005260815,0.001597032,0.0008019437,0.004782793,0.0006464383],"domain_scores_gemma":[0.9913021,0.00327397,0.0004375811,0.0005677601,0.00392152,0.0004970352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.001019679,0.0009507697,0.01224589,0.00004282762,0.0006232131,0.001994676,0.03081884,0.7996669,0.007780461,0.009474957,0.03321407,0.1021677],"study_design_scores_gemma":[0.006268213,0.01259412,0.4206738,0.003356898,0.0002204059,0.001683456,0.02406782,0.260101,0.004920857,0.227697,0.03532151,0.003094871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8102739,0.001382127,0.1292022,0.03525593,0.001981697,0.002413839,0.0001887097,0.00007555301,0.01922611],"genre_scores_gemma":[0.9144445,0.00005934352,0.08402111,0.000222296,0.00101684,0.00001770084,0.00001481239,0.00004483405,0.0001585626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5395659,"threshold_uncertainty_score":0.9990272,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2901923381441248,"score_gpt":0.4730422828480221,"score_spread":0.1828499447038973,"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."}}