{"id":"W2253883587","doi":"10.1016/j.ejc.2017.06.026","title":"On the minimum number of edges in triangle-free 5-critical graphs","year":2017,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Corollary; Disjoint sets; Graph; Vertex (graph theory); Discrete mathematics; Clique number; Cograph; Chordal graph; 1-planar graph","routes":{"ca_aff":true,"ca_fund":true,"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.001170382,0.00135184,0.001632782,0.002668708,0.002240708,0.003097473,0.003082084,0.002705107,0.0141802],"category_scores_gemma":[0.01052095,0.001091547,0.0008218571,0.001516932,0.002407592,0.004667849,0.001828423,0.00223358,0.001020185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001533824,"about_ca_system_score_gemma":0.0007699978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001031368,"about_ca_topic_score_gemma":0.001809955,"domain_scores_codex":[0.9991178,0.0002442204,0.00004539813,0.0002188889,0.0001651723,0.0002085122],"domain_scores_gemma":[0.989778,0.006769918,0.0009901535,0.0004727456,0.000611056,0.001378091],"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.003059104,0.000446388,0.009388336,0.002055861,0.0002251822,0.001241136,0.00182542,0.06192217,0.03539556,0.7982724,0.02291149,0.06325699],"study_design_scores_gemma":[0.000314776,0.0001732508,0.002998352,0.0002113322,0.0001098163,0.0006513466,0.0008305516,0.06477255,0.005456157,0.9195307,0.004900596,0.00005047032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.88372,0.001630651,0.0645752,0.002814599,0.0003173396,0.0001447465,0.0009778087,0.0003041889,0.0455156],"genre_scores_gemma":[0.949779,0.0009006602,0.03877913,0.0004196892,0.0002427849,0.0001552819,0.001239955,0.0003040884,0.008179365],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0141802,"threshold_uncertainty_score":0.04743755,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05218795407067771,"score_gpt":0.3293878167928302,"score_spread":0.2771998627221525,"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."}}