{"id":"W2592554260","doi":"10.1016/j.cor.2017.10.003","title":"Online algorithms for the maximum k-colorable subgraph problem","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Colored; Online algorithm; Combinatorics; Benchmark (surveying); Algorithm; Mathematics; Computer science; Competitive analysis; Greedy coloring; Graph; Upper and lower bounds","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009985016,0.0001277304,0.0002162465,0.000427347,0.009532701,0.004557898,0.003279904,0.00008434274,0.00009587462],"category_scores_gemma":[0.005348207,0.00007849387,0.0001723558,0.0007867453,0.0006723835,0.0005361995,0.0005790771,0.0004569858,0.0003308162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005002815,"about_ca_system_score_gemma":0.0004155738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007278207,"about_ca_topic_score_gemma":0.001028682,"domain_scores_codex":[0.9965742,0.0003201835,0.0004557446,0.0005895284,0.001422911,0.0006374079],"domain_scores_gemma":[0.9918041,0.00351921,0.00006399083,0.00209228,0.002353447,0.0001669779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006163321,0.00101012,0.001814418,0.00001310882,0.0002313112,0.00001116235,0.001677827,0.2272523,0.0004895668,0.06021303,0.2057653,0.5014603],"study_design_scores_gemma":[0.0005362971,0.0001332023,0.004454151,0.00001976441,0.00001228303,0.000007107361,0.000531388,0.8603709,0.0001532302,0.02335821,0.110285,0.0001384396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02757374,0.0006484353,0.9023554,0.06394708,0.001636868,0.001892166,0.0001530445,0.00009557651,0.001697665],"genre_scores_gemma":[0.7045999,0.0001025388,0.2790226,0.0002873483,0.0009357455,0.0004506756,0.00004564386,0.00003164206,0.01452387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6770262,"threshold_uncertainty_score":0.9964755,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.4906069269434795,"score_gpt":0.5419991593872532,"score_spread":0.05139223244377367,"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."}}