{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008572555,0.0002681755,0.0004070891,0.0002377302,0.0007713956,0.0007512622,0.001098717,0.00009330726,0.00006226888],"category_scores_gemma":[0.001134966,0.0002517147,0.000235023,0.001590144,0.0001241008,0.0005239425,0.0008548329,0.0003891728,0.000252008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000146797,"about_ca_system_score_gemma":0.0002456463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006609854,"about_ca_topic_score_gemma":0.00004368432,"domain_scores_codex":[0.9974582,0.0002094809,0.0004543658,0.0005688948,0.0005475143,0.0007615099],"domain_scores_gemma":[0.9970253,0.0005840179,0.0001134217,0.001378068,0.0005603493,0.0003388994],"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.000005032791,0.0001145362,0.00007436727,0.00007458538,0.0000651525,0.0001052645,0.003019966,0.0004641683,0.007743965,0.9846154,0.0008793495,0.002838246],"study_design_scores_gemma":[0.0007991024,0.000120209,0.0002650183,0.000424421,0.0000447931,0.0002194916,0.00123891,0.02641005,0.01175054,0.9506373,0.007418065,0.0006720705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01643375,0.0006707801,0.9741941,0.00488447,0.0001474002,0.0003881259,0.00007436494,0.0003192082,0.002887777],"genre_scores_gemma":[0.7008958,0.00003191165,0.2970657,0.0002122311,0.00007156476,0.0001412275,0.00002735424,0.0000425707,0.001511595],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6844621,"threshold_uncertainty_score":0.9999935,"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."}}