{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004279375,0.0004040472,0.0003920543,0.0004948061,0.0003427443,0.0003783361,0.004064927,0.0002911619,0.00006517026],"category_scores_gemma":[0.0000991134,0.0004691008,0.0002553113,0.001185679,0.0002686615,0.001174118,0.004637078,0.001061377,0.0002046321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002540218,"about_ca_system_score_gemma":0.000143714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003685766,"about_ca_topic_score_gemma":0.00002935815,"domain_scores_codex":[0.9969605,0.0002736474,0.0002369594,0.001579928,0.0002047188,0.0007442955],"domain_scores_gemma":[0.9969937,0.0002923422,0.0002502031,0.001894557,0.0002280929,0.0003411089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008499355,0.0002482369,0.005556748,0.0003471914,0.000311419,0.00107256,0.0007183705,0.04775879,0.003135223,0.9336093,0.003101368,0.004055783],"study_design_scores_gemma":[0.000840293,0.000132786,0.0008205942,0.0003344756,0.00006829802,0.00001535042,0.0001870751,0.3118161,0.002152315,0.6787564,0.003405649,0.001470631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.526986,0.0003476737,0.4671348,0.0001413838,0.0005389195,0.0004504339,0.00001114604,0.0004857982,0.003903863],"genre_scores_gemma":[0.9928705,0.0003906245,0.003149352,0.00008976163,0.00005239782,0.000004019558,0.000008700286,0.00003168283,0.003402966],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4658845,"threshold_uncertainty_score":0.9997761,"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."}}