{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002260212,0.001441106,0.001324393,0.0009093297,0.001149029,0.002436311,0.002195446,0.001261765,0.01091226],"category_scores_gemma":[0.01224983,0.0006004797,0.001545846,0.001067525,0.001906025,0.003263091,0.005623424,0.004732448,0.0010998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002330228,"about_ca_system_score_gemma":0.001677108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003192686,"about_ca_topic_score_gemma":0.002787763,"domain_scores_codex":[0.9984658,0.0003457758,0.0000532649,0.0003011361,0.0003989915,0.0004349816],"domain_scores_gemma":[0.9956042,0.002656385,0.0003936857,0.0005686606,0.0003082824,0.000468868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003993597,0.0001719206,0.001838574,0.0003189316,0.00005442338,0.0001550879,0.000408042,0.5638881,0.002785216,0.3696744,0.006048882,0.05425708],"study_design_scores_gemma":[0.00002504894,0.0001129631,0.0001863209,0.00002845057,0.00001198591,0.00005028027,0.00008041832,0.8979412,0.001308041,0.09845573,0.001788085,0.00001148232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2205079,0.0005217501,0.7296147,0.001375378,0.0001422815,0.0003243095,0.0005176397,0.000799122,0.04619697],"genre_scores_gemma":[0.801254,0.0004944658,0.1855259,0.0004020641,0.0001339081,0.0004612227,0.001073273,0.0002856952,0.01036962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01091226,"threshold_uncertainty_score":0.03650516,"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."}}