{"id":"W1988714784","doi":"10.1145/512161.512197","title":"Finding shortest paths in large network systems","year":2001,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dijkstra's algorithm; Suurballe's algorithm; Shortest path problem; Pathfinding; Computer science; Yen's algorithm; Floyd–Warshall algorithm; Shortest Path Faster Algorithm; K shortest path routing; Graph; A* search algorithm; Algorithm; Scalability; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0007855993,0.0009505783,0.000838199,0.001963614,0.00163633,0.001434942,0.001360107,0.0009589781,0.004004452],"category_scores_gemma":[0.00553014,0.0007100537,0.000405068,0.002828086,0.0008891642,0.00400571,0.001825646,0.0006888569,0.0007415377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001256792,"about_ca_system_score_gemma":0.001059442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007033745,"about_ca_topic_score_gemma":0.008698473,"domain_scores_codex":[0.9990335,0.0002382994,0.00007115081,0.0002715395,0.0002623086,0.0001232373],"domain_scores_gemma":[0.9975782,0.001624386,0.0002144805,0.0002464806,0.0002553086,0.00008108812],"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.0002136572,0.00007399622,0.001489553,0.000428749,0.00008106119,0.0003004565,0.0004435549,0.7818586,0.00584161,0.03783282,0.005024844,0.1664111],"study_design_scores_gemma":[0.00006702201,0.00005683431,0.0004370094,0.00002398522,0.00002688121,0.0001683459,0.0002357137,0.9095708,0.004284215,0.07597537,0.009129077,0.00002467295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04846897,0.0008022776,0.9453038,0.0002623233,0.00003750073,0.0001366586,0.0002793018,0.001811156,0.002897966],"genre_scores_gemma":[0.3199137,0.0007796494,0.6734052,0.00006221384,0.00003979594,0.0002539648,0.001107287,0.0003129894,0.004125199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007033745,"threshold_uncertainty_score":0.01398557,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01381417334087049,"score_gpt":0.218172339680091,"score_spread":0.2043581663392205,"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."}}