{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009116504,0.0008698116,0.001196885,0.0008761365,0.001083833,0.002689507,0.002217058,0.001392608,0.01249864],"category_scores_gemma":[0.01220218,0.0006308041,0.0006818261,0.002162545,0.0008516914,0.006751942,0.002528641,0.002339379,0.002253595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009128812,"about_ca_system_score_gemma":0.0007930876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000762291,"about_ca_topic_score_gemma":0.00144742,"domain_scores_codex":[0.998782,0.0003824527,0.00008101335,0.0002841102,0.0002882916,0.0001822387],"domain_scores_gemma":[0.9936156,0.004069175,0.0005346999,0.000726991,0.0005935059,0.000459991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001022834,0.0004388304,0.004021211,0.000888841,0.0001185585,0.0002992796,0.000454752,0.1528252,0.01044102,0.6040832,0.03743178,0.1879745],"study_design_scores_gemma":[0.0001219706,0.00008545046,0.001094163,0.00008396777,0.00006324218,0.0003178359,0.0002211393,0.2588761,0.002893446,0.7256259,0.01059589,0.00002088802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1890911,0.00247471,0.7439935,0.004506372,0.0004635166,0.0002345062,0.002838972,0.0009006592,0.05549659],"genre_scores_gemma":[0.7139397,0.002761237,0.2552899,0.0007620411,0.0004477357,0.0003104242,0.00451366,0.0004559673,0.02151934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01249864,"threshold_uncertainty_score":0.04181212,"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."}}