{"id":"W2949889202","doi":"10.1007/s10107-019-01394-z","title":"The matching augmentation problem: a $$\\frac{7}{4}$$-approximation algorithm","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Matching (statistics); Zero (linguistics); Cover (algebra); Approx; Reduction (mathematics)","routes":{"ca_aff":true,"ca_fund":true,"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.002358838,0.002185217,0.002564499,0.001484307,0.001569463,0.004242528,0.006473048,0.004182566,0.02128603],"category_scores_gemma":[0.01008337,0.001264605,0.002745432,0.003543714,0.001639523,0.008453498,0.005208518,0.005980858,0.004645571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002845521,"about_ca_system_score_gemma":0.004365382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003373388,"about_ca_topic_score_gemma":0.003924767,"domain_scores_codex":[0.9978518,0.000639916,0.00008466346,0.0005630756,0.0004897398,0.0003707879],"domain_scores_gemma":[0.9966864,0.001720317,0.0002059908,0.0008557912,0.0002518135,0.0002797113],"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.001462894,0.001404852,0.001631614,0.0005752121,0.0001448974,0.0002065818,0.0003018525,0.1696731,0.00424839,0.309219,0.06822874,0.4429029],"study_design_scores_gemma":[0.0002165693,0.0001087827,0.0003217646,0.00008834284,0.0000802075,0.0001951197,0.00009072705,0.7134029,0.001813741,0.271374,0.01227867,0.00002920838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03522851,0.001025598,0.9129176,0.004349742,0.0006267595,0.0004804178,0.00101786,0.003254363,0.04109918],"genre_scores_gemma":[0.1741048,0.0007170699,0.7987022,0.001059913,0.0005317954,0.0008051131,0.001809408,0.0008001067,0.02146956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02128603,"threshold_uncertainty_score":0.07120889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01408727426147026,"score_gpt":0.2561014180336755,"score_spread":0.2420141437722053,"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."}}