{"id":"W4300427120","doi":"10.1002/jgt.22899","title":"Spanning trees in graphs of high minimum degree with a universal vertex II: A tight 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":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Degree (music); Vertex connectivity; Minimum degree spanning tree; Graph; Discrete mathematics","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.00203888,0.0002236281,0.0006069961,0.001100007,0.0003538598,0.00001158371,0.000636182,0.00007447171,0.0002184316],"category_scores_gemma":[0.000211427,0.0001614705,0.0003047939,0.0008373575,0.0003275573,0.0001760141,0.000232506,0.0007069824,1.346503e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006506626,"about_ca_system_score_gemma":0.000113391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000168417,"about_ca_topic_score_gemma":0.00003202883,"domain_scores_codex":[0.9975108,0.0006095293,0.0007508146,0.0001839479,0.0006528656,0.0002920628],"domain_scores_gemma":[0.9975735,0.000888999,0.0009228413,0.0003635441,0.0001556421,0.00009547576],"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.004329952,0.0003164621,0.002344049,0.0000422077,0.0003815976,0.0003612703,0.008753038,0.0002466014,0.0009520607,0.9796926,0.001021084,0.001559057],"study_design_scores_gemma":[0.00285909,0.001473271,0.00573114,0.0001751048,0.0001670401,0.0003380707,0.005429114,0.00001722966,0.0005465474,0.9827139,0.0003382706,0.0002111725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9960852,0.0005162276,0.0003153918,0.0001129423,0.00037996,0.0001343342,0.00002472689,0.00001502199,0.002416245],"genre_scores_gemma":[0.9963468,0.00004403374,0.003227575,0.00006832694,0.00003687511,0.000003308027,0.000001258669,0.00003499091,0.0002368741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003387091,"threshold_uncertainty_score":0.6584576,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02316656221824536,"score_gpt":0.2490706252883467,"score_spread":0.2259040630701014,"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."}}