{"id":"W2292472667","doi":"10.1016/j.comgeo.2020.101626","title":"Shortest paths and convex hulls in 2D complexes with non-positive curvature","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Convex hull; Shortest path problem; Polyhedron; Mathematics; Euclidean shortest path; Combinatorics; Convex polytope; Convex set; Regular polygon; Vertex (graph theory); Subderivative; K shortest path routing; Convex optimization; Geometry; Graph","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.0006234822,0.001066079,0.0009103747,0.0032744,0.001174869,0.003106225,0.001660916,0.001805111,0.006861776],"category_scores_gemma":[0.006697884,0.001012037,0.0008069232,0.001747199,0.002160523,0.003583752,0.003139903,0.002104979,0.0009216412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001514002,"about_ca_system_score_gemma":0.0004988437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002300192,"about_ca_topic_score_gemma":0.002091826,"domain_scores_codex":[0.9992901,0.0001786246,0.00004024679,0.0001716343,0.0002441639,0.00007512031],"domain_scores_gemma":[0.9971377,0.001548393,0.0004512112,0.0001850246,0.0003578733,0.0003198081],"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.0001085092,0.00005156413,0.001172172,0.0001843586,0.0000246046,0.0002303924,0.0006514455,0.09903225,0.003406163,0.8626644,0.003590952,0.02888325],"study_design_scores_gemma":[0.00001560886,0.00002431128,0.0005200852,0.0000314813,0.000007331648,0.0001343953,0.000187321,0.2755582,0.001124603,0.7181541,0.004220817,0.00002184632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2164722,0.0006363189,0.7688744,0.0006844893,0.0001078569,0.00009936317,0.0006638273,0.0003155478,0.01214599],"genre_scores_gemma":[0.7885423,0.0008331775,0.1871981,0.0001631955,0.0001383309,0.0002020078,0.001104506,0.0006262914,0.02119205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006861776,"threshold_uncertainty_score":0.02295494,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01615387067059728,"score_gpt":0.2523741191691435,"score_spread":0.2362202484985462,"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."}}