{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002636354,0.0002684297,0.0002204517,0.0003168681,0.0001303383,0.0001236705,0.0001981159,0.0002691363,0.00002021752],"category_scores_gemma":[0.00003957385,0.0002850799,0.00006717614,0.0003127083,0.00008911073,0.0002038158,0.00002306102,0.0003005599,0.00001770394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003348548,"about_ca_system_score_gemma":0.00007884217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009244261,"about_ca_topic_score_gemma":0.00005254578,"domain_scores_codex":[0.9987157,0.00001001795,0.0002993164,0.0004162989,0.0002778633,0.0002807908],"domain_scores_gemma":[0.9993491,0.0001223528,0.00008328001,0.0001743395,0.000205819,0.00006513801],"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.00001072002,0.00001307506,0.00006465748,0.0001799345,0.00002001617,0.000004600475,0.0003020179,0.4173594,0.002532486,0.00142658,0.0002779595,0.5778085],"study_design_scores_gemma":[0.0002480007,0.00007302312,0.00005726402,0.0002512853,0.00001265577,0.00002026874,8.731015e-8,0.9666727,0.008153471,0.02187782,0.002284785,0.0003486767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007988032,0.00009001607,0.9954337,0.00005318052,0.001301963,0.0004946856,0.00002166543,0.0007846914,0.001021327],"genre_scores_gemma":[0.8512054,0.00004936233,0.1461343,0.0009553198,0.0008319971,0.00008159851,0.0004308197,0.0001426297,0.00016851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8504066,"threshold_uncertainty_score":0.9999601,"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."}}