{"id":"W4406778339","doi":"10.1016/j.cor.2026.107528","title":"Navigating Network Availability: A Shortest Path Approach to Uav Traffic Routing","year":2025,"lang":"en","type":"preprint","venue":"Computers & Operations Research","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Equal-cost multi-path routing; Computer science; Routing (electronic design automation); Private Network-to-Network Interface; Path (computing); Constrained Shortest Path First; Computer network; Static routing; K shortest path routing; Real-time computing; Routing protocol; Theoretical computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.006914924,0.0006394726,0.0007506987,0.0004076879,0.001748065,0.003723829,0.006207541,0.0003339883,0.00001754494],"category_scores_gemma":[0.0002888485,0.0006871758,0.0002794481,0.003732532,0.0001783094,0.0003530852,0.01671303,0.003755556,0.0001461813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001384867,"about_ca_system_score_gemma":0.00144567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003587729,"about_ca_topic_score_gemma":0.0001477858,"domain_scores_codex":[0.9902763,0.00195226,0.001186138,0.002963843,0.001821939,0.001799548],"domain_scores_gemma":[0.9933664,0.0008618092,0.00009391095,0.004154119,0.001007548,0.0005162586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004563638,0.0002179261,0.00006791089,0.0001214828,0.00008445647,0.00002008632,0.001636808,0.8428642,0.000002953755,0.009436022,0.0229829,0.1225607],"study_design_scores_gemma":[0.0002120844,0.0001085711,0.0001532043,0.001076513,0.00001673179,0.000003991485,0.0001174576,0.9934043,0.000009534037,0.0002044955,0.00412869,0.000564385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01264102,0.0004222269,0.9737774,0.002490787,0.001727954,0.004900482,0.00002153168,0.0006452305,0.003373331],"genre_scores_gemma":[0.430919,0.00006208695,0.563323,0.001087598,0.001206458,0.002321812,0.0002572395,0.00005251692,0.0007703316],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.418278,"threshold_uncertainty_score":0.9995579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07721717280929229,"score_gpt":0.3675326028935209,"score_spread":0.2903154300842286,"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."}}