{"id":"W4412202024","doi":"10.1145/3747591","title":"Minimum Plane Bichromatic Spanning Trees","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Spanning tree; Combinatorics; Plane (geometry); Mathematics; Minimum degree spanning tree; Computer science; Discrete mathematics; Physics; Geometry","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.0002117581,0.0002184721,0.0002163833,0.0004639138,0.0003109952,0.0002981813,0.001793397,0.00006917323,0.00008489379],"category_scores_gemma":[0.0000247103,0.0002065773,0.0001045976,0.0009986024,0.00005415593,0.0007016137,0.00005782894,0.0002158937,0.0002551715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004968331,"about_ca_system_score_gemma":0.00004910575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004646256,"about_ca_topic_score_gemma":0.00001573561,"domain_scores_codex":[0.9984871,0.00004793372,0.0002921196,0.0005125765,0.0003007804,0.0003595209],"domain_scores_gemma":[0.998256,0.0002003401,0.00005626256,0.001372218,0.00003448027,0.00008074164],"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.000005263629,0.0002066413,0.000009601701,0.00002668348,0.0001170987,0.00003222331,0.0001786538,0.0005480271,0.0001322813,0.00231927,0.002537707,0.9938865],"study_design_scores_gemma":[0.003266321,0.0005249227,0.004063834,0.0004786851,0.0002119712,0.00003651185,0.0005606068,0.8801373,0.006517561,0.0194135,0.08349192,0.001296854],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006296377,0.00008596882,0.9905046,0.003475879,0.001276418,0.0002139684,0.00001932964,0.0004661105,0.003328067],"genre_scores_gemma":[0.1261007,0.0001482877,0.8496605,0.002345961,0.0001364792,0.0001431765,0.00003607368,0.00003234845,0.02139653],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9925897,"threshold_uncertainty_score":0.8423979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01779323630805467,"score_gpt":0.265220523802979,"score_spread":0.2474272874949243,"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."}}