{"id":"W1836455089","doi":"10.1007/s00453-016-0139-6","title":"List H-Coloring a Graph by Removing Few Vertices","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Defense Advanced Research Projects Agency; Office of Naval Research; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Combinatorics; Mathematics; Parameterized complexity; Bipartite graph; Conjecture; Discrete mathematics; Homomorphism; Vertex (graph theory); Graph homomorphism; Graph; Graph power; Line graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0003966058,0.0001526487,0.0001552889,0.0001539036,0.0002075187,0.0001260566,0.001365475,0.0000559716,0.00003856502],"category_scores_gemma":[0.0001635607,0.0001092747,0.00007562232,0.0006083747,0.0001507839,0.0009643552,0.0004588955,0.0001358185,0.0001614806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006403677,"about_ca_system_score_gemma":0.00003876236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002367831,"about_ca_topic_score_gemma":0.000004215292,"domain_scores_codex":[0.9982215,0.0001013143,0.0001964625,0.0005276874,0.0003843745,0.0005686512],"domain_scores_gemma":[0.9985232,0.0004243989,0.00006407089,0.000722735,0.00008326867,0.0001822773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002335272,0.00008205584,0.000507988,0.00001611394,0.00004920139,0.0000985539,0.000259428,0.000002007415,0.1278389,0.09430402,0.003915082,0.7729033],"study_design_scores_gemma":[0.003093503,0.0006618106,0.001874564,0.0004017832,0.0000248735,0.0001945244,0.0001110525,0.01003782,0.3537234,0.4851394,0.1428736,0.001863663],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0330477,0.0005648886,0.9592316,0.0033361,0.0004007601,0.0002022125,0.000009135475,0.0004463368,0.00276125],"genre_scores_gemma":[0.8997115,0.0001602041,0.09643589,0.000407219,0.0001767785,0.00006255198,0.000001527956,0.00004092683,0.00300342],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8666638,"threshold_uncertainty_score":0.4456091,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01321742497990888,"score_gpt":0.2631657678241809,"score_spread":0.249948342844272,"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."}}