{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001945128,0.0009764981,0.001378594,0.000836234,0.0003504406,0.0009771282,0.004877477,0.0008674651,0.00003907949],"category_scores_gemma":[0.0002647128,0.0009678542,0.0007792048,0.0006713801,0.0002721934,0.001827044,0.004611568,0.001691996,0.0006271013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004149411,"about_ca_system_score_gemma":0.0006611688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002045043,"about_ca_topic_score_gemma":0.00001054817,"domain_scores_codex":[0.9937336,0.0001258405,0.002072432,0.001041153,0.001049067,0.001977867],"domain_scores_gemma":[0.9942572,0.0008061425,0.0009138348,0.002887744,0.0007402588,0.0003947992],"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.002060578,0.004807243,0.008899266,0.01904887,0.002705719,0.0001545782,0.05014819,0.06025014,0.000303157,0.03607946,0.06814159,0.7474012],"study_design_scores_gemma":[0.003670668,0.0003718907,0.0000891583,0.0003230522,0.00002391575,0.0000236343,0.0001417963,0.9057685,0.0003511384,0.02231867,0.06590252,0.001015095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02261421,0.0001376302,0.9633566,0.0002685736,0.001430407,0.007121,0.00325086,0.0003905141,0.001430259],"genre_scores_gemma":[0.04340642,0.0001351336,0.9409443,0.001862775,0.0006614087,0.002950428,0.005399662,0.0003867683,0.004253104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8455183,"threshold_uncertainty_score":0.9992772,"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."}}