{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008186674,0.0002592545,0.0002958812,0.001268468,0.0002144434,0.000323754,0.002252258,0.0001002352,0.00017259],"category_scores_gemma":[0.00006136204,0.0002630469,0.0002345505,0.001210331,0.00008396937,0.002056841,0.0002280968,0.000317793,0.00007293133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002036405,"about_ca_system_score_gemma":0.0005056509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001535686,"about_ca_topic_score_gemma":0.000001753651,"domain_scores_codex":[0.9967146,0.0001139384,0.001030664,0.0004327989,0.001430575,0.0002774573],"domain_scores_gemma":[0.9957767,0.0002228515,0.000762625,0.0003322806,0.00258941,0.0003161871],"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.00002928138,0.0009361305,0.0005928818,0.000006784271,0.0002738692,0.0000580401,0.00054333,0.02695192,0.0002258463,0.09627012,0.0003156165,0.8737962],"study_design_scores_gemma":[0.00293548,0.001112952,0.07365651,0.0001248225,0.0001501716,0.003681374,0.0004115785,0.3154905,0.004873507,0.5117546,0.08427734,0.001531187],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00537218,0.0002930684,0.990787,0.00035085,0.0009484643,0.0002791975,0.00003873691,0.0001003556,0.001830149],"genre_scores_gemma":[0.5214405,0.00004130279,0.4770291,0.0003682293,0.000910929,0.00004825184,0.00008929828,0.0000169015,0.00005552116],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.872265,"threshold_uncertainty_score":0.9999822,"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."}}