{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003857109,0.000445281,0.0004405061,0.0004531453,0.0002768866,0.0004329858,0.001153074,0.0001933742,0.0001534368],"category_scores_gemma":[0.00002963982,0.000378734,0.0001542614,0.0008690794,0.0001262,0.001566306,0.000667551,0.0004798635,0.001064063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001592969,"about_ca_system_score_gemma":0.0000678357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00172307,"about_ca_topic_score_gemma":0.00008720208,"domain_scores_codex":[0.996923,0.0002231898,0.0004771025,0.001101927,0.000475194,0.0007995536],"domain_scores_gemma":[0.9978022,0.0002321976,0.0001631751,0.001406675,0.00008850281,0.0003072566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002476123,0.004760347,0.003463912,0.0002913403,0.0005396834,0.02727442,0.006470518,0.008308977,0.08255586,0.03882865,0.02389927,0.8033594],"study_design_scores_gemma":[0.001296098,0.0004008414,0.004205192,0.0001123478,0.00001068028,0.001130639,0.00007700974,0.9847097,0.0008640258,0.005675933,0.0006729524,0.0008445231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4568598,0.0006146805,0.5140634,0.01002019,0.002685655,0.003322613,0.0002774204,0.001511082,0.0106451],"genre_scores_gemma":[0.952934,0.00007614667,0.04477235,0.0006385566,0.0001214491,0.0002599972,0.00007318627,0.0000633327,0.001060937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9764008,"threshold_uncertainty_score":0.9998665,"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."}}