{"id":"W2017923854","doi":"10.1016/j.disc.2014.10.002","title":"Cycle-maximal triangle-free graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Counterexample; Conjecture; Discrete mathematics; Homomorphism; Upper and lower bounds; Vertex (graph theory); Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.001072575,0.0002119384,0.0003256258,0.0002025759,0.0001709981,0.0002019121,0.002507349,0.00007023437,0.00003585984],"category_scores_gemma":[0.0009174668,0.0001736093,0.000177664,0.0006121547,0.0001517128,0.0004400663,0.0007645814,0.0002151929,0.0002164094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002220151,"about_ca_system_score_gemma":0.00002468417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002006248,"about_ca_topic_score_gemma":0.000002691288,"domain_scores_codex":[0.9979897,0.0001361199,0.0003761901,0.0003907376,0.0005925369,0.0005147898],"domain_scores_gemma":[0.9969947,0.0005250199,0.0001457501,0.00206094,0.00008689014,0.0001867501],"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.000004885656,0.00005106202,0.00002559948,0.00004727062,0.00001594832,0.000006153356,0.000577079,0.00003783435,0.0002533073,0.9922083,0.0005434962,0.006229079],"study_design_scores_gemma":[0.0005472393,0.00009205441,0.00004859824,0.000025952,0.000006540561,0.00001922512,0.00005212655,0.06926189,0.0009737606,0.9263952,0.002352222,0.0002252016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00854033,0.00005072134,0.9592845,0.0008891667,0.0001516504,0.0002463963,0.000006266294,0.0003270656,0.0305039],"genre_scores_gemma":[0.4014038,0.00001451862,0.596947,0.0003478355,0.00009837474,0.00006442139,0.000005493438,0.00005756445,0.001060932],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3928635,"threshold_uncertainty_score":0.7079583,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01997222884557123,"score_gpt":0.2811180102016201,"score_spread":0.2611457813560489,"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."}}