{"id":"W3183859668","doi":"10.1007/978-3-030-79987-8_26","title":"Approximation Algorithms for Hitting Subgraphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypergraph; Combinatorics; Approximation algorithm; Vertex cover; Vertex (graph theory); Undirected graph; Graph; Discrete mathematics; Computer science; Mathematics; 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.001320604,0.0005910568,0.0006530732,0.001015863,0.0005358974,0.0009776711,0.003330935,0.0003588027,0.00001843892],"category_scores_gemma":[0.0001738749,0.0005996765,0.0003420911,0.001063747,0.0006013393,0.0007431388,0.001362519,0.0007509583,0.0000104737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00022008,"about_ca_system_score_gemma":0.0005682177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001288667,"about_ca_topic_score_gemma":0.00003698662,"domain_scores_codex":[0.9953967,0.00003781942,0.0006870464,0.002021227,0.00101968,0.0008375624],"domain_scores_gemma":[0.996504,0.0008588106,0.0003742313,0.001560533,0.0005209867,0.0001814142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000222234,0.00002857456,0.000007424244,0.00006987144,0.00001397787,0.00003088289,0.0003665074,0.002658052,0.00005383528,0.1461813,0.00002071622,0.8505666],"study_design_scores_gemma":[0.0002559144,0.0000964498,0.00002116641,0.0002991092,0.000007805073,0.00005706192,2.921828e-7,0.6048854,0.001237312,0.3900179,0.002563148,0.0005584256],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001857737,0.0009815034,0.9925501,0.0007962993,0.002912418,0.0006459999,0.00001464007,0.0002449967,0.001835469],"genre_scores_gemma":[0.003709729,0.00006369253,0.9939889,0.0009602672,0.0007701167,0.00003983342,0.0000297599,0.00004177274,0.0003959363],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8500082,"threshold_uncertainty_score":0.9996455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03333876799596407,"score_gpt":0.2654470085768108,"score_spread":0.2321082405808467,"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."}}