{"id":"W4403975939","doi":"10.55016/ojs/cdm.v19i2.62694","title":"Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Combinatorics; Spanning tree; Mathematics; Discrete mathematics; Minimum spanning tree; Kruskal's algorithm; Minimum degree spanning tree; Trémaux tree; Graph; Line graph; Pathwidth","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.0003234349,0.0003527183,0.0004867454,0.0009999003,0.001454186,0.001451083,0.0006835479,0.0008276235,0.005428205],"category_scores_gemma":[0.002126148,0.0004330121,0.0006747195,0.001102884,0.001050436,0.002419623,0.0009934268,0.001017155,0.0004265629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007784872,"about_ca_system_score_gemma":0.0004021064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007104283,"about_ca_topic_score_gemma":0.001279567,"domain_scores_codex":[0.9994977,0.0001048349,0.00003361821,0.0001780852,0.00008362009,0.0001022166],"domain_scores_gemma":[0.9983032,0.0007656149,0.0003466459,0.0002145393,0.0001505713,0.000219395],"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.000210374,0.00007561864,0.00319344,0.0002894991,0.00004657743,0.0002890632,0.0008106992,0.01597661,0.01275154,0.9403735,0.007118268,0.01886469],"study_design_scores_gemma":[0.00005008719,0.0001003353,0.006229646,0.00005332324,0.00007954449,0.001248201,0.0006614653,0.06848197,0.006702273,0.8992761,0.01707157,0.00004566458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8014751,0.0009178923,0.1516809,0.001367379,0.0000834008,0.00009560689,0.001969453,0.0002657544,0.04214441],"genre_scores_gemma":[0.9586698,0.0003855419,0.03320354,0.0002473832,0.00008476365,0.000126442,0.001382516,0.00005629298,0.00584368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005428205,"threshold_uncertainty_score":0.01815915,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0337211460636568,"score_gpt":0.2992418798723409,"score_spread":0.2655207338086841,"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."}}