{"id":"W6947565633","doi":"10.4230/lipics.isaac.2024.4","title":"Minimum Plane Bichromatic Spanning Trees","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Spanning tree; Euclidean minimum spanning tree; Minimum spanning tree; k-minimum spanning tree; Shortest-path tree; Tree (set theory); Plane (geometry); Time complexity; Regular polygon","routes":{"ca_aff":true,"ca_fund":true,"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.0002440845,0.0007137559,0.001000759,0.0007481941,0.0005368658,0.001080004,0.0009359457,0.0009918106,0.003995364],"category_scores_gemma":[0.00191351,0.000424706,0.0005534943,0.002198969,0.00025383,0.00167687,0.00103581,0.000756404,0.001153197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006384508,"about_ca_system_score_gemma":0.0004300466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002015487,"about_ca_topic_score_gemma":0.002495903,"domain_scores_codex":[0.9995819,0.00007024115,0.0000273883,0.0001388897,0.0000971598,0.00008452185],"domain_scores_gemma":[0.9994497,0.0001903816,0.000104548,0.00010459,0.00009658161,0.00005421034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007304256,0.0002478706,0.002623658,0.001362244,0.0001851149,0.000633188,0.0007644563,0.3749245,0.04722005,0.09474793,0.03461859,0.4419419],"study_design_scores_gemma":[0.0001091476,0.0002177549,0.002824492,0.0001159917,0.00008208981,0.001184608,0.0003799945,0.8475769,0.01138366,0.1092732,0.0268039,0.00004820355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1784818,0.002386504,0.7981668,0.0007418431,0.00008613022,0.0002711264,0.00386255,0.001583383,0.01441978],"genre_scores_gemma":[0.3696479,0.001564979,0.6155846,0.0001777426,0.00005230026,0.000194521,0.006367701,0.0002408723,0.006169413],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003995364,"threshold_uncertainty_score":0.01336581,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01928083163543032,"score_gpt":0.2567765929345371,"score_spread":0.2374957612991068,"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."}}