{"id":"W2922220994","doi":"10.4153/s0008414x20000784","title":"Shortest paths in arbitrary plane domains","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Analytic and geometric function theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan; Nipissing University","funders":"","keywords":"Path (computing); Homotopy; Euclidean shortest path; Shortest path problem; Plane (geometry); Open set; Euclidean geometry; Set (abstract data type); Simple (philosophy)","routes":{"ca_aff":true,"ca_fund":false,"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.0006762212,0.0001516574,0.0004437768,0.0004292663,0.00005242842,0.00003604508,0.0003054,0.00009838839,0.0006714805],"category_scores_gemma":[0.002228508,0.0001305082,0.0001337857,0.0006130428,0.00007392328,0.0001094515,0.00001189608,0.0003909865,0.00006270992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000109916,"about_ca_system_score_gemma":0.0006899099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008643624,"about_ca_topic_score_gemma":0.001000786,"domain_scores_codex":[0.9985626,0.00004087877,0.0007507107,0.0001025381,0.0002522791,0.0002909427],"domain_scores_gemma":[0.9980871,0.0005304242,0.0003417222,0.0001672767,0.0001049762,0.0007684933],"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.00008991642,0.0006436461,0.03513148,0.001373873,0.0006589931,0.008223651,0.03350972,0.0004189886,0.0001477436,0.7342532,0.1819413,0.003607487],"study_design_scores_gemma":[0.002378817,0.0007161342,0.001654237,0.000604592,0.0003206133,0.00133684,0.0163969,0.003850845,0.0002937392,0.9463344,0.02532744,0.0007854965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9043117,0.001067843,0.05511083,0.005068569,0.0005566264,0.0003617851,0.0000606502,0.00003954055,0.03342244],"genre_scores_gemma":[0.9799468,0.00002195781,0.01842721,0.0009341116,0.0002897127,0.000001252807,0.000001955765,0.00003555922,0.000341429],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2120811,"threshold_uncertainty_score":0.7352241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04493405247974432,"score_gpt":0.2476058292899679,"score_spread":0.2026717768102236,"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."}}