{"id":"W1996923782","doi":"10.1016/j.jda.2010.12.002","title":"On the number of shortest descending paths on the surface of a convex terrain","year":2010,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Terrain; Regular polygon; Mathematics; Surface (topology); Combinatorics; Computer science; Geometry; Geography; 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.002504604,0.0008769217,0.001575258,0.002974334,0.001383713,0.002647193,0.002665055,0.00147428,0.007145369],"category_scores_gemma":[0.03387286,0.0006709331,0.0006367053,0.00300621,0.00210803,0.004360359,0.001974087,0.001921789,0.0003553276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001756532,"about_ca_system_score_gemma":0.001257187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003398447,"about_ca_topic_score_gemma":0.004991441,"domain_scores_codex":[0.9983975,0.000470257,0.0001393121,0.0003464592,0.0004410668,0.00020531],"domain_scores_gemma":[0.9547122,0.03865795,0.002216361,0.001267707,0.001514845,0.001631042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001949736,0.0002502594,0.02212998,0.0009826706,0.0002618662,0.0002549156,0.0005887236,0.7574972,0.006455165,0.1221247,0.008754803,0.07874995],"study_design_scores_gemma":[0.00008416553,0.0001761479,0.003866367,0.00006231906,0.00005649938,0.0002117302,0.0002652381,0.91588,0.001436471,0.07604933,0.001882335,0.00002940916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7624642,0.003221482,0.2128936,0.003004138,0.0002443431,0.0001502731,0.002603271,0.000442235,0.01497642],"genre_scores_gemma":[0.918318,0.001517834,0.07215799,0.0001651795,0.0001787098,0.0001348621,0.002259441,0.0002282479,0.005039761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007145369,"threshold_uncertainty_score":0.02390367,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01686813879995525,"score_gpt":0.2749265895926963,"score_spread":0.258058450792741,"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."}}