{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001175841,0.000808416,0.001135156,0.0009821436,0.0007042717,0.0008784311,0.002269958,0.0009445677,0.001797203],"category_scores_gemma":[0.003805937,0.0004775943,0.0005701116,0.0009481098,0.0008110126,0.001891588,0.00170962,0.001318564,0.0004076017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291394,"about_ca_system_score_gemma":0.00210952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004587856,"about_ca_topic_score_gemma":0.003912097,"domain_scores_codex":[0.9990933,0.0001868778,0.00005660563,0.0002763938,0.0002726293,0.0001142304],"domain_scores_gemma":[0.9988179,0.0005767473,0.0001568567,0.0001475511,0.0002151282,0.00008584126],"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.0001328497,0.00009852454,0.0006958987,0.00008717652,0.0000532165,0.00005499481,0.0001152605,0.794358,0.003809423,0.02330015,0.002137264,0.1751574],"study_design_scores_gemma":[0.00001763732,0.00002816792,0.00005128373,0.000003748405,0.000004383145,0.00001852071,0.000009737683,0.9926795,0.0005538233,0.005921784,0.0007052949,0.00000616018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006662624,0.00006855663,0.992167,0.00007104139,0.00002249801,0.00004743478,0.00002955797,0.0003811537,0.0005501304],"genre_scores_gemma":[0.2933502,0.0001589318,0.7033004,0.0001420551,0.00005022868,0.0003381991,0.0003167761,0.0001412543,0.00220198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004587856,"threshold_uncertainty_score":0.009369791,"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."}}