{"id":"W2160532428","doi":"10.1007/s00446-013-0194-z","title":"No sublogarithmic-time approximation scheme for bipartite vertex cover","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Bipartite graph; Vertex cover; Vertex (graph theory); Approximation algorithm; Upper and lower bounds; Expander graph; Theory of computation; Independent set; Matching (statistics); Feedback vertex set","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.004722206,0.002674351,0.004066461,0.001966296,0.00392197,0.009852861,0.01022858,0.005225454,0.02860754],"category_scores_gemma":[0.02331631,0.001237144,0.003051729,0.006252445,0.003772783,0.02513625,0.008260536,0.009913702,0.006274087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0128307,"about_ca_system_score_gemma":0.01062326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005837771,"about_ca_topic_score_gemma":0.01195316,"domain_scores_codex":[0.9883939,0.002316216,0.000537881,0.002617667,0.003534998,0.002599333],"domain_scores_gemma":[0.9722593,0.0126471,0.001138337,0.01094432,0.001175472,0.001835331],"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.01403263,0.00248037,0.004534192,0.002045294,0.0006050665,0.0002721839,0.001175227,0.1800452,0.02377217,0.3326312,0.08800895,0.3503977],"study_design_scores_gemma":[0.001119427,0.0003179983,0.0009809621,0.0001524891,0.0004278254,0.0003706417,0.0003816083,0.4792551,0.008992788,0.4921661,0.01573629,0.00009882369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1601774,0.005215833,0.7164146,0.02019079,0.001737514,0.0009869483,0.005569235,0.01076869,0.07893889],"genre_scores_gemma":[0.6988838,0.001787802,0.2550275,0.004057853,0.00127375,0.001154167,0.004553766,0.00205925,0.03120217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02860754,"threshold_uncertainty_score":0.09570175,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01416074054477997,"score_gpt":0.2312845328330668,"score_spread":0.2171237922882868,"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."}}