{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004083076,0.0002957699,0.0004673837,0.0005555934,0.0001120655,0.0001819288,0.001273778,0.000191145,0.00001180423],"category_scores_gemma":[0.0001305644,0.0002762909,0.00008587432,0.0007349122,0.0003370973,0.0003623715,0.0009342629,0.0003839684,9.072699e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006740643,"about_ca_system_score_gemma":0.0009702365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003016404,"about_ca_topic_score_gemma":0.0002022005,"domain_scores_codex":[0.9976511,0.00002022427,0.0004593217,0.0009557757,0.0005161198,0.00039744],"domain_scores_gemma":[0.9981188,0.0003417225,0.0002272943,0.0006363863,0.0004852026,0.0001906086],"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.00001869292,0.0001776422,0.0001415399,0.0003881669,0.00003822931,0.00002810748,0.001210707,0.2155043,0.000407791,0.02873677,0.00009223195,0.7532558],"study_design_scores_gemma":[0.0006993997,0.000542445,0.0001354707,0.000837554,0.00001115559,0.00003468835,5.667685e-7,0.9237953,0.0003608192,0.06893784,0.004162816,0.0004819191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001646547,0.001177159,0.9961968,0.0009741662,0.0006757187,0.0005329385,0.00001908282,0.00006146354,0.0001980391],"genre_scores_gemma":[0.003047734,0.0004698684,0.9945306,0.0007776106,0.000216581,0.000003973945,0.00004096798,0.0000250296,0.0008875928],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7527739,"threshold_uncertainty_score":0.9999689,"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."}}