{"id":"W2999668563","doi":"10.3390/data5010008","title":"A Python Algorithm for Shortest-Path River Network Distance Calculations Considering River Flow Direction","year":2020,"lang":"en","type":"article","venue":"Data","topic":"Wildlife-Road Interactions and Conservation","field":"Environmental Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Japan Society for the Promotion of Science","keywords":"Dijkstra's algorithm; Shortest path problem; Computer science; Yen's algorithm; Python (programming language); Algorithm; A* search algorithm; Shortest Path Faster Algorithm; Distance; K shortest path routing; Node (physics); Topology (electrical circuits); Mathematics; Graph; Theoretical computer science; Combinatorics; Physics","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.00009835025,0.00009481276,0.00009254527,0.00000810425,0.0002303877,0.00004314425,0.0002043083,0.0000355154,0.0003815832],"category_scores_gemma":[0.00008068571,0.00009676646,0.00003128765,0.0001940852,0.00008112068,0.000657725,0.0002162477,0.00007742795,0.0001435646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006098374,"about_ca_system_score_gemma":0.000009744249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003426675,"about_ca_topic_score_gemma":0.0002068654,"domain_scores_codex":[0.9991428,0.00002421876,0.0001657163,0.0003712451,0.0001284462,0.0001675646],"domain_scores_gemma":[0.9993981,0.00007295505,0.00006046253,0.000379781,0.0000118228,0.00007684708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003593341,0.00009022946,0.05435158,0.000008921717,0.00005468398,0.000008633219,0.0008991009,0.03654834,0.0004974217,0.0001458582,0.5861752,0.3211841],"study_design_scores_gemma":[0.0001097164,0.00001638319,0.02044419,0.0000089382,0.00001958469,0.000002393685,0.00002193349,0.6563559,0.00001227506,0.0001069746,0.3228099,0.00009176612],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0151416,0.00005529265,0.9802516,0.001679761,0.0004058302,0.0004262117,0.001140032,0.0001248688,0.0007748423],"genre_scores_gemma":[0.4117506,0.0000911838,0.5759222,0.004534319,0.001243118,0.0001574401,0.005585062,0.00006495867,0.0006511619],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6198076,"threshold_uncertainty_score":0.4178068,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04496736249250134,"score_gpt":0.2628186246520804,"score_spread":0.2178512621595791,"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."}}