{"id":"W2035543139","doi":"10.1016/j.jda.2011.03.004","title":"Parameterized complexity of even/odd subgraph problems","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Parameterized complexity; Combinatorics; Induced subgraph isomorphism problem; Mathematics; Cograph; Vertex (graph theory); Pathwidth; Eulerian path; Discrete mathematics; Induced subgraph; Graph; Line graph; Voltage graph; Lagrangian","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":[],"consensus_categories":[],"category_scores_codex":[0.001262575,0.0001884005,0.0005148601,0.0003883433,0.00008116554,0.00004497569,0.001822466,0.00006910866,0.0000590898],"category_scores_gemma":[0.00009554711,0.0001437441,0.0003463496,0.000763026,0.0005029849,0.000966377,0.000289092,0.00038939,0.000007473637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003273862,"about_ca_system_score_gemma":0.0001094127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000454382,"about_ca_topic_score_gemma":0.000004811236,"domain_scores_codex":[0.9974762,0.0002796182,0.0008260327,0.0002401009,0.000767754,0.0004103132],"domain_scores_gemma":[0.9977054,0.000137995,0.0008110821,0.0006033433,0.0004959276,0.0002462403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00172515,0.002764543,0.01763954,0.0005873746,0.002070184,0.0009336574,0.02114416,0.0004063221,0.1386286,0.6155158,0.000906548,0.1976781],"study_design_scores_gemma":[0.002928874,0.003034797,0.02802241,0.0002519472,0.00005456704,0.0004269033,0.0002681407,0.01264425,0.04899886,0.9023189,0.0004817739,0.0005685809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1250439,0.0004938772,0.8714747,0.0002084724,0.0004312477,0.0002823021,0.00001663395,0.00004388005,0.002004964],"genre_scores_gemma":[0.6119822,0.0002045727,0.3876644,0.00002348141,0.00005319478,0.000004274934,7.975634e-7,0.00001583512,0.00005127983],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4869383,"threshold_uncertainty_score":0.5861715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1012913606734593,"score_gpt":0.3090173922446653,"score_spread":0.2077260315712059,"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."}}