{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001664616,0.0004349913,0.0002955392,0.0006370249,0.0006255142,0.0005685152,0.0006513365,0.0004589439,0.007996568],"category_scores_gemma":[0.002561452,0.0002993545,0.0003309339,0.0007186898,0.0003439832,0.001007081,0.0009605396,0.000549771,0.001216735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004542769,"about_ca_system_score_gemma":0.0005160877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001978119,"about_ca_topic_score_gemma":0.004259976,"domain_scores_codex":[0.9997932,0.00001950458,0.00001446602,0.00005753321,0.00006754352,0.00004776107],"domain_scores_gemma":[0.9995617,0.0001507751,0.0000605539,0.00009351922,0.00009153153,0.00004190867],"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.0007088666,0.0001777395,0.007184607,0.001072842,0.00008118074,0.0007308121,0.001156247,0.1542261,0.0500197,0.2013633,0.03193538,0.5513433],"study_design_scores_gemma":[0.0001660075,0.0004672392,0.005392456,0.0003503696,0.00007231333,0.00153754,0.001224075,0.4978031,0.05307069,0.2919454,0.1478932,0.00007759805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2245617,0.001045744,0.7370328,0.000386583,0.0001475288,0.0005250193,0.0047461,0.002430228,0.02912425],"genre_scores_gemma":[0.423738,0.0006715215,0.5554687,0.00007699432,0.0000245028,0.0003141527,0.006504627,0.0003073457,0.01289403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007996568,"threshold_uncertainty_score":0.02675116,"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."}}