{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001231312,0.0001017055,0.0001817333,0.00005948282,0.00009898957,0.00005705459,0.0006084563,0.00004127259,0.00006774898],"category_scores_gemma":[0.0002469986,0.00005245344,0.0001377013,0.0003159139,0.00007847511,0.0001837161,0.00006757936,0.0003589098,0.000006068832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001370935,"about_ca_system_score_gemma":0.00009192622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007680881,"about_ca_topic_score_gemma":0.00000238293,"domain_scores_codex":[0.9986814,0.0001247289,0.0004099804,0.0001107202,0.0005490651,0.0001240624],"domain_scores_gemma":[0.9980503,0.000909214,0.0004801054,0.0002791407,0.0002280907,0.0000531334],"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.0001521769,0.0007118726,0.00374893,0.00003829366,0.0003909637,0.00005258275,0.006117199,0.02316065,0.1493473,0.7413687,0.00767807,0.06723332],"study_design_scores_gemma":[0.001770326,0.001884933,0.03438043,0.000553711,0.00009828135,0.0005810286,0.001003417,0.6475821,0.2242268,0.08467245,0.002613274,0.0006332484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8799485,0.00002827313,0.11346,0.004598745,0.0007772321,0.0001139348,0.000008428424,0.000006008027,0.001058844],"genre_scores_gemma":[0.9868428,0.000008450622,0.01270345,0.0002225532,0.0001500753,8.900472e-7,7.772487e-7,0.0000055048,0.0000654687],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6566962,"threshold_uncertainty_score":0.2138989,"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."}}