{"id":"W4302588649","doi":"10.48550/arxiv.1409.6365","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":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo; Canada Research Chairs; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Polytope; Vertex cover; Mathematics; Cover (algebra); Lift (data mining); Approximation algorithm; Relaxation (psychology); Linear programming relaxation; Theory of computation; Discrete mathematics; Graph; Linear programming; Mathematical optimization; Computer science; 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"],"consensus_categories":[],"category_scores_codex":[0.0007269045,0.0004501795,0.0004360125,0.0003068835,0.0005585308,0.0004709717,0.003413269,0.0002816889,0.00004148228],"category_scores_gemma":[0.00007931326,0.0003751593,0.0003537113,0.0006810596,0.0001865284,0.0003050649,0.002513889,0.001018279,0.0005034935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001640277,"about_ca_system_score_gemma":0.0002526235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005798569,"about_ca_topic_score_gemma":0.00003220498,"domain_scores_codex":[0.9972618,0.0003989753,0.0002767474,0.001275103,0.000237221,0.0005501435],"domain_scores_gemma":[0.9964965,0.0004403965,0.0003197665,0.002481082,0.0001330087,0.0001292227],"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.0000317566,0.0001226289,0.0005852915,0.0001241053,0.0001502762,0.00007943246,0.0005393397,0.09979124,0.00000956826,0.8930709,0.004458784,0.001036654],"study_design_scores_gemma":[0.0002864004,0.00008631605,0.0002071804,0.0003220829,0.00005420384,0.00001250525,0.00006758567,0.9402442,0.00005509879,0.01880338,0.03922025,0.0006407856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2543204,0.0001228423,0.7216082,0.0004753819,0.004084419,0.001183678,0.00003121642,0.0005800824,0.01759385],"genre_scores_gemma":[0.9947774,0.00008755412,0.000474477,0.0003114389,0.0002217606,0.000005169484,0.00001007733,0.00002326138,0.004088867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8742675,"threshold_uncertainty_score":0.9998701,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1304195680715192,"score_gpt":0.2075711145987895,"score_spread":0.07715154652727027,"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."}}