{"id":"W4412398761","doi":"10.1109/icccs65393.2025.11069970","title":"Comparative Analysis of Shortest-Path Algorithms in Network Routing","year":2025,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Computer science; Shortest path problem; K shortest path routing; Routing (electronic design automation); Path (computing); Equal-cost multi-path routing; Routing algorithm; Link-state routing protocol; Algorithm; Routing protocol; Computer network; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003782537,0.00005511245,0.0002347026,0.0003001611,0.00003622226,0.00004523082,0.0003385778,0.00002365396,0.00003279303],"category_scores_gemma":[0.0000150099,0.0000480059,0.00005258519,0.004382324,0.00002148491,0.0001406337,0.0001506271,0.00006802708,0.000002315696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002041004,"about_ca_system_score_gemma":0.00005737333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001038797,"about_ca_topic_score_gemma":0.0001890314,"domain_scores_codex":[0.9992098,0.00007724143,0.000242051,0.0001856149,0.0001240126,0.0001613087],"domain_scores_gemma":[0.9994932,0.0001297654,0.00004247516,0.0002199609,0.00008743746,0.00002712515],"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.000001104847,0.00004439299,0.03187254,0.000001525023,0.0001316325,0.00000104689,0.0007324471,0.7885014,0.000008997121,0.1752467,0.0004199092,0.003038279],"study_design_scores_gemma":[0.00009464178,0.00001139215,0.02543692,0.0000117883,0.00001521154,4.296125e-8,0.00006497707,0.9734655,0.00005299018,0.0007152631,0.00008701783,0.00004425251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001503638,0.00003529693,0.9541558,0.0002422586,0.00004653079,0.00009009983,5.007357e-7,0.00003695269,0.0438889],"genre_scores_gemma":[0.8394722,0.000007288556,0.1596164,0.0002049523,0.000004487961,0.000004722985,0.00000333702,7.288891e-7,0.0006859288],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8379686,"threshold_uncertainty_score":0.2105562,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03011207326568078,"score_gpt":0.3251645753135578,"score_spread":0.295052502047877,"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."}}