{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000402047,0.0001068533,0.0002337449,0.00003310474,0.00007067546,0.0000444462,0.000251833,0.00004154805,0.000004139107],"category_scores_gemma":[0.00003668021,0.0000985205,0.0000273534,0.00009969107,0.00008543456,0.0002467231,0.0004586891,0.000111377,7.628723e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002483516,"about_ca_system_score_gemma":0.00001980285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001132759,"about_ca_topic_score_gemma":0.00002336803,"domain_scores_codex":[0.9991348,0.000064083,0.000280329,0.0002716889,0.00009116283,0.0001578736],"domain_scores_gemma":[0.9990635,0.0004839654,0.0001040808,0.0002279094,0.00004333246,0.00007721022],"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.00007004243,0.0002380757,0.01626221,0.00009270554,0.0001747682,0.0006976549,0.03903718,0.0001681716,0.00009523071,0.05110857,0.001519724,0.8905357],"study_design_scores_gemma":[0.0004910449,0.0001731543,0.0001612619,0.00004293204,0.000009478476,0.00006449746,0.001206988,0.9957924,0.00004838428,0.001756915,0.0001391862,0.0001137149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1007646,0.0003165505,0.8976124,0.0007147822,0.00004590473,0.0002422702,0.000002026137,0.00003740541,0.0002641152],"genre_scores_gemma":[0.8958377,0.00007151806,0.1033069,0.0007169772,0.00001171975,0.00002053566,0.000003626798,0.000005216242,0.0000258459],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9956242,"threshold_uncertainty_score":0.4017549,"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."}}