{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004213481,0.0003595258,0.0003115729,0.001494851,0.001033672,0.001466453,0.0005569577,0.0007639272,0.003499251],"category_scores_gemma":[0.002367713,0.0002875507,0.0003484815,0.001003325,0.001724393,0.002399647,0.001990344,0.001007658,0.0002796065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001312196,"about_ca_system_score_gemma":0.0004829128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001700514,"about_ca_topic_score_gemma":0.001426045,"domain_scores_codex":[0.999598,0.00007903646,0.00002490128,0.00009035988,0.0001403282,0.0000674248],"domain_scores_gemma":[0.9992853,0.000250237,0.0001435648,0.00006514277,0.0001126974,0.0001431848],"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.0000985861,0.00003057193,0.0009479856,0.00005392309,0.00001741566,0.0002190675,0.0006021843,0.01528222,0.004762818,0.9633664,0.0005582165,0.01406063],"study_design_scores_gemma":[0.0000393227,0.00008333123,0.00160801,0.00006351045,0.00001872914,0.0002238973,0.0009522635,0.04909392,0.00400316,0.9242076,0.01967502,0.00003134245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8490444,0.0006573973,0.1207153,0.0005680484,0.00005244711,0.00007841876,0.0002604476,0.0001403792,0.02848327],"genre_scores_gemma":[0.9450559,0.0004687518,0.04907273,0.00005001769,0.00002024754,0.00005946776,0.0002172206,0.00003034022,0.005025255],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003499251,"threshold_uncertainty_score":0.01170611,"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."}}