{"id":"W2119449734","doi":"10.5281/zenodo.7949826","title":"Vertex deletion games with parity rules","year":2005,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Parity (physics); Feedback vertex set; Undirected graph; Combinatorial game theory; Graph; Neighbourhood (mathematics); Discrete mathematics; Sequential game; Game theory; Mathematical economics","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":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004572444,0.0001236725,0.0001083638,0.0001464774,0.001282111,0.001043192,0.00159277,0.00004766636,0.00241761],"category_scores_gemma":[0.0002635435,0.0001142158,0.00003314155,0.0004302932,0.0001670353,0.0008077027,0.0008553285,0.0001991482,0.01334874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001207508,"about_ca_system_score_gemma":0.000005011706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001742666,"about_ca_topic_score_gemma":0.000001678864,"domain_scores_codex":[0.9984459,0.0001897448,0.0002022332,0.0004236911,0.000396661,0.000341805],"domain_scores_gemma":[0.9987203,0.0000289349,0.00008085377,0.0005727898,0.0004561179,0.0001409525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000295652,0.0001446435,0.00001242695,0.00001385305,0.0000213472,0.0000105139,0.001690082,0.0004441532,0.001332797,0.07241231,0.05545627,0.868432],"study_design_scores_gemma":[0.0001208822,0.0001995628,0.0006142699,0.00002234339,0.000004828449,0.00009197807,0.0001169339,0.01722444,0.004362739,0.001345571,0.975706,0.0001904615],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09088156,0.0001680183,0.7697474,0.006433865,0.000167246,0.0005504792,0.00003823064,0.002981678,0.1290316],"genre_scores_gemma":[0.9854692,0.00005417772,0.01293129,0.0003193585,0.0001344477,4.723861e-8,0.0001132459,0.0004465842,0.0005316147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9202497,"threshold_uncertainty_score":0.9999938,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03686037197315816,"score_gpt":0.2550208498718524,"score_spread":0.2181604778986942,"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."}}