{"id":"W3186619231","doi":"10.1007/978-3-030-80879-2_4","title":"Online Coloring and a New Type of Adversary for Online Graph Problems","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Concordia University; Université de Montréal","funders":"","keywords":"Adversary; Bipartite graph; Parameterized complexity; Combinatorics; Computer science; Bounded function; Mathematics; Discrete mathematics; Graph; Theoretical computer science; Computer security","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.002990078,0.001904952,0.001706312,0.00115362,0.001934125,0.004074053,0.00583475,0.004108173,0.009704471],"category_scores_gemma":[0.00972391,0.001120472,0.00245087,0.002523147,0.004138342,0.009409869,0.005261573,0.01050499,0.001790031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002695814,"about_ca_system_score_gemma":0.001810712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007664294,"about_ca_topic_score_gemma":0.001350925,"domain_scores_codex":[0.9959916,0.00143981,0.0001328781,0.0007850421,0.001146169,0.0005045822],"domain_scores_gemma":[0.9884939,0.006754027,0.0004463053,0.003036208,0.000595359,0.0006743079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001728493,0.0001554764,0.0003026867,0.0001687011,0.00004367283,0.0001341116,0.0001436452,0.0408106,0.002479453,0.9073271,0.01454976,0.03371204],"study_design_scores_gemma":[0.00004232201,0.00008678159,0.0001401497,0.00003471438,0.00003929702,0.0002540018,0.00003886373,0.2269039,0.001374452,0.7516643,0.01938917,0.00003207351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01053444,0.0006914334,0.9410013,0.001805506,0.000773171,0.0001380324,0.0002271069,0.0005343335,0.04429456],"genre_scores_gemma":[0.3862232,0.00251564,0.4923861,0.002352605,0.003127288,0.0007535309,0.000684426,0.0008671185,0.1110903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009704471,"threshold_uncertainty_score":0.03246468,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0589688178431416,"score_gpt":0.2940742975132717,"score_spread":0.2351054796701301,"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."}}