{"id":"W2006186391","doi":"10.1016/j.tcs.2015.01.028","title":"Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Mathematics; Combinatorics; Injective function; Bijection; Treewidth; Homomorphism; Bounded function; Surjective function; Discrete mathematics; Algebra homomorphism; Graph; Tree-depth; 1-planar graph; Pathwidth; Chordal graph; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003032305,0.0002808644,0.0003986757,0.0005093379,0.0003308593,0.0003904498,0.002879872,0.00007976991,0.00001281563],"category_scores_gemma":[0.0003638399,0.000227346,0.00007936406,0.002011581,0.0151957,0.0007107854,0.001254837,0.0003246983,0.00002707071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007516656,"about_ca_system_score_gemma":0.0004706663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004291025,"about_ca_topic_score_gemma":0.00000152785,"domain_scores_codex":[0.9960337,0.0002708176,0.0004096401,0.0009694256,0.001491178,0.0008251956],"domain_scores_gemma":[0.9966943,0.0006127141,0.0001222598,0.001228544,0.000535863,0.0008063032],"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.00007719032,0.0001026776,0.0000670779,0.000007649185,0.000007549322,0.00003113147,0.0003232875,0.0000385316,0.0004666701,0.9574565,0.00001780289,0.04140389],"study_design_scores_gemma":[0.0009072736,0.001295408,0.0004285946,0.00004104044,0.000004077231,0.00008867238,0.00001861994,0.1078811,0.005694723,0.8833516,0.00003665952,0.0002522424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1260334,0.00005405436,0.8649451,0.0006654823,0.0003014415,0.0002911021,0.000004025848,0.0001618524,0.00754351],"genre_scores_gemma":[0.8222852,0.000004651992,0.1773288,0.0003267624,0.00002606605,0.000006790611,5.963904e-7,0.00001026704,0.00001082651],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6962518,"threshold_uncertainty_score":0.9874844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04165431843452008,"score_gpt":0.2921332516211976,"score_spread":0.2504789331866776,"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."}}