{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004523223,0.0005970336,0.0008758975,0.001102303,0.001477412,0.003307783,0.001517163,0.001232813,0.009266127],"category_scores_gemma":[0.005989228,0.001043063,0.0009353863,0.001153439,0.002152415,0.003304061,0.001525059,0.001492782,0.0006658308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006615673,"about_ca_system_score_gemma":0.0005295703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001766655,"about_ca_topic_score_gemma":0.001979509,"domain_scores_codex":[0.9994106,0.000114283,0.00004510009,0.0002108287,0.00009719894,0.0001218926],"domain_scores_gemma":[0.9910357,0.005996966,0.001298951,0.0006024498,0.0003060229,0.0007599181],"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.003038263,0.0006157158,0.03581515,0.0007148933,0.0002009879,0.002920184,0.004406921,0.02503809,0.05503292,0.8300722,0.009379779,0.03276483],"study_design_scores_gemma":[0.0005557562,0.0003379398,0.02707054,0.0001048537,0.0002579862,0.003190073,0.001772441,0.05612108,0.01164608,0.8941225,0.004698018,0.0001226672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9609342,0.0002127492,0.01752281,0.0006200696,0.00003639795,0.00004627691,0.0005692301,0.0001556733,0.01990257],"genre_scores_gemma":[0.990512,0.0002078612,0.004551284,0.0001313682,0.00006769368,0.00005294672,0.0007895486,0.00009033173,0.003597144],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009266127,"threshold_uncertainty_score":0.03099835,"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."}}