{"id":"W4410229922","doi":"10.2139/ssrn.5248448","title":"Navigating Network Availability: A Shortest Path Approach to Uav Traffic Routing","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shortest path problem; Private Network-to-Network Interface; Constrained Shortest Path First; Equal-cost multi-path routing; Computer science; Routing (electronic design automation); Path (computing); Computer network; K shortest path routing; Link-state routing protocol; Real-time computing; Routing protocol; Theoretical computer science; Graph","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.0007914037,0.0008018849,0.001155142,0.001524655,0.0008149096,0.001490517,0.001576583,0.001047535,0.002103942],"category_scores_gemma":[0.004557927,0.0005218855,0.0007489092,0.001656458,0.0007356352,0.00212363,0.001266596,0.0009449787,0.0002241831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000897675,"about_ca_system_score_gemma":0.0009181205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006950842,"about_ca_topic_score_gemma":0.005427646,"domain_scores_codex":[0.9994947,0.0001661091,0.00002178969,0.0001060421,0.000149016,0.00006232729],"domain_scores_gemma":[0.9988151,0.0007506945,0.0001297701,0.00007644753,0.0001702839,0.00005776178],"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.0000566338,0.00003071348,0.0006684204,0.0000778674,0.00004862474,0.00007764759,0.000122949,0.9165945,0.001365179,0.03870203,0.001199869,0.04105559],"study_design_scores_gemma":[0.000002742598,0.00001128603,0.00008480041,0.00000463425,0.000007813994,0.00001561843,0.00002146455,0.9859525,0.0001463931,0.01338815,0.0003607103,0.000003991111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01798121,0.000301495,0.9785864,0.000210939,0.00004825255,0.00003673694,0.00007324031,0.0001440782,0.002617549],"genre_scores_gemma":[0.7367379,0.0007134455,0.2588891,0.00006848799,0.0001396265,0.00009882098,0.0001826284,0.000123411,0.003046478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006950842,"threshold_uncertainty_score":0.01382077,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01316667474324372,"score_gpt":0.2531728130857787,"score_spread":0.240006138342535,"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."}}