{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002178104,0.001569819,0.002534061,0.001856153,0.001457729,0.004683056,0.004037844,0.003250006,0.006815735],"category_scores_gemma":[0.009072319,0.0007079205,0.002066402,0.005839316,0.003482557,0.007885827,0.003582727,0.006592419,0.0006886218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003527988,"about_ca_system_score_gemma":0.001395078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004335263,"about_ca_topic_score_gemma":0.004276356,"domain_scores_codex":[0.9977177,0.0007848532,0.00006343524,0.0005787895,0.0005861183,0.0002691703],"domain_scores_gemma":[0.9957918,0.002583971,0.0003364928,0.0006816933,0.0002789107,0.0003269846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000129538,0.0001214027,0.0004073981,0.0002701416,0.00007265605,0.0001036062,0.0001351984,0.07359941,0.0006705595,0.8796449,0.01132011,0.03352503],"study_design_scores_gemma":[0.00003216802,0.0000228078,0.0003380053,0.00003176601,0.00002712681,0.00009440876,0.00004711248,0.1580911,0.0002089142,0.8329742,0.008108732,0.00002358624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1322715,0.02714616,0.7225216,0.01350749,0.001501995,0.0001637115,0.001207331,0.0003983685,0.1012819],"genre_scores_gemma":[0.7671611,0.01305839,0.1691702,0.002211224,0.004451049,0.0003723648,0.001355639,0.0005560673,0.041664],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006815735,"threshold_uncertainty_score":0.02559745,"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."}}