{"id":"W2745314127","doi":"10.1016/j.disopt.2018.06.004","title":"The generalized vertex cover problem and some variations","year":2018,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Vertex cover; Mathematics; Vertex (graph theory); Generalization; Combinatorics; Cover (algebra); Edge cover; Mathematical optimization; Quadratic equation; Linear programming; Integer programming; Discrete mathematics; Approximation algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003246463,0.0002141356,0.0001797273,0.00008385352,0.0006662394,0.001036474,0.0008544025,0.0001548361,0.00002531114],"category_scores_gemma":[0.00005000524,0.0001646349,0.00008183726,0.0002104973,0.0001545477,0.0004201008,0.001418056,0.0002299491,0.00001241761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003845503,"about_ca_system_score_gemma":0.0001092474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004204561,"about_ca_topic_score_gemma":0.000005415027,"domain_scores_codex":[0.9985352,0.0001377448,0.0002887496,0.0005281425,0.0002736547,0.0002365201],"domain_scores_gemma":[0.9986565,0.0001034376,0.0002161635,0.0007873541,0.000165445,0.00007109851],"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.000008237298,0.00002441633,0.00002873156,0.00003353745,0.000083377,0.000001226647,0.0005884331,0.3045964,0.000004172054,0.686292,0.003108385,0.005231073],"study_design_scores_gemma":[0.0001766013,0.00002055706,0.00009306108,0.00003315073,0.00001725155,0.000002261736,0.000003006034,0.7998325,0.00001007398,0.1978324,0.001795184,0.0001840366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009329079,0.000443611,0.9934698,0.002184769,0.00106245,0.0004460064,0.00002883089,0.0001591877,0.002112002],"genre_scores_gemma":[0.008376775,0.001840494,0.9874742,0.0004555397,0.000373311,0.0001750224,0.000266251,0.00003369043,0.0010047],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4952361,"threshold_uncertainty_score":0.9994743,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01554961387666857,"score_gpt":0.2494159079872457,"score_spread":0.2338662941105771,"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."}}