{"id":"W2004802557","doi":"10.1016/j.disopt.2008.10.004","title":"Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":44,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Vertex (graph theory); Polytope; Independent set; Graph; Algorithm; Discrete mathematics","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.0006668913,0.0001036996,0.0001909567,0.0002660585,0.000538885,0.0000953307,0.0001119244,0.00006464822,0.0000138192],"category_scores_gemma":[0.001486432,0.00008878815,0.0000467071,0.0006802664,0.0001624564,0.0004699276,0.00007687978,0.00007021131,0.000002051135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001188396,"about_ca_system_score_gemma":0.00003035978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008590375,"about_ca_topic_score_gemma":0.00002404806,"domain_scores_codex":[0.9986044,0.00004576988,0.0004660437,0.0003082292,0.0004014891,0.0001741301],"domain_scores_gemma":[0.9987611,0.0004837135,0.0002304427,0.0002350641,0.0002005359,0.00008910615],"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.00006053655,0.00001603401,0.02629151,0.000006062977,0.0000233746,0.000002281662,0.003698709,0.9666119,0.00004936731,0.002427669,0.0001371925,0.0006754046],"study_design_scores_gemma":[0.0008068979,0.00006701797,0.02757397,0.00003283606,0.00002427132,0.00002639361,0.0005708608,0.9685028,0.000186712,0.001812817,0.0002415364,0.0001538623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.51648,0.0002018354,0.4812478,0.0004803266,0.0001546122,0.0001614425,0.0001082829,0.00005102097,0.001114679],"genre_scores_gemma":[0.9294695,0.0001837998,0.07008627,0.00001428541,0.00003160469,0.000004525096,0.00004137777,0.000008658678,0.0001600101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4129895,"threshold_uncertainty_score":0.4144723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1211367297478479,"score_gpt":0.3512656153859113,"score_spread":0.2301288856380634,"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."}}