{"id":"W2085702149","doi":"10.1007/s00373-013-1356-2","title":"Graphs with a Minimal Number of Convex Sets","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Convex hull; Induced path; Graph; Graph power; Line graph; Regular polygon","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":[],"consensus_categories":[],"category_scores_codex":[0.0001733416,0.0001602041,0.0002343414,0.0001567136,0.0001105691,0.00008287917,0.0005530594,0.00006233219,0.00002914277],"category_scores_gemma":[0.00001526768,0.0001256574,0.00005659732,0.001102945,0.0002722293,0.0004694631,0.0002071534,0.0001708701,0.00001913543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000765895,"about_ca_system_score_gemma":0.00003581992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004422448,"about_ca_topic_score_gemma":0.000001307965,"domain_scores_codex":[0.9986875,0.0000611108,0.0001894962,0.0003366088,0.0003775689,0.0003477312],"domain_scores_gemma":[0.998844,0.0001280358,0.00009232623,0.0004956176,0.0002637076,0.0001763635],"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.00001008645,0.00008823779,0.04690018,0.00002740398,0.00002491287,0.000008684116,0.0002324989,5.147839e-7,0.0001286089,0.9488803,0.0002960025,0.003402618],"study_design_scores_gemma":[0.0007077469,0.0002810985,0.02017462,0.00001936945,0.000005502242,0.00004549465,0.00008420824,0.0006586025,0.0007336008,0.9767655,0.0003276978,0.0001965307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.990095,0.0002968927,0.005565081,0.0001763887,0.0001170152,0.0002760562,0.000002600694,0.00009061489,0.003380301],"genre_scores_gemma":[0.9948515,0.00008752477,0.00480762,0.0000642125,0.000001677387,0.00004172907,0.000001015351,0.00001176607,0.0001329978],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02788528,"threshold_uncertainty_score":0.5124162,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01161708151221971,"score_gpt":0.2556868968321987,"score_spread":0.244069815319979,"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."}}