{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007023316,0.002061221,0.002407116,0.001666757,0.002488836,0.004793638,0.007467076,0.005973766,0.00714852],"category_scores_gemma":[0.02425562,0.001387862,0.003531178,0.002815107,0.006526103,0.01294186,0.007474169,0.01161527,0.001062764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003401252,"about_ca_system_score_gemma":0.002717862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001169462,"about_ca_topic_score_gemma":0.001998248,"domain_scores_codex":[0.9910321,0.004208416,0.0002909648,0.001597057,0.001766559,0.001104881],"domain_scores_gemma":[0.9635691,0.02371705,0.001571382,0.00751514,0.001528698,0.00209866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000500376,0.000315613,0.001096455,0.0002205125,0.0001198653,0.0002240137,0.000253579,0.1181929,0.002873807,0.8416513,0.0108036,0.02374801],"study_design_scores_gemma":[0.00007543166,0.0001112597,0.0001795264,0.00002806979,0.00005370834,0.0001918705,0.00004880696,0.4844315,0.0009915059,0.508132,0.00571841,0.00003774064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02184798,0.0004070224,0.9588748,0.002707537,0.0004730911,0.000145587,0.0002494005,0.000387622,0.01490694],"genre_scores_gemma":[0.6234045,0.001262227,0.3320643,0.002120807,0.002109573,0.0006487751,0.0005701364,0.0006148299,0.03720483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007467076,"threshold_uncertainty_score":0.03714329,"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."}}