{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054631,0.002403259,0.00230632,0.002348918,0.001439471,0.004023193,0.004944168,0.002602865,0.01151666],"category_scores_gemma":[0.0151551,0.001037959,0.002242174,0.005052619,0.001660138,0.009892821,0.003119789,0.003973034,0.002575919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004228932,"about_ca_system_score_gemma":0.002341303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006533224,"about_ca_topic_score_gemma":0.007506839,"domain_scores_codex":[0.9969584,0.0007335229,0.0001568521,0.0008994711,0.00064385,0.0006080145],"domain_scores_gemma":[0.9920866,0.004448908,0.000558538,0.002105739,0.0003919525,0.0004082831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001119664,0.0006478943,0.003896061,0.0009793451,0.0004552953,0.0002749161,0.0008191764,0.4480672,0.005125033,0.2303594,0.04657647,0.2616795],"study_design_scores_gemma":[0.0001422876,0.00009199545,0.0004952771,0.00006265999,0.00009581726,0.0001885025,0.0001633228,0.6625863,0.001635899,0.3288764,0.005636735,0.00002480891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09579222,0.003342559,0.8684983,0.0033054,0.0002653335,0.0003882595,0.002748339,0.005368117,0.02029142],"genre_scores_gemma":[0.5207253,0.002594489,0.4527603,0.001065627,0.0003920988,0.0006267155,0.008324408,0.001438763,0.0120723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01151666,"threshold_uncertainty_score":0.03852707,"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."}}