{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003072187,0.0002124342,0.0002475709,0.00009467448,0.000383508,0.0005264718,0.0009382626,0.0000926891,0.00008272962],"category_scores_gemma":[0.0001501193,0.0002177434,0.0001471979,0.0005564866,0.00005995598,0.000615063,0.0002993631,0.0001623343,0.0009691842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006426497,"about_ca_system_score_gemma":0.00004700727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002960186,"about_ca_topic_score_gemma":2.082258e-7,"domain_scores_codex":[0.9982789,0.00005102858,0.0003697017,0.000502197,0.0002558701,0.0005422892],"domain_scores_gemma":[0.9984528,0.0002978324,0.0001651618,0.0005453023,0.0004110861,0.0001277651],"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.00005703159,0.001374174,0.004042359,0.0004733992,0.0004930182,0.00002050007,0.001348751,0.008952863,0.03541569,0.3856065,0.224408,0.3378077],"study_design_scores_gemma":[0.000539989,0.0000636331,0.001489666,0.00003650763,0.000005351622,0.000007216582,0.000007881499,0.9794848,0.001030213,0.008858556,0.00819727,0.0002789001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01595252,0.00003771322,0.9811801,0.0003698627,0.0005073199,0.0005314221,0.00005826635,0.0004804005,0.0008823738],"genre_scores_gemma":[0.5920224,0.00000205318,0.4063635,0.0004852054,0.0002736163,0.00007193625,0.0005314613,0.00002431999,0.0002255286],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9705319,"threshold_uncertainty_score":0.9998087,"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."}}