{"id":"W1984264511","doi":"10.1016/j.tcs.2005.09.028","title":"H-Coloring dichotomy revisited","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Greedy coloring; Complete coloring; Combinatorics; Discrete mathematics; Complexity of constraint satisfaction; Computational complexity theory; Automaton; Constraint (computer-aided design); Fractional coloring; List coloring; Constraint satisfaction; Graph coloring; Time complexity; Computer science; Local consistency; Theoretical computer science; Algorithm; Graph","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.001389995,0.0003333347,0.0008916006,0.001176266,0.003186648,0.003764231,0.001444487,0.002599878,0.0190301],"category_scores_gemma":[0.00391567,0.0004408901,0.0006167561,0.001556617,0.004351932,0.006795334,0.002245805,0.00553334,0.001391628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001471828,"about_ca_system_score_gemma":0.001028695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008113076,"about_ca_topic_score_gemma":0.0007937995,"domain_scores_codex":[0.999206,0.0002876858,0.0000194268,0.0001793177,0.0001290281,0.0001786203],"domain_scores_gemma":[0.9969285,0.001902016,0.0001416859,0.0004310772,0.0002372084,0.0003595216],"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.0000155884,0.0000122795,0.00008604467,0.00002044062,0.000002868711,0.00002229447,0.00006392608,0.0001643035,0.0001075084,0.9909804,0.005635703,0.002888463],"study_design_scores_gemma":[0.00001335416,0.000003803266,0.00008452366,0.000007949367,0.000002299755,0.00003692801,0.00007304137,0.0007978551,0.00005999276,0.9966241,0.002293525,0.000002502651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.220037,0.003839396,0.1239408,0.07611137,0.003432746,0.00009810358,0.0008611215,0.0007437592,0.5709359],"genre_scores_gemma":[0.9428965,0.00140375,0.01605689,0.009131542,0.00185877,0.0001057059,0.0002914864,0.0001461826,0.02810908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0190301,"threshold_uncertainty_score":0.06366199,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01505732805158794,"score_gpt":0.2993394964102967,"score_spread":0.2842821683587087,"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."}}