{"id":"W2403213103","doi":"","title":"A better approximation ratio for the Vertex Cover problem","year":2004,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Vertex cover; Combinatorics; Cover (algebra); Mathematics; Relaxation (psychology); Vertex (graph theory); Approximation algorithm; Set cover problem; Set (abstract data type); Edge cover; Maximum cut; Discrete mathematics; Computer science; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0001554597,0.00006212551,0.00005378759,0.00002588697,0.0001940618,0.0001715794,0.0004544982,0.00002138482,0.00002023593],"category_scores_gemma":[0.0000101776,0.00003872922,0.00005465057,0.0001664811,0.00003119009,0.0003360446,0.00007944788,0.00004878071,0.00004513581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001837457,"about_ca_system_score_gemma":0.00003250187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001804935,"about_ca_topic_score_gemma":0.000008882449,"domain_scores_codex":[0.9994642,0.000008854339,0.0001028825,0.0001617852,0.0001292217,0.000133092],"domain_scores_gemma":[0.9995237,0.0001001151,0.00002784114,0.0002844094,0.00004376163,0.00002017625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001848599,0.00003174831,0.000007746792,0.000007245412,0.00001025808,2.65983e-7,0.0003833392,0.0008369014,0.0001099182,0.9479674,0.002604588,0.04803871],"study_design_scores_gemma":[0.0005968725,0.00006196778,0.0003348319,0.000008425112,0.000004851435,0.000006103496,0.0000134698,0.3832682,0.002569346,0.5926985,0.02032131,0.0001161983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003140009,0.00002285088,0.986219,0.01042113,0.0001737657,0.0003816182,0.000001121072,0.00009413334,0.002372332],"genre_scores_gemma":[0.1775234,0.000003987113,0.8167927,0.004662661,0.0001013569,0.0001751875,0.000003897569,0.0000064569,0.0007303864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3824313,"threshold_uncertainty_score":0.1654544,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02213714143351398,"score_gpt":0.2405365403831179,"score_spread":0.2183993989496039,"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."}}