{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001137351,0.001233317,0.001232561,0.001103516,0.0007917834,0.00251357,0.003340339,0.001419133,0.005406285],"category_scores_gemma":[0.009275591,0.0008108256,0.001054967,0.001959527,0.001811686,0.008503222,0.003449599,0.003461166,0.00126374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001662376,"about_ca_system_score_gemma":0.00134153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002105728,"about_ca_topic_score_gemma":0.003031532,"domain_scores_codex":[0.9982357,0.0003136129,0.00009719047,0.0005528878,0.0005909289,0.0002096603],"domain_scores_gemma":[0.995748,0.001586269,0.0004563222,0.001785732,0.0002782295,0.0001455591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006531409,0.0001581176,0.001680252,0.0002487951,0.00008637668,0.0001033687,0.0003214947,0.5964965,0.01376976,0.1985039,0.006599179,0.1813791],"study_design_scores_gemma":[0.00004408828,0.00008845016,0.0001952118,0.00002140453,0.00001878565,0.00008190662,0.00007561532,0.8550726,0.007411893,0.132977,0.00399284,0.00002030886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02988037,0.0002256845,0.963422,0.0004438901,0.00003850978,0.00008912336,0.0004333077,0.001516181,0.003950873],"genre_scores_gemma":[0.3712264,0.0003336935,0.6220975,0.000217942,0.0001013957,0.0003562282,0.001247603,0.0005191272,0.003900217],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005406285,"threshold_uncertainty_score":0.01808584,"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."}}