{"id":"W3213138807","doi":"10.1007/s00453-021-00889-6","title":"Bounded-Angle Minimum Spanning Trees","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Carleton University; University of Windsor","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Theory of computation; Spanning tree; Minimum spanning tree; Combinatorics; Mathematics; Tree (set theory); Computer science; Discrete mathematics; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000177393,0.0001921335,0.0002356406,0.0001059018,0.0002980229,0.0003844133,0.0009640597,0.00008081358,0.0001233763],"category_scores_gemma":[0.00006603633,0.0002023765,0.0001686976,0.0007929329,0.00009749021,0.0004700799,0.0006168376,0.0002216579,0.00017154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000374408,"about_ca_system_score_gemma":0.0001552337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002784993,"about_ca_topic_score_gemma":0.00002300281,"domain_scores_codex":[0.9982168,0.00008226949,0.0002616501,0.000605571,0.0003654852,0.0004681941],"domain_scores_gemma":[0.9985805,0.0001594702,0.00006857925,0.0008973127,0.000141725,0.0001524564],"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.00000418387,0.0003711828,0.0002028882,0.00002196376,0.0001284976,0.0008554516,0.00173058,0.00004005205,0.002552055,0.2919221,0.01091611,0.691255],"study_design_scores_gemma":[0.001504145,0.0002340492,0.004674369,0.0001238054,0.0000437699,0.0007810596,0.0004905984,0.3314127,0.05372064,0.3091404,0.2964352,0.001439329],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01079886,0.001031336,0.9620187,0.004031202,0.001830268,0.0001210534,0.00001252812,0.0005989095,0.01955711],"genre_scores_gemma":[0.1761421,0.00004753065,0.81716,0.001617344,0.0006468323,0.00002711408,0.00002354379,0.00003219283,0.004303365],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6898156,"threshold_uncertainty_score":0.8252672,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02168900390825496,"score_gpt":0.251062075790046,"score_spread":0.229373071881791,"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."}}