{"id":"W108520386","doi":"","title":"Bi-Chromatic Minimum Spanning Trees","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Spanning tree; Combinatorics; Mathematics; Minimum spanning tree; Minimum degree spanning tree; Planar; Disjoint sets; Planar graph; Connected dominating set; Chromatic scale; Greedy algorithm; Discrete mathematics; Graph; Algorithm; Computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001146328,0.000060217,0.00005971842,0.0000972873,0.00007633782,0.0001022709,0.000233225,0.00001904972,0.0000801577],"category_scores_gemma":[0.00001842219,0.00005292906,0.00002960789,0.0002931388,0.000008144872,0.0004383421,0.00006434167,0.00003093806,0.0003031951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001696719,"about_ca_system_score_gemma":0.00003101256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003010269,"about_ca_topic_score_gemma":0.00000867893,"domain_scores_codex":[0.9994193,0.00001801045,0.000127856,0.0001609595,0.000157161,0.0001167065],"domain_scores_gemma":[0.9996629,0.0000595825,0.00002894875,0.0001671194,0.00003433786,0.00004709037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002257243,0.0001267918,0.0002009968,0.000009318864,0.00002029608,0.000005957912,0.001018236,0.05610715,0.01262832,0.2022524,0.01877928,0.708849],"study_design_scores_gemma":[0.0001719024,0.00003475309,0.003577086,0.000006262302,0.000002087461,0.00001596418,0.00001292769,0.9621085,0.008836748,0.002245419,0.02287097,0.0001173912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07747136,0.00009379852,0.9092127,0.002589043,0.0001535158,0.000048006,1.501444e-7,0.0001554986,0.0102759],"genre_scores_gemma":[0.7474896,0.00000184797,0.2489025,0.0006112593,0.0001649754,0.00000334008,0.000001822936,0.000002096331,0.002822495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9060013,"threshold_uncertainty_score":0.389706,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01719207396910605,"score_gpt":0.2509931357309643,"score_spread":0.2338010617618583,"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."}}