{"id":"W2079124625","doi":"10.1016/j.comgeo.2007.10.011","title":"Shortest descending paths through given faces","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shortest path problem; Path (computing); Yen's algorithm; K shortest path routing; Face (sociological concept); Terrain; Combinatorics; Sequence (biology); Regular polygon; Point (geometry); Mathematics; Constrained Shortest Path First; Algorithm; Computer science; Euclidean shortest path; Dijkstra's algorithm; Geography; Geometry; Cartography","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.0002562108,0.0005280773,0.0005340292,0.001173092,0.001016743,0.001328812,0.001129649,0.0007051686,0.01482842],"category_scores_gemma":[0.002856988,0.0003794685,0.0004021746,0.00105931,0.0004328048,0.001261657,0.001321992,0.00113577,0.001795351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008325399,"about_ca_system_score_gemma":0.0009721057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003125559,"about_ca_topic_score_gemma":0.007232722,"domain_scores_codex":[0.9997407,0.00002743365,0.00001693239,0.00006302904,0.00009642766,0.00005553324],"domain_scores_gemma":[0.9992628,0.0002522801,0.00006339583,0.00008923354,0.0002476864,0.00008471901],"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.0008504983,0.000399533,0.005432469,0.001106547,0.00008400779,0.0004632779,0.001549742,0.1542003,0.03269435,0.2860218,0.02830278,0.4888948],"study_design_scores_gemma":[0.0001558113,0.0004309827,0.003670265,0.000422371,0.00008708946,0.000630529,0.002271704,0.5137971,0.04095543,0.3276769,0.1098435,0.00005824571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3085942,0.0004977491,0.6289422,0.0006261871,0.0001462331,0.0005949462,0.004091586,0.001335187,0.0551718],"genre_scores_gemma":[0.4349713,0.0007375968,0.5197738,0.000086754,0.0000261488,0.0004221101,0.005783741,0.0005766477,0.03762189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01482842,"threshold_uncertainty_score":0.04960597,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04140129129438375,"score_gpt":0.2666796259368927,"score_spread":0.225278334642509,"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."}}