{"id":"W2175772512","doi":"10.1016/j.jda.2012.04.009","title":"Kinetic Euclidean minimum spanning tree in the plane","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Euclidean minimum spanning tree; Delaunay triangulation; Mathematics; Combinatorics; Spanning tree; Constrained Delaunay triangulation; Minimum spanning tree; Bowyer–Watson algorithm; Plane (geometry); Euclidean geometry; Euclidean space; Pitteway triangulation; Triangulation; Geometry; Kruskal's algorithm","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.001088251,0.00008848252,0.0001348888,0.000188439,0.00005864526,0.0001005325,0.0004938393,0.00003064065,0.00000872343],"category_scores_gemma":[0.00006558034,0.00005698792,0.00007609415,0.0004282326,0.00001730302,0.0006692137,0.00005258753,0.00019821,0.00001014322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002406145,"about_ca_system_score_gemma":0.0000399745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006055895,"about_ca_topic_score_gemma":0.000003009846,"domain_scores_codex":[0.9987789,0.000131692,0.000360575,0.00008353927,0.0004269517,0.0002183558],"domain_scores_gemma":[0.9992827,0.0001983611,0.0002185227,0.0001537545,0.00006494893,0.00008173066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001131338,0.001033743,0.01683768,0.00006373827,0.0002128136,0.0004898148,0.03575942,0.02466741,0.007264788,0.05912881,0.02291801,0.8315107],"study_design_scores_gemma":[0.004498749,0.001829691,0.6040669,0.0002923951,0.0001152272,0.004618115,0.00230684,0.2880776,0.004305057,0.0201165,0.068731,0.00104197],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2465991,0.002841013,0.7402255,0.005647824,0.001863722,0.0001490114,0.000002511214,0.00001749036,0.002653848],"genre_scores_gemma":[0.9538146,0.00002446044,0.04487934,0.0003309521,0.0008668284,0.000001375406,0.000002301712,0.000004094628,0.00007606379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8304687,"threshold_uncertainty_score":0.23239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02183772406415762,"score_gpt":0.2748747911010951,"score_spread":0.2530370670369375,"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."}}