{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119275,0.001747025,0.001171557,0.001814377,0.001427543,0.001938908,0.003529764,0.0009212226,0.04444364],"category_scores_gemma":[0.004991099,0.001340006,0.001567717,0.00237696,0.0008638094,0.002639265,0.003644413,0.002624355,0.02315254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001149397,"about_ca_system_score_gemma":0.003943736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007468154,"about_ca_topic_score_gemma":0.009227365,"domain_scores_codex":[0.9986701,0.00013259,0.000146007,0.0003015944,0.0005923582,0.0001574341],"domain_scores_gemma":[0.9986522,0.0004406854,0.0001193945,0.0002326422,0.0004613168,0.00009382693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003742471,0.0003132315,0.003584451,0.001188855,0.0003171118,0.0005976033,0.0007521511,0.07610556,0.01223537,0.04523764,0.2986001,0.5606937],"study_design_scores_gemma":[0.0002454375,0.000088676,0.002074438,0.0001672583,0.00007226226,0.0007711417,0.0001565837,0.6424493,0.02043131,0.07802837,0.2553014,0.0002138377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001774153,0.00007983285,0.8723421,0.0001281999,0.000081468,0.0002143816,0.003820765,0.1155184,0.006040724],"genre_scores_gemma":[0.03044933,0.000196817,0.9286194,0.0002335677,0.0000445287,0.0011058,0.009824697,0.01839747,0.01112832],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04444364,"threshold_uncertainty_score":0.1486788,"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."}}