{"id":"W2736557199","doi":"10.46298/dmtcs.3437","title":"Chromatic Turán problems and a new upper bound for the Turán density of $\\mathcal{K}_4^-$","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Graph; Upper and lower bounds; Chromatic scale; Integer (computer science); Discrete mathematics; Mathematical analysis","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002369056,0.0003656998,0.0005904707,0.0001315651,0.0008326209,0.0002822989,0.00126729,0.0001178877,0.00007460781],"category_scores_gemma":[0.0008369365,0.0002090662,0.0002194118,0.0004088802,0.004385022,0.000258308,0.0008022643,0.0002535646,0.000004494726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003624441,"about_ca_system_score_gemma":0.00009052409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003228412,"about_ca_topic_score_gemma":0.00000430738,"domain_scores_codex":[0.9972075,0.00007136496,0.0007665519,0.0005379381,0.0007888843,0.0006277292],"domain_scores_gemma":[0.9953771,0.002779261,0.0003061366,0.001042895,0.0002209398,0.0002736624],"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.00001478441,0.00007315301,0.00002577103,0.0003422151,0.00004364543,6.486187e-7,0.00842684,0.00002164901,0.0004602685,0.986791,0.0001514773,0.003648522],"study_design_scores_gemma":[0.0003606337,0.0001291538,0.0001330497,0.0001805696,0.0001094127,0.00006263268,0.0001506528,0.1879961,0.001755562,0.8087475,0.0001313523,0.000243358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3342361,0.0001925597,0.662132,0.001150608,0.000227765,0.001056845,0.00001153386,0.00008077289,0.0009118565],"genre_scores_gemma":[0.6871039,0.00001348255,0.3124152,0.0001884896,0.0001868267,0.00002012705,7.465071e-7,0.00002792955,0.00004335764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3528678,"threshold_uncertainty_score":0.9983245,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02749814079494463,"score_gpt":0.2849033482915382,"score_spread":0.2574052074965936,"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."}}