{"id":"W2065415255","doi":"10.1016/j.tcs.2014.06.014","title":"H-coloring degree-bounded (acyclic) digraphs","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bounded function; Degree (music); Homomorphism; Conjecture; Upper and lower bounds; Discrete mathematics; Time complexity; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.0005289188,0.0005211363,0.0005243434,0.0007929923,0.0009808672,0.001696102,0.001418417,0.0007204586,0.01075571],"category_scores_gemma":[0.003212461,0.0004672113,0.0004063228,0.001237262,0.00077944,0.001569018,0.001057716,0.001165241,0.0009824366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001207124,"about_ca_system_score_gemma":0.0009265291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002663937,"about_ca_topic_score_gemma":0.005473475,"domain_scores_codex":[0.9994239,0.0001372336,0.00002784424,0.0001614194,0.00008854741,0.0001610737],"domain_scores_gemma":[0.994217,0.003266644,0.0003436986,0.0007494472,0.0006074347,0.0008157435],"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.0007956618,0.000402137,0.005764487,0.0005937913,0.00009585472,0.0008340302,0.0006994677,0.06913441,0.02051104,0.8047536,0.0246193,0.07179619],"study_design_scores_gemma":[0.0001643084,0.0001103858,0.002113158,0.00005897502,0.00005815368,0.0005511241,0.0004076695,0.1303101,0.007979563,0.8433712,0.0148358,0.00003946751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4995359,0.0005043647,0.419744,0.001870382,0.0002242646,0.0002867689,0.00585972,0.001421959,0.07055264],"genre_scores_gemma":[0.887519,0.0003878557,0.08833804,0.0005797229,0.00009139215,0.0001624201,0.002867197,0.0001643928,0.01989],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01075571,"threshold_uncertainty_score":0.03598148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02455338323382172,"score_gpt":0.2900484033323826,"score_spread":0.2654950200985609,"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."}}