{"id":"W4413186192","doi":"10.55016/ojs/cdm.v6i2.62095","title":"A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Tournament; Mathematics; Combinatorics; Graph; Discrete mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001862109,0.0009316768,0.001312655,0.0009320861,0.002374609,0.003941322,0.003079103,0.001837958,0.015631],"category_scores_gemma":[0.01295671,0.0008417591,0.00264872,0.00157949,0.004214105,0.009803399,0.004720486,0.007500067,0.0007490384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002988366,"about_ca_system_score_gemma":0.001873364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002826271,"about_ca_topic_score_gemma":0.002413847,"domain_scores_codex":[0.9969925,0.0007188051,0.0001607523,0.0007583021,0.0008318413,0.0005377654],"domain_scores_gemma":[0.9779554,0.0173489,0.001242969,0.001730547,0.0007468942,0.0009751766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000231523,0.0002697578,0.001740618,0.0004635967,0.000138063,0.0005171311,0.0007441218,0.04898658,0.006619161,0.9080156,0.007915469,0.02435847],"study_design_scores_gemma":[0.000141618,0.0001354916,0.0007729254,0.0000374254,0.00008442602,0.0003814523,0.0001671654,0.08587166,0.003373367,0.9011626,0.007812153,0.0000597844],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.151959,0.0006589416,0.802183,0.005254217,0.0003999142,0.0003827175,0.0007573892,0.0006662724,0.03773855],"genre_scores_gemma":[0.817748,0.0007839591,0.1692803,0.001468673,0.0005844226,0.0004176287,0.001017427,0.0002196456,0.00847995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.015631,"threshold_uncertainty_score":0.05229086,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0149535106238082,"score_gpt":0.2223248306890903,"score_spread":0.2073713200652821,"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."}}