{"id":"W4303438707","doi":"10.1002/jgt.22897","title":"Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Fondo Nacional de Desarrollo Científico, Tecnológico y de Innovación Tecnológica; Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Degree (music); Minimum degree spanning tree; Graph; Discrete mathematics; Spanning tree","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.002312077,0.0002223023,0.0005878174,0.001077775,0.0002440196,0.00001605334,0.0006778599,0.00007254867,0.0001544455],"category_scores_gemma":[0.0002074889,0.0001656699,0.0002491925,0.0007503765,0.0003190034,0.0002584103,0.0001397088,0.0006664728,1.346237e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006511801,"about_ca_system_score_gemma":0.0001103955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002033801,"about_ca_topic_score_gemma":0.00004414013,"domain_scores_codex":[0.997272,0.0008605799,0.0007357908,0.0001948866,0.0006435895,0.0002931824],"domain_scores_gemma":[0.997534,0.0009080105,0.0008717186,0.0004103408,0.0001578417,0.0001180942],"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.004049492,0.0003752592,0.004738246,0.0000428694,0.0003174312,0.0003365977,0.007223608,0.0007317573,0.0008605832,0.9789914,0.0002161846,0.002116567],"study_design_scores_gemma":[0.002579022,0.001816318,0.01418022,0.0001366443,0.0001722233,0.000350026,0.008853506,0.00004016868,0.000330946,0.9712747,0.00005257272,0.0002136218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9974306,0.0003025651,0.0004282417,0.00005320418,0.0003563248,0.0001279109,0.00002014576,0.00001617227,0.001264788],"genre_scores_gemma":[0.9962459,0.00002845984,0.003506597,0.00006059712,0.00003737112,0.000002545765,0.000001719257,0.00003865311,0.00007815765],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009441973,"threshold_uncertainty_score":0.6755821,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02759842679262543,"score_gpt":0.2614477421452291,"score_spread":0.2338493153526037,"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."}}