{"id":"W1591207959","doi":"10.4230/lipics.fsttcs.2009.2319","title":"On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Cover (algebra); Mathematics; Vertex (graph theory); Combinatorics; Upper and lower bounds; Vertex cover; Regular polygon; Inequality; Metric (unit); Discrete mathematics; Approximation algorithm; Mathematical analysis; Geometry; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007758975,0.002595429,0.003440157,0.00231968,0.00194953,0.005421276,0.004151269,0.00247751,0.01021468],"category_scores_gemma":[0.0350339,0.00119625,0.002730711,0.002595857,0.004324179,0.008948369,0.007767376,0.0107232,0.001019358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004085483,"about_ca_system_score_gemma":0.00265227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002867832,"about_ca_topic_score_gemma":0.00296124,"domain_scores_codex":[0.993965,0.002066452,0.0002713859,0.001103323,0.00137933,0.001214621],"domain_scores_gemma":[0.9711037,0.02307506,0.001103983,0.002150844,0.001177537,0.001388897],"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.0007432153,0.0005038861,0.002521245,0.001016142,0.0002776013,0.0003783137,0.0005765744,0.371087,0.006716501,0.5201374,0.01511231,0.08092986],"study_design_scores_gemma":[0.00008979683,0.0002140219,0.0007592461,0.0001379053,0.00009585552,0.0002112442,0.0001486142,0.5938681,0.002525572,0.3959558,0.005952802,0.00004112678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1493679,0.002567633,0.7916436,0.005169713,0.0004848081,0.000421522,0.001025742,0.0007259899,0.04859317],"genre_scores_gemma":[0.6874385,0.002350427,0.2926193,0.002094529,0.0008344505,0.0008835048,0.001722275,0.0006788793,0.01137802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01021468,"threshold_uncertainty_score":0.04103386,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01935012980026356,"score_gpt":0.2701668991542132,"score_spread":0.2508167693539496,"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."}}