{"id":"W3020969699","doi":"10.1137/1.9781611976465.132","title":"The Expander Hierarchy and its Applications to Dynamic Graph Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Tree decomposition; Algorithm; Computer science; Hierarchy; Dynamic problem; Graph; Mathematics; Theoretical computer science; Combinatorics; Pathwidth; Line 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004575599,0.0004140169,0.000478674,0.00005679216,0.001093658,0.0004711151,0.0006746002,0.0004582271,0.000003601082],"category_scores_gemma":[0.00001423761,0.0003311193,0.0003797387,0.00006918407,0.0002410977,0.00003806387,0.0007125335,0.0005602756,0.000003836838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003691698,"about_ca_system_score_gemma":0.0001276527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.112951e-7,"about_ca_topic_score_gemma":0.000004082785,"domain_scores_codex":[0.9981308,0.000004883136,0.0004761717,0.0006632088,0.0003429732,0.0003819809],"domain_scores_gemma":[0.9981788,0.0006844142,0.0002272355,0.0005873007,0.0001147803,0.0002074244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002722848,0.00001233819,7.308305e-9,0.00007873901,0.0001484366,3.214341e-7,0.0006835829,8.592738e-7,0.00006303012,0.8469788,0.0008686967,0.1511624],"study_design_scores_gemma":[0.0005944316,0.00005240958,8.343248e-8,0.0001117445,0.00009355696,0.00001398357,0.0002702844,0.002565349,0.0001628352,0.7905896,0.2050778,0.0004679075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009009497,0.002172025,0.8648192,0.001709621,0.0006274649,0.006955847,0.0003470436,0.0003524434,0.1229262],"genre_scores_gemma":[0.0006390613,0.001572111,0.5446129,0.001433302,0.00186465,0.004303711,0.0001315929,0.0002708847,0.4451718],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3222456,"threshold_uncertainty_score":0.9999141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06587450508378731,"score_gpt":0.2717993298694636,"score_spread":0.2059248247856763,"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."}}