{"id":"W3081819253","doi":"10.48550/arxiv.2008.03327","title":"A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Travelling salesman problem; Regular polygon; Enhanced Data Rates for GSM Evolution; Approximation algorithm; Discrete mathematics; Algorithm; Geometry; 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.0007077851,0.0004239734,0.0003893245,0.000281503,0.0005010765,0.000342378,0.00321693,0.0002568308,0.00000826781],"category_scores_gemma":[0.00008511096,0.0003155079,0.0004289887,0.001526132,0.000267477,0.0003255957,0.001262737,0.001024382,0.00001170702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053936,"about_ca_system_score_gemma":0.0001761988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007247641,"about_ca_topic_score_gemma":0.0007705161,"domain_scores_codex":[0.997453,0.0003748271,0.0003541709,0.0011858,0.0001583725,0.0004738779],"domain_scores_gemma":[0.9969355,0.001138401,0.0003094781,0.001289161,0.0002165477,0.0001108885],"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.000102288,0.000650318,0.0002196214,0.0003500821,0.0004168014,0.005935539,0.01177995,0.02862111,0.00002284719,0.8499406,0.001887375,0.1000734],"study_design_scores_gemma":[0.0008731067,0.00008955027,0.0001154121,0.00006546734,0.00007526645,0.0001540924,0.0009830435,0.8829311,0.00002649841,0.1135049,0.0008221359,0.0003594776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01193538,0.0001120336,0.9828265,0.001836426,0.0005845707,0.002116858,0.00009873941,0.0002236244,0.000265899],"genre_scores_gemma":[0.9264286,0.00006914405,0.07272769,0.0003915563,0.0001572671,0.00004968514,0.00005352479,0.00002276013,0.00009975716],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9144933,"threshold_uncertainty_score":0.9999297,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1051686159428374,"score_gpt":0.2179346125417006,"score_spread":0.1127659965988632,"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."}}