{"id":"W2108063157","doi":"10.1109/tc.2006.83","title":"An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Government of Ontario","keywords":"Shortest path problem; Shortest Path Faster Algorithm; Algorithm; Floyd–Warshall algorithm; K shortest path routing; Computer science; Graph; Mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001867555,0.0002463388,0.0002815748,0.000250193,0.0001641339,0.00007572138,0.0002251294,0.00005296183,0.00003037514],"category_scores_gemma":[1.267375e-7,0.0002728553,0.0002186912,0.0003310867,0.00004561519,0.00006825804,0.000001973041,0.000252146,0.000003662636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001349414,"about_ca_system_score_gemma":0.00002598657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000342485,"about_ca_topic_score_gemma":0.0001597199,"domain_scores_codex":[0.9985821,0.0000495926,0.0003596409,0.0004320115,0.0001414512,0.0004351493],"domain_scores_gemma":[0.9992797,0.0002002734,0.00008007109,0.0003149384,0.00004287517,0.00008212573],"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.000008980839,0.0003661017,0.00002377193,5.445809e-7,0.00004270261,0.000001528517,0.0000412185,0.8510122,0.00001833785,0.0002185201,0.00006154006,0.1482046],"study_design_scores_gemma":[0.0004587886,0.0001477512,0.0001734931,0.00004432102,0.00006140521,0.00000112397,0.00006818308,0.9981437,0.0000533143,0.0005480319,0.00003118649,0.0002686945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0161212,0.000009122922,0.9828012,0.00003269263,0.000305518,0.0004650701,0.0000370113,0.0001816606,0.00004654649],"genre_scores_gemma":[0.9539057,4.641673e-7,0.0456038,0.00004428788,0.000161442,0.0001551797,0.00007955712,0.00003770354,0.00001184573],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9377845,"threshold_uncertainty_score":0.9999723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007588173983234923,"score_gpt":0.2548482205699203,"score_spread":0.2472600465866854,"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."}}