{"id":"W3021945058","doi":"10.48550/arxiv.2005.02368","title":"Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Shortest path problem; Omega; Path (computing); Time complexity; Metric space; Binary logarithm; Discrete mathematics; Logarithm; Graph; Computer science; Physics","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.0001647131,0.0004133262,0.0004771453,0.0002045351,0.0003295632,0.0002308505,0.00178885,0.0002076633,0.000009804594],"category_scores_gemma":[0.00002945498,0.0004742972,0.0002078144,0.0007338934,0.0004394315,0.0004435896,0.002100099,0.0006962966,0.00002484777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001765202,"about_ca_system_score_gemma":0.0000962273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000107873,"about_ca_topic_score_gemma":0.0002373945,"domain_scores_codex":[0.9974908,0.0001913486,0.0001957124,0.001590885,0.0001422467,0.0003890516],"domain_scores_gemma":[0.998321,0.0002379746,0.0002320461,0.0008685448,0.00008956473,0.0002508804],"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.0003810563,0.0002827922,0.0040797,0.001009727,0.0008916909,0.002130326,0.003107726,0.02380375,0.0001843416,0.9020327,0.001347279,0.0607489],"study_design_scores_gemma":[0.0004276389,0.000102928,0.005059969,0.0001768298,0.00007107433,0.000005912367,0.000167381,0.615468,0.00004098997,0.3766287,0.001222685,0.0006279108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06234302,0.0006495632,0.931903,0.0003776921,0.00104118,0.0004701679,0.00005539595,0.0003511048,0.002808842],"genre_scores_gemma":[0.9937807,0.0005805951,0.005062354,0.0001022868,0.00003313401,0.000002464716,0.00001533922,0.00001616819,0.0004069298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9314377,"threshold_uncertainty_score":0.9997709,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03936896967354345,"score_gpt":0.1834978566868087,"score_spread":0.1441288870132653,"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."}}