{"id":"W2979731478","doi":"10.1145/3341599","title":"A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Multigraph; Mathematics; Approximation algorithm; Enhanced Data Rates for GSM Evolution; Vertex connectivity; Induced subgraph isomorphism problem; Subgraph isomorphism problem; Reduction (mathematics); Vertex cover; Discrete mathematics; Algorithm; Computer science; Graph; Line graph; Vertex (graph theory); Artificial intelligence","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.0005747097,0.0003477632,0.0003202496,0.0003181834,0.0007119039,0.0003095178,0.0021642,0.0001612846,0.000107629],"category_scores_gemma":[0.00003088449,0.0002725275,0.0003771134,0.001319823,0.0001308293,0.0006264315,0.00004356688,0.0004310375,0.0001564906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006750351,"about_ca_system_score_gemma":0.00009802377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004959697,"about_ca_topic_score_gemma":0.00001515287,"domain_scores_codex":[0.9975579,0.0001014,0.0004621936,0.0007982849,0.0004995586,0.0005806553],"domain_scores_gemma":[0.9962992,0.001267275,0.0001591542,0.001878034,0.0002660225,0.0001302851],"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.00001619716,0.0002572055,0.000004070602,0.00002666123,0.0001252473,0.000001877374,0.0005488644,0.0004112536,0.0001607982,0.007714827,0.0002776414,0.9904553],"study_design_scores_gemma":[0.001880592,0.0006007573,0.0003354047,0.00006236994,0.00005952419,0.00004683554,0.000218679,0.9365811,0.003479724,0.04308731,0.01310435,0.0005434007],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004677983,0.0001548828,0.9916678,0.003282127,0.001637303,0.001882409,0.00008714333,0.0004961608,0.0003243434],"genre_scores_gemma":[0.02559385,0.0001088588,0.9711887,0.0007640984,0.0001574661,0.0008086271,0.00002355135,0.0000489945,0.001305863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.989912,"threshold_uncertainty_score":0.9999727,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02408591830526699,"score_gpt":0.2552901439520244,"score_spread":0.2312042256467574,"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."}}