{"id":"W3201703753","doi":"10.4230/lipics.approx/random.2021.25","title":"Hitting Weighted Even Cycles in Planar Graphs","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Transversal (combinatorics); Approximation algorithm; Discrete mathematics; Undirected graph; Graph; Minimum weight; Time complexity; Independent set","routes":{"ca_aff":true,"ca_fund":true,"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.0006889799,0.001260019,0.001180958,0.001016088,0.0007783233,0.001710531,0.001562933,0.001030182,0.008764017],"category_scores_gemma":[0.005352516,0.0009084269,0.001220094,0.001774012,0.001023508,0.00346938,0.002229595,0.002005642,0.001365189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001322238,"about_ca_system_score_gemma":0.0008702115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003521153,"about_ca_topic_score_gemma":0.004488332,"domain_scores_codex":[0.999169,0.0001746846,0.00003464599,0.000267606,0.0001787342,0.0001752746],"domain_scores_gemma":[0.9977531,0.001294467,0.0003049567,0.0003152589,0.0001570374,0.0001752558],"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.0007474144,0.00021201,0.003682353,0.0008548874,0.0001929362,0.0006483541,0.0005886421,0.548616,0.01162619,0.2228207,0.01929124,0.1907193],"study_design_scores_gemma":[0.0000689889,0.0001192568,0.0006341742,0.00008034174,0.00005641019,0.0003312759,0.0002222395,0.5962709,0.004465476,0.3905829,0.007141707,0.00002638864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.282649,0.001588925,0.6927888,0.001464465,0.0001135581,0.0002049115,0.00148143,0.001818391,0.01789051],"genre_scores_gemma":[0.6741155,0.001988038,0.3020654,0.0006614151,0.0001218453,0.0003163611,0.003488401,0.001069939,0.01617317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008764017,"threshold_uncertainty_score":0.02931857,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0183218251078683,"score_gpt":0.2553436650242999,"score_spread":0.2370218399164316,"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."}}