{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00463125,0.0009080293,0.000898289,0.004174764,0.0007221217,0.00137434,0.0009527263,0.0009435077,0.003166148],"category_scores_gemma":[0.01842631,0.0002311785,0.0005764398,0.005651282,0.0005664147,0.003540064,0.0006375803,0.0006260877,0.0004546898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00197078,"about_ca_system_score_gemma":0.00101603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002407467,"about_ca_topic_score_gemma":0.002135646,"domain_scores_codex":[0.995563,0.001605591,0.0002112375,0.0002519071,0.002141139,0.0002271571],"domain_scores_gemma":[0.9860167,0.01054791,0.0003265165,0.0005147344,0.002442963,0.0001511267],"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.000641391,0.0002469198,0.004627184,0.0007683784,0.0002398342,0.0001257429,0.0001487887,0.5423665,0.001580687,0.08277316,0.006869595,0.3596118],"study_design_scores_gemma":[0.00004254889,0.0003379837,0.003752791,0.0001025957,0.000103918,0.0002996298,0.0001967458,0.942997,0.002773379,0.03516876,0.01418788,0.00003684899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.311828,0.08140003,0.5154032,0.002355062,0.0008614467,0.0003016741,0.0008227495,0.001803151,0.08522463],"genre_scores_gemma":[0.826551,0.02131742,0.1450156,0.0001250988,0.0003214708,0.0001376528,0.001384453,0.0003424703,0.004804885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00463125,"threshold_uncertainty_score":0.02449268,"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."}}