{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006306947,0.0003902662,0.0005119774,0.0004785435,0.0003731501,0.0005257247,0.001498049,0.0002079049,0.00003154657],"category_scores_gemma":[0.0001067826,0.0003887552,0.0003147426,0.001149793,0.0001132745,0.001730037,0.0005816931,0.0005484378,0.00007398063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009967203,"about_ca_system_score_gemma":0.0001442134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003274556,"about_ca_topic_score_gemma":0.0001100305,"domain_scores_codex":[0.9968287,0.00007796415,0.001195582,0.0004272423,0.0005574621,0.0009131009],"domain_scores_gemma":[0.9979405,0.0002737209,0.0003264517,0.001003376,0.0002489343,0.0002070651],"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.0001255542,0.001795552,0.05588849,0.001446816,0.000521706,0.0003611285,0.03623484,0.0002720772,0.0004241488,0.7029101,0.009344611,0.190675],"study_design_scores_gemma":[0.01089454,0.0004608,0.02502424,0.001259537,0.00006870501,0.0007066248,0.004930963,0.5810878,0.007861921,0.2102605,0.1544527,0.002991781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5284783,0.0005052153,0.4474702,0.002597919,0.003394224,0.001548457,0.0005833275,0.0008796486,0.01454282],"genre_scores_gemma":[0.6850204,0.0001505862,0.3107013,0.002747787,0.000216761,0.0001546742,0.0005921153,0.00006471918,0.0003515795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5808157,"threshold_uncertainty_score":0.9998564,"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."}}