{"id":"W2404724826","doi":"","title":"Spanning trees with a bounded number of leaves in a claw-free graph","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spanning tree; Minimum degree spanning tree; Claw; Graph; Bounded function; Trémaux tree; Minimum spanning tree; Discrete mathematics; Degree (music); Line graph; Pathwidth; Physics; Biology","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000611754,0.0001584285,0.0002578598,0.0002169255,0.00007600894,0.00004772883,0.00119629,0.00006205947,0.00001171885],"category_scores_gemma":[0.0001116458,0.0001375129,0.00005622026,0.001266868,0.0002202174,0.0009826786,0.0004064953,0.0002507084,0.00001872261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000448691,"about_ca_system_score_gemma":0.00005886272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005148863,"about_ca_topic_score_gemma":0.00003104989,"domain_scores_codex":[0.9982964,0.0001556744,0.0002317509,0.0002768238,0.000452086,0.0005871957],"domain_scores_gemma":[0.9984697,0.0002378553,0.0001034082,0.0009582122,0.00009054402,0.0001403323],"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.00003439597,0.0001684538,0.1854855,0.00001149418,0.0000160165,0.000009189137,0.00105537,0.000007502192,0.0002826012,0.8122104,0.00007771116,0.0006414248],"study_design_scores_gemma":[0.00140691,0.0001149555,0.05224224,0.00006078362,0.000003448025,0.00002162318,0.0001215686,0.0001636794,0.003275353,0.9422457,0.0001544757,0.0001892852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9909459,0.0002402683,0.004082958,0.0001421163,0.0003541838,0.0001871354,0.000001123782,0.0000820487,0.003964303],"genre_scores_gemma":[0.9838716,0.000008616537,0.01594152,0.00002985998,0.000005607164,0.00002653388,5.878246e-7,0.00001669044,0.0000989141],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1332432,"threshold_uncertainty_score":0.5607615,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01777677651731934,"score_gpt":0.2891600823010217,"score_spread":0.2713833057837023,"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."}}