{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016089,0.0001712339,0.0001797687,0.00006443233,0.0004487658,0.0008858799,0.0008193445,0.00005843976,0.0000301374],"category_scores_gemma":[0.00003975158,0.0001194821,0.0001090042,0.0003779513,0.00007400921,0.000612608,0.0003004103,0.0002347438,0.0003915866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005026421,"about_ca_system_score_gemma":0.00002769376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007474164,"about_ca_topic_score_gemma":0.000001120611,"domain_scores_codex":[0.9981881,0.00008604227,0.0004105819,0.0003542899,0.0005248843,0.000436111],"domain_scores_gemma":[0.9987402,0.000398148,0.0001480099,0.0005601367,0.00007112342,0.00008237363],"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":[9.524015e-7,0.00005439817,0.000006314821,0.00005599851,0.0000117277,0.000001397631,0.0008632445,0.000008805092,0.00004736353,0.4790004,0.00001807713,0.5199313],"study_design_scores_gemma":[0.0002184909,0.0000539569,0.00002474138,0.00007219776,0.000006415373,0.00002557827,0.0002363016,0.3054441,0.0002055766,0.6913245,0.00222099,0.0001671702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003593569,0.00005472006,0.9913352,0.0008993056,0.0002130882,0.0008657182,5.187834e-7,0.0003513708,0.002686519],"genre_scores_gemma":[0.0525941,0.000002922531,0.9465787,0.00009053049,0.00005911776,0.0001514391,0.000004402053,0.00001631398,0.000502407],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5197642,"threshold_uncertainty_score":0.854256,"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."}}