{"id":"W2395489635","doi":"10.5555/2627817.2627898","title":"Dynamic graph connectivity in polylogarithmic worst case time","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Time complexity; Binary logarithm; Amortized analysis; Computer science; Graph; Enhanced Data Rates for GSM Evolution; Preprocessor; Upper and lower bounds; Data structure; Matching (statistics); Discrete mathematics; Path (computing); Sequence (biology); Mathematics; Algorithm","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004080792,0.002595172,0.002303372,0.002347942,0.002249417,0.007816906,0.005159807,0.003523184,0.01337869],"category_scores_gemma":[0.03013197,0.001692713,0.002158162,0.006499964,0.003049057,0.01665812,0.00383205,0.004548382,0.00316349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006602376,"about_ca_system_score_gemma":0.006585269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006565151,"about_ca_topic_score_gemma":0.01251666,"domain_scores_codex":[0.9867727,0.002207658,0.0008988484,0.003066849,0.004694249,0.002359725],"domain_scores_gemma":[0.9613441,0.02590123,0.002592353,0.00735708,0.001795588,0.00100964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004730037,0.00111542,0.008050062,0.001990333,0.0005228723,0.0009491391,0.00114897,0.4652947,0.03721242,0.0889868,0.0668744,0.3231249],"study_design_scores_gemma":[0.0007033346,0.0002883788,0.001412825,0.0001267993,0.0002802556,0.001072372,0.0004795809,0.7546094,0.01428249,0.2114932,0.01516393,0.00008742775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2107775,0.00545556,0.6868343,0.02028388,0.0008978042,0.001075591,0.008608968,0.02410525,0.04196108],"genre_scores_gemma":[0.6214911,0.001486889,0.3544714,0.002025123,0.000608467,0.001013113,0.006820535,0.002304437,0.00977897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01337869,"threshold_uncertainty_score":0.04790384,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006188313789722419,"score_gpt":0.2324596412625818,"score_spread":0.2262713274728593,"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."}}