{"id":"W3108451666","doi":"10.48550/arxiv.2011.14450","title":"Approximation algorithms for hitting subgraphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Approximation algorithm; Vertex cover; Vertex (graph theory); Undirected graph; Discrete mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003275003,0.0003640036,0.0004054883,0.0002994408,0.0003180135,0.0002477684,0.00235309,0.0002737302,0.00000969065],"category_scores_gemma":[0.00007308678,0.0004523684,0.0004628511,0.0008805118,0.0001118721,0.0004363143,0.001997954,0.0005717702,0.00002727347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001088837,"about_ca_system_score_gemma":0.0001563694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005284202,"about_ca_topic_score_gemma":0.000009237802,"domain_scores_codex":[0.9976175,0.0001003149,0.0002800623,0.001449913,0.0001243393,0.0004279118],"domain_scores_gemma":[0.9979973,0.0002127653,0.0003336477,0.001042083,0.0002108453,0.0002033298],"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.00002473929,0.0001034363,0.0002156766,0.0002937786,0.0001415543,0.0000821479,0.0005360726,0.01778916,0.00003690664,0.9623606,0.0007187546,0.01769723],"study_design_scores_gemma":[0.0003340252,0.00004545672,0.0001255002,0.00004700359,0.00003480719,0.00000223647,0.00004326208,0.6402103,0.0001381833,0.357637,0.001042145,0.0003400443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007225844,0.00007654753,0.9888272,0.0005102059,0.001012076,0.000658824,0.00004918711,0.0005889921,0.001051106],"genre_scores_gemma":[0.8455896,0.00008890282,0.1534054,0.0002416363,0.000280131,0.000007776996,0.00008063524,0.00002963637,0.0002763244],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8383638,"threshold_uncertainty_score":0.9997928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1562712320790418,"score_gpt":0.2171280354508415,"score_spread":0.06085680337179966,"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."}}