{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006609575,0.0006989354,0.0006830846,0.001397972,0.001094469,0.001429999,0.001390012,0.001395122,0.002580616],"category_scores_gemma":[0.005244239,0.0009085473,0.0005643226,0.001291349,0.001001091,0.003073186,0.001917922,0.001221921,0.0007346768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007561824,"about_ca_system_score_gemma":0.0004688355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001058269,"about_ca_topic_score_gemma":0.00226724,"domain_scores_codex":[0.9993519,0.00009730676,0.0000514429,0.0001814313,0.0001575668,0.0001602765],"domain_scores_gemma":[0.995628,0.002425132,0.0005397872,0.0004107715,0.0002951557,0.0007011523],"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.001459584,0.0005942536,0.01503474,0.001214993,0.0003100018,0.004005981,0.003139255,0.1346453,0.2338175,0.5169329,0.01140101,0.07744454],"study_design_scores_gemma":[0.0002533457,0.0002987796,0.006548745,0.0001492112,0.000146996,0.003404139,0.0006239479,0.2777184,0.02856371,0.6733339,0.008876093,0.0000827887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8941807,0.0008757697,0.09586963,0.0006773142,0.00002824027,0.00006313722,0.0006782779,0.0004489897,0.007178069],"genre_scores_gemma":[0.9318252,0.0005409115,0.06105115,0.0002948737,0.00005768242,0.00009811819,0.001239731,0.0001488609,0.004743578],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002580616,"threshold_uncertainty_score":0.008633018,"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."}}