{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001212138,0.0009761652,0.0009405114,0.002215684,0.002068681,0.002654964,0.00321026,0.001902332,0.006581393],"category_scores_gemma":[0.008786972,0.0008303563,0.0007533456,0.001736238,0.003474582,0.006117015,0.002805562,0.003834035,0.0006405495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002536561,"about_ca_system_score_gemma":0.0006203502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002084559,"about_ca_topic_score_gemma":0.002248207,"domain_scores_codex":[0.9988411,0.00036029,0.00003839961,0.0002679246,0.000258436,0.0002339739],"domain_scores_gemma":[0.9928681,0.004841917,0.0006380609,0.0005748912,0.0004256799,0.0006513092],"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.0002770686,0.000113635,0.002662505,0.0002293875,0.00004765163,0.000154765,0.0004326698,0.05293385,0.003769787,0.9108166,0.009345997,0.01921612],"study_design_scores_gemma":[0.00004040179,0.00007159226,0.001815727,0.00005249774,0.00004194659,0.0003062862,0.0001728603,0.263416,0.003865103,0.7233706,0.006792683,0.00005439398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5267137,0.004302348,0.3718129,0.005996366,0.0002617625,0.0001381174,0.0008689652,0.0008299603,0.08907599],"genre_scores_gemma":[0.9347591,0.001114466,0.05354976,0.000652735,0.0003980158,0.0002614967,0.0005942764,0.0001804873,0.008489676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006581393,"threshold_uncertainty_score":0.02201694,"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."}}