{"id":"W2404596072","doi":"","title":"Shortest Descending Paths through Given Faces.","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shortest path problem; K shortest path routing; Yen's algorithm; Path (computing); Face (sociological concept); Combinatorics; Constrained Shortest Path First; Mathematics; Sequence (biology); Euclidean shortest path; Terrain; Regular polygon; Shortest Path Faster Algorithm; Point (geometry); Algorithm; Computer science; Dijkstra's algorithm; Geometry; 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":[],"consensus_categories":[],"category_scores_codex":[0.00009087884,0.00007129861,0.000065061,0.0000475596,0.0001138305,0.0001383124,0.0002483272,0.00002555883,0.00004436877],"category_scores_gemma":[0.000008093378,0.00006473577,0.00003245948,0.0003435978,0.0000111344,0.0005484885,0.00007905113,0.00004154875,0.00009200419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002425659,"about_ca_system_score_gemma":0.00002982753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000700283,"about_ca_topic_score_gemma":0.0000221544,"domain_scores_codex":[0.9993185,0.00001838478,0.0001300411,0.000215005,0.0001747363,0.0001432926],"domain_scores_gemma":[0.9996951,0.0000453288,0.00003023438,0.0001571641,0.00004832976,0.00002384339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001358354,0.0001102545,0.002354092,0.00000529259,0.000008281229,0.00001603078,0.0002244025,0.03218175,0.005697067,0.8905785,0.02489333,0.04392966],"study_design_scores_gemma":[0.0006585382,0.0001322785,0.04376583,0.0000227339,0.00001029912,0.0000739024,0.00005247769,0.5714303,0.06037382,0.1514564,0.1712875,0.0007360014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01416586,0.00009429208,0.9536117,0.0007298724,0.0002615199,0.00006477975,7.649155e-7,0.000163166,0.03090806],"genre_scores_gemma":[0.8689913,0.000003224488,0.128896,0.000235833,0.0001391948,0.000004324327,0.0000104411,0.000002882744,0.001716907],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8548254,"threshold_uncertainty_score":0.2639848,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01777371571570184,"score_gpt":0.2417176833266489,"score_spread":0.2239439676109471,"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."}}