{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002532958,0.0001730678,0.0003544174,0.00005828104,0.0001194962,0.000009109027,0.0002747108,0.00004500278,0.00005194696],"category_scores_gemma":[0.00004828561,0.0001112106,0.000115263,0.0003333009,0.0005868669,0.0000375368,0.0000808733,0.0001012316,0.000003278022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008159521,"about_ca_system_score_gemma":0.00001589153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001836179,"about_ca_topic_score_gemma":0.00006710612,"domain_scores_codex":[0.9989486,0.00007489202,0.0004187209,0.0001121315,0.0002040768,0.0002416012],"domain_scores_gemma":[0.9991525,0.00006379843,0.0001461469,0.0004132346,0.0001372035,0.00008706715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001716656,0.0004752973,0.00146296,0.001080657,0.000632985,0.000003542817,0.01119761,0.004437529,0.02221017,0.9575418,0.0005896926,0.0001961463],"study_design_scores_gemma":[0.00262315,0.0004109125,0.003189732,0.002357684,0.000582054,0.00009295029,0.003803002,0.0399868,0.7335083,0.2124523,0.0001803857,0.0008127262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8101489,0.0001853102,0.1848849,0.00005053823,0.00007083582,0.0008947676,0.0006017661,0.0001147158,0.003048244],"genre_scores_gemma":[0.9988385,0.00000227879,0.001007113,0.000004525891,0.000006857421,0.00007458978,0.000007468399,0.00002213972,0.00003654191],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7450895,"threshold_uncertainty_score":0.4535035,"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."}}