{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049445,0.002400525,0.001989628,0.001271984,0.001252022,0.00215107,0.004029782,0.002691572,0.01599178],"category_scores_gemma":[0.002839299,0.001003642,0.001957435,0.002378534,0.0008550814,0.004161661,0.002759227,0.003376017,0.004387916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002839183,"about_ca_system_score_gemma":0.003865546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008571584,"about_ca_topic_score_gemma":0.01371646,"domain_scores_codex":[0.9988269,0.0001582836,0.00005934151,0.0003696759,0.0002319405,0.0003539082],"domain_scores_gemma":[0.9989948,0.0003849934,0.0000978158,0.0002755163,0.0001092336,0.0001377053],"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.001809009,0.001478985,0.002467165,0.0007560862,0.0002058115,0.0004601019,0.0007113687,0.3704169,0.01227932,0.05629872,0.06346061,0.489656],"study_design_scores_gemma":[0.0002722123,0.0001578541,0.0005356747,0.0000597506,0.0000551527,0.0002198589,0.0002182079,0.9397106,0.002459871,0.04882266,0.007459856,0.00002839852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1060725,0.001469782,0.843488,0.002839436,0.0003059298,0.000949549,0.001793746,0.007387834,0.03569321],"genre_scores_gemma":[0.2458999,0.0004334532,0.7365691,0.001002718,0.0001333334,0.0007826104,0.004283672,0.00079674,0.01009836],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01599178,"threshold_uncertainty_score":0.05349785,"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."}}