{"id":"W1510343741","doi":"10.1007/978-3-540-39923-0_12","title":"“Simplest” Paths: Automated Route Selection for Navigation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","field":"Engineering","cited_by":215,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Shortest path problem; Dijkstra's algorithm; K shortest path routing; Path (computing); Computation; Path length; Algorithm; The Internet; Graph; Theoretical computer science; Computer network; World Wide Web","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000279886,0.001018265,0.0007463116,0.0007381017,0.0005157642,0.001229241,0.002434688,0.0007943984,0.00795084],"category_scores_gemma":[0.001437931,0.0005468383,0.0005065493,0.0009626779,0.0005116303,0.002160327,0.001094044,0.0007610698,0.002643459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003261514,"about_ca_system_score_gemma":0.0008387775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005010603,"about_ca_topic_score_gemma":0.008898469,"domain_scores_codex":[0.9996955,0.0000441097,0.00001502781,0.0001139245,0.00009983776,0.00003159167],"domain_scores_gemma":[0.9995912,0.0001545244,0.00002738957,0.0001103787,0.00009436333,0.00002219707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003583637,0.00005253205,0.001090668,0.0003172912,0.00006760608,0.0001343614,0.0002856386,0.04834701,0.0158149,0.02729607,0.02596032,0.8802752],"study_design_scores_gemma":[0.00009030878,0.0001030822,0.001528608,0.00006627414,0.00008750147,0.0004552248,0.0001771276,0.8395337,0.02096605,0.1018241,0.03511317,0.00005470655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0174093,0.0006031115,0.9670648,0.0001408813,0.00008275751,0.00003443998,0.000547654,0.007960336,0.006156665],"genre_scores_gemma":[0.1664045,0.0005259561,0.8266277,0.00004802695,0.00004811341,0.0000562233,0.001108044,0.0007209923,0.004460519],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00795084,"threshold_uncertainty_score":0.02659822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01429994429066915,"score_gpt":0.2459593359121606,"score_spread":0.2316593916214915,"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."}}