{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00961137,0.000798503,0.0008682547,0.0001591774,0.0007154259,0.001058787,0.004644648,0.0003399243,0.000008304617],"category_scores_gemma":[0.0001429202,0.0008076713,0.0005338558,0.001330107,0.00004969833,0.0002679118,0.004112621,0.011462,0.00003736669],"about_ca_system_candidate":true,"about_ca_system_consensus":true,"about_ca_system_score_codex":0.005552902,"about_ca_system_score_gemma":0.005994763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008382571,"about_ca_topic_score_gemma":0.0002374718,"domain_scores_codex":[0.9891766,0.0006775887,0.001343198,0.001838852,0.001057389,0.00590637],"domain_scores_gemma":[0.9964276,0.0002275706,0.0007625235,0.001991492,0.0002290233,0.000361802],"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.00001263269,0.0001400279,0.0002584903,0.00005785815,0.0003130223,0.00001342549,0.0004705751,0.6785465,0.000001271243,0.05549861,0.001102183,0.2635853],"study_design_scores_gemma":[0.0006072965,0.000365846,0.0001687663,0.001449315,0.0001963254,0.0001868912,0.0006021045,0.9266782,0.000004236608,0.06522119,0.003156706,0.001363055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02403049,0.003655883,0.9643139,0.001125122,0.001805178,0.001621979,0.000004798228,0.0004622038,0.0029805],"genre_scores_gemma":[0.9349675,0.001259962,0.05875088,0.001214019,0.002338076,0.000324902,0.00003730176,0.00007608706,0.001031294],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.910937,"threshold_uncertainty_score":0.9999782,"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."}}