{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006901099,0.001135575,0.0009713494,0.001203935,0.003059505,0.001799306,0.002552758,0.001201645,0.02008303],"category_scores_gemma":[0.002674771,0.0007245892,0.0009200559,0.001511722,0.001062811,0.002585339,0.001961558,0.001755933,0.006072003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009189769,"about_ca_system_score_gemma":0.00209191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002344319,"about_ca_topic_score_gemma":0.007095824,"domain_scores_codex":[0.9992015,0.0002345058,0.00003714578,0.00016285,0.0001284845,0.0002354706],"domain_scores_gemma":[0.9956502,0.001372678,0.0001967085,0.001636495,0.0004882665,0.0006556524],"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.004467207,0.00243999,0.01136934,0.00239088,0.0004855043,0.001274988,0.00125884,0.05816738,0.1740564,0.1500511,0.1175391,0.4764993],"study_design_scores_gemma":[0.001167878,0.002064585,0.008050955,0.0002871026,0.0007118222,0.001591815,0.002414882,0.2852907,0.1760579,0.4245683,0.09747021,0.0003237111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3160721,0.0005949239,0.6127608,0.003711393,0.001611569,0.0007713121,0.003679684,0.009176058,0.05162223],"genre_scores_gemma":[0.4166563,0.0003643057,0.5362609,0.001793659,0.0003676881,0.0004837681,0.003834783,0.00126896,0.03896959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02008303,"threshold_uncertainty_score":0.06718445,"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."}}