{"id":"W3026866611","doi":"10.1007/s00453-021-00920-w","title":"Online Coloring and a New Type of Adversary for Online Graph Problems","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Parameterized complexity; Adversary; Bipartite graph; Competitive analysis; Bounded function; Discrete mathematics; Treewidth; Upper and lower bounds; Graph; Computer science; Line graph; Pathwidth","routes":{"ca_aff":true,"ca_fund":true,"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.0001641888,0.00007360918,0.0001312883,0.0001145166,0.0001212878,0.00002074499,0.0003635728,0.0000199475,0.00002654102],"category_scores_gemma":[0.00002863124,0.00007490521,0.00003484675,0.0004771854,0.00002722607,0.0001441118,0.0003604582,0.0001071794,6.23359e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001896946,"about_ca_system_score_gemma":0.0001385608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006644677,"about_ca_topic_score_gemma":0.00001253616,"domain_scores_codex":[0.9991963,0.00003319643,0.0001848884,0.0002284112,0.0001838211,0.0001734206],"domain_scores_gemma":[0.9994839,0.00007247081,0.00007256281,0.0001958863,0.00008595469,0.00008918936],"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.0001664405,0.002712716,0.001306113,0.0003890197,0.000271998,0.00002332713,0.005919432,0.0849569,0.003698554,0.05564047,0.02310791,0.8218071],"study_design_scores_gemma":[0.001425853,0.001021603,0.0005718255,0.00001848974,0.00001079365,0.00001897821,0.0001321613,0.9257395,0.0002127328,0.0078685,0.06277857,0.0002010339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02902345,0.001078805,0.9610444,0.005974253,0.0007469223,0.001393516,0.0002115681,0.0002480058,0.0002791176],"genre_scores_gemma":[0.0333003,0.0001456058,0.9639758,0.0006598842,0.0001022914,0.00004226367,0.0001294484,0.00002085339,0.001623581],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8407826,"threshold_uncertainty_score":0.3054546,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0654509948533736,"score_gpt":0.2981127694963594,"score_spread":0.2326617746429858,"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."}}