{"id":"W2046384546","doi":"10.1016/j.dam.2006.04.018","title":"Minimum edge ranking spanning trees of split graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Simon Fraser University; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Discrete mathematics; Chordal graph; k-minimum spanning tree; Indifference graph; Time complexity; Graph; K-ary tree; Tree structure; Binary tree","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.0005264977,0.0002292479,0.0003854007,0.0002523432,0.0001303368,0.00009043498,0.001155505,0.00007415887,0.00001466259],"category_scores_gemma":[0.00003339746,0.000202339,0.000135781,0.0007500514,0.0002028466,0.000216778,0.0003737928,0.0001741266,0.00003086101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002111684,"about_ca_system_score_gemma":0.00003068952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005817164,"about_ca_topic_score_gemma":0.000003964868,"domain_scores_codex":[0.9980274,0.00002367131,0.0005346803,0.000379189,0.0005594206,0.0004755838],"domain_scores_gemma":[0.9983065,0.0003424594,0.0002665488,0.0009393769,0.00007252295,0.00007263371],"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.00001020585,0.00007261873,0.00007080443,0.0001206488,0.00001761357,0.000003899355,0.0007437046,0.000165393,0.0233606,0.9728104,0.0000884629,0.002535629],"study_design_scores_gemma":[0.0004875682,0.0000381949,0.0003189658,0.00007286322,0.00001386939,0.000006966751,0.0002811012,0.01833319,0.02393046,0.9560708,0.0001734175,0.0002726271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1067474,0.0001320615,0.8525282,0.00005761874,0.00005795446,0.0003999065,0.000005846751,0.0001837953,0.03988729],"genre_scores_gemma":[0.6279511,0.000004981076,0.371779,0.00001599298,0.00002848414,0.00003563681,0.000005006765,0.00002470514,0.0001550462],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5212038,"threshold_uncertainty_score":0.8251146,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01762151411447972,"score_gpt":0.2709471979207124,"score_spread":0.2533256838062327,"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."}}