{"id":"W2117878581","doi":"10.1142/s0218195911003755","title":"SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Shortest path problem; Path (computing); Terrain; Euclidean shortest path; Algorithm; Sequence (biology); Combinatorics; Time complexity; Approximation algorithm; Point (geometry); Yen's algorithm; K shortest path routing; Computer science; Dijkstra's algorithm; Geometry; Graph; Geography","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.001134791,0.001914285,0.001744274,0.001361047,0.001365964,0.002411044,0.003595473,0.002117715,0.01490678],"category_scores_gemma":[0.0056709,0.001221776,0.001414849,0.003339928,0.001010993,0.005700599,0.003507839,0.003342075,0.00552543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001695651,"about_ca_system_score_gemma":0.002649122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00555042,"about_ca_topic_score_gemma":0.007862715,"domain_scores_codex":[0.9985065,0.0002375664,0.0001463347,0.000402052,0.0004575979,0.0002499755],"domain_scores_gemma":[0.9973664,0.001248406,0.0001115698,0.0007645686,0.0003938724,0.0001152694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003755204,0.0003449595,0.0009880256,0.0007434062,0.00009586556,0.000208541,0.0003543069,0.2069681,0.004085648,0.1204313,0.04762376,0.6177806],"study_design_scores_gemma":[0.0001947467,0.00009829523,0.000189312,0.0001032113,0.00004400628,0.0001788061,0.0001974752,0.6274688,0.002082701,0.3435877,0.02581548,0.00003950691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006228086,0.0007816338,0.9799329,0.0005634347,0.0001036627,0.0001815306,0.0006404984,0.0042149,0.007353376],"genre_scores_gemma":[0.04855147,0.0005356428,0.9430778,0.0001903798,0.00006627487,0.0002347169,0.001599554,0.0006946796,0.005049508],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01490678,"threshold_uncertainty_score":0.04986817,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03376333864733476,"score_gpt":0.3009306287747315,"score_spread":0.2671672901273968,"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."}}