{"id":"W2970633507","doi":"10.4230/lipics.swat.2020.12","title":"A Simple Algorithm for Minimum Cuts in Near-Linear Time","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minimum cut; Combinatorics; Simple (philosophy); Subroutine; Vertex (graph theory); Time complexity; Undirected graph; Minimum spanning tree; Spanning tree; Mathematics; Running time; Algorithm; Matching (statistics); Graph; Enhanced Data Rates for GSM Evolution; Computer science","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.00118643,0.002782897,0.001430884,0.002043619,0.001055735,0.002056221,0.003776875,0.002729387,0.03218807],"category_scores_gemma":[0.007704468,0.001476637,0.001909144,0.003217554,0.00106133,0.005920525,0.004207083,0.004453353,0.01338452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001144654,"about_ca_system_score_gemma":0.001467816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001269528,"about_ca_topic_score_gemma":0.002095022,"domain_scores_codex":[0.997251,0.0003793668,0.0002108492,0.0007718709,0.001083412,0.0003035658],"domain_scores_gemma":[0.9971739,0.001122636,0.0001730104,0.0008848833,0.0004821293,0.0001634316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004591212,0.000386218,0.0004926124,0.0007513462,0.0001523715,0.0002610517,0.0002535766,0.03195165,0.02498293,0.0747136,0.04893541,0.8166602],"study_design_scores_gemma":[0.0008151288,0.0004380122,0.0007808501,0.0001554918,0.0001557226,0.001512576,0.0001666372,0.3829431,0.02374675,0.5020834,0.08701626,0.0001860702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002786212,0.0002583386,0.9855492,0.0003178546,0.000134656,0.0002116008,0.0002858958,0.00531783,0.005138436],"genre_scores_gemma":[0.02419538,0.0001727587,0.9682009,0.0002395427,0.00008589652,0.0004189028,0.001073514,0.0009723504,0.004640782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03218807,"threshold_uncertainty_score":0.1076798,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0212399533739961,"score_gpt":0.309635207758114,"score_spread":0.2883952543841179,"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."}}