{"id":"W4400596816","doi":"10.55016/ojs/cdm.v16i3.62279","title":"Graphs where each spanning tree has a perfect matching","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Spanning tree; Minimum degree spanning tree; Matching (statistics); Graph; Connectivity; Discrete mathematics; Connected dominating set; Tree (set theory); Minimum spanning tree","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.0001955456,0.0003132656,0.0003269971,0.0007813121,0.000913284,0.001034072,0.0004145273,0.000508415,0.004053949],"category_scores_gemma":[0.001190028,0.0002683856,0.000351086,0.001076552,0.0006574287,0.002546307,0.0007808614,0.0003026322,0.0005895442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004467898,"about_ca_system_score_gemma":0.0004078673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007009241,"about_ca_topic_score_gemma":0.001230447,"domain_scores_codex":[0.9996387,0.00005055911,0.00003391634,0.0001272691,0.00006815277,0.00008139879],"domain_scores_gemma":[0.9992454,0.000229291,0.0002036748,0.0001610988,0.00009378664,0.00006675855],"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.0002576005,0.00008475877,0.004973164,0.0003273871,0.00008956264,0.0008769396,0.0006415435,0.01864308,0.0309963,0.8617322,0.00639164,0.0749857],"study_design_scores_gemma":[0.00002896852,0.000128074,0.005676863,0.00006392324,0.000109153,0.002899981,0.0006885168,0.04655079,0.01631709,0.888202,0.03929811,0.00003656833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7704423,0.0008387828,0.1483114,0.0007042253,0.00006792219,0.00007009145,0.00134173,0.0004225237,0.07780096],"genre_scores_gemma":[0.9645573,0.0005174745,0.02662994,0.0001579351,0.00005563921,0.00003654948,0.0008462581,0.00005321154,0.007145675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004053949,"threshold_uncertainty_score":0.01356179,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02635374451992335,"score_gpt":0.3218086747465916,"score_spread":0.2954549302266682,"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."}}