{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0037271,0.000283599,0.0003039812,0.0005020998,0.0009068384,0.0008584656,0.00607239,0.00006928478,0.00003787622],"category_scores_gemma":[0.0004109682,0.0002364417,0.0001248161,0.002904096,0.00556908,0.001448267,0.002480624,0.0004246417,0.000251798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008389505,"about_ca_system_score_gemma":0.0001123903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002903027,"about_ca_topic_score_gemma":0.00000110623,"domain_scores_codex":[0.9954775,0.0003073582,0.0003545034,0.001239358,0.001330292,0.001291],"domain_scores_gemma":[0.9962978,0.0008854019,0.00008291721,0.001847018,0.0002760025,0.0006108629],"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.000009013869,0.00004092879,0.0001238657,0.000005038636,0.000003356332,0.000006908252,0.000178044,0.00007381645,0.0011101,0.8884695,0.00001251648,0.1099669],"study_design_scores_gemma":[0.0002480019,0.0002287959,0.001276212,0.00001970146,0.00000204399,0.00003327241,0.0000030987,0.298584,0.007101001,0.691654,0.0005753862,0.0002744789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04778148,0.00001867218,0.933469,0.0007935204,0.0006451096,0.0002026399,4.803669e-7,0.0004994426,0.01658963],"genre_scores_gemma":[0.7732795,0.000003425023,0.2260476,0.0004941094,0.0001282039,0.00001422579,2.882364e-7,0.00001256788,0.00002006255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.725498,"threshold_uncertainty_score":0.9993052,"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."}}