{"id":"W1584512166","doi":"10.4230/lipics.fsttcs.2014.199","title":"Lift & Project Systems Performing on the Partial Vertex Cover Polytope","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Combinatorics; Vertex (graph theory); Vertex cover; Polytope; Mathematics; Cover (algebra); Lift (data mining); Approximation algorithm; Relaxation (psychology); Theory of computation; Linear programming relaxation; Graph; Discrete mathematics; Linear programming; Computer science; Mathematical optimization; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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"],"consensus_categories":[],"category_scores_codex":[0.0005790151,0.000378449,0.000372461,0.0002388555,0.0004913092,0.000398383,0.003009012,0.0002403925,0.00003004694],"category_scores_gemma":[0.00005639179,0.0003153606,0.0002942546,0.0005371445,0.0001730763,0.0002594595,0.00220146,0.000899942,0.0002674478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000142958,"about_ca_system_score_gemma":0.0002492075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004026457,"about_ca_topic_score_gemma":0.00001030152,"domain_scores_codex":[0.9976612,0.0003363923,0.0002294047,0.001090951,0.0002069236,0.0004750838],"domain_scores_gemma":[0.9972757,0.0003730741,0.000253782,0.001876449,0.0001086775,0.0001123567],"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.00003487432,0.00009980616,0.0004274381,0.0000882346,0.0001200992,0.0001152536,0.0003707324,0.09154733,0.000006538504,0.903176,0.003014943,0.0009987475],"study_design_scores_gemma":[0.000264116,0.0001116845,0.0001926868,0.0002175068,0.00003990591,0.00000846963,0.00006800056,0.9751148,0.00006137582,0.01002575,0.01344786,0.0004478853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2995261,0.000119081,0.6738284,0.0004823389,0.005327521,0.001280199,0.00003397431,0.0005785187,0.01882388],"genre_scores_gemma":[0.9974383,0.00005910226,0.0002024367,0.0002660397,0.0002503752,0.000003848294,0.000006483619,0.00001787079,0.001755526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8931503,"threshold_uncertainty_score":0.9999298,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1041633846942203,"score_gpt":0.1982802356524526,"score_spread":0.09411685095823225,"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."}}