{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002860231,0.0001642435,0.0002604861,0.000160003,0.0001042268,0.0001014008,0.0009161069,0.00004130258,0.0000166096],"category_scores_gemma":[0.00003361559,0.0001185976,0.00008116775,0.0006696814,0.0003501937,0.0002939794,0.0001782267,0.0001157787,0.00001377437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001698353,"about_ca_system_score_gemma":0.00004055116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002184832,"about_ca_topic_score_gemma":0.00002366306,"domain_scores_codex":[0.9985649,0.00004082023,0.0003080607,0.0002488476,0.0005219803,0.0003153637],"domain_scores_gemma":[0.998596,0.0001776134,0.0001811871,0.0008482253,0.0001328546,0.00006415014],"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.000006827996,0.00009114171,0.0003028178,0.00007836854,0.00001632944,0.00001551216,0.0002640746,0.00008270165,0.001076842,0.9977411,0.00007348441,0.0002507684],"study_design_scores_gemma":[0.0003566611,0.0001529286,0.0004072681,0.00008372578,0.00001093769,0.0000383074,0.0001172147,0.01095168,0.008189225,0.979313,0.0001637524,0.0002152691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1248755,0.0001287287,0.8564857,0.0001314635,0.00003772297,0.0002792697,0.00001186408,0.0001460882,0.01790364],"genre_scores_gemma":[0.6853673,0.000004365977,0.3140958,0.00001078647,0.0000107912,0.00001621386,0.000003694738,0.00001774782,0.0004732687],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5604919,"threshold_uncertainty_score":0.4836271,"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."}}