{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003165954,0.0005177213,0.0006491125,0.0007531752,0.0001743593,0.0005064037,0.0007710001,0.0002804335,0.0000186548],"category_scores_gemma":[0.00008015744,0.0005160104,0.0000997015,0.001558018,0.0001439795,0.0004042247,0.001282741,0.0009876549,0.00003124516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000116588,"about_ca_system_score_gemma":0.0005663017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003504498,"about_ca_topic_score_gemma":0.0000166291,"domain_scores_codex":[0.9967852,0.0001379061,0.0005767668,0.001311721,0.0008148763,0.0003735831],"domain_scores_gemma":[0.9979286,0.0006558042,0.0003220951,0.0003784434,0.000462258,0.0002528113],"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.00008939668,0.0003304766,0.01008799,0.0003226924,0.0002765113,0.000294442,0.001972664,0.9195564,0.0002061248,0.04508031,0.00264667,0.0191363],"study_design_scores_gemma":[0.000993536,0.0002432637,0.2663388,0.0003160159,0.00003661914,0.00009377608,0.00005142054,0.6790921,0.000166154,0.05140701,0.0004582204,0.0008030598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.140981,0.0009701423,0.8531742,0.002759212,0.0004985906,0.0007185299,0.0001523626,0.0001498076,0.0005961589],"genre_scores_gemma":[0.8867137,0.00002822583,0.110413,0.001416713,0.0002663496,0.00005530819,0.001021685,0.0000284197,0.00005666148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7457327,"threshold_uncertainty_score":0.9997292,"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."}}