{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":925,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":925,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"68502a2299b6","filters":{"topic":"Artificial Intelligence in Games"}},"results":[{"id":"W2574978968","doi":"10.1126/science.aam6960","title":"DeepStack: Expert-level artificial intelligence in heads-up no-limit poker","year":2017,"lang":"en","type":"article","venue":"Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":812,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Perfect information; Exploit; Computer science; Imperfect; Artificial intelligence; Intuition; Computation; Limit (mathematics); Machine learning; Cognitive science; Mathematical economics; Algorithm; Mathematics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.1440522495334658,"gpt":0.3769481268805651,"spread":0.2328958773470994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002091809,0.0002755064,0.0002762476,0.0003826153,0.001366781,0.001869806,0.008221063,0.0001017128,0.0001014689],"category_scores_gemma":[0.002251716,0.0002578491,0.00008862824,0.000904525,0.002180828,0.003822847,0.001699143,0.0003309799,0.002063767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002042886,"about_ca_system_score_gemma":0.0005533952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004780349,"about_ca_topic_score_gemma":0.0006502477,"domain_scores_codex":[0.9959211,0.00006543237,0.0006085442,0.001232643,0.001076535,0.001095705],"domain_scores_gemma":[0.9963117,0.0001557549,0.0002684225,0.002547214,0.0004221585,0.0002947378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002068916,0.0001600473,0.002223207,0.000007796121,0.000003637845,0.0000700314,0.005296258,0.0002760316,0.02444206,0.1925124,0.0003513547,0.7746365],"study_design_scores_gemma":[0.00008071725,0.0002213756,0.02350614,0.0001575502,0.000003287843,0.00003432187,0.0008877677,0.3457765,0.4616838,0.1596098,0.006841541,0.00119722],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1047164,0.000302375,0.8698126,0.005432279,0.008064444,0.000531819,0.000005792019,0.0002746401,0.01085962],"genre_scores_gemma":[0.9519285,0.00005180505,0.04660732,0.0005910317,0.0002119795,0.00003069696,3.100852e-7,0.000012963,0.0005654159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8472121,"threshold_uncertainty_score":0.9999874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914296650","doi":"10.1609/aiide.v1i1.18726","title":"Cooperative Pathfinding","year":2005,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":665,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Computer science; Heuristic; Path (computing); Series (stratigraphy); Computation; Mathematical optimization; Space (punctuation); Shortest path problem; Algorithm; Artificial intelligence; Theoretical computer science; Graph; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04673518047539069,"gpt":0.2919325657892966,"spread":0.2451973853139059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002324616,0.0003245762,0.0003039809,0.0001591814,0.0002245625,0.0008810651,0.001338718,0.00007445915,0.00007685438],"category_scores_gemma":[0.0003576244,0.0002337124,0.0001493775,0.0003480028,0.0003634675,0.002291935,0.0006871707,0.0003377196,0.0001617449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001391824,"about_ca_system_score_gemma":0.00005128482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001239661,"about_ca_topic_score_gemma":0.000006802396,"domain_scores_codex":[0.9977934,0.00001707933,0.0006720951,0.0006183822,0.0004946523,0.0004043927],"domain_scores_gemma":[0.9985304,0.0001652613,0.0003798081,0.0002650697,0.0005286948,0.0001307066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008799041,0.0003279922,0.0003441841,0.0000114444,0.00004114968,7.746669e-7,0.004984636,0.00007382204,0.0100819,0.6121246,0.0001296425,0.3717919],"study_design_scores_gemma":[0.00003966222,0.0006204738,0.000139135,0.0003822146,0.00001161872,0.00001522761,0.00528684,0.06617791,0.8815267,0.04383916,0.001555614,0.000405435],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8154395,0.00007129367,0.0875568,0.0148447,0.0008936614,0.001301944,0.00003394485,0.0001990363,0.07965908],"genre_scores_gemma":[0.9979535,0.00004271212,0.0007270474,0.0005246004,0.0000858604,0.00004066605,8.652873e-7,0.00001418557,0.0006105567],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8714448,"threshold_uncertainty_score":0.9530514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020135152","doi":"10.1145/1273496.1273531","title":"Combining online and offline knowledge in UCT","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":458,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Function (biology); Value (mathematics); Bellman equation; Online and offline; Offline learning; Monte Carlo tree search; Online algorithm; Artificial intelligence; Value network; Monte Carlo method; Machine learning; Algorithm; Mathematical optimization; Online learning; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04959359877610941,"gpt":0.3435625851067528,"spread":0.2939689863306434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005044829,0.0000694888,0.00009469074,0.0001278317,0.00003127195,0.0000403788,0.0003112632,0.0000364771,0.00001632683],"category_scores_gemma":[0.00005470939,0.00006155539,0.00001345518,0.0003352026,0.00005103975,0.0002103292,0.0002129974,0.00009949726,0.00004726938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001924726,"about_ca_system_score_gemma":0.00002086589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009899459,"about_ca_topic_score_gemma":0.00198005,"domain_scores_codex":[0.9992594,0.00001684767,0.0002273332,0.0002065151,0.00007838821,0.0002115246],"domain_scores_gemma":[0.9994701,0.0002059452,0.00002578626,0.0001983707,0.00003893437,0.00006084981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007064077,0.0002900462,0.01891418,0.000007975704,0.000004120163,0.00004225024,0.003352743,0.00004334893,0.002114823,0.2718601,0.0002977396,0.7030656],"study_design_scores_gemma":[0.0005325151,0.0003784024,0.1246898,0.0001297912,0.000004562038,0.00006469635,0.002619288,0.6894796,0.1127265,0.04768072,0.02085918,0.000834972],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5471362,0.0002462904,0.4361794,0.0004461847,0.0002186571,0.00006337495,2.389312e-7,0.0001051902,0.01560442],"genre_scores_gemma":[0.9529938,0.0000116218,0.04608318,0.0002123702,0.00004176858,6.029131e-7,4.913731e-7,0.000003646899,0.0006524976],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7022307,"threshold_uncertainty_score":0.2510156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995987707","doi":"10.1126/science.1144079","title":"Checkers Is Solved","year":2007,"lang":"en","type":"article","venue":"Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":436,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Task (project management); Heuristic; Artificial intelligence; Process (computing); State (computer science); Video game; Perfection; Algorithm; Programming language; Multimedia; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03679734623591062,"gpt":0.3270783915183024,"spread":0.2902810452823918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001823253,0.00008171635,0.00006910752,0.0001750722,0.0002962003,0.0002306996,0.002313497,0.00002853356,0.0000454662],"category_scores_gemma":[0.0001798746,0.00007302619,0.00003474419,0.001659477,0.0007327618,0.001040952,0.0003574251,0.00009170562,0.0006918749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007020936,"about_ca_system_score_gemma":0.000187017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002301838,"about_ca_topic_score_gemma":0.00001465434,"domain_scores_codex":[0.9981797,0.000006528213,0.0001866613,0.000457823,0.0006225458,0.0005467742],"domain_scores_gemma":[0.9989332,0.00006208241,0.00005450671,0.000624974,0.0001495769,0.0001756754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000006017765,0.00008341096,0.006591479,0.000005062156,0.000004463799,0.00004627413,0.01146636,0.00007212141,0.1808298,0.2111848,0.002549432,0.5871608],"study_design_scores_gemma":[0.00002748977,0.00004488624,0.00823621,0.000008497962,9.644549e-7,0.00001124939,0.0003070909,0.02639251,0.9276996,0.01993916,0.01712012,0.0002122813],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1030022,0.00005842266,0.8740005,0.001312196,0.0009870502,0.00008352681,2.493161e-7,0.0001905039,0.02036537],"genre_scores_gemma":[0.9508153,0.000003447021,0.04720224,0.001354766,0.00005329314,0.000001326524,3.599094e-8,0.000003054506,0.0005665103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8478131,"threshold_uncertainty_score":0.8892883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006791053","doi":"10.1126/science.1259433","title":"Heads-up limit hold’em poker is solved","year":2015,"lang":"en","type":"article","venue":"Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":350,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; Alberta Innovates - Technology Futures; Compute Canada","keywords":"Perfect information; Limit (mathematics); Imperfect; Computation; Computer science; Combinatorial game theory; Mathematical economics; Extensive-form game; Sequential game; Complete information; Game theory; Theoretical computer science; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1142824154970506,"gpt":0.3346387999782774,"spread":0.2203563844812268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001483203,0.0001491455,0.0001415881,0.0001880828,0.0002880992,0.0006441589,0.003233911,0.00005069862,0.00004168595],"category_scores_gemma":[0.0004485914,0.000130459,0.00005336055,0.001726698,0.0007031715,0.001866705,0.0007853617,0.000150335,0.002139965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001186031,"about_ca_system_score_gemma":0.0006300959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004542013,"about_ca_topic_score_gemma":0.00002464994,"domain_scores_codex":[0.9972408,0.00003557762,0.0002544239,0.0007266744,0.001091275,0.0006512338],"domain_scores_gemma":[0.9979628,0.00005888958,0.00008547792,0.001045043,0.0004270134,0.0004207366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003165011,0.0003449089,0.008736526,0.00001720857,0.00001805777,0.00009693723,0.08520789,0.001108001,0.05705818,0.1580544,0.08276438,0.6065619],"study_design_scores_gemma":[0.0002331006,0.0003990847,0.004281763,0.00005219383,0.000007372615,0.00006153475,0.002575531,0.305985,0.5128967,0.09204505,0.08047167,0.0009910099],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4127188,0.0006402238,0.5463137,0.01235035,0.008126607,0.0004420372,0.000003900439,0.0008059416,0.01859836],"genre_scores_gemma":[0.97733,0.000008232074,0.01833495,0.002277057,0.0001173604,0.000008684604,1.677282e-7,0.000007449021,0.0019161],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6055709,"threshold_uncertainty_score":0.998637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1561304027","doi":"10.1609/aimag.v34i1.2449","title":"Interactive Narrative: An Intelligent Systems Approach","year":2013,"lang":"en","type":"article","venue":"AI Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":291,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Narrative; Entertainment; Computer science; Multimedia; Human–computer interaction; Visual arts; Art; Literature","retraction":null,"screen_n_in":null,"score":{"opus":0.02883995263335977,"gpt":0.298659651766415,"spread":0.2698196991330552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002458015,0.0002196988,0.0002361041,0.0001383489,0.0001256556,0.0006047885,0.001222315,0.00007670008,0.0001950149],"category_scores_gemma":[0.00007504341,0.0001841946,0.00006101768,0.0003961449,0.0001092744,0.002345863,0.0002985275,0.0002700019,0.003592104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008492514,"about_ca_system_score_gemma":0.00004800783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002911343,"about_ca_topic_score_gemma":0.00001321753,"domain_scores_codex":[0.9981867,0.0001683666,0.0003913581,0.0005655087,0.0003082844,0.00037979],"domain_scores_gemma":[0.9983871,0.0000965022,0.0001262744,0.000830062,0.0003682379,0.0001918182],"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.00003732887,0.00171343,0.001463636,0.0001012098,0.0002080014,0.00005246071,0.08798476,0.01099524,0.01672438,0.4083665,0.09346241,0.3788906],"study_design_scores_gemma":[0.00007296644,0.00035586,0.0008931542,0.00003818665,0.000006305464,0.00006132806,0.004336794,0.9583644,0.007334773,0.01049232,0.0175494,0.0004945527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03329441,0.000159108,0.9466431,0.001451435,0.00114251,0.0006953562,0.000001414458,0.0003786478,0.01623401],"genre_scores_gemma":[0.9803514,0.000009052732,0.01586637,0.0006929635,0.0001935816,0.0001669195,0.000006639647,0.00001861492,0.002694439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9473691,"threshold_uncertainty_score":0.9971837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101861158","doi":"10.1016/s0004-3702(01)00130-8","title":"The challenge of poker","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":271,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exploit; Construct (python library); Deception; Artificial intelligence; Probabilistic logic; Adversary; Class (philosophy); Perfect information; Machine learning; Task (project management); Computer security; Engineering; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.100451595296851,"gpt":0.3046174899691713,"spread":0.2041658946723203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005815466,0.0001789416,0.0001896646,0.0000851409,0.0003642337,0.0001728118,0.002130489,0.00008138403,0.0002667081],"category_scores_gemma":[0.0003224119,0.000130444,0.0001346629,0.0006495375,0.0004617577,0.0004077732,0.000309619,0.000214462,0.001466701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002866025,"about_ca_system_score_gemma":0.00002115032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007655875,"about_ca_topic_score_gemma":0.0001314985,"domain_scores_codex":[0.9978036,0.0001016634,0.0007348367,0.0004232253,0.000463569,0.0004731255],"domain_scores_gemma":[0.9976128,0.0006851865,0.0002079866,0.001154828,0.0002380208,0.0001011868],"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.000002633477,0.00006737241,0.0000100918,0.000002348033,0.000007747047,0.000004002032,0.001448611,0.0001753022,0.0004223652,0.5897261,0.000230224,0.4079033],"study_design_scores_gemma":[0.000006001456,0.0001650641,0.00001773881,0.0000198909,0.000005129044,0.000005694927,0.0005142293,0.1200536,0.1651384,0.704482,0.009353995,0.0002382576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005037296,0.002131496,0.950096,0.01332469,0.001503078,0.0003233779,0.000002065084,0.0002414725,0.02734058],"genre_scores_gemma":[0.9946568,0.0005837333,0.003991951,0.0001332822,0.000126406,0.00002073285,1.758451e-7,0.00001228201,0.0004746542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9896195,"threshold_uncertainty_score":0.9993108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119296376","doi":"10.1007/s10994-006-6205-6","title":"Adaptive game AI with dynamic scripting","year":2006,"lang":"en","type":"article","venue":"Machine Learning","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":260,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; University of Alberta","keywords":"Computer science; Scripting language; CLARITY; Human–computer interaction; Computer game; Game design; Sequential game; Scalability; Artificial intelligence; Game design document; Adaptation (eye); Multimedia; Game theory; Game Developer; Programming language; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.01036808213155851,"gpt":0.2475459678214451,"spread":0.2371778856898866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002392487,0.0001615476,0.0001492248,0.0001103448,0.0002088555,0.0002119085,0.0005059295,0.00004138497,0.00003326166],"category_scores_gemma":[0.00005261451,0.0001358463,0.00004191509,0.0003826407,0.00007000623,0.000446417,0.0001780448,0.0004150227,0.0001419829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006033706,"about_ca_system_score_gemma":0.00003417756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009738182,"about_ca_topic_score_gemma":0.0005127877,"domain_scores_codex":[0.9986787,0.00009801167,0.0002069876,0.0003873557,0.0002718607,0.0003570892],"domain_scores_gemma":[0.9993958,0.0000892896,0.0001154119,0.000275593,0.00007649699,0.0000474374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000459942,0.0001152778,0.07422771,0.00001711216,0.00003790544,0.0002163107,0.002785599,0.6067371,0.004028623,0.07598835,0.0002434166,0.2355566],"study_design_scores_gemma":[0.00006567375,0.0001530089,0.002716769,0.0000310747,0.00000416928,0.00002885903,0.00008351883,0.9880019,0.0009627864,0.003485719,0.00425976,0.0002067134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06048191,0.0002143494,0.9315345,0.0008903741,0.0001144121,0.00009133191,4.635639e-7,0.0004435316,0.006229147],"genre_scores_gemma":[0.9690744,0.000001698141,0.02848195,0.0002506311,0.00006475137,0.000007304145,0.000002979768,0.00001956364,0.002096777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9085925,"threshold_uncertainty_score":0.5539652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994685255","doi":"10.1016/s0004-3702(01)00152-7","title":"Games solved: Now and in the future","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":253,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Exploit; State (computer science); Space (punctuation); State space; Domain (mathematical analysis); Combinatorial game theory; Brute force; Game complexity; Game theory; Sequential game; Computational complexity theory; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Mathematical economics; Worst-case complexity; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.05601123108821538,"gpt":0.288640933092087,"spread":0.2326297020038717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006563566,0.0002206578,0.0001925263,0.0001601799,0.0002198438,0.0004433803,0.001609325,0.0001089299,0.0001573961],"category_scores_gemma":[0.0001233177,0.0001641922,0.00006768054,0.0009067923,0.0002790058,0.0006450514,0.000220306,0.0003632396,0.0008813222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002777685,"about_ca_system_score_gemma":0.00001605931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004187228,"about_ca_topic_score_gemma":0.001195606,"domain_scores_codex":[0.9978709,0.0001620786,0.0005083233,0.0005622673,0.0003969125,0.0004995533],"domain_scores_gemma":[0.9985563,0.0004095238,0.00009404228,0.000778372,0.00007426018,0.00008751871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000682551,0.000165485,0.0009766718,0.000007467623,0.000006031364,0.00006455004,0.008065276,0.0002295595,0.0004528014,0.2878086,0.001613179,0.7006036],"study_design_scores_gemma":[0.00002946287,0.0002462987,0.002156415,0.00006065955,0.00001220831,0.0001360575,0.008764655,0.4709544,0.04161439,0.4342968,0.04085386,0.0008747182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2202587,0.006603092,0.6940303,0.06412666,0.0027986,0.001088482,0.000004917239,0.000480515,0.0106088],"genre_scores_gemma":[0.9921971,0.0006120502,0.005134101,0.001503475,0.0003644145,0.000036144,4.380273e-7,0.00001105728,0.0001412447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7719384,"threshold_uncertainty_score":0.9998966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913781869","doi":"10.1016/j.artint.2019.103216","title":"The Hanabi challenge: A new frontier for AI research","year":2019,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":237,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Google (Canada)","funders":"","keywords":"Computer science; Domain (mathematical analysis); Imperfect; Artificial intelligence; Frontier; Perfect information; State (computer science); Cognitive science; Data science; Human–computer interaction; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.1628522236355365,"gpt":0.4126734209769778,"spread":0.2498211973414413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002765794,0.000253343,0.000262685,0.000196698,0.0008912323,0.0009740415,0.003472166,0.0001591959,0.000123467],"category_scores_gemma":[0.0009832397,0.0001946937,0.0001948225,0.0009770301,0.0003808465,0.0007468685,0.0005891784,0.0005724311,0.004550911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001242969,"about_ca_system_score_gemma":0.0004391061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003982185,"about_ca_topic_score_gemma":0.0007186105,"domain_scores_codex":[0.9960883,0.0002253092,0.0007192388,0.000915184,0.0008693484,0.001182573],"domain_scores_gemma":[0.9951604,0.001989497,0.0001276239,0.001693155,0.0007774605,0.0002518506],"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.00003150698,0.00004253442,0.00002560789,0.000005404961,0.00001288802,0.000002306102,0.001264079,0.0002442219,0.0004088903,0.572634,0.007207241,0.4181213],"study_design_scores_gemma":[0.00001535025,0.0003210878,0.0000125952,0.00002486476,0.000003441431,0.00000326619,0.001098072,0.1147192,0.05819198,0.6767836,0.1485765,0.0002500766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00263411,0.0009457857,0.9543387,0.03294761,0.002969794,0.001383758,0.000002450182,0.000210242,0.004567596],"genre_scores_gemma":[0.9664052,0.0002411984,0.01938433,0.0007999935,0.000939672,0.0002081724,0.00000205841,0.00005163611,0.0119678],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.963771,"threshold_uncertainty_score":0.9962242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1664963465","doi":"","title":"Approximating game-theoretic optimal strategies for full-scale poker","year":2003,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Abstraction; Sequential game; Combinatorial game theory; Class (philosophy); Game theory; Computation; Scale (ratio); Key (lock); Mathematical economics; Theoretical computer science; Artificial intelligence; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0273082856829337,"gpt":0.2861029956219506,"spread":0.2587947099390169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004786761,0.0001503053,0.000157484,0.00006070097,0.0001218677,0.0004167811,0.000615927,0.00006377599,0.0001387924],"category_scores_gemma":[0.0001323855,0.0001283194,0.00008769597,0.0002125228,0.0001272194,0.0006410737,0.00007921353,0.00008912439,0.0001149445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002422841,"about_ca_system_score_gemma":0.0001027483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008704974,"about_ca_topic_score_gemma":0.00001353186,"domain_scores_codex":[0.9986411,0.00005380713,0.0003229516,0.000382727,0.0001897307,0.0004096808],"domain_scores_gemma":[0.9990593,0.000224318,0.00008012253,0.0004425687,0.0001137904,0.0000799043],"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.000003444686,0.00003198532,0.00003022302,0.00001336273,0.00000539884,0.000001202108,0.001436764,0.002671031,0.002009879,0.9858238,0.0002767437,0.007696239],"study_design_scores_gemma":[0.00009617886,0.0001975468,0.00001300906,0.00001679945,0.000006995839,0.00002762319,0.004273571,0.5288689,0.06458523,0.3983677,0.003189193,0.0003573014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0385784,0.00004337102,0.9249158,0.0002346902,0.0002503881,0.0002687126,7.350486e-7,0.0002379705,0.03546994],"genre_scores_gemma":[0.550276,0.000001512265,0.4489543,0.0001438492,0.00002992585,0.00004404265,3.942229e-7,0.000009191337,0.0005407867],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.587456,"threshold_uncertainty_score":0.5232711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156523042","doi":"10.1109/aamas.2004.238","title":"Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms","year":2004,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":201,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Gamut; Computer science; Suite; Benchmarking; Generator (circuit theory); Test suite; Nash equilibrium; Theoretical computer science; Variation (astronomy); Architecture; Algorithm; Artificial intelligence; Machine learning; Mathematical optimization; Test case; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08309830794725798,"gpt":0.3423465536720401,"spread":0.2592482457247821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005291637,0.000195849,0.0001811822,0.00008488908,0.0002205945,0.0003078731,0.001781838,0.00005422117,0.00002934988],"category_scores_gemma":[0.0001673643,0.0001276611,0.00009115877,0.0006987433,0.0001898051,0.0002469373,0.0005493676,0.0001998777,0.0007612644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008921513,"about_ca_system_score_gemma":0.000109963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001449108,"about_ca_topic_score_gemma":0.000009941457,"domain_scores_codex":[0.9979529,0.000123235,0.0003320806,0.0005484761,0.0005857062,0.0004576051],"domain_scores_gemma":[0.9983668,0.0002181688,0.00007397876,0.0009523162,0.0002479656,0.0001408204],"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.000005068857,0.0001059623,0.00001857365,0.000007602385,0.0000178632,0.000004351509,0.01120317,0.06115428,0.001004067,0.831224,0.0002336872,0.09502133],"study_design_scores_gemma":[0.0001779532,0.0003176272,0.0003019993,0.00003912918,0.00001425439,0.00006404462,0.002872914,0.7056271,0.02068695,0.2675635,0.001858913,0.000475628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02538821,0.00008796492,0.9534734,0.002675639,0.0003098803,0.0005510901,6.080671e-7,0.000262167,0.01725098],"genre_scores_gemma":[0.6596028,0.000004224974,0.3371922,0.002660794,0.0001090349,0.00007083466,5.803017e-7,0.00001359541,0.0003459338],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6444728,"threshold_uncertainty_score":0.9784768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2518462","doi":"10.1609/aiide.v3i1.18780","title":"Interactive Storytelling: A Player Modelling Approach","year":2007,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Storytelling; Interactive storytelling; Entertainment; Computer science; Multimedia; Human–computer interaction; Style (visual arts); Entertainment industry; Narrative; Visual arts; Art","retraction":null,"screen_n_in":null,"score":{"opus":0.06494872172888295,"gpt":0.2916616737695535,"spread":0.2267129520406705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006485964,0.0004808788,0.0004453462,0.0003271338,0.0002584282,0.0008410901,0.00175882,0.0001336183,0.00002994002],"category_scores_gemma":[0.0002689384,0.0003651741,0.0002517493,0.000501696,0.000465394,0.002302054,0.0007756872,0.0006376902,0.00006607865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000216722,"about_ca_system_score_gemma":0.00006061175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003982655,"about_ca_topic_score_gemma":0.000004833077,"domain_scores_codex":[0.9965943,0.00002097549,0.001022965,0.0009409947,0.0007627418,0.0006580154],"domain_scores_gemma":[0.9976271,0.0003650325,0.000657046,0.0003909396,0.0007413012,0.0002185234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0007900197,0.0012736,0.0005943469,0.000061286,0.0001672253,0.000004582744,0.01759127,0.001310133,0.008732251,0.7218464,0.00009841735,0.2475304],"study_design_scores_gemma":[0.00005867919,0.0006691277,0.00006748503,0.0004518847,0.00002322876,0.00002898213,0.01524937,0.376354,0.5301121,0.0757405,0.0006448458,0.000599826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2047132,0.00003568516,0.7512462,0.0007324896,0.0005786819,0.0006908078,0.00001028547,0.0001023204,0.04189035],"genre_scores_gemma":[0.9957804,0.0000399483,0.003305987,0.0002861235,0.00009535281,0.00003347848,0.000001818188,0.00002711882,0.0004297816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7910671,"threshold_uncertainty_score":0.99988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913764096","doi":"10.1016/s0004-3702(01)00121-7","title":"Computer Go","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":180,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Representation (politics); Artificial intelligence; Data science; Human–computer interaction; Management science; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0945553412646733,"gpt":0.3002023316696072,"spread":0.2056469904049339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003454274,0.0002784473,0.0002511888,0.0001926283,0.0002840432,0.0004307094,0.002011514,0.0001214643,0.001093733],"category_scores_gemma":[0.0001226404,0.0002731487,0.0001528206,0.000929493,0.0002832101,0.0008968255,0.0004248821,0.0002845253,0.01780146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006135398,"about_ca_system_score_gemma":0.00001957817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000479636,"about_ca_topic_score_gemma":0.00003879013,"domain_scores_codex":[0.9972997,0.0001002809,0.0006889181,0.0007587783,0.0004824606,0.0006699185],"domain_scores_gemma":[0.9980785,0.0002885909,0.0001361903,0.001089001,0.0001871434,0.000220582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001782442,0.000115467,0.00005219465,0.000002914472,0.000008481426,0.00003031975,0.001045961,0.0008307474,0.0004209525,0.4114733,0.00243738,0.5835806],"study_design_scores_gemma":[0.000007466982,0.0001441305,0.00003638755,0.00001797616,0.00000460797,0.00003180769,0.00007459451,0.7747851,0.07367004,0.1383178,0.01249804,0.0004120765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004395775,0.0002163029,0.9793222,0.003070298,0.001638596,0.0002103353,0.000001594869,0.0006073275,0.01053757],"genre_scores_gemma":[0.922681,0.00006762069,0.07469707,0.001246871,0.00050413,0.0000242231,8.96572e-7,0.00002243321,0.0007557137],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9182853,"threshold_uncertainty_score":0.999972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168356773","doi":"10.48550/arxiv.1207.1411","title":"Bayes' Bluff: Opponent Modelling in Poker","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Prior probability; Computer science; Adversary; Artificial intelligence; Dirichlet distribution; Fictitious play; Bluff; Probabilistic logic; Domain (mathematical analysis); Task (project management); Class (philosophy); Observability; Machine learning; Bayesian probability; Game theory; Mathematical economics; Mathematics; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1747774249227732,"gpt":0.2159533918694924,"spread":0.04117596694671916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005052568,0.0003677339,0.0003805545,0.0004269448,0.00009938222,0.0001414596,0.00251866,0.0003844648,0.0000696698],"category_scores_gemma":[0.00002580271,0.0004376181,0.0002093119,0.0005962825,0.0001184848,0.0006884379,0.002745948,0.0008630676,0.0004813795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003694214,"about_ca_system_score_gemma":0.0001779341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007505069,"about_ca_topic_score_gemma":0.0001111134,"domain_scores_codex":[0.9974905,0.0001717455,0.0003571929,0.001182429,0.0001443363,0.0006538117],"domain_scores_gemma":[0.9978027,0.0001402719,0.0002344944,0.001463792,0.0001231636,0.000235518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001095257,0.0001115781,0.002683467,0.000024639,0.00002202017,0.0001596184,0.0008223259,0.8072248,0.00002070808,0.1876923,0.00006116094,0.001166379],"study_design_scores_gemma":[0.00006976649,0.0000119485,0.0001896293,0.00009123042,0.00001899286,0.000002531488,0.0001002328,0.9152979,0.0005053583,0.08272331,0.0005354545,0.0004536277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2154227,0.0001552278,0.7799593,0.0001336349,0.0009234475,0.0002398835,0.000003638947,0.0001821816,0.002980049],"genre_scores_gemma":[0.9914989,0.0002195664,0.007108184,0.00009497366,0.0001248714,0.000001612946,0.000004858695,0.00002306199,0.0009239821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7760762,"threshold_uncertainty_score":0.9998075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056740053","doi":"","title":"The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University; University of Alberta","funders":"Sixth Framework Programme; Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Computer science; Monte Carlo method; Tree (set theory); Game tree; Artificial intelligence; Theoretical computer science; Machine learning; Game theory; Mathematics; Mathematical economics; Sequential game; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.09049253033088579,"gpt":0.3200413653549884,"spread":0.2295488350241027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007316731,0.0002285586,0.0003215791,0.00008162421,0.000205844,0.0002060398,0.001490204,0.0001835881,0.000009539061],"category_scores_gemma":[0.00003015108,0.0001457012,0.000123046,0.000101088,0.0003605362,0.00016031,0.003869545,0.000497982,0.00003169454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002168213,"about_ca_system_score_gemma":0.00008781315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005169555,"about_ca_topic_score_gemma":0.0007226918,"domain_scores_codex":[0.99812,0.0001600093,0.0004104825,0.0005031672,0.000407191,0.0003992213],"domain_scores_gemma":[0.9976402,0.0005378377,0.0001047356,0.001304495,0.000267954,0.0001447994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001371028,0.0001376496,0.0004509763,0.00008639678,0.0001060975,0.00001060536,0.009486856,0.002073804,0.00006646332,0.1058029,0.002712487,0.8790521],"study_design_scores_gemma":[0.0001614669,0.0002140925,0.008096538,0.0002775878,0.00004945903,0.00002517353,0.0003948155,0.9435765,0.003132863,0.0340621,0.009158579,0.0008508656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08373875,0.01301268,0.8688365,0.01367419,0.003977881,0.001369001,0.00001458317,0.0003290811,0.01504736],"genre_scores_gemma":[0.9737905,0.001506802,0.02352268,0.00006579476,0.000229979,0.00002165376,5.583121e-7,0.00001452599,0.0008475399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9415026,"threshold_uncertainty_score":0.5941522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102256448","doi":"10.1109/tciaig.2010.2067212","title":"Monte Carlo Tree Search in Hex","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Monte Carlo method; Game tree; Computer science; Tree (set theory); Olympiad; Theoretical computer science; Algorithm; Artificial intelligence; Game theory; Mathematics; Mathematical economics; Combinatorics; Statistics; Sequential game","retraction":null,"screen_n_in":null,"score":{"opus":0.03421570580501265,"gpt":0.3124778418136939,"spread":0.2782621360086812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003989941,0.0002199031,0.0002275694,0.000624639,0.0001249583,0.0001955512,0.0006215303,0.0001318436,0.00005365762],"category_scores_gemma":[0.00001922295,0.0002228083,0.00007602745,0.0008395683,0.0002471022,0.0006672484,0.00001014908,0.0008750228,0.00009688057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000527136,"about_ca_system_score_gemma":0.000134677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005261312,"about_ca_topic_score_gemma":0.002583538,"domain_scores_codex":[0.9980324,0.00008689403,0.0005124341,0.0005807362,0.0004064595,0.0003810936],"domain_scores_gemma":[0.9987434,0.0006367431,0.00004787005,0.0003120099,0.0001393617,0.0001206008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001829125,0.0002134908,0.0004251898,0.000008254407,0.000007421986,0.00002589323,0.001856137,0.6388329,0.0003911918,0.006161002,0.00002081992,0.3520395],"study_design_scores_gemma":[0.00008761357,0.0001284416,0.003476185,0.00006085937,0.000002701852,0.00003185785,0.0003924294,0.9486735,0.02398839,0.0227119,0.0001513271,0.000294761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2371921,0.00004686624,0.7598346,0.001873305,0.0005640684,0.0001925072,0.000004252677,0.00006922523,0.0002230843],"genre_scores_gemma":[0.9836237,0.0000713429,0.0155313,0.000514993,0.00003745809,0.00004476185,5.230171e-7,0.0000130273,0.0001629097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7464315,"threshold_uncertainty_score":0.908586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321428174","doi":"10.1145/2093548.2093574","title":"The grand challenge of computer Go","year":2012,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Sixth Framework Programme; Seventh Framework Programme","keywords":"Monte Carlo tree search; Computer science; Monte Carlo method; Tree (set theory); Artificial intelligence; Game tree; Theoretical computer science; Machine learning; Game theory; Mathematical economics; Sequential game; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1080938249366108,"gpt":0.3387268185554478,"spread":0.230632993618837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005569848,0.00005291613,0.00008380159,0.00002072364,0.0002890414,0.00002128426,0.03960741,0.00002574075,0.000001986291],"category_scores_gemma":[0.001173812,0.00003045792,0.00007514191,0.0002026951,0.0004759807,0.0001855751,0.02112416,0.0001141466,0.00002560254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001027738,"about_ca_system_score_gemma":0.00002020473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000198424,"about_ca_topic_score_gemma":0.00003588678,"domain_scores_codex":[0.9992493,0.0001827741,0.0002394227,0.00006099123,0.0001361805,0.0001313032],"domain_scores_gemma":[0.9729521,0.0009735891,0.0001722202,0.02576408,0.0001136887,0.00002436448],"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.000003361416,0.0002942333,0.004019563,0.00001003544,0.00004511184,1.776619e-8,0.00809179,0.00006869557,0.0003400734,0.8381019,0.02094364,0.1280816],"study_design_scores_gemma":[0.0001202905,0.00007834716,0.01654572,0.000103134,0.00002944457,0.000005205424,0.0003117526,0.01992051,0.02476833,0.7267219,0.2111579,0.0002373986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.05463326,0.04522742,0.1294787,0.7082475,0.003745698,0.001563728,0.00001511318,0.0002609058,0.05682764],"genre_scores_gemma":[0.9008713,0.0005363996,0.09841219,0.00006646548,0.00002690907,0.000009444033,2.415771e-7,0.000003454889,0.00007358404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8462381,"threshold_uncertainty_score":0.9867928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1558653343","doi":"","title":"Real-time strategy gaines: a new AI research challenge","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Operations research; Artificial intelligence; Human–computer interaction; Data science; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2825745515600075,"gpt":0.4172919766152771,"spread":0.1347174250552695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002088602,0.0004961211,0.000450092,0.0008660622,0.0003796183,0.001296934,0.003034601,0.0002665444,0.003656499],"category_scores_gemma":[0.001641151,0.0004895495,0.0002252641,0.001049963,0.0004680361,0.001107802,0.0003864516,0.001027488,0.01210177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003580123,"about_ca_system_score_gemma":0.00117845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006525937,"about_ca_topic_score_gemma":0.0001917918,"domain_scores_codex":[0.993602,0.0005925188,0.001276699,0.001443699,0.001999651,0.001085395],"domain_scores_gemma":[0.9954255,0.0006379319,0.0002742166,0.001319262,0.001824112,0.0005189358],"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.00003313965,0.0003114199,0.000008505881,0.000004461287,0.00003357447,0.00008795116,0.0009965312,0.000975009,0.009780004,0.8548912,0.001802191,0.131076],"study_design_scores_gemma":[0.00003751408,0.0004950916,0.00002369573,0.0001440923,0.000004341533,0.00003548972,0.0007804939,0.1029759,0.1285156,0.7609929,0.005446172,0.0005486684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007116401,0.00005911917,0.6477711,0.02305132,0.002726901,0.0008318864,0.00001461665,0.0006636843,0.317765],"genre_scores_gemma":[0.9828783,0.0003997008,0.0100552,0.0004828861,0.0005144072,0.00007466639,0.000008878534,0.00004574683,0.005540227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9757619,"threshold_uncertainty_score":0.9997556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022504108","doi":"10.1109/cig.2013.6633643","title":"Portfolio greedy search and simulation for large-scale combat in starcraft","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Portfolio; Greedy algorithm; Artificial intelligence; State (computer science); Machine learning; Mathematical optimization; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03788244393986911,"gpt":0.3196235751881126,"spread":0.2817411312482435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003105924,0.00007314503,0.00009604626,0.0001062342,0.00006069911,0.0001419172,0.000272331,0.00004454434,0.000134899],"category_scores_gemma":[0.00003926689,0.00006438029,0.00002205309,0.0001879827,0.00002956257,0.0006462727,0.0001636554,0.00006436512,0.00007861503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000211726,"about_ca_system_score_gemma":0.00002254891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005333257,"about_ca_topic_score_gemma":0.000475911,"domain_scores_codex":[0.999098,0.00002649108,0.0002025969,0.0002501137,0.0001487016,0.0002740719],"domain_scores_gemma":[0.9993441,0.0002243875,0.00001927706,0.0002324967,0.0001115344,0.00006826168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005454225,0.0006155577,0.2048187,0.00009790034,0.0000273457,0.0000114726,0.016829,0.1125502,0.003621613,0.170723,0.005173767,0.4854769],"study_design_scores_gemma":[0.0001263473,0.00007024994,0.01148661,0.000004946835,5.993955e-7,6.409173e-7,0.0002698405,0.9733687,0.00182944,0.01217528,0.0005807395,0.00008658603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.37123,0.00002158957,0.6270663,0.0005655708,0.00005876271,0.000404297,8.197792e-7,0.00004987249,0.000602814],"genre_scores_gemma":[0.9597791,0.000004333955,0.03910347,0.0002397072,0.00002354196,0.00003545713,0.000001352294,0.00000537615,0.0008076805],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8608186,"threshold_uncertainty_score":0.2625352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1863869622","doi":"10.1016/s0004-3702(01)00166-7","title":"World-championship-caliber Scrabble☆☆SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the USA by Hasbro Inc., in Canada by Hasbro Canada Corporation, and throughout the rest of the world by J.W. Spear &amp; Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc.","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Championship; Corporation; Intellectual property; Computer science; Operations research; Advertising; Engineering; Business; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.08528845174103022,"gpt":0.2779775682452863,"spread":0.1926891165042561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001484654,0.0004334274,0.0006228986,0.0002418797,0.0002542924,0.0001718928,0.002243144,0.0001140132,0.00007629303],"category_scores_gemma":[0.0008802172,0.0002279485,0.00006217267,0.002810688,0.0008260583,0.0003746612,0.0004156235,0.0007752719,0.00000751165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003077584,"about_ca_system_score_gemma":0.0005633758,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.9640157,"about_ca_topic_score_gemma":0.9996327,"domain_scores_codex":[0.9947277,0.001094377,0.001753791,0.0007747891,0.0009791916,0.0006701743],"domain_scores_gemma":[0.9949433,0.002656589,0.0006960008,0.001344992,0.0002154819,0.0001436014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00102541,0.001597646,0.1834137,0.0002704209,0.0002162086,0.00009652704,0.184902,0.002771493,0.01145841,0.009207872,0.5683075,0.03673275],"study_design_scores_gemma":[0.0010422,0.0006955852,0.04588496,0.002845495,0.0001708626,0.0001407729,0.0305744,0.1762767,0.3934809,0.03190029,0.3132114,0.003776493],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9489109,0.001089157,0.002722859,0.0444956,0.0003182585,0.001891026,0.0002759569,0.00001533816,0.0002809327],"genre_scores_gemma":[0.9961819,0.0001370419,0.0001931158,0.002598599,0.00003397443,0.00008357159,0.00001053472,0.00002260732,0.0007386657],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3820225,"threshold_uncertainty_score":0.9295469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1944385714","doi":"10.1007/3-540-47987-2_94","title":"Modeling Students’ Emotions from Cognitive Appraisal in Educational Games","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Cognitive appraisal; Educational game; Cognition; Personality; Game theory; Appraisal theory; Cognitive psychology; Artificial intelligence; Human–computer interaction; Multimedia; Psychology; Social psychology; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.0481980177279456,"gpt":0.3263712115191295,"spread":0.2781731937911839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005352826,0.0005131344,0.0004840121,0.001046924,0.0002210236,0.0007725927,0.003971462,0.0003120089,0.0002059597],"category_scores_gemma":[0.0004926759,0.0005291849,0.0001264623,0.000712818,0.0006562755,0.0008716715,0.001441732,0.0009989053,0.0003988431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003376469,"about_ca_system_score_gemma":0.0005917663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004352175,"about_ca_topic_score_gemma":0.0004386513,"domain_scores_codex":[0.9953226,0.00005736927,0.0007340544,0.001790495,0.001445545,0.0006498976],"domain_scores_gemma":[0.9967194,0.001678134,0.0001942432,0.0008928608,0.0003383755,0.0001769852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009585925,0.0003104138,0.001734583,0.00001535901,0.00003202395,0.0001073441,0.0103056,0.3821443,0.00004138966,0.04629474,0.00002209718,0.5589826],"study_design_scores_gemma":[0.00009187061,0.00005439584,0.0003520976,0.0005032085,0.000005773259,0.00001547856,0.000002336038,0.7409476,0.0001675442,0.257338,0.00005907107,0.0004626362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006365891,0.0003802765,0.9858845,0.0009853067,0.002366613,0.0003880782,0.00001240183,0.0000975174,0.003519363],"genre_scores_gemma":[0.872206,0.00007498872,0.1256261,0.0009252069,0.0006983843,0.00002562695,0.00001367662,0.00003439656,0.0003957062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8658401,"threshold_uncertainty_score":0.999716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1750339092","doi":"10.1609/aiide.v8i1.12527","title":"Fast Heuristic Search for RTS Game Combat Scenarios","year":2012,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Adversary; Heuristic; Incremental heuristic search; State (computer science); Sorting; Iterative deepening depth-first search; Beam search; Search algorithm; Artificial intelligence; Computer security; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0665393189233454,"gpt":0.3124185084308653,"spread":0.2458791895075199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004084779,0.0003615484,0.0003662901,0.0001411745,0.0002100713,0.0007591083,0.001358892,0.00008996002,0.00004001466],"category_scores_gemma":[0.000397771,0.0002701484,0.0002098376,0.0002949096,0.0004210022,0.002078997,0.0007105141,0.0003201399,0.00008973006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001361514,"about_ca_system_score_gemma":0.00005312926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002234674,"about_ca_topic_score_gemma":0.000002782102,"domain_scores_codex":[0.9974503,0.00002099564,0.0006967237,0.0005696138,0.0005573115,0.0007050363],"domain_scores_gemma":[0.9981101,0.0003522267,0.0003435452,0.0003109206,0.0006499329,0.0002332551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003401015,0.001024661,0.003406123,0.00008965341,0.00009053784,6.030011e-7,0.01097774,0.0001172811,0.009038414,0.6741376,0.0002315248,0.3005458],"study_design_scores_gemma":[0.00007964805,0.001145006,0.0006637227,0.0005839879,0.00003026895,0.00002270841,0.008234131,0.09183978,0.8484663,0.04721154,0.001109532,0.0006134108],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7635544,0.00009138993,0.2165177,0.003984387,0.001487916,0.001942447,0.0000601576,0.0001308167,0.01223077],"genre_scores_gemma":[0.9986278,0.00002739748,0.0004439347,0.0002898883,0.0001231652,0.00009768029,0.000002457001,0.00002205055,0.0003656484],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8394278,"threshold_uncertainty_score":0.9999751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153678894","doi":"","title":"Achieving master level play in 9×9 computer go","year":2008,"lang":"en","type":"article","venue":"UCL Discovery (University College London)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Heuristic; Artificial intelligence; Monte Carlo tree search; Function (biology); Value (mathematics); Tree (set theory); State (computer science); Bellman equation; Monte Carlo method; Domain (mathematical analysis); Machine learning; Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04533729866204827,"gpt":0.2195444041823804,"spread":0.1742071055203321,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001740393,0.0002398692,0.0003087516,0.0004334955,0.0003867115,0.00008570038,0.001505176,0.000120981,0.00006079306],"category_scores_gemma":[0.00001917945,0.0002755593,0.0001470606,0.001080792,0.000205193,0.003696916,0.0009646707,0.0002942311,0.0004523251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002588045,"about_ca_system_score_gemma":0.0001834337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002582685,"about_ca_topic_score_gemma":0.0005926926,"domain_scores_codex":[0.9980921,0.0001408173,0.0002397334,0.0006394339,0.0003768888,0.0005110062],"domain_scores_gemma":[0.998848,0.000199206,0.0001085076,0.0006505796,0.00006611044,0.0001275493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0006174897,0.001739212,0.2572522,0.0001106346,0.0002431556,0.01804529,0.02979705,0.02263407,0.002516733,0.5732692,0.05438588,0.03938903],"study_design_scores_gemma":[0.003141058,0.0006813351,0.5097382,0.0003719523,0.00004350151,0.0006983053,0.002850234,0.43191,0.003083459,0.002875734,0.04153807,0.003068096],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5363939,0.000025063,0.4601524,0.0007508441,0.0003878939,0.0001773718,0.00005036843,0.00009374675,0.00196845],"genre_scores_gemma":[0.9598719,0.00003297429,0.02414536,0.0004234073,0.00008559688,8.761947e-7,0.000004655938,0.00001440594,0.01542084],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5703935,"threshold_uncertainty_score":0.9999697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1778554682","doi":"","title":"Reinforcement learning of local shape in the game of go","year":2007,"lang":"en","type":"article","venue":"UCL Discovery (University College London)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Template; Function (biology); Artificial intelligence; Reinforcement; Computer game; Temporal difference learning; Variety (cybernetics); Machine learning; Multimedia","retraction":null,"screen_n_in":null,"score":{"opus":0.01524687706555709,"gpt":0.2284758731527574,"spread":0.2132289960872003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007005341,0.0001136559,0.0002071098,0.0002747264,0.00008842239,0.0000187851,0.001258618,0.00006528008,0.00003989292],"category_scores_gemma":[0.00004023935,0.0001055308,0.0001116471,0.001112183,0.0002620253,0.001031934,0.0003753728,0.0002078119,0.00002200576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001114995,"about_ca_system_score_gemma":0.0001024028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003957071,"about_ca_topic_score_gemma":0.0003757656,"domain_scores_codex":[0.998683,0.0001015493,0.0002729105,0.000237215,0.0004242892,0.0002810523],"domain_scores_gemma":[0.9989318,0.0003506253,0.0001967975,0.0003966821,0.00008269967,0.00004144006],"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.0002725894,0.0002252584,0.007097372,0.000049509,0.00003786662,0.0003016219,0.01013573,0.04075852,0.001292585,0.9228594,0.0004492147,0.0165204],"study_design_scores_gemma":[0.001437839,0.00127654,0.05594556,0.0002816082,0.00005534205,0.00004075835,0.08630398,0.8002371,0.0352069,0.004379333,0.01400079,0.000834235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4535042,0.00002775942,0.5411333,0.0001986811,0.00007666524,0.0001451511,0.000004044053,0.00001596365,0.004894198],"genre_scores_gemma":[0.9967905,0.00001848775,0.0008650768,0.00007667973,0.0000124191,2.404966e-7,0.000001620237,0.000004185366,0.002230793],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.91848,"threshold_uncertainty_score":0.430342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1605527696","doi":"10.1007/978-3-642-12239-2_14","title":"Towards a Generic Framework for Automated Video Game Level Creation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Encoding (memory); Video game; Genetic algorithm; Generative grammar; Game design; Human–computer interaction; Artificial intelligence; Multimedia; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.05360482209948655,"gpt":0.3185226923221993,"spread":0.2649178702227128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001034443,0.0006663094,0.0006474246,0.0008801865,0.0003470102,0.0009867591,0.004645029,0.0009142802,0.00004320402],"category_scores_gemma":[0.0008227706,0.0006228044,0.0002338311,0.0008303417,0.001062319,0.0007366344,0.001130997,0.00119213,0.00009537444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003419283,"about_ca_system_score_gemma":0.001020242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000576929,"about_ca_topic_score_gemma":0.0001321544,"domain_scores_codex":[0.9952652,0.00003357331,0.0007835761,0.001924492,0.001086511,0.0009066086],"domain_scores_gemma":[0.9956865,0.001098353,0.0004753721,0.001871727,0.0006347545,0.0002332855],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009060856,0.00003187936,0.00001300903,0.00003487009,0.00001324546,0.00002253036,0.001346627,0.01930386,0.000983665,0.1205696,0.00003702848,0.8576346],"study_design_scores_gemma":[0.00004858631,0.0001177824,0.00005860824,0.0001885944,0.000007088924,0.00002508312,1.381882e-7,0.5372965,0.01184067,0.4476416,0.002302777,0.0004726142],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001022396,0.0002079753,0.9913067,0.00150489,0.004296925,0.0008367363,0.0000187254,0.0008578105,0.0008679835],"genre_scores_gemma":[0.05030803,0.00002690788,0.946662,0.001656399,0.0009495153,0.00005508572,0.00000876952,0.00005721535,0.0002760464],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.857162,"threshold_uncertainty_score":0.9996223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097778153","doi":"10.1145/1390156.1390278","title":"Sample-based learning and search with permanent and transient memories","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Sample (material); Function (biology); Artificial intelligence; Transient (computer programming); Q-learning; Matching (statistics); Bellman equation; Machine learning; Mathematical optimization; Mathematics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.04074702411668039,"gpt":0.275774518047986,"spread":0.2350274939313056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001205171,0.00008264534,0.00008811391,0.00005245143,0.0002386641,0.00007758645,0.0001306817,0.00002078482,0.00002239565],"category_scores_gemma":[0.00001881637,0.00006045253,0.0000108477,0.0001277814,0.0002451692,0.000179595,0.00005127522,0.0001019299,0.000005885024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009894045,"about_ca_system_score_gemma":0.00004824763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001440187,"about_ca_topic_score_gemma":0.00004474646,"domain_scores_codex":[0.9992278,0.00003564591,0.00009289496,0.0002493445,0.0002123711,0.0001820084],"domain_scores_gemma":[0.9995499,0.0001765871,0.00001393193,0.0001211495,0.00005350965,0.00008494787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001897745,0.0002725047,0.4794741,0.0001425047,0.00007236835,0.0004031643,0.08721174,0.01522389,0.004716426,0.08856848,0.0005808242,0.3231442],"study_design_scores_gemma":[0.0005979174,0.001772041,0.05336554,0.00007362545,0.00001505912,0.0004667167,0.002893642,0.7723733,0.1431258,0.0009559497,0.02344853,0.0009118552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4733297,0.0000673506,0.5250256,0.0007609936,0.00001698612,0.00006344797,2.419008e-7,0.0000710824,0.0006646125],"genre_scores_gemma":[0.9421909,0.00004147779,0.05736319,0.0001232758,0.00001293051,0.0000041315,4.604135e-7,0.000004584602,0.000259071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7571494,"threshold_uncertainty_score":0.2465183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098487995","doi":"10.1609/aiide.v7i1.12435","title":"Build Order Optimization in StarCraft","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Action (physics); Order (exchange); Unit (ring theory); Resource (disambiguation); Resource allocation; Pathfinding; Mathematical optimization; Artificial intelligence; Theoretical computer science; Shortest path problem; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0564658959255539,"gpt":0.2790584538778487,"spread":0.2225925579522948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002235184,0.00027323,0.0002672135,0.0002303233,0.00009155387,0.0003657091,0.001188967,0.00007523346,0.000116328],"category_scores_gemma":[0.0003421159,0.0002075779,0.00009047578,0.0005329808,0.0002923902,0.001850727,0.0005581992,0.0002851459,0.0000384556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009773719,"about_ca_system_score_gemma":0.00005072562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009174966,"about_ca_topic_score_gemma":0.0000177127,"domain_scores_codex":[0.998002,0.00001739875,0.0006733121,0.0005612469,0.0003855522,0.0003605086],"domain_scores_gemma":[0.9987558,0.00008787771,0.0003268386,0.0002488536,0.0004864994,0.00009415635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000441242,0.001273871,0.006185335,0.00004077429,0.00005883312,0.000004225973,0.0191785,0.000843405,0.003084467,0.7568625,0.0000545834,0.2119722],"study_design_scores_gemma":[0.00007654451,0.00107479,0.0008621503,0.0006705044,0.00001320382,0.00001256812,0.009355232,0.2882001,0.5501697,0.1488161,0.0001515636,0.0005974604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5377637,0.00004149219,0.3771442,0.002951577,0.000917143,0.001460849,0.00001888991,0.000145827,0.07955623],"genre_scores_gemma":[0.9961993,0.00004680484,0.003280438,0.0002227534,0.00002004773,0.0000417829,8.356952e-7,0.0000132103,0.000174841],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6080464,"threshold_uncertainty_score":0.8464782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153039919","doi":"10.1007/s10994-012-5280-0","title":"Temporal-difference search in computer Go","year":2012,"lang":"en","type":"article","venue":"Machine Learning","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Temporal difference learning; Computer science; Search algorithm; Monte Carlo method; Bootstrapping (finance); Tree (set theory); Artificial intelligence; Reinforcement learning; Markov decision process; Beam search; Markov chain Monte Carlo; Search problem; Machine learning; Algorithm; Markov process; Mathematics; Statistics; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.04416456190730939,"gpt":0.309821783679691,"spread":0.2656572217723816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007587237,0.0001370897,0.0001601458,0.000162094,0.0001150195,0.0001232613,0.0006915678,0.0000572207,0.00007117983],"category_scores_gemma":[0.00007378367,0.0001245063,0.00004128942,0.0004326001,0.00004708205,0.0004349902,0.0004668406,0.0004993384,0.0005071312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005078119,"about_ca_system_score_gemma":0.00002294022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005128784,"about_ca_topic_score_gemma":0.0000757967,"domain_scores_codex":[0.9984297,0.0002453467,0.0002430804,0.0002762816,0.0002698955,0.000535766],"domain_scores_gemma":[0.9992937,0.0001877491,0.00005323284,0.0003110037,0.00003364217,0.0001206741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002615536,0.00005696867,0.7552085,0.000006857801,0.000003028943,0.000008824315,0.00355136,0.005731523,0.0003201684,0.004641677,0.00004427469,0.2304242],"study_design_scores_gemma":[0.00006787829,0.00006364263,0.09152698,0.00002654405,9.837954e-7,0.00001352037,0.00003646572,0.9015283,0.001669668,0.0005128399,0.004340135,0.0002130757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.360989,0.0002192868,0.6365866,0.0005388499,0.0002973302,0.00008534762,2.50777e-7,0.0001777458,0.001105585],"genre_scores_gemma":[0.9600753,0.000007319912,0.03881128,0.0001976117,0.0001755306,0.00000584633,0.000002448463,0.00001133802,0.0007133055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8957968,"threshold_uncertainty_score":0.6518315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1947291763","doi":"10.48550/arxiv.1412.6564","title":"Move Evaluation in Go Using Deep Convolutional Neural Networks","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Monte Carlo tree search; Computer science; Convolutional neural network; Artificial intelligence; Deep learning; Machine learning; Monte Carlo method","retraction":null,"screen_n_in":null,"score":{"opus":0.1116652315484495,"gpt":0.227260463415021,"spread":0.1155952318665715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005229742,0.0001062848,0.0001086459,0.0001423569,0.0001063215,0.0000494413,0.0005730432,0.00007489193,0.00003928393],"category_scores_gemma":[0.000088381,0.0001267683,0.00005187733,0.0006720696,0.0000935722,0.0006578696,0.0001792983,0.0001432766,0.00004861346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002152541,"about_ca_system_score_gemma":0.00004696463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001321738,"about_ca_topic_score_gemma":0.0001741285,"domain_scores_codex":[0.9988466,0.0002202717,0.0001460413,0.000418115,0.0001022885,0.0002666824],"domain_scores_gemma":[0.9992035,0.0001512803,0.0000846594,0.0003452561,0.0001435684,0.00007172158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006122077,0.0000201017,0.0111598,9.46776e-7,0.000003462029,0.000008616783,0.00008117324,0.8539724,0.00002962234,0.1295309,0.00000904753,0.005177804],"study_design_scores_gemma":[0.0001278114,0.00002130944,0.004967539,0.000007251708,0.000008432777,0.000002860443,0.00004222302,0.9674386,0.00006855145,0.02714441,0.00003477848,0.000136174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3898443,0.0000173781,0.6091539,0.00002865636,0.0002269967,0.00007985035,1.542621e-7,0.00003714472,0.0006116225],"genre_scores_gemma":[0.9983731,0.000003092377,0.001359097,0.0001256421,0.00006857337,3.287389e-7,0.000001517766,0.000005243631,0.00006343165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6085287,"threshold_uncertainty_score":0.516946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012220350","doi":"10.1016/j.disc.2005.12.038","title":"A note on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-cop, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:mi>l</mml:mi></mml:math>-robber games on graphs","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Mathematics; Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02307160409932155,"gpt":0.261477874880912,"spread":0.2384062707815904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.003965999,0.003100805,0.001879612,0.001125471,0.003063371,0.004021668,0.005925415,0.003377648,0.0007009272],"category_scores_gemma":[0.002381185,0.003794758,0.003703099,0.002517679,0.002836529,0.002931972,0.003805705,0.003663172,0.0167459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002108338,"about_ca_system_score_gemma":0.001909376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001784417,"about_ca_topic_score_gemma":0.0008754338,"domain_scores_codex":[0.9792883,0.0006816852,0.005070135,0.004323825,0.005766848,0.004869214],"domain_scores_gemma":[0.9826055,0.003671579,0.004615946,0.006944554,0.0005670721,0.001595323],"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.0009290897,0.001639206,0.00002112148,0.002040753,0.00124564,0.001670525,0.008977439,0.00707832,0.002161701,0.9623021,0.008225955,0.003708164],"study_design_scores_gemma":[0.00162329,0.002566365,0.00005957909,0.003929373,0.001340788,0.0009725376,0.002605557,0.9064122,0.05223887,0.01676644,0.008291381,0.003193618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9577441,0.001335454,0.01119473,0.001402905,0.005014862,0.0005950745,0.000683383,0.001314411,0.02071511],"genre_scores_gemma":[0.9662243,0.001309922,0.02215593,0.003161497,0.002641865,0.001297196,0.0006084883,0.001369839,0.00123095],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9455357,"threshold_uncertainty_score":0.9998772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W193176855","doi":"10.5591/978-1-57735-516-8/ijcai11-054","title":"Accelerating best response calculation in large extensive games","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Tree traversal; Computer science; Computation; Tree (set theory); Abstraction; Limit (mathematics); Perfect information; Game tree; Imperfect; Theoretical computer science; Sequential game; Game theory; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1055475456976191,"gpt":0.3231958775465029,"spread":0.2176483318488838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801616,0.00009040603,0.0001029762,0.0001364769,0.00006734644,0.00007646532,0.0004400577,0.00005371385,0.0001278662],"category_scores_gemma":[0.0003803748,0.00008189569,0.00003153987,0.0003287765,0.00002964693,0.000660397,0.0001828358,0.00009912955,0.0003291955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003703216,"about_ca_system_score_gemma":0.00004680574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00025012,"about_ca_topic_score_gemma":0.000316954,"domain_scores_codex":[0.9989,0.000129049,0.0002674536,0.0002860446,0.0001536144,0.0002638708],"domain_scores_gemma":[0.9992312,0.0001669443,0.00005895585,0.0003771335,0.000117298,0.00004845343],"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.000368406,0.000823621,0.1212546,0.00001415266,0.00002113521,0.0003988006,0.08278565,0.0005541486,0.02504488,0.5292266,0.001336819,0.2381711],"study_design_scores_gemma":[0.0002539759,0.0003346513,0.2123683,0.00009912374,0.000004024786,0.00002771845,0.003315263,0.5356454,0.2263136,0.01908723,0.00189998,0.0006506584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5797498,0.00002757123,0.4109732,0.0002913055,0.0001502715,0.0001983417,4.282744e-7,0.0001128323,0.008496231],"genre_scores_gemma":[0.9438854,0.000002160531,0.05497043,0.000371581,0.00002169857,0.00001899735,2.786692e-7,0.000005497155,0.0007239669],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5350913,"threshold_uncertainty_score":0.4231252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1646839507","doi":"10.1609/aaai.v24i1.7562","title":"Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Perfect information; Computer science; Set (abstract data type); A priori and a posteriori; Monte Carlo method; Variety (cybernetics); Search algorithm; Imperfect; Algorithm; Mathematical economics; Artificial intelligence; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1901535286000289,"gpt":0.3337788850530906,"spread":0.1436253564530617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751166,0.0002604859,0.0003337966,0.0003453076,0.0002273764,0.0004191328,0.003488811,0.0001503561,0.00004295231],"category_scores_gemma":[0.001025029,0.0001756133,0.0001538444,0.001370681,0.0007377394,0.001455667,0.0005802144,0.0008940817,0.0000379205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000103905,"about_ca_system_score_gemma":0.0001936517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004167835,"about_ca_topic_score_gemma":0.0006078813,"domain_scores_codex":[0.9972038,0.00004205525,0.001023291,0.0003843709,0.000853996,0.0004924829],"domain_scores_gemma":[0.9976285,0.0004591841,0.0005379809,0.0005316701,0.000760904,0.00008183521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006963784,0.0000880505,0.003800087,0.00005440896,0.00001258302,2.776243e-7,0.01238327,0.001721237,0.03396107,0.9001586,0.00002215555,0.04772862],"study_design_scores_gemma":[0.00003084061,0.0001688538,0.001765795,0.000263438,0.00001038754,0.000006123158,0.006250085,0.3081273,0.5423823,0.1406736,0.00004334671,0.0002780166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8948166,0.00001681512,0.09356567,0.003371078,0.0007892637,0.0007226591,0.000005448605,0.00007053247,0.006641938],"genre_scores_gemma":[0.9985576,0.00004193201,0.001182187,0.0000972261,0.00005497609,0.00002584639,2.380174e-7,0.00001120125,0.0000288219],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7594851,"threshold_uncertainty_score":0.7161303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3080963199","doi":"10.22266/ijies2020.1031.45","title":"Football Game Based Optimization: an Application to Solve Energy Commitment Problem","year":2020,"lang":"en","type":"article","venue":"International journal of intelligent engineering and systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Villum Fonden","keywords":"Computer science; Football; Mathematical optimization; Operations research; Mathematics; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.02494442093663609,"gpt":0.2566309651829805,"spread":0.2316865442463444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783852,0.0001422144,0.000194475,0.0001921993,0.00002448243,0.0003136537,0.0009210499,0.00004818671,0.000005562206],"category_scores_gemma":[0.00007117348,0.0001304783,0.00006442252,0.0001766413,0.00001233606,0.0003371957,0.00009011244,0.00010923,0.00000722849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001048582,"about_ca_system_score_gemma":0.00004946647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003829153,"about_ca_topic_score_gemma":0.000001747799,"domain_scores_codex":[0.9984818,0.00002666948,0.0006300982,0.000213203,0.000505914,0.0001423877],"domain_scores_gemma":[0.9986634,0.00008129983,0.000230765,0.0001579385,0.0005848116,0.0002817909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000176025,0.0000412217,0.00007078574,0.00001168993,0.00005077238,0.00001652998,0.0007752992,0.964065,0.001025484,0.02303803,0.0001067289,0.01078086],"study_design_scores_gemma":[0.00006898203,0.0002641293,0.00001343362,0.00008844713,0.000005352269,0.00004461104,0.0001054275,0.9797093,0.005211582,0.00007172815,0.01428685,0.0001301803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001646719,0.0002659477,0.9949182,0.002083981,0.0008384391,0.0001246022,0.000002721875,0.00006110156,0.00005834292],"genre_scores_gemma":[0.9180313,0.00004335744,0.0809312,0.0004559018,0.0004926292,0.00001860886,0.000003381808,0.00001398991,0.000009602162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9163846,"threshold_uncertainty_score":0.532075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W84074851","doi":"","title":"Monte-Carlo exploration for deterministic planning","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo method; Monte Carlo tree search; Random walk; Computer science; Mathematical optimization; Hybrid Monte Carlo; Markov chain Monte Carlo; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1131353051604986,"gpt":0.3519815830720948,"spread":0.2388462779115963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001173623,0.00007146821,0.00007502855,0.00004928817,0.0000924935,0.0001477624,0.0003878153,0.00003103244,0.000005044229],"category_scores_gemma":[0.00009732207,0.00006411452,0.00003678848,0.0001031258,0.00001305576,0.0006708519,0.00002677225,0.00003434851,0.00004446406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001611334,"about_ca_system_score_gemma":0.00001976057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003864879,"about_ca_topic_score_gemma":0.000003738025,"domain_scores_codex":[0.9993393,0.00001120374,0.0001665041,0.0002056235,0.0001053265,0.0001720423],"domain_scores_gemma":[0.9995002,0.0001111739,0.00004094881,0.0002446186,0.00005982759,0.00004330221],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001764976,0.00007081167,0.000170564,0.000005724485,0.000005851416,0.00001462908,0.004621605,0.01487786,0.001720467,0.1899346,0.005240322,0.7833199],"study_design_scores_gemma":[0.00004029629,0.0002653381,0.0002299655,0.0000121747,0.000002385312,0.000003367798,0.0001739778,0.9214515,0.01396915,0.06096607,0.002743452,0.0001422969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009182752,0.00002536958,0.986322,0.001289535,0.0002268213,0.0001588903,3.239008e-7,0.0002047601,0.00258948],"genre_scores_gemma":[0.9089494,0.000001104483,0.0897879,0.0006516965,0.00007709032,0.00001737359,2.937618e-7,0.000002911539,0.0005121716],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9065737,"threshold_uncertainty_score":0.2614514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2230033167","doi":"","title":"Adversarial hierarchical-task network planning for complex real-time games","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Adversarial system; Task (project management); Tree (set theory); Theoretical computer science; Artificial intelligence; Combinatorial game theory; Point (geometry); Machine learning; Game theory; Sequential game; Monte Carlo method; Mathematics; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2196141500131067,"gpt":0.3844458776644416,"spread":0.1648317276513349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001122579,0.0004352031,0.0004443931,0.0002876491,0.0002823348,0.0007771936,0.003000899,0.0001997914,0.0003769785],"category_scores_gemma":[0.0009957586,0.0004368837,0.000218917,0.000469747,0.0003571826,0.0007294715,0.0004633765,0.0003843583,0.001472822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002374428,"about_ca_system_score_gemma":0.000423598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001135411,"about_ca_topic_score_gemma":0.00003964802,"domain_scores_codex":[0.9958414,0.0001839089,0.001038989,0.001059732,0.001058321,0.0008175834],"domain_scores_gemma":[0.9965402,0.0007817853,0.0003635438,0.0007657153,0.001118627,0.0004300509],"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.0003970435,0.0001665197,0.00006069941,0.000004699281,0.00006120111,0.00002713535,0.001735777,0.02577572,0.003959497,0.8764124,0.008610667,0.08278864],"study_design_scores_gemma":[0.00005760931,0.0003553838,0.00003467972,0.00007741375,0.000007981005,0.000009313992,0.0002896855,0.5718582,0.006375813,0.4119817,0.008559006,0.0003931655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00332312,0.0000197209,0.9400339,0.006757567,0.003843905,0.0006365278,0.00004328124,0.000488513,0.04485352],"genre_scores_gemma":[0.9125475,0.00003035927,0.08324226,0.0009664151,0.001946631,0.0001492454,0.00007346783,0.00004284741,0.001001219],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9092245,"threshold_uncertainty_score":0.9998083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102669142","doi":"10.1109/tciaig.2011.2161310","title":"A Generic Approach to Challenge Modeling for the Procedural Creation of Video Game Levels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Generative grammar; Entertainment; Fitness function; Generative Design; Video game; Generative model; Constraint (computer-aided design); Multimedia; Human–computer interaction; Artificial intelligence; Function (biology); Genetic algorithm; Game design; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1476889815550019,"gpt":0.3228816404081994,"spread":0.1751926588531975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002965963,0.000175544,0.0001944675,0.0002721024,0.0001323026,0.00006101407,0.0005235699,0.00006733608,0.000008534752],"category_scores_gemma":[0.00002296048,0.0001419656,0.0000885803,0.0004910213,0.0001161604,0.0003897917,0.000007705733,0.0001596996,0.000008437557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003685892,"about_ca_system_score_gemma":0.00008762052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001082665,"about_ca_topic_score_gemma":0.00003697459,"domain_scores_codex":[0.9985498,0.00004255517,0.0004863574,0.0004250385,0.0002618241,0.0002344671],"domain_scores_gemma":[0.9989441,0.0004040773,0.00008218525,0.0002314337,0.0002704003,0.0000677858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003627724,0.0002060698,0.000003417766,0.00002321993,0.00001885716,3.021032e-7,0.007611731,0.8373551,0.00005425789,0.01778956,0.000007839618,0.1368933],"study_design_scores_gemma":[0.00004512935,0.0001976227,0.00009455913,0.00004992172,0.00001009125,0.000006689527,0.0007501392,0.9443415,0.009754079,0.04456904,0.00002631946,0.0001548917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006951858,0.0001379996,0.9910008,0.0008537394,0.0002004781,0.0006055203,0.00000880981,0.00004685545,0.0001939611],"genre_scores_gemma":[0.910043,0.00005787354,0.08910814,0.0004709491,0.00002554109,0.0002463059,7.932812e-7,0.00001124777,0.00003615224],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9030911,"threshold_uncertainty_score":0.5789191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W24557711","doi":"10.1007/s12185-014-1536-8","title":"Towards Fuzzy Agents with Dynamic Personality for Human Behavior Simulation","year":2003,"lang":"en","type":"article","venue":"International Journal of Hematology","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Personality; Fuzzy logic; Psychology; Representation (politics); Cognitive psychology; Artificial intelligence; Social psychology; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05617438159950045,"gpt":0.3913061455232036,"spread":0.3351317639237032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003654043,0.0001058659,0.0002000527,0.0001760911,0.00006863177,0.00007584166,0.0007860805,0.00006231706,0.00006629748],"category_scores_gemma":[0.000194499,0.00008699332,0.0001136161,0.00008094269,0.00007608355,0.0003900243,0.00004171644,0.0001247583,0.000008178898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000113689,"about_ca_system_score_gemma":0.0001261226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001091225,"about_ca_topic_score_gemma":0.00003065172,"domain_scores_codex":[0.9987061,0.00007120437,0.0004711461,0.0001677936,0.0004210124,0.0001627158],"domain_scores_gemma":[0.9982928,0.0001564649,0.0004311691,0.0001456039,0.0009104955,0.0000634686],"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.0001758889,0.0008222582,0.02977837,0.00002353631,0.0003991107,0.0005886313,0.002298366,0.009154467,0.001489694,0.9167861,0.0004819488,0.03800168],"study_design_scores_gemma":[0.004709281,0.003674379,0.04639353,0.0004061469,0.0002858618,0.01539518,0.001318616,0.2219459,0.08376783,0.5951741,0.02531256,0.00161653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3352976,0.00004485237,0.6624406,0.0006841685,0.0007954134,0.0001118269,0.000002945931,0.00001482337,0.000607789],"genre_scores_gemma":[0.9684172,0.000002689586,0.03128072,0.0001710449,0.0000490523,0.000009619192,0.000001781179,0.000007919465,0.00006003583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6331196,"threshold_uncertainty_score":0.3547485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012061263","doi":"10.1016/s0004-3702(01)00165-5","title":"Games, computers, and artificial intelligence","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Artificial intelligence; Computer science; Artificial Sweetener; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.08793558553946206,"gpt":0.2975744220529197,"spread":0.2096388365134576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008379681,0.000632952,0.0005791581,0.0004589724,0.000619312,0.001077062,0.002458892,0.0002794924,0.0006680625],"category_scores_gemma":[0.0005219692,0.0006478434,0.0002085098,0.001552814,0.0008783804,0.001456878,0.0009309169,0.0006392334,0.00347864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001123052,"about_ca_system_score_gemma":0.00005323443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001824829,"about_ca_topic_score_gemma":0.0001470998,"domain_scores_codex":[0.9945994,0.0002373391,0.001513786,0.00160166,0.0008298823,0.001217933],"domain_scores_gemma":[0.9964821,0.0008334204,0.0003291804,0.001512736,0.000323223,0.0005193254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008021105,0.0001632465,0.00004179598,0.00001026541,0.00001760267,0.0000490008,0.00177246,0.00049411,0.0006774617,0.4495963,0.0004430857,0.5467266],"study_design_scores_gemma":[0.000007943509,0.0002457774,0.00003604279,0.00005789486,0.00001550728,0.00009144581,0.0006711804,0.5346528,0.08217529,0.3778071,0.003492168,0.0007468557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01035527,0.001153327,0.9761832,0.005939893,0.001923509,0.0005214951,0.000007679502,0.0007625979,0.003153006],"genre_scores_gemma":[0.9435133,0.0004744229,0.05411265,0.001055362,0.0004896672,0.00004971852,0.000003126576,0.00004893848,0.0002527869],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.933158,"threshold_uncertainty_score":0.9999599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W182596629","doi":"","title":"Temporal difference learning applied to a high-performance game-playing program","year":2001,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Task (project management); Temporal difference learning; Artificial intelligence; Class (philosophy); Function (biology); Sequential game; Machine learning; Game design; Reinforcement learning; Game theory; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09513926961760284,"gpt":0.3262099561051989,"spread":0.231070686487596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006388062,0.0005936211,0.0005077993,0.0006947907,0.0003933024,0.001188571,0.002981506,0.0001950571,0.0006445402],"category_scores_gemma":[0.0004697356,0.0005846684,0.0001467276,0.001107186,0.0002563161,0.0006565018,0.0007102067,0.0008644276,0.004036595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002812037,"about_ca_system_score_gemma":0.0002123794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002344312,"about_ca_topic_score_gemma":0.000145955,"domain_scores_codex":[0.9948238,0.0001224489,0.001267592,0.001424592,0.001380285,0.0009813416],"domain_scores_gemma":[0.9973082,0.0002343626,0.0003985288,0.0008981341,0.0007356917,0.0004250838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001140111,0.0003175821,0.0009423667,0.000006290578,0.00002800787,0.00004291904,0.0008677747,0.008346178,0.00984059,0.3299933,0.00003408394,0.6494669],"study_design_scores_gemma":[0.00008863163,0.001381142,0.006412697,0.0003566622,0.0000121714,0.00007313331,0.0007697775,0.7492551,0.1617557,0.07353584,0.004808409,0.001550796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3712018,0.000006750897,0.6070241,0.003646167,0.001664013,0.0007811009,0.000004422758,0.0008809793,0.01479064],"genre_scores_gemma":[0.9693337,0.00007157143,0.02793289,0.0009317478,0.0003951338,0.0003803303,0.00001763353,0.00004238584,0.0008946257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7409089,"threshold_uncertainty_score":0.9998483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123018439","doi":"10.65109/umek3334","title":"Abstraction pathologies in extensive games","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Abstraction; Computer science; Solver; Combinatorial game theory; Sequential game; Extensive-form game; Game theory; Repeated game; Theoretical computer science; Mathematical economics; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03659273412157045,"gpt":0.3077348041073538,"spread":0.2711420699857833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001274364,0.00006531562,0.00007733633,0.00009008887,0.00002587892,0.00007310144,0.0003317821,0.0000416582,0.00002226292],"category_scores_gemma":[0.000113185,0.00005522672,0.00002461512,0.0001980753,0.00002674028,0.0005185289,0.00003915212,0.00008742909,0.0002062924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002495521,"about_ca_system_score_gemma":0.00001579055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000299536,"about_ca_topic_score_gemma":0.00002002122,"domain_scores_codex":[0.9993327,0.00002059198,0.0001591508,0.0002139258,0.000106497,0.0001671523],"domain_scores_gemma":[0.9995615,0.00006837503,0.00003540678,0.0002603834,0.00005130765,0.00002303135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000003695134,0.00009568724,0.001068905,8.821125e-7,0.000001002135,0.0001169182,0.00111525,0.0006376186,0.005239822,0.1120228,0.0009634577,0.878734],"study_design_scores_gemma":[0.00007844939,0.0003364549,0.4371912,0.00002450371,0.000001540396,0.00007950853,0.001413073,0.03456466,0.142289,0.3813343,0.002300616,0.0003866327],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4317277,0.0001555845,0.5167361,0.007962072,0.0005035772,0.0001683955,2.044921e-7,0.000542487,0.0422039],"genre_scores_gemma":[0.9740448,0.00002663461,0.02469091,0.0008792921,0.00002310298,0.000002495448,1.461374e-7,0.000001397364,0.0003312184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8783474,"threshold_uncertainty_score":0.265154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114793692","doi":"10.1609/aaai.v28i1.8810","title":"Solving Imperfect Information Games Using Decomposition","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures; Compute Canada","keywords":"Perfect information; Computer science; Decomposition; Extensive-form game; Imperfect; Sequential game; Subgame perfect equilibrium; Mathematical optimization; Nash equilibrium; Normal-form game; Construct (python library); Combinatorial game theory; Subgame; Game theory; Best response; Mathematical economics; Mathematics; Epsilon-equilibrium","retraction":null,"screen_n_in":null,"score":{"opus":0.05366474124327942,"gpt":0.3096907656912596,"spread":0.2560260244479802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951126,0.0002918089,0.0003090031,0.0002638886,0.0003858155,0.0006333635,0.002238525,0.0001321402,0.00005969048],"category_scores_gemma":[0.0008539945,0.0002322007,0.000174488,0.0008032338,0.0003038426,0.002208771,0.0004945284,0.0003351383,0.000201473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001013565,"about_ca_system_score_gemma":0.00009749853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009535409,"about_ca_topic_score_gemma":0.000007842199,"domain_scores_codex":[0.9975267,0.00004463673,0.0008788415,0.0004245449,0.0006567389,0.0004685173],"domain_scores_gemma":[0.9976628,0.0001931849,0.0006676159,0.0004403323,0.0009246652,0.0001114395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002694909,0.00005838148,0.0002242731,0.00003358324,0.00001059462,9.64569e-8,0.00160577,0.0008056458,0.06779741,0.7776586,0.00007316985,0.1517055],"study_design_scores_gemma":[0.000009964339,0.0001171153,0.00008736813,0.0001547542,0.000008633204,0.000006171011,0.0003359925,0.4050967,0.4777718,0.1161208,0.0001062388,0.0001845098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3791731,0.00001400697,0.6039934,0.001861158,0.0009806869,0.0005073589,0.000002958892,0.000226592,0.01324065],"genre_scores_gemma":[0.9846784,0.00001468127,0.01477651,0.0003677846,0.0001091025,0.00001712808,6.138098e-7,0.00001246274,0.00002336372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6615378,"threshold_uncertainty_score":0.9468868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112320870","doi":"10.1145/2702123.2702242","title":"Now You Can Compete With Anyone","year":2015,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Software deployment; Load balancing (electrical power); Multimedia; Human–computer interaction; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0528076355882725,"gpt":0.2736525821452432,"spread":0.2208449465569707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001620105,0.00008893683,0.00009663305,0.00004530935,0.00004296733,0.0001197883,0.0006723525,0.0000247759,0.00003076082],"category_scores_gemma":[0.00002204917,0.000063218,0.00001646114,0.0002724702,0.00007878087,0.0002599291,0.0001505945,0.00006868289,0.0004971082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003473211,"about_ca_system_score_gemma":0.0001169172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002858404,"about_ca_topic_score_gemma":0.001098984,"domain_scores_codex":[0.9991248,0.00002356752,0.0001196448,0.0002386195,0.000274742,0.0002186251],"domain_scores_gemma":[0.9991471,0.00002965299,0.00003483349,0.0004672315,0.0001496956,0.0001714794],"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.00004227903,0.0002980271,0.05581095,0.00001244373,0.00006818726,0.00025276,0.0123517,0.003710479,0.00148497,0.749028,0.05777268,0.1191675],"study_design_scores_gemma":[0.0008266687,0.002271404,0.005831494,0.00008615482,0.00002461798,0.0003162326,0.003553771,0.4006696,0.2851754,0.05908171,0.240082,0.002080932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04989692,0.0000390178,0.8902764,0.005611675,0.0003414017,0.0001152219,7.965268e-7,0.0003760034,0.05334258],"genre_scores_gemma":[0.8967193,0.000001625924,0.09812132,0.0007304935,0.00005907251,0.000005050862,5.418697e-7,0.000006460529,0.004356098],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8468224,"threshold_uncertainty_score":0.6389486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1511096005","doi":"10.1609/aimag.v33i3.2419","title":"Real‐Time Strategy Game Competitions","year":2012,"lang":"en","type":"article","venue":"AI Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Multitude; Order (exchange); Computer science; Operations research; Management science; Data science; Engineering; Business; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.02933503070841547,"gpt":0.2981434790828846,"spread":0.2688084483744691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002126853,0.0001237698,0.0001331084,0.00007536072,0.00007796804,0.000112298,0.0006001849,0.00005238185,0.0007557381],"category_scores_gemma":[0.00003344322,0.0001172672,0.0000541921,0.0003224173,0.0000877073,0.0009293344,0.0001784567,0.000127821,0.01677487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003422766,"about_ca_system_score_gemma":0.00004113125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003624035,"about_ca_topic_score_gemma":0.00001089966,"domain_scores_codex":[0.9988766,0.00005288823,0.0002228707,0.0002109216,0.0002038218,0.0004328383],"domain_scores_gemma":[0.999041,0.00009523302,0.00005520908,0.0005522953,0.00009053514,0.0001657821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004626588,0.0003239911,0.002264262,0.000009836318,0.000024367,0.00001743462,0.001051116,0.0003681096,0.03516285,0.8726181,0.04676401,0.04139134],"study_design_scores_gemma":[0.0004106609,0.000633302,0.08951771,0.0001048097,0.00005469368,0.0002467016,0.000156854,0.1579024,0.05573383,0.1179774,0.5752839,0.00197764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09353548,0.0003925758,0.499029,0.01123071,0.00177511,0.000499489,0.00001969944,0.001671915,0.391846],"genre_scores_gemma":[0.9802481,0.00003419792,0.01249816,0.0006912536,0.0003356365,0.00001390212,0.00000732229,0.00001341527,0.006157987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8867127,"threshold_uncertainty_score":0.9839907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153816030","doi":"10.7939/r35n5v","title":"Computing Robust Counter-Strategies","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bounding overwatch; Adaptation (eye); Variety (cybernetics); Bayesian probability; Simple (philosophy); Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0451494206295277,"gpt":0.3070415953745863,"spread":0.2618921747450585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005829567,0.00009406594,0.00008825913,0.00007091883,0.0001114771,0.0003226008,0.0007620375,0.00004243013,0.00005453958],"category_scores_gemma":[0.0000259468,0.00008218558,0.00003755968,0.0002724798,0.00006844325,0.0006037923,0.0001903202,0.00009745832,0.000338973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003055349,"about_ca_system_score_gemma":0.00004674703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001086604,"about_ca_topic_score_gemma":0.0001591002,"domain_scores_codex":[0.9989454,0.00001382448,0.000246598,0.0002481535,0.0002117235,0.0003342735],"domain_scores_gemma":[0.9992772,0.0001778078,0.00005098222,0.0003356522,0.00009039275,0.00006799965],"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.000002391116,0.00003525822,0.001321913,0.000004458357,0.000006900659,0.00003998299,0.001470207,0.004078723,0.000636469,0.8445216,0.001401667,0.1464805],"study_design_scores_gemma":[0.0001146992,0.0001690124,0.005682737,0.00004844258,0.000004892632,0.00007347357,0.006732055,0.8356274,0.0735376,0.04826831,0.02894763,0.0007937892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0182887,0.00002803709,0.8610572,0.0002615403,0.0004388696,0.00004919274,8.751875e-8,0.0003442381,0.1195322],"genre_scores_gemma":[0.8661336,0.000001374346,0.1329343,0.000413187,0.000100506,3.289038e-7,2.148267e-7,0.000004443129,0.0004119736],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.847845,"threshold_uncertainty_score":0.4356925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156078757","doi":"10.1109/cig.2007.368082","title":"Adversarial Planning Through Strategy Simulation","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Adversarial system; Software deployment; Nash equilibrium; Video game; Quality (philosophy); Automated planning and scheduling; Game theory; Artificial intelligence; Operations research; Software engineering; Multimedia; Mathematical optimization; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09375477713319037,"gpt":0.3799972725835327,"spread":0.2862424954503423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002837188,0.00007178032,0.00006403093,0.0000395114,0.00008486483,0.00009287438,0.0003787527,0.00005283012,0.00006687125],"category_scores_gemma":[0.00004955228,0.00006481503,0.00002941241,0.0002138732,0.00002887754,0.0007919177,0.00007974375,0.0000746794,0.0001779749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002694203,"about_ca_system_score_gemma":0.00002623548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008076309,"about_ca_topic_score_gemma":0.00001769126,"domain_scores_codex":[0.9991583,0.00001388709,0.0002006408,0.0002047929,0.0001926754,0.0002296524],"domain_scores_gemma":[0.9993864,0.0002405722,0.00004558879,0.0002340098,0.00005407698,0.00003940916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001538458,0.00003028994,0.00101816,0.000001887634,0.000007603431,0.00003110576,0.002836847,0.5236338,0.0006615866,0.3612276,0.0003428409,0.1101928],"study_design_scores_gemma":[0.00007165406,0.00008579602,0.001491042,0.000008190985,0.000002215453,0.00000324691,0.0005329243,0.901992,0.03291146,0.05548546,0.007213166,0.0002028181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01855468,0.00001944816,0.9179109,0.00008271966,0.0004426519,0.00006235544,1.008807e-7,0.000210857,0.06271632],"genre_scores_gemma":[0.9515848,4.359309e-7,0.04767115,0.0002297784,0.0001772155,5.461185e-7,5.061717e-7,0.000003640415,0.0003319026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9330301,"threshold_uncertainty_score":0.264308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W190498140","doi":"10.1609/aaai.v26i1.8269","title":"Finding Optimal Abstract Strategies in Extensive-Form Games","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; Alberta Innovates; Western Canada Research Grid; Compute Canada","keywords":"Nash equilibrium; Extensive-form game; Computer science; Sequential game; Mathematical economics; Limit (mathematics); Normal-form game; Solution concept; Repeated game; Best response; State space; Epsilon-equilibrium; Symmetric game; Computation; Mathematical optimization; Combinatorial game theory; Strategy; Equilibrium selection; Game theory; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.09497848147463588,"gpt":0.3277930247737362,"spread":0.2328145432991003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006899484,0.0003717362,0.0004555616,0.0002557493,0.0002176034,0.0006669171,0.002558229,0.0001761606,0.000276352],"category_scores_gemma":[0.001036704,0.000309118,0.0002149099,0.001434744,0.0004453576,0.001458263,0.0007133846,0.0006442739,0.0001798431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001104398,"about_ca_system_score_gemma":0.0004689017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009675774,"about_ca_topic_score_gemma":0.000104992,"domain_scores_codex":[0.9965433,0.00002627042,0.001124462,0.0008674866,0.0007511107,0.0006873868],"domain_scores_gemma":[0.9972483,0.00026779,0.000536577,0.0005530427,0.001270954,0.0001233538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003647793,0.0002164615,0.0004432646,0.00004496199,0.00001514778,0.0000109858,0.00358198,0.0008436158,0.06567398,0.8765774,0.0001189274,0.05243684],"study_design_scores_gemma":[0.00001885657,0.00009725558,0.001391546,0.0003729921,0.000006965768,0.00001570838,0.00721336,0.03278843,0.718546,0.2390743,0.0001391036,0.0003354252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9192082,0.0001389512,0.02488516,0.005197581,0.001337272,0.0005523089,0.000007313203,0.0002011545,0.04847202],"genre_scores_gemma":[0.9930519,0.00009913379,0.00608379,0.0001777978,0.00008849217,0.00003119586,6.520198e-7,0.0000200982,0.0004468699],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.652872,"threshold_uncertainty_score":0.9999361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W196854640","doi":"10.1609/aiide.v3i1.18778","title":"Memory-Efficient Abstractions for Pathfinding","year":2007,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Abstraction; Computer science; Perspective (graphical); Path (computing); Work (physics); State (computer science); Human–computer interaction; Theoretical computer science; Programming language; Shortest path problem; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05392906527082882,"gpt":0.3095958223270369,"spread":0.2556667570562081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005829938,0.0003002132,0.000279772,0.0002236632,0.000301823,0.000628186,0.001092332,0.00008607545,0.00002933343],"category_scores_gemma":[0.0004875578,0.0002288362,0.000214678,0.0002918742,0.0003305862,0.0009156395,0.0003983061,0.0002823785,0.00004895636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001494395,"about_ca_system_score_gemma":0.00004693781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000181864,"about_ca_topic_score_gemma":0.000007834603,"domain_scores_codex":[0.9976069,0.00000743322,0.0007907901,0.0006145078,0.0004709218,0.0005094516],"domain_scores_gemma":[0.9980426,0.0004289032,0.0004940952,0.0002603104,0.0006255334,0.0001485048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002281524,0.000599951,0.000201074,0.00003641122,0.00005765826,0.00000123438,0.004426531,0.0001697047,0.01906813,0.5385525,0.0000930295,0.4365656],"study_design_scores_gemma":[0.00004407019,0.0005305798,0.0003149543,0.0002561645,0.00001542203,0.0000126219,0.009196064,0.02783027,0.9030541,0.0579751,0.000444924,0.0003257353],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4507846,0.00002759211,0.515707,0.003000759,0.001298205,0.00142213,0.00003418944,0.000119117,0.02760645],"genre_scores_gemma":[0.9982224,0.00001033301,0.001059073,0.0002043586,0.00007991851,0.00005399918,0.000001317847,0.00001629884,0.0003523671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.883986,"threshold_uncertainty_score":0.9331669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152070548","doi":"10.1109/re.2006.19","title":"Emotional Requirements in Video Games","year":2006,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Human–computer interaction; Video game; Emotional expression; Multimedia; Cognitive psychology; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.0389813789453596,"gpt":0.2983603652367821,"spread":0.2593789862914225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001682347,0.00006544331,0.00006599804,0.00009697427,0.0000310981,0.00007855301,0.0004599061,0.00002840356,0.0001724847],"category_scores_gemma":[0.00002580126,0.00005966819,0.00002640213,0.0002703142,0.00003492238,0.0004635231,0.0001194142,0.00004989611,0.0004022111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004435244,"about_ca_system_score_gemma":0.00002787341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004654195,"about_ca_topic_score_gemma":0.0003477745,"domain_scores_codex":[0.9991107,0.00002428805,0.0002217853,0.000227501,0.0002221614,0.0001935721],"domain_scores_gemma":[0.9996216,0.00004779001,0.0000305846,0.0002410766,0.00003558896,0.0000234158],"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.00000190186,0.0001437431,0.04484021,0.000002941986,0.000002464027,0.00002034221,0.0001541825,0.001298555,0.001776302,0.8919221,0.01053563,0.04930168],"study_design_scores_gemma":[0.0001774171,0.00007134971,0.1773706,0.00004969477,0.000001456096,0.00001286404,0.00007792229,0.1581029,0.07143959,0.5732909,0.0189567,0.0004485662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.127746,0.000053613,0.7823458,0.00227671,0.0003954576,0.000111865,4.177867e-7,0.0001871879,0.08688288],"genre_scores_gemma":[0.9647093,0.00000185797,0.03209999,0.0003012074,0.00006522507,0.00000640434,8.211141e-7,0.00000310207,0.002812025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8369634,"threshold_uncertainty_score":0.5169744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1589331835","doi":"10.1007/11424918_9","title":"Heuristic Search Applied to Abstract Combat Games","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristic; Adversarial system; Tournament; Artificial intelligence; Mathematical optimization; Theoretical computer science; Operations research; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03450216205097408,"gpt":0.2919005191359224,"spread":0.2573983570849483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001179915,0.0007179963,0.0007032901,0.001237841,0.0003173685,0.001017846,0.006425225,0.0003774472,0.0001323154],"category_scores_gemma":[0.0001393256,0.0006858695,0.0001528414,0.0009147303,0.000925888,0.0004830731,0.002348344,0.001254612,0.001295834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005091341,"about_ca_system_score_gemma":0.0006697004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005054485,"about_ca_topic_score_gemma":0.000142502,"domain_scores_codex":[0.993982,0.00002451515,0.0008194754,0.002244229,0.001741029,0.001188795],"domain_scores_gemma":[0.9959287,0.0009084814,0.0002130631,0.002177043,0.0003232715,0.0004494644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006991329,0.00003452627,0.00001196743,0.00002098387,0.000007478487,0.00007097379,0.00100866,0.1055011,0.0003178243,0.04637884,0.0001001718,0.8465405],"study_design_scores_gemma":[0.000291657,0.0005735687,0.0008537646,0.0009919169,0.00002128812,0.0001539788,0.000002354787,0.569946,0.0303438,0.3626853,0.03046364,0.003672733],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002065188,0.0002451869,0.9758896,0.001697439,0.00151617,0.0007277135,0.000006427911,0.0002966718,0.01941432],"genre_scores_gemma":[0.5985713,0.00003955721,0.3956841,0.003567211,0.001124991,0.00002394784,0.000003990484,0.0000691563,0.000915731],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8428677,"threshold_uncertainty_score":0.9995592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}