{"id":"W3118097934","doi":"10.1109/isncc49221.2020.9297217","title":"Internet-of-Things (IoT) Shortest Path Algorithms and Communication Case Studies for Maintaining Connectivity in Harsh Environements","year":2020,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Shortest path problem; Computer network; Network packet; Pathfinding; Distributed computing; Path (computing); Node (physics); Wireless; Dijkstra's algorithm; Graph; Theoretical computer science; Telecommunications","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.001427856,0.0008739508,0.0006513175,0.001134627,0.001847121,0.001519601,0.001309786,0.002297719,0.001739766],"category_scores_gemma":[0.004897064,0.0003343133,0.001300518,0.003364722,0.001523584,0.002947503,0.001089253,0.001166142,0.0002261386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001389313,"about_ca_system_score_gemma":0.0005743224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004055411,"about_ca_topic_score_gemma":0.004910997,"domain_scores_codex":[0.9987884,0.0005349979,0.00008053381,0.000133319,0.000294579,0.0001681994],"domain_scores_gemma":[0.996822,0.002435116,0.0001899709,0.0001797006,0.0002498834,0.0001233091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000135124,0.0002696123,0.002743221,0.0004346634,0.00007721856,0.001643973,0.0006294757,0.787213,0.001671271,0.1559179,0.004986471,0.04427813],"study_design_scores_gemma":[0.00004622742,0.0002386298,0.001076637,0.00006681962,0.00005567218,0.0009109807,0.0009487481,0.9091656,0.001957761,0.07117171,0.01430776,0.00005349991],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2872417,0.006987185,0.6553233,0.002205369,0.0002474354,0.0004693721,0.0004539044,0.0002538257,0.04681784],"genre_scores_gemma":[0.7590536,0.005452808,0.2263349,0.0001205446,0.0001224365,0.0002581795,0.0004069041,0.00005939753,0.00819121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004055411,"threshold_uncertainty_score":0.01008022,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08402513057490472,"score_gpt":0.2976847494655531,"score_spread":0.2136596188906483,"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."}}