{"id":"W2623275761","doi":"10.1016/j.comgeo.2017.06.002","title":"Connecting a set of circles with minimum sum of radii","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Sandia National Laboratories; University of Victoria; McGill University; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Mathematics; Combinatorics; Bounded function; Constant (computer programming); Upper and lower bounds; Plane (geometry); Steiner tree problem; Set (abstract data type); Planar; Tree (set theory); Planar graph; Point (geometry); Approximation algorithm; Discrete mathematics; Mathematical analysis; Geometry; Graph; Computer science","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.0003625546,0.0001288919,0.0002538941,0.0003351387,0.0003704072,0.0001512695,0.000789472,0.00004902912,0.00001868178],"category_scores_gemma":[0.000227705,0.0001245454,0.00007530602,0.0004201503,0.0001341441,0.0005142865,0.0002269724,0.00008561283,0.000007117288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001904091,"about_ca_system_score_gemma":0.0002071879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002379351,"about_ca_topic_score_gemma":0.000005582516,"domain_scores_codex":[0.9986229,0.00004284387,0.0003664083,0.0003081585,0.0004952278,0.0001644756],"domain_scores_gemma":[0.9979319,0.0004379136,0.0005979908,0.0004669326,0.000494806,0.00007045582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000998227,0.0002899217,0.01540103,0.0002866557,0.0002884251,0.00002393237,0.001680112,0.644306,0.003886868,0.1940558,0.0005152457,0.1391662],"study_design_scores_gemma":[0.002516588,0.0006105136,0.2690664,0.0002169206,0.00004045179,0.0001398387,0.0001852405,0.6700342,0.014768,0.04058188,0.001271983,0.0005679426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4881449,0.00009439771,0.5107493,0.0003119364,0.0001557826,0.00008027156,0.0000137252,0.00002428199,0.0004253778],"genre_scores_gemma":[0.8988423,0.000002101249,0.1009535,0.00004016833,0.00008318742,0.000003351616,0.0000304348,0.000007536778,0.00003736987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4106974,"threshold_uncertainty_score":0.5078813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02824305924596995,"score_gpt":0.2800464124401446,"score_spread":0.2518033531941746,"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."}}