{"id":"W2950649163","doi":"10.48550/arxiv.1308.1068","title":"List H-Coloring a Graph by Removing Few Vertices","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Parameterized complexity; Discrete mathematics; Conjecture; Homomorphism; Graph homomorphism; Vertex (graph theory); 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.001074829,0.0007503937,0.0007769801,0.0003815182,0.001187067,0.001443918,0.002503382,0.001073973,0.0118263],"category_scores_gemma":[0.003911391,0.0005036927,0.0009782098,0.0009239793,0.001179318,0.00585883,0.001774523,0.00186901,0.001670152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001204097,"about_ca_system_score_gemma":0.002022542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002940646,"about_ca_topic_score_gemma":0.003609686,"domain_scores_codex":[0.9990467,0.0002247896,0.00004820746,0.0003590938,0.0001143313,0.0002067959],"domain_scores_gemma":[0.9952313,0.002093234,0.0003280749,0.001813453,0.0002287651,0.0003051428],"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.003892471,0.001717489,0.01711996,0.001738849,0.0003182399,0.001436324,0.002274805,0.2177659,0.08591989,0.2977955,0.04237533,0.3276452],"study_design_scores_gemma":[0.0006458953,0.0007558312,0.003664089,0.00009848994,0.000258869,0.001031451,0.001263965,0.4704094,0.09909666,0.3887278,0.03393945,0.0001081013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4691302,0.0002241212,0.5018321,0.001973709,0.0001498055,0.0006123304,0.003481952,0.004258341,0.01833743],"genre_scores_gemma":[0.7099718,0.0001708358,0.2693807,0.0007602786,0.00007811699,0.0003152682,0.005149491,0.000475365,0.01369801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0118263,"threshold_uncertainty_score":0.03956294,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0736527274133749,"score_gpt":0.2113069901099451,"score_spread":0.1376542626965702,"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."}}