{"id":"W3132307481","doi":"10.1016/j.jctb.2021.02.001","title":"Connectivity and choosability of graphs with no K minor","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Minor (academic); Mathematics; Graph; Conjecture; Graph minor; Upper and lower bounds; Discrete mathematics; Graph power; Line 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":[],"consensus_categories":[],"category_scores_codex":[0.001964335,0.0001395732,0.0004299651,0.0001145813,0.0001004305,0.00006945388,0.0005304418,0.00006084661,0.0000344761],"category_scores_gemma":[0.00111038,0.0001067285,0.000107797,0.0005272009,0.0005109268,0.001111247,0.0002384868,0.0003234671,9.62933e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003042356,"about_ca_system_score_gemma":0.0002803679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001336266,"about_ca_topic_score_gemma":0.000001319124,"domain_scores_codex":[0.9980012,0.0007076192,0.0003817593,0.0002120676,0.000481722,0.0002156676],"domain_scores_gemma":[0.9967729,0.0009315269,0.0003671805,0.0004746444,0.001300129,0.0001536439],"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.001331385,0.0001971665,0.002869794,0.00004589551,0.000083901,0.00007595482,0.0003037358,0.000006365036,0.006086511,0.9870898,0.00002503281,0.001884527],"study_design_scores_gemma":[0.001353532,0.001256069,0.003449908,0.00004864175,0.00001391164,0.0003281397,0.0001697057,0.000009034408,0.04757929,0.9448557,0.0008157837,0.0001202285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9810364,0.0005132047,0.01464958,0.0002920036,0.001744787,0.000112528,0.000003615603,0.00001864467,0.001629283],"genre_scores_gemma":[0.9930536,0.00006173347,0.00665165,0.00002291161,0.00008920258,0.000001763963,2.053841e-7,0.000008734384,0.000110256],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04223397,"threshold_uncertainty_score":0.435226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00907079580733079,"score_gpt":0.2509396275268328,"score_spread":0.241868831719502,"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."}}