{"id":"W2149317979","doi":"10.1016/j.tcs.2010.10.038","title":"On the red/blue spanning tree problem","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Division of Biological Infrastructure; National Natural Science Foundation of China","keywords":"Combinatorics; Spanning tree; Mathematics; Shortest-path tree; Euclidean minimum spanning tree; Minimum spanning tree; Vertex (graph theory); k-minimum spanning tree; Convex hull; Tree (set theory); Minimum degree spanning tree; Path (computing); K-ary tree; Regular polygon; Geometry; Tree structure; Graph; Binary tree; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009262648,0.0005490946,0.0008673192,0.000628352,0.0009480403,0.001165528,0.001114457,0.001346151,0.007938178],"category_scores_gemma":[0.004230203,0.0003345518,0.0003995746,0.001012823,0.0009508849,0.002847075,0.001873731,0.001550263,0.0009623413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006622926,"about_ca_system_score_gemma":0.0005586447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001666671,"about_ca_topic_score_gemma":0.001679616,"domain_scores_codex":[0.9994742,0.0002149947,0.00001721235,0.00009513066,0.0001027247,0.00009576722],"domain_scores_gemma":[0.9988635,0.0007219209,0.00007501673,0.0001074573,0.0001100801,0.000122108],"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.0005546841,0.0001493561,0.0007723463,0.0003556987,0.00006704062,0.000251668,0.0003411226,0.1603208,0.003413058,0.6423362,0.04353296,0.147905],"study_design_scores_gemma":[0.00007048735,0.00005832272,0.000347078,0.00004763217,0.00002951204,0.00017201,0.0001819888,0.3585806,0.000943445,0.6291983,0.01035685,0.00001372202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1942385,0.003466195,0.6849896,0.008840214,0.0006569207,0.0001416781,0.0006166822,0.0005011708,0.106549],"genre_scores_gemma":[0.7177956,0.002603797,0.2354293,0.001401678,0.0005584583,0.0001290668,0.001050009,0.000366445,0.04066575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007938178,"threshold_uncertainty_score":0.02655584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00984460314560611,"score_gpt":0.2398397162658545,"score_spread":0.2299951131202483,"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."}}