{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008794311,0.0008388454,0.001223065,0.001762374,0.0008581423,0.001577825,0.001671031,0.00102435,0.002147707],"category_scores_gemma":[0.005022427,0.0005832815,0.0008223073,0.001893383,0.0007987646,0.002296443,0.001192488,0.0009983439,0.0002200213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009908048,"about_ca_system_score_gemma":0.0009775851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00875447,"about_ca_topic_score_gemma":0.006642475,"domain_scores_codex":[0.9994627,0.0001846748,0.00002288402,0.0001070646,0.0001571131,0.00006560901],"domain_scores_gemma":[0.9987066,0.0008443064,0.0001317633,0.00007685529,0.0001797526,0.00006064142],"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.00005229655,0.00003106124,0.0006048799,0.00007060387,0.00004700842,0.00006542394,0.0001097894,0.9221058,0.001076566,0.03888661,0.001104593,0.03584538],"study_design_scores_gemma":[0.000002993483,0.00001023043,0.00008169287,0.000004711971,0.000008077242,0.00001343751,0.0000189967,0.985518,0.0001254641,0.01388028,0.0003321523,0.000003935479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01900315,0.0003633954,0.9775499,0.0002389985,0.00004802854,0.00003679092,0.00007555518,0.0001309638,0.002553245],"genre_scores_gemma":[0.7089903,0.000874337,0.2862205,0.00007256455,0.0001501246,0.00009988994,0.0001956203,0.0001324616,0.003264211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00875447,"threshold_uncertainty_score":0.017407,"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."}}