{"id":"W1989905036","doi":"10.1016/j.disc.2005.09.030","title":"List homomorphisms of graphs with bounded degrees","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Bounded function; Combinatorics; Discrete mathematics; Contrast (vision); Upper and lower bounds; Degree (music); Graph homomorphism; Computational complexity theory; Graph; Computer science; Algorithm; Line graph; Artificial intelligence","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.00148532,0.0007889399,0.0009092201,0.003734828,0.00266748,0.004529739,0.002374563,0.001412267,0.008729715],"category_scores_gemma":[0.009004522,0.0009742345,0.001118149,0.002537617,0.002246143,0.01056718,0.003796201,0.002882714,0.00158803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001717518,"about_ca_system_score_gemma":0.0007964241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001020598,"about_ca_topic_score_gemma":0.0009930928,"domain_scores_codex":[0.998285,0.0004925771,0.0001072422,0.0003960249,0.0003430611,0.0003760844],"domain_scores_gemma":[0.9881827,0.0073168,0.001001179,0.0009839776,0.0009560897,0.001559197],"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.0002398478,0.00008502495,0.0006907494,0.0001100803,0.00001763715,0.0002021922,0.001160162,0.001540566,0.003199632,0.9779335,0.001938448,0.01288227],"study_design_scores_gemma":[0.0000465136,0.00003650413,0.0004193572,0.00002763538,0.00003082349,0.0002008706,0.0003498832,0.006791942,0.002406209,0.9860698,0.003587703,0.0000327006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6052959,0.001181606,0.3383432,0.002332713,0.0003076912,0.0001535161,0.001164958,0.002348981,0.04887142],"genre_scores_gemma":[0.9197196,0.0009021829,0.04622143,0.0007615807,0.0003968661,0.0002543067,0.001190283,0.0006330396,0.02992071],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008729715,"threshold_uncertainty_score":0.02920383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01541211956355663,"score_gpt":0.2574159094243612,"score_spread":0.2420037898608045,"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."}}