{"id":"W2962832012","doi":"10.4230/lipics.fsttcs.2014.199","title":"Lift & Project Systems Performing on the Partial Vertex Cover Polytope","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex cover; Vertex (graph theory); Approximation algorithm; Mathematics; Polytope; Lift (data mining); Cover (algebra); Relaxation (psychology); Theory of computation; Linear programming relaxation; Discrete mathematics; Graph; Linear programming; Computer science; Mathematical optimization; Algorithm","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001415174,0.0004497358,0.0004588788,0.000256371,0.0009371974,0.001149869,0.002173688,0.000179515,0.00002823948],"category_scores_gemma":[0.000238709,0.0003116732,0.0003143946,0.0004850051,0.0001721709,0.001361707,0.0006185843,0.0005731788,0.0005678062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009534596,"about_ca_system_score_gemma":0.000106555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005766367,"about_ca_topic_score_gemma":0.00001122259,"domain_scores_codex":[0.9968169,0.0001239072,0.0009625957,0.0003742654,0.0008022301,0.0009201425],"domain_scores_gemma":[0.9971336,0.0005800728,0.0004038468,0.001513533,0.0002017942,0.0001671929],"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.0002034045,0.0006829305,0.002205654,0.0008397796,0.000376782,0.000004868664,0.02056263,0.001364105,0.00005810022,0.8652886,0.06186861,0.04654459],"study_design_scores_gemma":[0.00108737,0.0003119901,0.0001604101,0.000195063,0.00001876052,0.00005036647,0.0003055269,0.5071486,0.0002307292,0.001014987,0.4890127,0.0004634834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.141915,0.00007661292,0.8165796,0.001722695,0.00670674,0.003397396,0.0003012444,0.0007193031,0.02858138],"genre_scores_gemma":[0.9848754,0.00002327193,0.01003448,0.003050548,0.0005490531,0.0002960681,0.0001216586,0.00005049164,0.0009989787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8642735,"threshold_uncertainty_score":0.9999335,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03681802645176051,"score_gpt":0.2644570532543573,"score_spread":0.2276390268025968,"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."}}