{"id":"W1554407673","doi":"10.1109/sffcs.1999.814580","title":"Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":228,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Transitive closure; Amortized analysis; Combinatorics; Binary logarithm; Integer (computer science); Algorithm; Mathematics; Shortest path problem; Closure (psychology); Discrete mathematics; Data structure; Time complexity; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006629151,0.0002347253,0.0002723416,0.0002523496,0.0001525292,0.0001549405,0.0003979654,0.00009757341,0.00001314982],"category_scores_gemma":[0.00004751659,0.0002251132,0.0001231852,0.0005525256,0.0001183125,0.0004046407,0.00006348892,0.0002039654,0.000001888927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003741567,"about_ca_system_score_gemma":0.00007116394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000042197,"about_ca_topic_score_gemma":0.0004331252,"domain_scores_codex":[0.9982388,0.00009592699,0.0003124361,0.0006233291,0.0002039726,0.0005255493],"domain_scores_gemma":[0.9991014,0.0003172081,0.00004953484,0.00033204,0.00006582355,0.0001339737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002209592,0.0002730351,0.004668377,0.00003058894,0.00008971506,0.0001128486,0.004980342,0.0002572278,0.000277383,0.8594585,0.000127568,0.1297023],"study_design_scores_gemma":[0.002541634,0.0007393328,0.01795827,0.000091392,0.00002785396,0.0001684924,0.002239022,0.7124237,0.0004958863,0.2583556,0.003959706,0.0009991144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02877818,0.0002795683,0.9669082,0.0007433578,0.0002399657,0.0005015156,0.00001886579,0.0001654678,0.002364852],"genre_scores_gemma":[0.8058921,0.00004934439,0.1934645,0.0004258634,0.00001324132,0.00005788565,0.000007145117,0.00001334385,0.00007654362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7771139,"threshold_uncertainty_score":0.9179848,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02292567693488149,"score_gpt":0.2702413490047282,"score_spread":0.2473156720698468,"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."}}