{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001859647,0.00008558082,0.0001174798,0.00005723288,0.00002108408,0.00002813212,0.00007690095,0.00007317089,0.00009266758],"category_scores_gemma":[0.000004272762,0.00008090364,0.0000210068,0.0002151094,0.000003182553,0.00007509631,0.00001240272,0.0001033011,0.00004226052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003968823,"about_ca_system_score_gemma":0.000002750226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002508249,"about_ca_topic_score_gemma":0.00005459259,"domain_scores_codex":[0.9993982,0.00001053444,0.0001522343,0.00008397146,0.00006107181,0.0002940317],"domain_scores_gemma":[0.9998068,0.00002438064,0.000007094553,0.0001204295,0.000006259034,0.0000350126],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008540859,0.0001202652,0.6520227,0.0001625427,0.00006170455,0.0006258435,0.000528414,0.1491317,0.004349867,0.03276767,0.1387487,0.02147211],"study_design_scores_gemma":[0.0005234788,0.00006906429,0.02565716,0.000339545,0.00001174677,0.0000849874,0.0002590558,0.8558581,0.001018618,0.0009308247,0.114403,0.0008443419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1729923,0.002737354,0.4799739,0.00002338166,0.0008957432,0.0005596186,0.000005451044,0.003687128,0.3391252],"genre_scores_gemma":[0.9985185,0.000174054,0.000583311,0.00002298866,0.0001543163,0.00002776092,0.000003978884,0.00002089925,0.0004941583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8255263,"threshold_uncertainty_score":0.3299155,"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."}}