{"id":"W2963964459","doi":"10.20382/jocg.v7i2a3","title":"Shortest path in a polygon using sublinear space","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Sublinear function; Mathematics; Polygon (computer graphics); Simple polygon; Shortest path problem; Combinatorics; Path (computing); Space (punctuation); Constant (computer programming); K shortest path routing; Time complexity; Discrete mathematics; Algorithm; Monotone polygon; Computer science; Graph; Geometry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007133261,0.0001551553,0.0002739132,0.002327229,0.00008037606,0.0001198525,0.0006115626,0.00007982643,0.00001007178],"category_scores_gemma":[0.0001440899,0.0001702389,0.0001277155,0.003506559,0.00004065016,0.001405938,0.0001611837,0.0002641914,0.000008625356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000398268,"about_ca_system_score_gemma":0.0009527583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003066978,"about_ca_topic_score_gemma":0.000005258901,"domain_scores_codex":[0.9981772,0.0001630289,0.0004179273,0.0002305135,0.0007854962,0.0002257877],"domain_scores_gemma":[0.9979981,0.000215691,0.0004044597,0.0001460425,0.0009636523,0.0002721121],"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.00006370879,0.0001561205,0.003853366,0.000006129977,0.00003310038,0.0003266527,0.0002487739,0.9709492,0.0001672505,0.021574,0.0004701705,0.002151584],"study_design_scores_gemma":[0.003424746,0.0005414117,0.01358094,0.00009338988,0.00003700768,0.0007378309,0.0004984468,0.9488744,0.0003181455,0.01194853,0.01949265,0.0004524757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4060629,0.0001705068,0.592261,0.0004754034,0.0003968977,0.00005682473,0.000002490942,0.0000174556,0.0005565974],"genre_scores_gemma":[0.8764902,0.00001263708,0.1229762,0.0001238996,0.0001896327,6.020312e-8,0.000006633626,0.000007383888,0.000193415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4704273,"threshold_uncertainty_score":0.6942143,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03357880101853126,"score_gpt":0.2418161223360534,"score_spread":0.2082373213175222,"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."}}