{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002017695,0.0001535823,0.0001122849,0.0001723263,0.0007628447,0.0006512678,0.002418611,0.00004526143,0.00007289787],"category_scores_gemma":[0.0001999403,0.00009794082,0.00005665296,0.001443443,0.001243272,0.0004569479,0.0006418757,0.0004077801,0.0001363782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002190224,"about_ca_system_score_gemma":0.0001396632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.78773e-7,"about_ca_topic_score_gemma":0.00000115182,"domain_scores_codex":[0.9979003,0.0000896503,0.0002117061,0.0006023684,0.0007781981,0.000417776],"domain_scores_gemma":[0.9980892,0.000666128,0.0000628707,0.0008036356,0.0001976523,0.0001805481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003051622,0.00003438188,0.000007557855,0.000001166092,0.000001670449,0.000003315243,0.0002163647,0.001216987,0.003423929,0.945429,0.0003373044,0.04932526],"study_design_scores_gemma":[0.00008723851,0.0001262816,0.0006457728,0.000009511003,0.000001459893,0.00003092181,0.000001932251,0.5570256,0.008807887,0.4324396,0.0006912076,0.0001326341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1180586,0.000003254827,0.8627673,0.007487521,0.0009385506,0.0001646003,3.868862e-7,0.0001462653,0.01043346],"genre_scores_gemma":[0.8403347,4.115253e-7,0.157947,0.001444459,0.0002259191,0.00000989915,5.620732e-7,0.000004615248,0.0000324121],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7222761,"threshold_uncertainty_score":0.628019,"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."}}