{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001619154,0.002759948,0.002820856,0.002945285,0.001614557,0.004689653,0.007101477,0.002728193,0.0291331],"category_scores_gemma":[0.01311559,0.001525102,0.002668625,0.008801453,0.001721104,0.0108627,0.003728006,0.005680871,0.005845933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004279706,"about_ca_system_score_gemma":0.002137481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004907086,"about_ca_topic_score_gemma":0.005757017,"domain_scores_codex":[0.9977946,0.0004849517,0.0001119843,0.0005135126,0.0006844872,0.0004104697],"domain_scores_gemma":[0.9928001,0.004076604,0.0002945477,0.001981778,0.0004823214,0.0003647013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007697709,0.0005542097,0.001277379,0.0009637056,0.0002082562,0.0001559148,0.0004234479,0.1515218,0.003279495,0.2967669,0.07652821,0.467551],"study_design_scores_gemma":[0.0001727101,0.00009380731,0.0004046531,0.0001026917,0.0001417103,0.0002221391,0.0001375604,0.4334154,0.002062211,0.5517837,0.01143743,0.00002613009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04179594,0.003296622,0.8973497,0.002243349,0.0005245209,0.0004330846,0.002302627,0.005327784,0.04672633],"genre_scores_gemma":[0.2689398,0.004192672,0.6718805,0.001021838,0.0008024509,0.0009166126,0.009599077,0.002558527,0.04008847],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0291331,"threshold_uncertainty_score":0.09745997,"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."}}