{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009866299,0.001602289,0.002435307,0.001843939,0.00428682,0.00564464,0.004268471,0.00223816,0.01876344],"category_scores_gemma":[0.006326343,0.001977087,0.00170499,0.002255534,0.003561005,0.008756776,0.003225137,0.004140373,0.002646785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002202119,"about_ca_system_score_gemma":0.001512423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001221914,"about_ca_topic_score_gemma":0.002253809,"domain_scores_codex":[0.9981086,0.0004373534,0.0001288839,0.0005324867,0.0004309232,0.0003617463],"domain_scores_gemma":[0.9925874,0.003146343,0.0008617914,0.001419428,0.0007653274,0.001219816],"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.0003385933,0.00008390444,0.0008003596,0.0002526076,0.0000727217,0.0002530833,0.0002230562,0.003798999,0.004651713,0.9713846,0.006573321,0.01156694],"study_design_scores_gemma":[0.00007063353,0.00003155437,0.0007189462,0.00005112796,0.00007024626,0.0004653012,0.0002091238,0.009007524,0.003569225,0.9785169,0.007259136,0.00003024238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4196138,0.001067767,0.3721229,0.008267906,0.0004482589,0.0004953499,0.006911251,0.001921784,0.189151],"genre_scores_gemma":[0.7695143,0.0006558021,0.1838858,0.001042428,0.000311428,0.0006063831,0.004323096,0.0006405122,0.03902028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01876344,"threshold_uncertainty_score":0.06276989,"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."}}