{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.007077144,0.0003036889,0.0006874885,0.0004683811,0.000154133,0.0002699252,0.009526964,0.00008855623,0.00001841395],"category_scores_gemma":[0.007752185,0.0002160849,0.0004378132,0.0003871543,0.0004709367,0.0002814865,0.00313209,0.002472446,0.00003003281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008089937,"about_ca_system_score_gemma":0.0002632134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001065287,"about_ca_topic_score_gemma":3.374059e-7,"domain_scores_codex":[0.9943685,0.002641852,0.001031519,0.0003588521,0.001186954,0.0004123586],"domain_scores_gemma":[0.9927738,0.002502007,0.001132852,0.002621823,0.0007709485,0.0001985628],"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.0001008808,0.0003357109,0.0005113235,0.00006806227,0.00004925243,0.0009369981,0.000375736,0.00005834592,0.00002346319,0.9905697,0.003464437,0.003506101],"study_design_scores_gemma":[0.001237113,0.0003715221,0.001906198,0.0006755664,0.00001434653,0.0000931926,0.00003189066,0.0001642104,0.0003302849,0.9939702,0.0009906094,0.0002148391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5560374,0.004970534,0.1960466,0.02580885,0.02199482,0.001383715,0.00005571855,0.0001294556,0.1935729],"genre_scores_gemma":[0.9973826,0.0002468265,0.001949547,0.00007336257,0.00009932537,0.000002039826,3.836951e-7,0.00004123157,0.0002046455],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4413452,"threshold_uncertainty_score":0.9998289,"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."}}