{"meta":{"query_hash":"68502a2299b6","filters":{"topic":"Artificial Intelligence in Games"},"cohort_total":925,"direct_labels_cover":0,"predictions_cover":925,"exported":925,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/68502a2299b6","api":"https://metacan.xera.ac/api/v1/cohort?topic=Artificial+Intelligence+in+Games"},"results":[{"id":"W101213734","doi":"10.1007/978-3-642-21219-2_7","title":"Using Artificial Intelligence Techniques for Strategy Generation in the Commons Game","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Resource (disambiguation); Artificial intelligence; Commons; Hill climbing; Particle swarm optimization; Operations research; Climbing; Machine learning; Engineering","score_opus":0.1742777273187105,"score_gpt":0.34486408099615923,"score_spread":0.17058635367744873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101213734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016275715,0.00019662172,0.9956252,0.0006087392,0.0008700836,0.0011174906,0.000005430561,0.0001124934,0.0013011845],"genre_scores_gemma":[0.5679835,0.000026849093,0.43034142,0.0007764139,0.00075888657,0.000051953033,0.000005454618,0.000032136497,0.000023350585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624056,0.00009393091,0.00091246003,0.0013173448,0.0007183815,0.0007173455],"domain_scores_gemma":[0.99722904,0.0006545454,0.00036106867,0.0014130421,0.00025989045,0.0000824377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020240485,0.0005070578,0.00045547335,0.00081201707,0.0003020171,0.00082656473,0.0046220655,0.00038312204,0.00001520126],"category_scores_gemma":[0.00013969993,0.00040870122,0.00014949888,0.00074694696,0.0009689184,0.00075019134,0.0006132429,0.0008168202,0.000016095197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004329009,0.00003579087,0.000007658957,0.000010016411,0.0000028169627,0.00001881539,0.0014913642,0.026291527,0.00030808715,0.34952292,0.000005226052,0.62230146],"study_design_scores_gemma":[0.000008073641,0.00013589459,0.0000038028932,0.00007857642,0.0000040287587,0.0000244946,9.677743e-7,0.485771,0.01932132,0.49417233,0.0001866241,0.00029285846],"about_ca_topic_score_codex":0.00017114004,"about_ca_topic_score_gemma":0.0014514019,"teacher_disagreement_score":0.62200856,"about_ca_system_score_codex":0.00028398627,"about_ca_system_score_gemma":0.00053268095,"threshold_uncertainty_score":0.9998365},"labels":[],"label_agreement":null},{"id":"W11034078","doi":"10.1609/aaai.v25i1.7813","title":"Block A*: Database-Driven Search with Applications in Any-Angle Path-Planning","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block (permutation group theory); Grid; Path (computing); Any-angle path planning; Computer science; Boundary (topology); Variety (cybernetics); Motion planning; Algorithm; City block; Database; Mathematics; Artificial intelligence; Geometry; Geography","score_opus":0.148062709564316,"score_gpt":0.3223104162119302,"score_spread":0.1742477066476142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11034078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7410979,0.000077373246,0.21424498,0.00130825,0.0003382201,0.0021975557,0.000022770277,0.00035831268,0.040354647],"genre_scores_gemma":[0.9799788,0.000019058127,0.019602021,0.000095775365,0.000046792164,0.000120006654,0.0000010360897,0.000022207481,0.0001143199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99719834,0.000033989312,0.0006991755,0.0007874209,0.0006766146,0.00060446595],"domain_scores_gemma":[0.99801874,0.00014247814,0.00033479207,0.0006695412,0.0006881847,0.00014628367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000580776,0.00031469058,0.00033221167,0.00029322068,0.0002435167,0.00018911375,0.0033823124,0.00010948575,0.00006796495],"category_scores_gemma":[0.0001513874,0.00022921088,0.000087391556,0.0015420924,0.0005325383,0.0007361078,0.0006290931,0.0005315217,0.00012941183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008894435,0.00046864935,0.016647117,0.0000497354,0.000019303558,0.0000047310878,0.009928179,0.00031640165,0.023554755,0.9341998,0.00006231262,0.014660053],"study_design_scores_gemma":[0.000032104945,0.00039297374,0.0017461742,0.00055043236,0.00001615138,0.000012891022,0.0048478227,0.07302496,0.85206217,0.06671755,0.00010725752,0.00048952835],"about_ca_topic_score_codex":0.0002763401,"about_ca_topic_score_gemma":0.000057525376,"teacher_disagreement_score":0.86748224,"about_ca_system_score_codex":0.00007197913,"about_ca_system_score_gemma":0.00017795124,"threshold_uncertainty_score":0.9346948},"labels":[],"label_agreement":null},{"id":"W1113434642","doi":"10.1609/socs.v6i1.18358","title":"Sibling Conspiracy Number Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Heuristic; Champion; Computer science; Null-move heuristic; Iterative deepening depth-first search; Tree (set theory); Game tree; Search algorithm; Node (physics); Search tree; Beam search; Incremental heuristic search; Bidirectional search; Theoretical computer science; Mathematics; Algorithm; Artificial intelligence; Monte Carlo method; Statistics; Combinatorics; Game theory; Sequential game; Mathematical economics; Engineering","score_opus":0.033329488121590305,"score_gpt":0.311779623732312,"score_spread":0.2784501356107217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1113434642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84152853,0.000021919477,0.0009192148,0.025622861,0.008046721,0.00031640785,0.0000070223896,0.00013036022,0.12340693],"genre_scores_gemma":[0.99682593,0.00002748216,0.0011467934,0.00033546472,0.00043523233,0.000013576502,0.0000010472811,0.000017237133,0.0011972426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996901,0.000040577717,0.000423444,0.0005057335,0.0017697446,0.0003595009],"domain_scores_gemma":[0.9969449,0.0003999268,0.00013088867,0.00029441318,0.0021238232,0.0001060533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010270526,0.00016466796,0.00019245577,0.000087908105,0.00021997413,0.00050684385,0.0030897164,0.000098293785,0.00013975325],"category_scores_gemma":[0.0005667626,0.00013812333,0.00017285314,0.0008005489,0.00021255715,0.0005665918,0.0015873528,0.00046644956,0.0001819017],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039346356,0.00025755243,0.009333632,0.00001944687,0.00005079918,0.000004651475,0.0005774435,0.00012702077,0.08704254,0.8996911,0.0009856797,0.0018707591],"study_design_scores_gemma":[0.00026097562,0.000054968274,0.00038341008,0.000108625856,0.0000051928955,0.000027440465,0.00018634825,0.0061350544,0.9425625,0.044190485,0.005914536,0.00017045553],"about_ca_topic_score_codex":0.00010131862,"about_ca_topic_score_gemma":0.0000014953032,"teacher_disagreement_score":0.85551995,"about_ca_system_score_codex":0.00021143477,"about_ca_system_score_gemma":0.00022107856,"threshold_uncertainty_score":0.57415134},"labels":[],"label_agreement":null},{"id":"W113188094","doi":"","title":"Effective team strategies using dynamic scripting","year":2012,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Scripting language; Computer science; Task (project management); Process (computing); Human–computer interaction; Programming language; Engineering","score_opus":0.034268632639660755,"score_gpt":0.3277777094603398,"score_spread":0.29350907682067906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113188094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23033644,0.00012407875,0.7512539,0.000037447302,0.00059281336,0.00012140846,1.3620013e-7,0.00020262889,0.01733115],"genre_scores_gemma":[0.907734,0.0000012164527,0.091949284,0.00009163103,0.00008080435,0.0000059193367,1.3402232e-7,0.0000065323725,0.00013051083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904567,0.000061614024,0.00015295752,0.00018814985,0.00015937377,0.00039226058],"domain_scores_gemma":[0.9994093,0.00011927368,0.000052415504,0.00028849777,0.00005167115,0.000078844634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003392845,0.00010652718,0.000099865465,0.00007057221,0.00013790878,0.00023090318,0.00043223082,0.000042338168,0.000026551374],"category_scores_gemma":[0.000053853666,0.00009069569,0.00004163011,0.00024182569,0.00005792961,0.0020864038,0.0002016275,0.00010238255,0.00019293245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047440058,0.00016776094,0.010818317,0.000025275947,0.000040765266,0.0000049181876,0.010920514,0.0037528481,0.07855074,0.5997366,0.0002675418,0.29570997],"study_design_scores_gemma":[0.000033626733,0.000050608913,0.0032192473,0.00002816849,0.000006958906,0.00003069424,0.0035817104,0.9254028,0.05203439,0.014630132,0.0006583095,0.0003233186],"about_ca_topic_score_codex":0.00016045354,"about_ca_topic_score_gemma":0.000022803435,"teacher_disagreement_score":0.92165,"about_ca_system_score_codex":0.00008384436,"about_ca_system_score_gemma":0.00003815635,"threshold_uncertainty_score":0.3698463},"labels":[],"label_agreement":null},{"id":"W1161663632","doi":"","title":"Bad Games Panel [Abstracts]","year":2009,"lang":"en","type":"article","venue":"Digital Games Research Association Conference","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer security","score_opus":0.13698524561016107,"score_gpt":0.37543753843099004,"score_spread":0.23845229282082897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1161663632","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17422527,0.000466819,0.17675188,0.055220217,0.0010862207,0.0014802325,0.000100561985,0.0016854883,0.5889833],"genre_scores_gemma":[0.9852293,0.000089576424,0.0011960758,0.00032323325,0.00015101244,0.000024145334,0.000014435504,0.000010852883,0.012961377],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953716,0.00021678422,0.0005707685,0.00070629636,0.0020350781,0.0010994914],"domain_scores_gemma":[0.9958268,0.0011833555,0.00025627075,0.0007385117,0.0016852267,0.00030986275],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016676277,0.00022706964,0.00027996907,0.0003282493,0.00025714238,0.00350856,0.0019266345,0.00019626136,0.00009349193],"category_scores_gemma":[0.0055357516,0.00022355703,0.00012419984,0.0010283901,0.00013419891,0.0028453013,0.00031879896,0.00069244445,0.0017595469],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013677664,0.00027778855,0.004846704,0.00000639439,0.000033299813,0.000036487098,0.0018348844,0.00007916403,0.0010944369,0.10739631,0.015245388,0.86913544],"study_design_scores_gemma":[0.00053797994,0.0012923158,0.17636506,0.00021988824,0.000009522495,0.00002192048,0.0017419985,0.043768607,0.036554877,0.4758585,0.2619977,0.0016316288],"about_ca_topic_score_codex":0.00003763428,"about_ca_topic_score_gemma":0.000017974984,"teacher_disagreement_score":0.8675038,"about_ca_system_score_codex":0.0004963009,"about_ca_system_score_gemma":0.000455934,"threshold_uncertainty_score":0.9990177},"labels":[],"label_agreement":null},{"id":"W120879277","doi":"10.1609/aiide.v2i1.18751","title":"Modelling Goal-Directed Players in Digital Games","year":2006,"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":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Abstraction; Set (abstract data type); Human–computer interaction; Simple (philosophy); Artificial intelligence; Machine learning","score_opus":0.03386377151643034,"score_gpt":0.2660398504145818,"score_spread":0.23217607889815145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120879277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.894733,0.000043836462,0.0720764,0.0013235232,0.00040425805,0.00071263843,0.000029185556,0.00015751035,0.030519608],"genre_scores_gemma":[0.99872106,0.000027971746,0.00047699406,0.000101347345,0.000051912994,0.00004410539,0.0000031390562,0.00001912741,0.0005543123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972419,0.0000111644795,0.00091699115,0.00075131963,0.0005633695,0.00051525584],"domain_scores_gemma":[0.99856496,0.0002094159,0.0004209184,0.00027080212,0.00043549223,0.00009843819],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00019132861,0.00038840531,0.00038284963,0.00028944077,0.00012639244,0.0012861158,0.0012463647,0.000098816476,0.000022450344],"category_scores_gemma":[0.00021583798,0.00030356122,0.00016909502,0.00053585187,0.0003596964,0.0027390202,0.00053298153,0.00037621876,0.000056754354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000389478,0.0012174181,0.004752026,0.000047008267,0.00005799341,0.000006943579,0.004330083,0.0071526063,0.006351049,0.7916674,0.00019751361,0.18383045],"study_design_scores_gemma":[0.00005946528,0.00042015992,0.00020247143,0.0005256566,0.000007796799,0.000011248294,0.0033001387,0.6132472,0.20056115,0.1809307,0.0002744216,0.0004595587],"about_ca_topic_score_codex":0.0001688631,"about_ca_topic_score_gemma":0.000018124674,"teacher_disagreement_score":0.6107367,"about_ca_system_score_codex":0.00016544624,"about_ca_system_score_gemma":0.00005334575,"threshold_uncertainty_score":0.99994165},"labels":[],"label_agreement":null},{"id":"W121191180","doi":"10.1007/bf03393047","title":"The Veils of Clio: Dimensions of a Behavioral Narratology","year":2007,"lang":"en","type":"article","venue":"The Analysis of Verbal Behavior","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Narratology; Narrative; Disequilibrium; Adaptation (eye); Field (mathematics); Psychology; Narrative inquiry; Epistemology; Sociology; Literature; Computer science; Psychoanalysis; Art; Philosophy; Mathematics; Medicine","score_opus":0.039172411185037066,"score_gpt":0.3532170331674471,"score_spread":0.31404462198241007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121191180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881513,0.00022355725,0.011057899,0.0001604718,0.00015792197,0.00013710008,0.000008472187,0.000017398977,0.00008586801],"genre_scores_gemma":[0.9986137,0.000026392012,0.0012408961,0.0000191837,0.000009880864,0.0000064796914,0.0000017158698,0.000005013436,0.00007670097],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981026,0.00012164489,0.0008233735,0.00021888096,0.00045081016,0.00028265652],"domain_scores_gemma":[0.9973265,0.0005534165,0.000512029,0.001213749,0.0003396615,0.00005465979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153176,0.00012188026,0.0004388309,0.00021262513,0.0001531013,0.000016568325,0.0016587082,0.00007671122,0.000024938105],"category_scores_gemma":[0.000056348767,0.00006615311,0.00042752063,0.0019571157,0.00068792683,0.00011274341,0.00031823225,0.0001355791,0.000006378174],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002162151,0.0025553524,0.41435888,0.000013070014,0.0017131235,0.000056858575,0.017644696,0.0013000309,0.17490922,0.07399132,0.00054522895,0.312696],"study_design_scores_gemma":[0.0002298526,0.0008190488,0.35978612,0.000033572764,0.0076661804,0.00002276534,0.0064932685,0.009245554,0.61285317,0.0016611257,0.0007271936,0.00046212747],"about_ca_topic_score_codex":0.00093192916,"about_ca_topic_score_gemma":0.0013879726,"teacher_disagreement_score":0.43794397,"about_ca_system_score_codex":0.000020490841,"about_ca_system_score_gemma":0.00006819535,"threshold_uncertainty_score":0.308232},"labels":[],"label_agreement":null},{"id":"W121525469","doi":"10.1609/aiide.v4i1.18701","title":"A Demonstration of Agent Learning with Action-Dependent Learning Rates in Computer Role-Playing Games","year":2008,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Action (physics); Artificial intelligence; Human–computer interaction; Machine learning; Programming language","score_opus":0.048780775861862635,"score_gpt":0.2848487029577575,"score_spread":0.23606792709589486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121525469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93897414,0.000018774334,0.056894246,0.00034385367,0.00012676424,0.00036291103,0.0000017291,0.00003781529,0.0032397434],"genre_scores_gemma":[0.9989383,0.0000942542,0.0007133899,0.000042945627,0.000029163371,0.000032230444,0.0000012525926,0.000013018445,0.00013544584],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979007,0.0000382725,0.0007019103,0.00052372436,0.0005182609,0.00031709284],"domain_scores_gemma":[0.9985456,0.00020571669,0.00059014163,0.00014477286,0.00043684762,0.00007694303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023830432,0.00027930373,0.00034066022,0.00023878917,0.00017370108,0.00027257056,0.0006217814,0.0000675109,0.000015869684],"category_scores_gemma":[0.00015580298,0.00020739112,0.000096413285,0.00034947006,0.00035290283,0.0014777872,0.00031178992,0.00048286098,0.000013293647],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010426277,0.0013058337,0.17844316,0.00010620666,0.0001759835,0.000014290037,0.03589368,0.014279989,0.0557752,0.098547764,0.000013373083,0.6144019],"study_design_scores_gemma":[0.000092638635,0.0017621918,0.0029555834,0.000970285,0.000013242415,0.000056654026,0.013792362,0.28496325,0.6880717,0.006884054,0.00003555231,0.00040245827],"about_ca_topic_score_codex":0.00008887584,"about_ca_topic_score_gemma":0.000022924798,"teacher_disagreement_score":0.6322965,"about_ca_system_score_codex":0.00011157324,"about_ca_system_score_gemma":0.00006734198,"threshold_uncertainty_score":0.8457164},"labels":[],"label_agreement":null},{"id":"W122194113","doi":"10.3233/icg-2007-30202","title":"CHECKING LIFE-AND-DEATH PROBLEMS IN GO I: THE PROGRAM SCANLD1","year":2007,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Programming language","score_opus":0.05807505227314331,"score_gpt":0.3283039106135261,"score_spread":0.2702288583403828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122194113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62594336,0.0017694938,0.36338013,0.0044016386,0.0009283667,0.0004450994,1.9550997e-7,0.0001432511,0.0029884516],"genre_scores_gemma":[0.9857994,0.00007775714,0.013412015,0.00031981527,0.0002963435,0.000007478693,5.446174e-8,0.00000833642,0.00007883991],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99855447,0.00006323957,0.00040789004,0.00019289229,0.00033074123,0.0004507605],"domain_scores_gemma":[0.9992182,0.0001476181,0.00015264541,0.00023993527,0.00008102328,0.00016053076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020875323,0.00010730303,0.00012004919,0.00012904427,0.00023410383,0.0005341599,0.0008519561,0.00005495574,0.000012857162],"category_scores_gemma":[0.00013298937,0.00007333352,0.000051494408,0.00037293165,0.00007465289,0.00045361512,0.00018110151,0.0005268307,0.000031955402],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055571068,0.00011776373,0.09401652,0.000007075834,0.000015917267,0.000084080144,0.0049595176,0.0006314249,0.0003176221,0.01275293,0.00022810136,0.88686347],"study_design_scores_gemma":[0.0009641972,0.0012289499,0.53637266,0.0008201599,0.00003228774,0.0046310024,0.0049571567,0.18171786,0.012098706,0.15687633,0.098716855,0.0015838365],"about_ca_topic_score_codex":0.000047554742,"about_ca_topic_score_gemma":0.00023727302,"teacher_disagreement_score":0.88527966,"about_ca_system_score_codex":0.000062016166,"about_ca_system_score_gemma":0.0001017421,"threshold_uncertainty_score":0.5150916},"labels":[],"label_agreement":null},{"id":"W123800271","doi":"10.1609/aaai.v25i1.7880","title":"Automated Action Abstraction of Imperfect Information Extensive-Form Games","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Perfect information; Limit (mathematics); Action (physics); Computer science; Bayesian game; Imperfect; Extensive-form game; Mathematical economics; Nash equilibrium; Space (punctuation); Focus (optics); Repeated game; Game theory; Mathematics","score_opus":0.10849922984711761,"score_gpt":0.3142262882419854,"score_spread":0.20572705839486777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123800271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9110953,0.00001907756,0.054594863,0.00085509336,0.0017310184,0.0009832509,0.00001013797,0.00072745996,0.029983765],"genre_scores_gemma":[0.99559885,0.000055087443,0.004122212,0.00009646025,0.000039025992,0.000027346114,8.16026e-7,0.0000108561435,0.00004933477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997547,0.0000230791,0.0010776623,0.00035945655,0.00062761613,0.00036523835],"domain_scores_gemma":[0.99651116,0.000100697755,0.0011445304,0.00041994522,0.0017352714,0.00008841052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061066996,0.00027181004,0.0003265133,0.00031682433,0.00017816114,0.00015105808,0.0016924661,0.0001656775,0.000120385936],"category_scores_gemma":[0.0006648166,0.00021201032,0.00017962886,0.0008731397,0.00038380985,0.0026068438,0.0002775639,0.00032391827,0.00021396279],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001708583,0.00023002333,0.0004049405,0.00009585414,0.000034915738,3.8294064e-7,0.008830587,0.00009264259,0.097119436,0.6203004,0.00025108462,0.27246884],"study_design_scores_gemma":[0.00001494009,0.00027522273,0.0021500746,0.00014987911,0.000015023324,0.000008317332,0.0018238334,0.08755025,0.8302398,0.07752258,0.000054835393,0.0001952532],"about_ca_topic_score_codex":0.00030057455,"about_ca_topic_score_gemma":0.00001984039,"teacher_disagreement_score":0.7331203,"about_ca_system_score_codex":0.0000781566,"about_ca_system_score_gemma":0.00012879209,"threshold_uncertainty_score":0.864553},"labels":[],"label_agreement":null},{"id":"W125031099","doi":"10.1007/978-3-642-38457-8_9","title":"Fast Grid-Based Path Finding for Video Games","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Grid; Path (computing); Computation; Algorithm; Computer network","score_opus":0.03367686381273285,"score_gpt":0.2764192464827732,"score_spread":0.24274238267004036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125031099","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008498526,0.00027224247,0.99132323,0.000993809,0.0039856923,0.0009967084,0.00001585126,0.00027890876,0.0020485776],"genre_scores_gemma":[0.07075767,0.000014396715,0.92278814,0.0041306713,0.0013599161,0.000111424255,0.000009834099,0.00008045769,0.0007474988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994983,0.00003538377,0.0007826132,0.0020573996,0.0010623332,0.0010792463],"domain_scores_gemma":[0.9954385,0.0015992337,0.0004694824,0.0017560031,0.00048867153,0.00024810128],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009830135,0.0007105991,0.0006698562,0.00094227196,0.00041334858,0.0011896801,0.005038713,0.0003599161,0.00008044876],"category_scores_gemma":[0.00034340844,0.0006448582,0.00027706468,0.0005906193,0.0009459818,0.0009026571,0.0010208633,0.0007192016,0.00023418898],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064392557,0.000032738953,0.000050174156,0.00006545341,0.000010663606,0.000035715802,0.00067024614,0.06974386,0.00024190336,0.038201932,0.00045055352,0.89049035],"study_design_scores_gemma":[0.00011381811,0.00023208548,0.000022124768,0.000462158,0.000007567216,0.000016989074,4.0930743e-7,0.81262743,0.009853743,0.16726811,0.008611002,0.0007845406],"about_ca_topic_score_codex":0.000048975333,"about_ca_topic_score_gemma":0.00006114847,"teacher_disagreement_score":0.8897058,"about_ca_system_score_codex":0.00038271482,"about_ca_system_score_gemma":0.00082894036,"threshold_uncertainty_score":0.9998472},"labels":[],"label_agreement":null},{"id":"W125856876","doi":"10.1007/978-3-642-31866-5_29","title":"Generating Believable Virtual Characters Using Behavior Capture and Hidden Markov Models","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scripting language; Hidden Markov model; Trainer; Generalization; Set (abstract data type); Artificial intelligence; Variation (astronomy); Machine learning; Human–computer interaction; Programming language","score_opus":0.043096085588531695,"score_gpt":0.2715792087605958,"score_spread":0.22848312317206412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125856876","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010217085,0.0013244388,0.9852774,0.00019712327,0.0019917546,0.00048197067,0.0000072446446,0.00014513965,0.00035781073],"genre_scores_gemma":[0.39900124,0.000080307225,0.5984567,0.001173962,0.0008973565,0.000014873535,0.000004625818,0.00006301866,0.00030789906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956521,0.000051681825,0.00066721527,0.0015950223,0.001027109,0.0010068925],"domain_scores_gemma":[0.9975381,0.00031009258,0.00038149557,0.0012105952,0.00024961677,0.00031011092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009431743,0.0006720647,0.00059708685,0.0006529114,0.0004944045,0.0009300191,0.0024299696,0.00048107663,0.00002267492],"category_scores_gemma":[0.000054674052,0.00064290245,0.00011462526,0.00040053454,0.00086252927,0.002040859,0.0019514901,0.0009856714,0.000021320757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036043493,0.000028900173,0.000117328236,0.000017882552,0.000009948222,0.00006888584,0.0032572406,0.039133057,0.002668854,0.010131326,0.000004904108,0.9445581],"study_design_scores_gemma":[0.00006615182,0.00007280002,0.000039188788,0.00023671007,0.000023660627,0.000172294,0.0000017866337,0.97576445,0.0026745892,0.020050416,0.00007964135,0.00081832893],"about_ca_topic_score_codex":0.00013118343,"about_ca_topic_score_gemma":0.000058127884,"teacher_disagreement_score":0.9437397,"about_ca_system_score_codex":0.00035399318,"about_ca_system_score_gemma":0.00041747277,"threshold_uncertainty_score":0.9996022},"labels":[],"label_agreement":null},{"id":"W128122349","doi":"10.7939/r3-q72g-5y63","title":"Correct and efficient search algorithms in the presence of repetitions","year":2005,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Correctness; Computer science; Search tree; Algorithm; Depth-first search; Search algorithm; Solver; Tree (set theory); Theoretical computer science; Mathematics; Mathematical optimization","score_opus":0.016632128340243437,"score_gpt":0.2217457773137804,"score_spread":0.20511364897353696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128122349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94034266,0.00011061777,0.025271282,0.008770573,0.000059184236,0.00018238116,0.0000022191048,0.000021663938,0.025239423],"genre_scores_gemma":[0.9853084,0.000042835567,0.013533358,0.000059002545,0.000009969638,8.1547086e-8,9.0486446e-7,0.0000017902049,0.0010436329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944466,0.000081426224,0.000088475186,0.00014709488,0.00013842407,0.00009989965],"domain_scores_gemma":[0.9990921,0.0005526485,0.000038411992,0.0002718223,0.000017328937,0.00002766995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010707927,0.000043542335,0.00007479626,0.00009285196,0.00005607897,0.00001672066,0.000727557,0.000025789817,0.0000618606],"category_scores_gemma":[0.000025672784,0.000039232084,0.000026839603,0.00031337643,0.00020907178,0.00047588887,0.0002820973,0.00007896789,0.00000961572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009184092,0.0010521932,0.046428964,0.000080768616,0.00004235456,0.00007223443,0.31610495,0.02702976,0.0007203817,0.45410872,0.0092011,0.14506672],"study_design_scores_gemma":[0.00030194415,0.00027220114,0.029254058,0.00018329926,0.000012457481,0.000031780142,0.014700625,0.9037041,0.025247475,0.0019645025,0.02401968,0.00030786285],"about_ca_topic_score_codex":0.00096298667,"about_ca_topic_score_gemma":0.00020044872,"teacher_disagreement_score":0.87667435,"about_ca_system_score_codex":0.0000053174294,"about_ca_system_score_gemma":0.000048726833,"threshold_uncertainty_score":0.1599838},"labels":[],"label_agreement":null},{"id":"W131273679","doi":"10.65109/eoel4551","title":"A demonstration of the Polaris poker system","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Testbed; Adversary; Perfect information; Exploit; Championship; Competition (biology); Adversarial system; Artificial intelligence; Limit (mathematics); Tournament; Human–computer interaction; Computer security; Mathematical economics; World Wide Web","score_opus":0.0178459112980689,"score_gpt":0.25139917228619163,"score_spread":0.23355326098812274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131273679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033986982,0.00002683578,0.9113604,0.0024646632,0.00021470961,0.000102034304,2.1850153e-7,0.00009887706,0.051745277],"genre_scores_gemma":[0.988699,3.8375865e-7,0.01073088,0.00019757017,0.000016813296,6.352682e-7,2.6368419e-8,8.8737215e-7,0.0003537891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949014,0.000030861633,0.00015050756,0.00009677058,0.00015077036,0.000080933714],"domain_scores_gemma":[0.9995124,0.000023728271,0.00005375717,0.00034005728,0.000052983345,0.000017086848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012388184,0.00003913008,0.000051138504,0.000020570966,0.00003707101,0.00003682121,0.00051383895,0.000026471349,0.0000043336995],"category_scores_gemma":[0.000015794854,0.000023648727,0.000039017177,0.00021028526,0.000024366149,0.00018090037,0.000040107818,0.0000398302,0.000027334449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.416828e-7,0.00001575567,0.0016560218,0.0000021176515,0.0000018837817,4.8611247e-7,0.00034381775,0.000052430525,0.0055666463,0.9539413,0.0003577876,0.038061123],"study_design_scores_gemma":[0.000039446484,0.00011293837,0.030365152,0.00005929773,0.000006759351,0.000028614375,0.0006004283,0.18553515,0.7690056,0.013427216,0.0006526684,0.0001667284],"about_ca_topic_score_codex":0.00006271241,"about_ca_topic_score_gemma":0.000014712479,"teacher_disagreement_score":0.95471203,"about_ca_system_score_codex":0.000016643233,"about_ca_system_score_gemma":0.000029067049,"threshold_uncertainty_score":0.09643671},"labels":[],"label_agreement":null},{"id":"W132114982","doi":"","title":"Selective Extensions in Game-Tree Search †","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer chess; Olympiad; Computer science; Heuristics; Extension (predicate logic); Point (geometry); Search algorithm; Game tree; Brute force; Domain (mathematical analysis); Artificial intelligence; Algorithm; Sequential game; Game theory; Mathematics; Mathematical economics; Programming language; Advertising; Computer security","score_opus":0.040635019663422346,"score_gpt":0.305098996880215,"score_spread":0.26446397721679266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132114982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38188925,0.00004361185,0.5472164,0.0046268855,0.00022427436,0.00044402605,1.7315722e-7,0.00027996,0.065275416],"genre_scores_gemma":[0.9727423,0.000005847736,0.024680726,0.00045527107,0.000023208671,0.00002997546,1.3370018e-7,0.0000049217115,0.0020575952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989471,0.000060395236,0.0001740315,0.00029840932,0.00019877634,0.00032130495],"domain_scores_gemma":[0.99916863,0.00017877364,0.000016459151,0.00038575236,0.00016964177,0.000080727106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016412925,0.00007947749,0.00009516965,0.00014427277,0.000040849205,0.00012170382,0.0006257378,0.000043784956,0.0002682524],"category_scores_gemma":[0.00009240297,0.0000658686,0.000029368048,0.00062718213,0.000057156416,0.00058811303,0.00025620416,0.00016382812,0.003019897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003740216,0.00028372218,0.023206335,0.000006103854,0.000013525082,0.000032580545,0.008034837,0.0014403644,0.022372408,0.294611,0.015479446,0.63451594],"study_design_scores_gemma":[0.00007680856,0.00012123569,0.13097896,0.00002292725,9.648415e-7,0.000012019739,0.0008262462,0.6547168,0.11369719,0.09844838,0.0007605715,0.00033789838],"about_ca_topic_score_codex":0.0017386108,"about_ca_topic_score_gemma":0.0005642027,"teacher_disagreement_score":0.65327644,"about_ca_system_score_codex":0.00004770931,"about_ca_system_score_gemma":0.00006108022,"threshold_uncertainty_score":0.99775636},"labels":[],"label_agreement":null},{"id":"W136561625","doi":"10.1609/aiide.v3i1.18800","title":"A Demonstration of SQUEGE: A CRPG Sub-Quest Generator","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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Game design; Plot (graphics); Adventure; Game Developer; Game design document; Video game development; Game art design; Multimedia; Process (computing); Human–computer interaction; World Wide Web; Artificial intelligence; Programming language; Mathematics","score_opus":0.03899920916849038,"score_gpt":0.28991160084366446,"score_spread":0.2509123916751741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136561625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85488296,0.000030860596,0.12502539,0.0010861364,0.0004213279,0.0005518522,0.000014262578,0.000051889732,0.017935302],"genre_scores_gemma":[0.9989693,0.00003671997,0.0006238466,0.0001635067,0.000056133922,0.000017786952,0.0000011941465,0.000012757505,0.000118710195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975968,0.000014742124,0.0009300065,0.0005266151,0.00055681943,0.0003750434],"domain_scores_gemma":[0.9980069,0.00019613907,0.0006237227,0.00026299266,0.00078140676,0.00012885136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048051632,0.00028685556,0.0003208777,0.00020383057,0.0001019173,0.00038453678,0.0010440808,0.00009204793,0.000017661623],"category_scores_gemma":[0.00032573874,0.0002191913,0.00015920878,0.00039415772,0.00044008752,0.0014204915,0.00041457592,0.00026142388,0.000025429463],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022679473,0.0004731957,0.0016738684,0.00003556845,0.00004864348,0.0000016579764,0.0028052668,0.000016962069,0.1470277,0.6180168,0.00005375505,0.22961982],"study_design_scores_gemma":[0.000025220246,0.0005415141,0.0003544108,0.00027473102,0.000010500909,0.0000097477205,0.0023227003,0.009839444,0.95502585,0.03128442,0.00010083561,0.00021060623],"about_ca_topic_score_codex":0.000031607025,"about_ca_topic_score_gemma":0.000020867898,"teacher_disagreement_score":0.8079982,"about_ca_system_score_codex":0.00009870522,"about_ca_system_score_gemma":0.0000681505,"threshold_uncertainty_score":0.89383614},"labels":[],"label_agreement":null},{"id":"W139731984","doi":"","title":"Running the table: an AI for computer billiards","year":2006,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Table (database); Artificial intelligence; Task (project management); Domain (mathematical analysis); Robotics; Dynamical billiards; Competition (biology); Space (punctuation); Shot (pellet); Robot; Human–computer interaction; Mathematics; Engineering; Data mining","score_opus":0.029257775141671317,"score_gpt":0.2987649669058246,"score_spread":0.2695071917641533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139731984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021196608,0.000022143198,0.9896386,0.0039064386,0.00056079315,0.0001454725,0.0000012144745,0.00022970875,0.0033759263],"genre_scores_gemma":[0.51785207,0.000001744626,0.4726417,0.004792079,0.0009707234,0.000050159404,0.0000038556104,0.000016196242,0.0036714303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990211,0.000023741684,0.00020270422,0.00029061225,0.00017421361,0.00028763415],"domain_scores_gemma":[0.99911314,0.00014107491,0.000043477714,0.0005297111,0.00013418228,0.00003838891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003512445,0.000100315076,0.00009091756,0.00003836434,0.00025143768,0.0003998862,0.0010318407,0.000040268962,0.000027927683],"category_scores_gemma":[0.000010502692,0.00006137272,0.00004475632,0.00026334552,0.000068153735,0.0005443157,0.00015153835,0.00007598451,0.000050591912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024932062,0.000055463257,0.00092447415,0.000003101748,0.0000053741455,0.000001888282,0.00030311442,0.009093876,0.00020524202,0.69006926,0.044140633,0.2551951],"study_design_scores_gemma":[0.00003213186,0.00007716363,0.00040660234,0.000004005663,0.0000022533725,0.000004570754,0.00002813443,0.8485364,0.0075834645,0.046982016,0.09621618,0.00012711025],"about_ca_topic_score_codex":0.00041762553,"about_ca_topic_score_gemma":0.0001478023,"teacher_disagreement_score":0.8394425,"about_ca_system_score_codex":0.000018921464,"about_ca_system_score_gemma":0.00004493882,"threshold_uncertainty_score":0.38561118},"labels":[],"label_agreement":null},{"id":"W1463054322","doi":"10.1007/3-540-45579-5_8","title":"Learning from Perfection","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Perfection; Field (mathematics); Function (biology); Feature (linguistics); Evaluation function; Artificial intelligence; Data science; Human–computer interaction","score_opus":0.02886589212512101,"score_gpt":0.2626190026771727,"score_spread":0.2337531105520517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1463054322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044118275,0.00034085798,0.98185664,0.0004916009,0.0027652432,0.00022683562,0.0000010286532,0.00034359007,0.01353304],"genre_scores_gemma":[0.6553971,0.00027334277,0.3375961,0.0014966276,0.0023937281,0.000015045257,0.000011081802,0.00008855399,0.002728442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960865,0.00005226652,0.00051769736,0.0017158259,0.0009784878,0.00064926833],"domain_scores_gemma":[0.9974541,0.0006820702,0.0002857178,0.0011812571,0.00023507174,0.00016176807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006587709,0.00049022306,0.00044689418,0.0007017702,0.00037947096,0.0007485052,0.0030797855,0.0003774269,0.00013856056],"category_scores_gemma":[0.00019765455,0.000478902,0.00014374538,0.00064019545,0.0006308832,0.000800058,0.0011974131,0.001332884,0.00039963188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002890041,0.000013368609,0.00022585448,0.0000043314544,0.0000064479273,0.0000787001,0.0010698707,0.08268507,0.00020525718,0.0067786966,0.000013199418,0.9089163],"study_design_scores_gemma":[0.000053740067,0.00018362845,0.000098964454,0.00022846255,0.00000593774,0.00004083651,4.988133e-7,0.70206815,0.003770443,0.28593972,0.006993704,0.0006159235],"about_ca_topic_score_codex":0.00022954108,"about_ca_topic_score_gemma":0.00020504135,"teacher_disagreement_score":0.9083004,"about_ca_system_score_codex":0.00039185467,"about_ca_system_score_gemma":0.00032561272,"threshold_uncertainty_score":0.9997663},"labels":[],"label_agreement":null},{"id":"W1482508514","doi":"","title":"A Practical Use of Imperfect Recall","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Recall; Perfect information; Event (particle physics); Limit (mathematics); Granularity; Imperfect; Action (physics); Abstraction; Quality (philosophy); Artificial intelligence; Mathematical economics; Cognitive psychology; Mathematics; Psychology","score_opus":0.11295552803113527,"score_gpt":0.3650234846978944,"score_spread":0.25206795666675913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482508514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034772307,0.00000704335,0.95377815,0.0053498563,0.0001079658,0.00007370345,1.6497802e-7,0.00011757294,0.0057932246],"genre_scores_gemma":[0.71455735,0.000005994467,0.28434908,0.00068048976,0.00001759675,7.088587e-7,7.205449e-8,0.0000014952892,0.00038722795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928874,0.00004190225,0.00018421689,0.00017386611,0.00016387562,0.00014741083],"domain_scores_gemma":[0.9991433,0.00028825074,0.000046719964,0.0003908941,0.000076484685,0.000054352928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016070394,0.000058017242,0.000091326816,0.000043604676,0.000021670645,0.00007166817,0.00028336642,0.000037865557,0.000054904554],"category_scores_gemma":[0.0004250951,0.00004579424,0.000044433127,0.0002031505,0.000035205685,0.00070284033,0.000063361455,0.00007360981,0.00010664664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010513115,0.00016836768,0.00048019056,0.0000016880152,0.000005988533,0.000022266497,0.000363406,0.000063511485,0.009975281,0.77975124,0.012456939,0.19670059],"study_design_scores_gemma":[0.000081835795,0.0011940555,0.0055041397,0.00002864663,0.000009777911,0.00009347478,0.000055857203,0.28058824,0.625596,0.059476916,0.026959972,0.0004110877],"about_ca_topic_score_codex":0.000042284937,"about_ca_topic_score_gemma":0.0000074341688,"teacher_disagreement_score":0.7202743,"about_ca_system_score_codex":0.000011163024,"about_ca_system_score_gemma":0.000044239805,"threshold_uncertainty_score":0.18674348},"labels":[],"label_agreement":null},{"id":"W1484372654","doi":"10.1007/978-3-540-87608-3_10","title":"An Improved Safety Solver in Go Using Partial Regions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Solver; Computer science; Margin (machine learning); Problem solver; Algorithm; Computer graphics (images); Computational science; Programming language; Machine learning","score_opus":0.04546164751459495,"score_gpt":0.2925259192794561,"score_spread":0.24706427176486115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484372654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006069707,0.00022732251,0.9951408,0.00042474843,0.002025382,0.00046437318,0.0000041366725,0.00017797128,0.0009282872],"genre_scores_gemma":[0.38557962,0.00013035593,0.6113376,0.0016500353,0.0010168595,0.000011200406,0.0000054453612,0.00007229385,0.00019659652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950699,0.000077719626,0.00091383164,0.0020271947,0.0008816422,0.0010296672],"domain_scores_gemma":[0.99668086,0.00038807327,0.0003465897,0.0020814375,0.00023766924,0.00026535004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008669614,0.00061158906,0.00063480745,0.0009839566,0.00040405337,0.00045767872,0.0043946,0.00047303247,0.000023883265],"category_scores_gemma":[0.00011681838,0.0005997656,0.00015865338,0.00093713583,0.0013535357,0.0014123087,0.0011479629,0.0011152184,0.000048311304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029034956,0.00012810044,0.00026090597,0.000019684712,0.00001159817,0.00042957216,0.005376973,0.34099647,0.0015623535,0.014541867,0.000032267937,0.63661116],"study_design_scores_gemma":[0.00010320244,0.00014915837,0.00006973227,0.00020714714,0.0000041271333,0.00010959318,5.130137e-7,0.9544208,0.003141063,0.039724752,0.001368568,0.0007013513],"about_ca_topic_score_codex":0.00024861988,"about_ca_topic_score_gemma":0.000772708,"teacher_disagreement_score":0.63590986,"about_ca_system_score_codex":0.0006260583,"about_ca_system_score_gemma":0.0010765637,"threshold_uncertainty_score":0.99964535},"labels":[],"label_agreement":null},{"id":"W1484734702","doi":"10.1609/aimag.v34i2.2474","title":"The Annual Computer Poker Competition","year":2013,"lang":"en","type":"article","venue":"AI Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Verafin (Canada); University of Alberta","funders":"","keywords":"Competition (biology); Competitor analysis; Benchmarking; Field (mathematics); Event (particle physics); Computer science; Operations research; Data science; Engineering; Marketing; Business; Mathematics","score_opus":0.011271261657010085,"score_gpt":0.2502195679546236,"score_spread":0.2389483062976135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484734702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077667097,0.00009447344,0.94757605,0.034243334,0.0012123374,0.0002679714,0.0000020557547,0.00026598657,0.008571091],"genre_scores_gemma":[0.9575696,0.000030626587,0.029265255,0.0077404617,0.00059854315,0.000052240004,0.000003957814,0.000016144739,0.0047231438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989953,0.000057470435,0.00021034738,0.00023279693,0.00022163778,0.00028244307],"domain_scores_gemma":[0.9989232,0.00017247777,0.000053081236,0.0005201625,0.0002619174,0.00006915654],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017340091,0.00010538969,0.00008738771,0.00003519044,0.00021408063,0.00040681288,0.00084430503,0.00003747454,0.00015085086],"category_scores_gemma":[0.00002299089,0.000070871494,0.00004634587,0.00020542226,0.0001266115,0.0007971591,0.00029173098,0.00013409788,0.010376299],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020979692,0.000047118472,0.00047232106,0.0000028168558,0.0000123994,0.0000068024005,0.0005545895,0.00017864683,0.0004930744,0.40661678,0.24010713,0.3515062],"study_design_scores_gemma":[0.00011567747,0.00021052595,0.029304849,0.000021940397,0.0000045520956,0.000039876435,0.00008654729,0.26723567,0.002148875,0.08738423,0.61307317,0.00037410887],"about_ca_topic_score_codex":0.000045858746,"about_ca_topic_score_gemma":0.000030045441,"teacher_disagreement_score":0.94980294,"about_ca_system_score_codex":0.000020644382,"about_ca_system_score_gemma":0.000021743548,"threshold_uncertainty_score":0.99039423},"labels":[],"label_agreement":null},{"id":"W1485287448","doi":"","title":"Prob-Max n : playing N-player games with opponent models","year":2006,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimax; Adversary; Computer science; Game tree; Pruning; Probabilistic logic; Game theory; Fictitious play; Artificial intelligence; Bayesian game; Mathematical economics; Theoretical computer science; Sequential game; Mathematics; Computer security","score_opus":0.034126422716123206,"score_gpt":0.24676858216547126,"score_spread":0.21264215944934806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485287448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0498045,0.00005987082,0.8987249,0.0009658841,0.000112143505,0.00020442961,5.26709e-7,0.0003579654,0.049769778],"genre_scores_gemma":[0.85695404,0.0000031435557,0.13991958,0.00024680965,0.00006466428,0.00002958667,8.418442e-7,0.000011791217,0.0027695396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853766,0.00002803392,0.00025194394,0.00043419655,0.00037161796,0.00037653753],"domain_scores_gemma":[0.99917847,0.00006829018,0.00006796116,0.0005181071,0.00009579637,0.000071371585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015691725,0.00016514318,0.00014474659,0.000090714,0.00013386003,0.00024544893,0.000706748,0.000049311057,0.00005420824],"category_scores_gemma":[0.000006377874,0.00011869903,0.000042509935,0.00026974542,0.0000656419,0.0009242434,0.00017719429,0.00010566314,0.00017770505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016269005,0.00016482307,0.0017780547,0.000011848315,0.000017808547,0.000060669714,0.00078356214,0.092814885,0.0030389049,0.8657089,0.0036631487,0.03194113],"study_design_scores_gemma":[0.00007961214,0.00010167427,0.00037220455,0.000034106128,0.000005012209,0.000035700577,0.00010594155,0.8714992,0.051726595,0.07366689,0.0020126565,0.0003604413],"about_ca_topic_score_codex":0.00059809885,"about_ca_topic_score_gemma":0.00018552766,"teacher_disagreement_score":0.8071495,"about_ca_system_score_codex":0.000042914227,"about_ca_system_score_gemma":0.00006711615,"threshold_uncertainty_score":0.48404056},"labels":[],"label_agreement":null},{"id":"W1486495553","doi":"","title":"Another bridge between NIM and WYTHOFF","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada; Dalhousie University","funders":"","keywords":"Bridge (graph theory); Biology; Anatomy","score_opus":0.07993165911632386,"score_gpt":0.32374605417931274,"score_spread":0.24381439506298888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486495553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020209864,0.00028775312,0.94817466,0.0035713045,0.00035998644,0.00024127054,0.0000048699967,0.0003952414,0.026755044],"genre_scores_gemma":[0.88099873,0.00008531485,0.114304975,0.0015080929,0.00047840265,0.000011048,0.0000039420574,0.00002055203,0.0025889506],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838245,0.000064880485,0.00031235893,0.0007078777,0.00024852672,0.000283894],"domain_scores_gemma":[0.99867773,0.000111490466,0.00011369729,0.00094235496,0.00006676682,0.00008796281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030438128,0.00023823057,0.0002968877,0.00011162949,0.0000618919,0.0004161025,0.001273542,0.00024119313,0.00005441834],"category_scores_gemma":[0.000037667083,0.00021457314,0.00007704683,0.00011268614,0.000086053646,0.00018176614,0.0015746468,0.00038075625,0.00019544137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017167338,0.000035008696,0.007714995,0.00003089732,0.000038449005,0.000020219084,0.0011256784,0.00010537843,0.00007919082,0.044721257,0.01263127,0.93349594],"study_design_scores_gemma":[0.00009423356,0.00018154622,0.16993178,0.00024773792,0.000042601096,0.00002081953,0.000030527393,0.033687368,0.021389836,0.71887887,0.053761445,0.0017332232],"about_ca_topic_score_codex":0.0002842537,"about_ca_topic_score_gemma":0.000029806148,"teacher_disagreement_score":0.9317627,"about_ca_system_score_codex":0.000032198815,"about_ca_system_score_gemma":0.00007622723,"threshold_uncertainty_score":0.87500393},"labels":[],"label_agreement":null},{"id":"W1487605616","doi":"10.1007/978-3-540-75538-8_4","title":"An Open Boundary Safety-of-Territory Solver for the Game of Go","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Solver; Boundary (topology); Problem solver; Computer science; Open source; Boundary value problem; Work (physics); Computational science; Mathematics; Engineering; Mechanical engineering; Operating system; Mathematical analysis; Programming language; Software","score_opus":0.05311775392573026,"score_gpt":0.32901471366295393,"score_spread":0.27589695973722367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487605616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004872175,0.0006668445,0.99276525,0.0004487069,0.0025466038,0.0011179076,0.000016388372,0.000048215134,0.0023413538],"genre_scores_gemma":[0.1839708,0.00009844581,0.812357,0.00192152,0.0009625254,0.000031604643,0.0000071097993,0.00007334974,0.000577655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626124,0.00004131089,0.00096824695,0.0011820067,0.00094630173,0.000600866],"domain_scores_gemma":[0.99447817,0.0020046448,0.0006213551,0.0022640876,0.0005027616,0.00012898962],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025982035,0.00042144948,0.0006387407,0.0005019581,0.00028578122,0.00048313368,0.011777864,0.0003032788,0.000031714208],"category_scores_gemma":[0.00013706589,0.00032052278,0.00017345796,0.00043121382,0.0023493317,0.0010060163,0.0022600002,0.0005398488,0.000009680274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046156096,0.00005731878,0.000046532317,0.00004329593,0.000020838763,0.000009891201,0.001936039,0.017838772,0.0004699562,0.054394282,0.000054479784,0.92508245],"study_design_scores_gemma":[0.00019372196,0.00084150565,0.00017948938,0.00050275744,0.000021875607,0.000026911468,0.00000200459,0.5814568,0.02363969,0.36773816,0.024708943,0.00068815873],"about_ca_topic_score_codex":0.000127037,"about_ca_topic_score_gemma":0.00042811377,"teacher_disagreement_score":0.92439425,"about_ca_system_score_codex":0.00017851076,"about_ca_system_score_gemma":0.00097000855,"threshold_uncertainty_score":0.99992466},"labels":[],"label_agreement":null},{"id":"W1489504788","doi":"10.1007/978-0-387-35706-5_17","title":"Solving 7×7 Hex: Virtual Connections and Game-State Reduction","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Outcome (game theory); Reduction (mathematics); Sequential game; Game tree; Computer science; State (computer science); Connection (principal bundle); Tree (set theory); Combinatorial game theory; Extensive-form game; Monte Carlo tree search; Game theory; Theoretical computer science; Mathematical optimization; Mathematical economics; Algorithm; Mathematics; Combinatorics","score_opus":0.018469418800435688,"score_gpt":0.2704984088857533,"score_spread":0.25202899008531765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489504788","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003375994,0.006834134,0.96755344,0.00047261838,0.003966149,0.00038807676,0.000007996202,0.0003814687,0.020058515],"genre_scores_gemma":[0.4065874,0.05214388,0.42352608,0.001565354,0.004568689,0.0001734925,0.000046539168,0.00042217123,0.11096642],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729973,0.00003916611,0.0007237803,0.0011189613,0.00036864053,0.00044971227],"domain_scores_gemma":[0.9983832,0.00027087866,0.00035940643,0.00072098733,0.00013843479,0.00012707057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022692038,0.00050163,0.0005534693,0.00048905594,0.00014195169,0.00029151034,0.0007446098,0.00022226482,0.000038594895],"category_scores_gemma":[0.000027912856,0.00053680287,0.00012955906,0.00014438866,0.0004246535,0.0016006222,0.00060005987,0.0006320919,0.000091265436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069690195,0.000021932481,0.00001550335,0.000029660267,0.000021136571,0.000050997358,0.0012706063,0.020424487,0.00001342838,0.34581473,0.00008364109,0.6322469],"study_design_scores_gemma":[0.0002385075,0.00043262044,0.000047544978,0.0011011383,0.00001759209,0.00023916335,0.000045461853,0.044048212,0.000870587,0.8424483,0.10940154,0.0011093364],"about_ca_topic_score_codex":0.00004142169,"about_ca_topic_score_gemma":0.0001268261,"teacher_disagreement_score":0.63113755,"about_ca_system_score_codex":0.00023676058,"about_ca_system_score_gemma":0.00013604375,"threshold_uncertainty_score":0.99970835},"labels":[],"label_agreement":null},{"id":"W1489599888","doi":"10.1007/978-3-540-89454-4_32","title":"Improvisation and Performance as Models for Interacting with Stories","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Improvisation; Narrative; Computer science; Metaphor; Storytelling; Interactive storytelling; Performing arts; Cognitive science; Human–computer interaction; Agency (philosophy); Computational creativity; Epistemology; Visual arts; Art; Psychology; Creativity; Linguistics; Literature; Social psychology","score_opus":0.027125936543626484,"score_gpt":0.26654602980446,"score_spread":0.23942009326083352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489599888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002201886,0.00013757955,0.99388206,0.0003635462,0.0009100101,0.00049695815,0.0000020628831,0.000113185044,0.001892698],"genre_scores_gemma":[0.6576664,0.000017092723,0.3412706,0.00033384972,0.0002946498,0.000021604956,0.0000027761039,0.000026411373,0.00036663408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746203,0.000011326977,0.00038396532,0.00110216,0.0005408445,0.0004996489],"domain_scores_gemma":[0.9979843,0.0006665577,0.00029225732,0.0006318911,0.00033826946,0.00008674913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055718643,0.0003766961,0.0003258912,0.00041254892,0.00032933796,0.0006603507,0.0012570261,0.00016904825,0.000002076166],"category_scores_gemma":[0.00008061543,0.00031692427,0.000045601326,0.00024430777,0.0005838855,0.0016916286,0.0005041784,0.0004048988,0.0000051923985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020587699,0.000010187265,0.000070394526,0.000052424235,0.0000055873,0.0000070748597,0.0018445041,0.16563684,0.00006521486,0.022182778,0.000012248013,0.81009215],"study_design_scores_gemma":[0.00006617482,0.00041562712,0.000020240066,0.0003063431,0.000005202468,0.000043433338,8.8287834e-7,0.8783304,0.0043504783,0.11572665,0.00035507575,0.00037946104],"about_ca_topic_score_codex":0.00009119996,"about_ca_topic_score_gemma":0.00015299593,"teacher_disagreement_score":0.8097127,"about_ca_system_score_codex":0.00022471104,"about_ca_system_score_gemma":0.00038819812,"threshold_uncertainty_score":0.9999283},"labels":[],"label_agreement":null},{"id":"W1493566687","doi":"","title":"Generalized amazons is PSPACE-complete","year":2005,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorial game theory; Sequential game; PSPACE; Mathematical proof; Computer science; Simple (philosophy); Game complexity; Mathematics; Game theory; Mathematical economics; Algorithm; Computational complexity theory","score_opus":0.05908172120910767,"score_gpt":0.3059631820785609,"score_spread":0.2468814608694532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493566687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03522723,0.000107113345,0.8907906,0.033138644,0.0003284307,0.00013172558,0.000002009009,0.00051017595,0.039764058],"genre_scores_gemma":[0.46495578,0.00002681776,0.5081294,0.010000096,0.0003187055,0.0000142833605,7.041667e-7,0.000012265527,0.016541922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883974,0.000032977085,0.00022006845,0.00034493217,0.00023917954,0.00032309414],"domain_scores_gemma":[0.999051,0.00005849959,0.000046092868,0.00066766294,0.00006785309,0.00010889639],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013757538,0.00012187944,0.00012686847,0.000076497614,0.00011180406,0.00017525154,0.0009778056,0.000045471294,0.0011542955],"category_scores_gemma":[0.000024949391,0.00010480076,0.000081230384,0.00027505486,0.000056652196,0.00047317654,0.00022843083,0.00008508908,0.004196779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027380086,0.00006176116,0.00043272143,0.0000019345289,0.00001700187,0.0000057976144,0.0022209724,0.00036666714,0.005736592,0.7223388,0.09341959,0.17539541],"study_design_scores_gemma":[0.00007580355,0.000033317487,0.000232569,0.0000044493895,0.0000030925867,0.000012037272,0.0000436094,0.3169994,0.097558714,0.017501686,0.5672584,0.00027688485],"about_ca_topic_score_codex":0.00013436745,"about_ca_topic_score_gemma":0.00013419629,"teacher_disagreement_score":0.70483714,"about_ca_system_score_codex":0.000036478512,"about_ca_system_score_gemma":0.000034808316,"threshold_uncertainty_score":0.9997588},"labels":[],"label_agreement":null},{"id":"W1499762049","doi":"10.4230/dfu.vol6.12191.21","title":"Pathfinding in Games","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Workgroup; Testbed; Computer science; Human–computer interaction; Toolbox; Artificial intelligence; World Wide Web; Shortest path problem; Theoretical computer science; Programming language","score_opus":0.020529046347228297,"score_gpt":0.2652369112787808,"score_spread":0.2447078649315525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499762049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5497877,0.000071698334,0.43384677,0.0012232299,0.0016424617,0.0019815597,0.00004750631,0.00044490988,0.010954131],"genre_scores_gemma":[0.9507595,0.000027076676,0.04707654,0.0012482267,0.00011154165,0.00031239688,0.000034324803,0.000032628268,0.00039780862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996852,0.000041403382,0.0012954244,0.00033907115,0.00047919014,0.0009929391],"domain_scores_gemma":[0.99802697,0.00024761804,0.00034903645,0.00091914274,0.00024783128,0.00020943226],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058500306,0.00036396756,0.00041177732,0.00045573243,0.00020809134,0.0008232355,0.0018603283,0.00021400576,0.00010659391],"category_scores_gemma":[0.00020883585,0.00033144196,0.00019093983,0.00057595974,0.00012947636,0.0039518056,0.0005879156,0.00042508967,0.0014500972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058768273,0.0010791452,0.102789015,0.0007573256,0.00018481491,0.00003580471,0.0916035,0.0015319753,0.000979768,0.18921162,0.02559732,0.586171],"study_design_scores_gemma":[0.0018955526,0.00050858746,0.012219359,0.00053193,0.000019796043,0.00010111289,0.007815047,0.8378653,0.016733965,0.042997286,0.07729587,0.0020161695],"about_ca_topic_score_codex":0.000121264275,"about_ca_topic_score_gemma":0.000051899908,"teacher_disagreement_score":0.83633333,"about_ca_system_score_codex":0.00016805316,"about_ca_system_score_gemma":0.0000774644,"threshold_uncertainty_score":0.99991375},"labels":[],"label_agreement":null},{"id":"W1501727541","doi":"10.1016/s0065-2458(00)80019-4","title":"The games computers (and people) play","year":2000,"lang":"en","type":"book-chapter","venue":"Advances in computers","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Successor cardinal; Bridge (graph theory); Computer science; Multimedia; Human–computer interaction; Mathematics","score_opus":0.013660726520574646,"score_gpt":0.2638103586101838,"score_spread":0.25014963208960916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501727541","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015903672,0.040299233,0.5734339,0.00351057,0.008813155,0.0011154294,0.000013679719,0.0006205999,0.37203443],"genre_scores_gemma":[0.06806398,0.3432742,0.33280203,0.010981613,0.004134331,0.0002574092,0.000064834865,0.000706079,0.23971552],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970909,0.0000621279,0.00072441745,0.0010155861,0.0005121348,0.0005948784],"domain_scores_gemma":[0.99647766,0.001918327,0.00030606176,0.0010885058,0.00006344024,0.00014600765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032555146,0.0005602169,0.00056177226,0.00032645717,0.0003149407,0.00046290885,0.002503483,0.00022205422,0.000020952051],"category_scores_gemma":[0.000021860968,0.0004567499,0.00015625483,0.00018458682,0.0005447535,0.0008287272,0.00075279217,0.00065728184,0.00014927766],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008205768,0.00000736802,0.00003764472,0.00001234419,0.000018486242,0.00003862191,0.0006760933,0.0031242503,3.3224475e-7,0.3612975,0.000870257,0.6339089],"study_design_scores_gemma":[0.00010039099,0.00009455316,0.00006903739,0.0003449486,0.00000765938,0.000050577015,0.000018450564,0.03961372,0.000018262355,0.1986508,0.76045597,0.0005756307],"about_ca_topic_score_codex":0.000022091372,"about_ca_topic_score_gemma":0.00038905162,"teacher_disagreement_score":0.75958574,"about_ca_system_score_codex":0.00012016306,"about_ca_system_score_gemma":0.00008386547,"threshold_uncertainty_score":0.9997884},"labels":[],"label_agreement":null},{"id":"W1501807268","doi":"10.1007/978-3-540-75538-8_23","title":"Optimization of a Billiard Player – Tactical Play","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Dynamical billiards; Computer science; Heuristics; Ball (mathematics); Selection (genetic algorithm); Greedy algorithm; Artificial intelligence; Mathematical optimization; Human–computer interaction; Algorithm; Mathematics","score_opus":0.04171191487718149,"score_gpt":0.29837236375686177,"score_spread":0.25666044887968026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501807268","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042728996,0.00016656677,0.9910071,0.0003587847,0.0016809426,0.00032185967,0.0000034198724,0.00011943545,0.0062991856],"genre_scores_gemma":[0.088773325,0.000045825975,0.9097872,0.000753421,0.0003692728,0.0000041288695,0.0000028080647,0.00003623301,0.00022780243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959182,0.00003129166,0.00082562503,0.0012786884,0.0013023553,0.0006438194],"domain_scores_gemma":[0.99669254,0.0009410426,0.0004166328,0.001320641,0.00044804558,0.00018109835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011712121,0.00045049275,0.0005483167,0.0010905865,0.00014152125,0.00026075362,0.0031174156,0.00045455058,0.00007911081],"category_scores_gemma":[0.00029063772,0.00040428757,0.0001485991,0.0008454028,0.0011207402,0.0006682245,0.0010559623,0.00073413894,0.000055625056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009383173,0.00003562501,0.000049100625,0.000019241714,0.000009516276,0.000060195205,0.0007204546,0.59498316,0.0000949384,0.04142934,0.00001549128,0.36257356],"study_design_scores_gemma":[0.00006926102,0.00017914495,0.000023224276,0.00024856973,0.0000073882256,0.000046230023,2.4604037e-7,0.9198649,0.012855403,0.065429226,0.00078095857,0.00049546064],"about_ca_topic_score_codex":0.00002927464,"about_ca_topic_score_gemma":0.000050923667,"teacher_disagreement_score":0.3620781,"about_ca_system_score_codex":0.00024656893,"about_ca_system_score_gemma":0.0005134016,"threshold_uncertainty_score":0.9998409},"labels":[],"label_agreement":null},{"id":"W1502031920","doi":"","title":"Search versus knowledge for solving life and death problems in Go","year":2005,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; State (computer science); Scale (ratio); Search engine; Artificial intelligence; Information retrieval; Programming language","score_opus":0.12477726096636288,"score_gpt":0.3575803084367537,"score_spread":0.23280304747039082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502031920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21637528,0.00069263706,0.77006936,0.0020425064,0.00029576942,0.0004779585,5.469538e-7,0.00014738497,0.009898577],"genre_scores_gemma":[0.9397018,0.000022678427,0.059399445,0.000085862426,0.000096817064,0.000028451885,2.0874491e-7,0.000005841113,0.0006589265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991634,0.000017056122,0.00017375247,0.00027079333,0.0000904479,0.0002845432],"domain_scores_gemma":[0.9992931,0.0003449611,0.000016676388,0.00019526103,0.000062330306,0.00008767203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037731056,0.000073019364,0.00009205933,0.00008983926,0.00006705184,0.00012350605,0.00037542672,0.000041142495,0.0000145412405],"category_scores_gemma":[0.00012682875,0.00006827745,0.000022034557,0.0001684948,0.000028200686,0.00039569548,0.00021106415,0.00007725159,0.000099980614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027703,0.00021434414,0.019519268,0.00005920941,0.00001710336,0.0000017880931,0.01205407,0.0039651236,0.0011628984,0.26255313,0.0015483836,0.698877],"study_design_scores_gemma":[0.00027419947,0.00015262404,0.0011430612,0.00002210543,0.0000014294585,0.0000013596526,0.00025851902,0.97470886,0.011182269,0.0024277782,0.009646799,0.0001809808],"about_ca_topic_score_codex":0.00005803532,"about_ca_topic_score_gemma":0.0012625091,"teacher_disagreement_score":0.9707438,"about_ca_system_score_codex":0.000047626414,"about_ca_system_score_gemma":0.00008549507,"threshold_uncertainty_score":0.27842733},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02933503070841547,"score_gpt":0.2981434790828846,"score_spread":0.2688084483744691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511096005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093535475,0.0003925758,0.49902898,0.011230713,0.0017751098,0.00049948896,0.000019699437,0.0016719153,0.39184603],"genre_scores_gemma":[0.9802481,0.000034197925,0.012498163,0.0006912536,0.00033563646,0.000013902125,0.0000073222895,0.000013415266,0.006157987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887663,0.000052888234,0.00022287075,0.00021092156,0.00020382182,0.00043283834],"domain_scores_gemma":[0.99904096,0.00009523302,0.00005520908,0.0005522953,0.00009053514,0.00016578214],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021268529,0.00012376977,0.0001331084,0.00007536072,0.00007796804,0.00011229796,0.0006001849,0.000052381845,0.0007557381],"category_scores_gemma":[0.000033443222,0.00011726721,0.0000541921,0.0003224173,0.0000877073,0.00092933443,0.00017845674,0.00012782097,0.016774874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046265877,0.0003239911,0.0022642622,0.000009836318,0.000024366998,0.000017434615,0.0010511164,0.00036810955,0.03516285,0.8726181,0.046764012,0.04139134],"study_design_scores_gemma":[0.00041066093,0.00063330197,0.089517705,0.000104809704,0.000054693683,0.00024670165,0.00015685402,0.15790245,0.05573383,0.1179774,0.57528394,0.0019776404],"about_ca_topic_score_codex":0.000036240348,"about_ca_topic_score_gemma":0.000010899661,"teacher_disagreement_score":0.8867127,"about_ca_system_score_codex":0.000034227658,"about_ca_system_score_gemma":0.000041131247,"threshold_uncertainty_score":0.98399067},"labels":[],"label_agreement":null},{"id":"W1513679598","doi":"10.1007/11674399_19","title":"Locally Informed Global Search for Sums of Combinatorial Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Exploit; Minimax; Mathematical optimization; Combinatorial game theory; Computation; Theoretical computer science; Search algorithm; Subgame perfect equilibrium; Algorithm; Sequential game; Game theory; Mathematics; Nash equilibrium; Mathematical economics","score_opus":0.02638382653820539,"score_gpt":0.29640842815495455,"score_spread":0.2700246016167492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513679598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027198065,0.00020455796,0.9879411,0.00030866681,0.0037576791,0.00079094135,0.00002630677,0.00012187177,0.0065769157],"genre_scores_gemma":[0.5076926,0.000029690154,0.49016637,0.00061292807,0.00110078,0.0000295311,0.000016064538,0.00004743178,0.00030462528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954767,0.000029130306,0.0009538918,0.0012371765,0.001430636,0.0008724399],"domain_scores_gemma":[0.9962227,0.0010832776,0.00038224345,0.0013059303,0.0008396068,0.00016624908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009789984,0.00052063895,0.0007086178,0.0005100763,0.00018763337,0.00040890847,0.0046612974,0.00044465673,0.000010163443],"category_scores_gemma":[0.00020720174,0.00048840564,0.00024432724,0.0007726073,0.0016301826,0.00062846346,0.0013637595,0.0004841682,0.000023160504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032619966,0.000048537768,0.00028448645,0.000111832065,0.000016614094,0.000020262773,0.00045227446,0.04638849,0.0000865276,0.36195526,0.00022038406,0.59038275],"study_design_scores_gemma":[0.00034159547,0.00061696797,0.00011203867,0.00042901706,0.000010837864,0.000025012292,5.4424225e-7,0.41413456,0.02327868,0.5568805,0.0033926363,0.0007776242],"about_ca_topic_score_codex":0.00018383442,"about_ca_topic_score_gemma":0.00017291415,"teacher_disagreement_score":0.5896051,"about_ca_system_score_codex":0.0005380834,"about_ca_system_score_gemma":0.0019495119,"threshold_uncertainty_score":0.99975675},"labels":[],"label_agreement":null},{"id":"W1515299244","doi":"10.1007/978-3-642-03364-3_32","title":"QuizMASter - A Multi-Agent Game-Style Learning Activity","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; Government of Alberta; Vancouver Island University","funders":"","keywords":"Computer science; Style (visual arts); Human–computer interaction; Artificial intelligence; Art; Visual arts","score_opus":0.04170535259895931,"score_gpt":0.2893219763018475,"score_spread":0.24761662370288823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515299244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047116895,0.00028934304,0.9930618,0.0008122442,0.0016450731,0.00045820716,0.0000016778998,0.00036376267,0.0028967503],"genre_scores_gemma":[0.57976335,0.00007402676,0.41330415,0.0017536418,0.00067238015,0.000014157494,0.0000023858356,0.00006620644,0.004349682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99469215,0.000094753785,0.00062889926,0.002198553,0.0013081838,0.00107748],"domain_scores_gemma":[0.9967982,0.00051073,0.00045262225,0.0016674872,0.00028796954,0.00028296042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001075793,0.0007581238,0.00069904624,0.00090201886,0.0003542439,0.0009634754,0.0042391405,0.00045848422,0.00005905786],"category_scores_gemma":[0.0002358491,0.0007168041,0.00024229955,0.0006936697,0.0008521054,0.0010964258,0.0017540294,0.0017795563,0.00034912323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006263292,0.000056949495,0.000051273822,0.0000137376555,0.000008097924,0.000111387024,0.0016987734,0.05274341,0.0005014386,0.0020646735,0.000009377315,0.9427346],"study_design_scores_gemma":[0.00014402694,0.000341541,0.00025488815,0.0003528353,0.00000896777,0.000064271815,5.589754e-7,0.95357925,0.008435053,0.028191619,0.0075759212,0.001051092],"about_ca_topic_score_codex":0.00005429111,"about_ca_topic_score_gemma":0.00014824203,"teacher_disagreement_score":0.94168353,"about_ca_system_score_codex":0.00051032874,"about_ca_system_score_gemma":0.00048440654,"threshold_uncertainty_score":0.9995283},"labels":[],"label_agreement":null},{"id":"W1516167732","doi":"10.1007/11674399_4","title":"*-Minimax Performance in Backgammon","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Minimax; Computer science; Pruning; Domain (mathematical analysis); Algorithm; Artificial intelligence; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.0234602086844417,"score_gpt":0.25600934127624064,"score_spread":0.23254913259179893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516167732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012517975,0.00037820218,0.9708107,0.000487004,0.0018144975,0.0003821243,0.0000021599774,0.00016743367,0.024706064],"genre_scores_gemma":[0.7540376,0.000092530296,0.2426852,0.00096810027,0.0005997014,0.000017996823,0.000004633351,0.000056018478,0.0015382327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518895,0.000034388693,0.0008688211,0.001801054,0.001126962,0.0009797945],"domain_scores_gemma":[0.99732316,0.00043099327,0.00030143277,0.0016118672,0.00019424563,0.0001382852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010107262,0.00061128166,0.00060221547,0.0013185771,0.00017743873,0.00051457493,0.0046766987,0.00040738127,0.000039792587],"category_scores_gemma":[0.000071541064,0.0005919712,0.00012202344,0.0010392993,0.00093235483,0.001043314,0.0014186823,0.0010957043,0.0002555046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005787462,0.000040850642,0.0011836545,0.000034883204,0.0000029950013,0.00013820684,0.00055653515,0.10236573,0.00006207395,0.01371141,0.000052885644,0.881845],"study_design_scores_gemma":[0.00011984868,0.00020485732,0.001432307,0.000590006,0.0000033954268,0.000054141907,2.1033065e-7,0.85897315,0.00635271,0.127223,0.0040381695,0.0010082272],"about_ca_topic_score_codex":0.00010532506,"about_ca_topic_score_gemma":0.0004882049,"teacher_disagreement_score":0.8808368,"about_ca_system_score_codex":0.00052868674,"about_ca_system_score_gemma":0.0005491427,"threshold_uncertainty_score":0.99965316},"labels":[],"label_agreement":null},{"id":"W1516910121","doi":"","title":"TBA*: time-bounded A*","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounded function; Computer science; Heuristic; Incremental heuristic search; Completeness (order theory); Consistent heuristic; Mathematical optimization; Algorithm; Search algorithm; Beam search; Mathematics; Artificial intelligence","score_opus":0.021960134597535756,"score_gpt":0.27890789900985075,"score_spread":0.256947764412315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516910121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008445036,0.000032458323,0.78965914,0.0058717127,0.00017397024,0.00007310027,1.07112925e-7,0.0005259162,0.19521856],"genre_scores_gemma":[0.865658,0.000003942663,0.115787745,0.0036971008,0.0000863806,0.0000017454929,3.4684814e-7,0.0000035440216,0.014761227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992923,0.000017483417,0.00013108844,0.0002071587,0.00015821366,0.00019374519],"domain_scores_gemma":[0.99942154,0.00004104414,0.00002372155,0.0004109616,0.000042279367,0.00006047743],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011907064,0.00006955363,0.0000726087,0.00004524951,0.00006446033,0.00015818486,0.00072363135,0.0000319267,0.00028796645],"category_scores_gemma":[0.000033269098,0.00005824119,0.000037080255,0.00022054881,0.00002607511,0.0003744861,0.00005936478,0.000053968946,0.0042372434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014615318,0.00004824053,0.00003938455,4.067774e-7,0.0000026360276,0.000009534781,0.00029352476,0.000031438405,0.004602985,0.63088703,0.012214969,0.35186836],"study_design_scores_gemma":[0.00005737467,0.00024166319,0.0012791624,0.000008926268,0.0000025011038,0.000021696513,0.000027365515,0.18437508,0.18539836,0.58296716,0.045248616,0.00037212286],"about_ca_topic_score_codex":0.000011768838,"about_ca_topic_score_gemma":0.000002944077,"teacher_disagreement_score":0.85721296,"about_ca_system_score_codex":0.00001849595,"about_ca_system_score_gemma":0.000026384536,"threshold_uncertainty_score":0.9965381},"labels":[],"label_agreement":null},{"id":"W1517193358","doi":"","title":"Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games)","year":2004,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Digraph; Completeness (order theory); Discrete mathematics; Combinatorics","score_opus":0.0269518989567623,"score_gpt":0.26517897275742613,"score_spread":0.23822707380066382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517193358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018198624,0.00055472425,0.97373885,0.0038038774,0.00069728435,0.0012367518,0.00013231355,0.00022823217,0.0014093218],"genre_scores_gemma":[0.5255585,0.00011683857,0.4713829,0.00008030793,0.000062258376,0.0003726641,0.00029896613,0.0000389471,0.0020886506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964322,0.00097270584,0.00090706913,0.0009058696,0.00038674194,0.0003954256],"domain_scores_gemma":[0.990789,0.0021008546,0.00088169496,0.002104705,0.0039936802,0.00013008833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035822445,0.00033366185,0.00042381993,0.00025585102,0.0004746468,0.0005687101,0.0018307873,0.00030759818,0.000014692138],"category_scores_gemma":[0.0024048886,0.00037420026,0.00041570168,0.0003987382,0.00020617394,0.00030873757,0.00089104,0.00033232456,0.000009042915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017130093,0.00070476485,0.0004265011,0.00042530318,0.00016765977,6.8162035e-7,0.01479278,0.033998992,0.013159162,0.7680677,0.0011266166,0.1671127],"study_design_scores_gemma":[0.0003188759,0.0000028672046,0.00016715494,0.0011121094,0.0000667279,0.000003516471,0.00014200372,0.66932875,0.24401045,0.07992019,0.0044056983,0.00052164256],"about_ca_topic_score_codex":0.00036626097,"about_ca_topic_score_gemma":0.0007019734,"teacher_disagreement_score":0.68814754,"about_ca_system_score_codex":0.00014662267,"about_ca_system_score_gemma":0.00059245405,"threshold_uncertainty_score":0.999871},"labels":[],"label_agreement":null},{"id":"W1517841585","doi":"10.1007/978-3-540-87608-3_8","title":"Using Artificial Boundaries in the Game of Go","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Boundary (topology); Local search (optimization); Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.07050931872780748,"score_gpt":0.303081793315775,"score_spread":0.23257247458796754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517841585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018005648,0.00051773986,0.9929353,0.0005930322,0.0015635139,0.00036834134,0.0000030382578,0.000049329465,0.0021691674],"genre_scores_gemma":[0.79416114,0.000050297254,0.20434242,0.00092736,0.00043770653,0.0000054802613,0.0000011404424,0.000025980231,0.00004845322],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99609977,0.00008092051,0.0008600925,0.0010542161,0.0012734832,0.00063152314],"domain_scores_gemma":[0.9971324,0.0007282852,0.00039597647,0.0014403923,0.00023603824,0.00006688793],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011980123,0.0004232718,0.0005420248,0.00081218017,0.00031658323,0.0006918692,0.0047454634,0.00027579285,0.00001122012],"category_scores_gemma":[0.00021671214,0.0003304802,0.00014561535,0.0010434747,0.003704753,0.00059967913,0.00092080265,0.0008474374,0.000027503174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014821737,0.000095098265,0.00019933537,0.00003918439,0.000010739524,0.00029139858,0.019184887,0.10755168,0.0005798013,0.22793026,0.000036243528,0.6440666],"study_design_scores_gemma":[0.00004823656,0.0001376875,0.000105246414,0.00029882984,0.0000055083187,0.00015491479,0.0000022020415,0.45297474,0.0074599497,0.53598976,0.0023057605,0.00051716925],"about_ca_topic_score_codex":0.00017302638,"about_ca_topic_score_gemma":0.0005109853,"teacher_disagreement_score":0.7923606,"about_ca_system_score_codex":0.00022437828,"about_ca_system_score_gemma":0.0011922272,"threshold_uncertainty_score":0.9999147},"labels":[],"label_agreement":null},{"id":"W1518382228","doi":"10.5281/zenodo.8275536","title":"King and Rook Vs. King on a Quarter-Infinite Board","year":2006,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); White (mutation); Mathematics; Position (finance); Combinatorics; Arithmetic; Mathematical economics; History; Economics; Archaeology; Finance","score_opus":0.023184962655759176,"score_gpt":0.2624805918829682,"score_spread":0.239295629227209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518382228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21034509,0.000063492276,0.7093786,0.0028049871,0.0004425436,0.00015291842,4.531093e-7,0.00045329757,0.07635859],"genre_scores_gemma":[0.97880083,0.0000027175795,0.019318184,0.00086771103,0.00012830243,0.0000055635282,2.8598717e-7,0.000006959243,0.0008694564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892306,0.000031416588,0.00021884675,0.00034454744,0.00021181897,0.00027029656],"domain_scores_gemma":[0.9993422,0.00016847879,0.000055128505,0.0003471167,0.00003541292,0.000051663897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016465472,0.00012123603,0.00011827047,0.00010459292,0.00012341575,0.00031770248,0.00037228144,0.00004679585,0.0000316844],"category_scores_gemma":[0.000021291982,0.000106160216,0.00003745688,0.00018177328,0.000051063027,0.00034130883,0.00012582446,0.00010231593,0.00020174649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001650792,0.00010434684,0.03107288,0.000014851179,0.000012379479,0.00006616938,0.0016162208,0.0008988754,0.00358953,0.7825611,0.0038166281,0.17623046],"study_design_scores_gemma":[0.0002775454,0.0007489188,0.05299207,0.00020177367,0.00001309871,0.00004333154,0.0003524439,0.6620623,0.078891434,0.15241703,0.050808575,0.001191487],"about_ca_topic_score_codex":0.0010149967,"about_ca_topic_score_gemma":0.00046182837,"teacher_disagreement_score":0.76845574,"about_ca_system_score_codex":0.00002487881,"about_ca_system_score_gemma":0.00001590069,"threshold_uncertainty_score":0.4329088},"labels":[],"label_agreement":null},{"id":"W1518923210","doi":"","title":"Planification optimale discrete et continue: un joueur de billard autonome optimise","year":2012,"lang":"fr","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Humanities; Philosophy; Physics","score_opus":0.06506211470114333,"score_gpt":0.3247021749369293,"score_spread":0.259640060235786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518923210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027911693,0.004156638,0.91019714,0.025058178,0.0026604286,0.00036251015,0.000017003902,0.00028754494,0.029348891],"genre_scores_gemma":[0.67246544,0.00036797728,0.29151827,0.0012639178,0.0005058044,0.000028893888,0.000008708018,0.000033834058,0.03380712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970493,0.00036970747,0.0006074425,0.0005131639,0.00034449314,0.0011159045],"domain_scores_gemma":[0.99783874,0.00034865146,0.00024388537,0.00087815523,0.00018824896,0.00050229515],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016724403,0.00032426725,0.0002933748,0.00011199671,0.0002052197,0.00055350456,0.0010281006,0.0002445885,0.0013838471],"category_scores_gemma":[0.00026694036,0.00031668824,0.0001527347,0.00041855258,0.0002914645,0.0022361965,0.000391172,0.00034907256,0.002532621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018450457,0.00034124605,0.010914373,0.00003236839,0.00006849679,0.000023051107,0.014096025,0.007836675,0.0016593125,0.84751004,0.007177603,0.11032235],"study_design_scores_gemma":[0.00020656714,0.0002502183,0.016279802,0.00013967964,0.00008778514,0.0002616655,0.0009771991,0.48147562,0.07447468,0.00728251,0.41738194,0.0011823376],"about_ca_topic_score_codex":0.00051599386,"about_ca_topic_score_gemma":0.00003889868,"teacher_disagreement_score":0.84022754,"about_ca_system_score_codex":0.00018803104,"about_ca_system_score_gemma":0.00021948693,"threshold_uncertainty_score":0.99992853},"labels":[],"label_agreement":null},{"id":"W1519010826","doi":"10.1007/11674399_20","title":"Current Challenges in Multi-player Game Search","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Perfect information; Adversary; Pruning; Combinatorial game theory; Bridge (graph theory); Sequential game; Video game design; Bayesian game; Game design; Game theory; Artificial intelligence; Mathematical economics; Computer security; Mathematics","score_opus":0.11637098636436781,"score_gpt":0.3351997276131082,"score_spread":0.21882874124874035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519010826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001693241,0.007885086,0.9853141,0.0011471376,0.0023992884,0.00051475706,0.000003772012,0.00017480613,0.0023917542],"genre_scores_gemma":[0.6180037,0.0026137405,0.37670422,0.0006611294,0.0012515786,0.000049424063,0.000008242239,0.00012605409,0.00058190495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99419194,0.00008310121,0.00084088894,0.0023026094,0.0014191788,0.0011623022],"domain_scores_gemma":[0.9969168,0.0006213165,0.0002218335,0.0017573705,0.00028925648,0.00019346527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014328144,0.00067603734,0.0006642929,0.0016048503,0.00013801902,0.00049598725,0.005005775,0.00039590042,0.00002337033],"category_scores_gemma":[0.000103510145,0.0006402163,0.00015606763,0.00076549884,0.00095349544,0.0007276201,0.0019725726,0.0016440492,0.00022953747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030817969,0.000087899796,0.0001669654,0.00004333395,0.0000032161258,0.0001147668,0.0014737742,0.07236776,0.000042534524,0.015287263,0.000017674836,0.91039175],"study_design_scores_gemma":[0.00017579607,0.00013383963,0.0008656293,0.00081121875,0.0000035042688,0.000042112068,7.399001e-7,0.90019965,0.0027119233,0.08842378,0.005587554,0.0010442466],"about_ca_topic_score_codex":0.00012264689,"about_ca_topic_score_gemma":0.0010969024,"teacher_disagreement_score":0.9093475,"about_ca_system_score_codex":0.0005507619,"about_ca_system_score_gemma":0.0006136683,"threshold_uncertainty_score":0.99960494},"labels":[],"label_agreement":null},{"id":"W1520256545","doi":"10.1007/11922155_3","title":"Automatic Generation of Search Engines","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Tree (set theory); Task (project management); Search tree; Beam search; Search engine; Search algorithm; Domain (mathematical analysis); Selection (genetic algorithm); Incremental heuristic search; Function (biology); Depth-first search; Machine learning; Data mining; Information retrieval; Artificial intelligence; Algorithm","score_opus":0.0445269752488981,"score_gpt":0.2853629682350087,"score_spread":0.24083599298611058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520256545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012405594,0.00030854202,0.99453205,0.00032997385,0.0012816212,0.000290658,0.0000027488056,0.00013348123,0.0018803531],"genre_scores_gemma":[0.49233145,0.000019335295,0.50632954,0.00023801484,0.0006433808,0.000006206549,0.0000052319356,0.000028380822,0.00039848033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967595,0.00003535265,0.0006722542,0.00097354024,0.0010866394,0.00047271175],"domain_scores_gemma":[0.9977451,0.00037835387,0.00024126115,0.0011794822,0.0003717443,0.00008406838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081539055,0.00035687682,0.00043892418,0.00086790405,0.00013429757,0.0002905904,0.00272076,0.00024213636,0.000035520425],"category_scores_gemma":[0.00008414612,0.00032946217,0.00011248613,0.0006224189,0.0007150637,0.00051018933,0.0007735438,0.00043883323,0.00004822209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8007026e-7,0.000021989403,0.00003422221,0.000038807375,0.000004982124,0.00002088722,0.00052785,0.19250785,0.0015473345,0.020278139,0.00006103459,0.78495634],"study_design_scores_gemma":[0.000031225143,0.000082592815,0.000040974308,0.00015854849,0.0000034246918,0.000016150854,8.157935e-8,0.91017544,0.04637677,0.042656794,0.00015852909,0.00029946837],"about_ca_topic_score_codex":0.00008075232,"about_ca_topic_score_gemma":0.00008929804,"teacher_disagreement_score":0.7846569,"about_ca_system_score_codex":0.00018540824,"about_ca_system_score_gemma":0.00047999283,"threshold_uncertainty_score":0.9999157},"labels":[],"label_agreement":null},{"id":"W1522634567","doi":"","title":"A Reusable Scripting Engine for Automating Cinematics and Cut-Scenes in Video Games","year":2007,"lang":"en","type":"article","venue":"Loading...","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scripting language; Computer science; Storytelling; Programmer; Process (computing); Multimedia; Animation; World Wide Web; Software engineering; Narrative; Programming language; Computer graphics (images)","score_opus":0.029614963632382547,"score_gpt":0.3001682791499486,"score_spread":0.27055331551756606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522634567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32212034,0.00028880034,0.6753418,0.00041157645,0.00028146408,0.00026512166,7.4695566e-7,0.00019097765,0.0010991896],"genre_scores_gemma":[0.7253193,0.000007381392,0.27422222,0.00016006747,0.000083231396,0.000013241406,4.433162e-7,0.000011554306,0.0001825052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857473,0.00001887646,0.00047381004,0.00031715893,0.00016304506,0.00045235408],"domain_scores_gemma":[0.9987815,0.0006323112,0.00012993425,0.00030047068,0.000078334146,0.00007742293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012898222,0.0001388247,0.00021492154,0.00020194106,0.000114023016,0.00016356066,0.00040508126,0.000066673965,0.000005468003],"category_scores_gemma":[0.00090665626,0.00013694074,0.000036846,0.00039689126,0.00004823881,0.00043867977,0.00016796992,0.00011074216,0.000009670602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003731176,0.00022653332,0.03855052,0.0008287895,0.000051957824,0.000088594694,0.030444242,0.003788395,0.06411976,0.14291246,0.0029009169,0.7160505],"study_design_scores_gemma":[0.00015519236,0.00008314157,0.0011191854,0.00031944222,0.0000056582985,0.000021858079,0.00093775947,0.8622766,0.11761957,0.015725048,0.001465298,0.0002712284],"about_ca_topic_score_codex":0.00007016157,"about_ca_topic_score_gemma":0.0001417842,"teacher_disagreement_score":0.8584882,"about_ca_system_score_codex":0.00005071432,"about_ca_system_score_gemma":0.000025055673,"threshold_uncertainty_score":0.55842817},"labels":[],"label_agreement":null},{"id":"W1522771270","doi":"","title":"Template Authoring Environment for the Automatic Generation of Narrative Content","year":2012,"lang":"en","type":"article","venue":"The Journal of Interactive Learning Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Narrative; Multimedia; Instructional design; Computer-Assisted Instruction; Content (measure theory); Teaching method; World Wide Web; Mathematics education; Psychology; Linguistics","score_opus":0.3694016127736161,"score_gpt":0.4451798977828462,"score_spread":0.07577828500923012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522771270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50125283,0.00047326187,0.49473748,0.0027929752,0.0003799517,0.00028330655,2.919286e-7,0.0000061047717,0.00007379163],"genre_scores_gemma":[0.9949581,0.000076463584,0.004294201,0.00002209866,0.0002976844,0.000014421123,1.2771666e-7,0.00000826707,0.00032862378],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973177,0.0011557272,0.00045181028,0.00008268231,0.0006823876,0.0003097229],"domain_scores_gemma":[0.99301565,0.005601679,0.0005034283,0.00023563403,0.00058144284,0.00006218921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008726427,0.00008352685,0.00015328621,0.00014365705,0.000498576,0.000082643615,0.0008980777,0.000030313086,0.00005304342],"category_scores_gemma":[0.0020003787,0.000043051095,0.00009520929,0.00016212123,0.00020087446,0.00071029825,0.00023022671,0.000853346,0.000020784077],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037133283,0.00031085403,0.0029269606,0.000035730885,0.0005140761,0.000003847235,0.3691303,0.04576878,0.29424867,0.005417923,0.0020494135,0.2792221],"study_design_scores_gemma":[0.00023774509,0.0016489809,0.0064667175,0.00024543266,0.00003909967,0.00011395552,0.068570785,0.48901352,0.42686898,0.00115546,0.0054830285,0.00015629396],"about_ca_topic_score_codex":0.00003872463,"about_ca_topic_score_gemma":0.000002886544,"teacher_disagreement_score":0.49370527,"about_ca_system_score_codex":0.00017452844,"about_ca_system_score_gemma":0.000062641746,"threshold_uncertainty_score":0.38346934},"labels":[],"label_agreement":null},{"id":"W1526187220","doi":"10.1007/978-0-387-35706-5_15","title":"Search and Knowledge in Lines of Action","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Olympiad; Action (physics); Domain (mathematical analysis); Gold medal; Computer science; Class (philosophy); Position (finance); Artificial intelligence; Mathematics education; Psychology; Mathematics; Art; Business; Art history","score_opus":0.051817475745823405,"score_gpt":0.3466774546907443,"score_spread":0.2948599789449209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526187220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006421624,0.047860112,0.8851394,0.0004957733,0.0032793514,0.00085749413,0.000009237953,0.0002128545,0.055724137],"genre_scores_gemma":[0.5803531,0.053134583,0.33986735,0.000373143,0.0016819994,0.000055255572,0.000015356194,0.00016655879,0.024352668],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982565,0.000038361337,0.00058329897,0.0006214488,0.000237544,0.0002628616],"domain_scores_gemma":[0.99890935,0.00030572395,0.00014711003,0.00047029086,0.00011529847,0.00005225048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002585309,0.00028383342,0.0004771934,0.0005649052,0.000024652296,0.00005202738,0.0007406425,0.00020220963,0.000014124991],"category_scores_gemma":[0.000011910385,0.00028578425,0.00006732657,0.00015611078,0.0002660868,0.0009197442,0.0005575852,0.0004164624,0.000024970139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007403138,0.000038067305,0.00032627888,0.00014501488,0.0000063557964,0.000023437868,0.0009274767,0.007920894,0.000011415287,0.22870745,0.000011015831,0.7618752],"study_design_scores_gemma":[0.0005790233,0.0006359345,0.0011855493,0.0047603515,0.000012915666,0.00005212123,0.00007940302,0.17433076,0.0076918607,0.7305566,0.07872524,0.0013902155],"about_ca_topic_score_codex":0.000055612818,"about_ca_topic_score_gemma":0.00059633976,"teacher_disagreement_score":0.760485,"about_ca_system_score_codex":0.00012185322,"about_ca_system_score_gemma":0.0001486408,"threshold_uncertainty_score":0.9999594},"labels":[],"label_agreement":null},{"id":"W1528097685","doi":"10.1007/978-3-642-12993-3_2","title":"A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Monte Carlo tree search; Scalability; Parallel computing; Tree (set theory); Monte Carlo method; Algorithm; Lock (firearm); Search tree; Search algorithm; Node (physics); Monte Carlo algorithm; Theoretical computer science; Mathematics; Operating system","score_opus":0.032951479933572905,"score_gpt":0.2787970192146341,"score_spread":0.24584553928106123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528097685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016392782,0.00040915393,0.9900702,0.0015844546,0.0035946777,0.0006831743,0.000014978818,0.00039238817,0.0030870012],"genre_scores_gemma":[0.0303348,0.00005291446,0.96586406,0.001016051,0.0011777196,0.000023025226,0.0000027128779,0.00008251264,0.0014462296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99283135,0.000064546526,0.0008952453,0.0026417917,0.0021846378,0.0013824205],"domain_scores_gemma":[0.9934067,0.00093358534,0.0003141649,0.0042561693,0.0006631035,0.00042626963],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014169486,0.00089643925,0.0008276491,0.0013016502,0.0004797455,0.0011358846,0.011760163,0.0008416707,0.000071701455],"category_scores_gemma":[0.0003422065,0.0008261125,0.00028161102,0.0009958057,0.0022496295,0.0010172526,0.0046395455,0.0027424821,0.00030819906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049168243,0.000047019927,0.000026469386,0.000016356487,0.0000133093345,0.00019572373,0.0015927169,0.007681895,0.0005807186,0.004675182,0.00003680641,0.9851289],"study_design_scores_gemma":[0.00020328154,0.00021743617,0.0000638477,0.00024960292,0.000009131506,0.00011118184,8.3220004e-7,0.82707435,0.020844026,0.14816388,0.0020349661,0.0010274767],"about_ca_topic_score_codex":0.0002946041,"about_ca_topic_score_gemma":0.001202635,"teacher_disagreement_score":0.9841014,"about_ca_system_score_codex":0.00038619406,"about_ca_system_score_gemma":0.00096033537,"threshold_uncertainty_score":0.99990106},"labels":[],"label_agreement":null},{"id":"W1528184253","doi":"10.1007/978-3-642-31866-5_2","title":"Revisiting Move Groups in Monte-Carlo Tree Search","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Branching (polymer chemistry); Tree (set theory); Monte Carlo method; Game tree; Mathematical optimization; Search tree; Algorithm; Theoretical computer science; Search algorithm; Game theory; Mathematics; Combinatorics; Statistics; Sequential game; Mathematical economics","score_opus":0.04173228012486649,"score_gpt":0.2875969155058841,"score_spread":0.24586463538101763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528184253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015091748,0.0019689167,0.98808885,0.0009917712,0.0015505787,0.00050520175,0.0000028597867,0.00017548168,0.0052071474],"genre_scores_gemma":[0.77364606,0.00015123827,0.22330712,0.0009914696,0.0014395912,0.000015334152,0.0000016621511,0.00006200353,0.000385532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99414456,0.00010198732,0.0009453935,0.0018640364,0.0015273904,0.0014166067],"domain_scores_gemma":[0.9962368,0.0010454959,0.00029259743,0.0018570352,0.000283939,0.00028414573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024891314,0.0006637646,0.00074164994,0.0013619649,0.00023419909,0.0007163406,0.005253303,0.0004500033,0.00004530403],"category_scores_gemma":[0.00024627612,0.00063713867,0.00018549646,0.0011800902,0.0008661428,0.0013982789,0.0025787975,0.0016626228,0.00021577098],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004341353,0.000023035609,0.0006859436,0.000032256692,0.000005130688,0.00011281919,0.0025524718,0.02505987,0.00013026953,0.019821666,0.000005928741,0.9515663],"study_design_scores_gemma":[0.00014392388,0.000118677934,0.0014682695,0.0011139718,0.0000073631422,0.000086861866,0.00000275179,0.889973,0.0038776437,0.10108945,0.00083580846,0.001282283],"about_ca_topic_score_codex":0.00017540329,"about_ca_topic_score_gemma":0.00026588087,"teacher_disagreement_score":0.950284,"about_ca_system_score_codex":0.0006643886,"about_ca_system_score_gemma":0.00043641892,"threshold_uncertainty_score":0.999608},"labels":[],"label_agreement":null},{"id":"W1528805538","doi":"10.1609/aiide.v10i1.12721","title":"Emotion-Based Interactive Storytelling with Artificial Intelligence","year":2014,"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":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Narrative; Storytelling; Computer science; Interactive storytelling; Video game; Human–computer interaction; Multimedia; Artificial intelligence; Game design; Art","score_opus":0.038404339894905506,"score_gpt":0.2749786095355833,"score_spread":0.2365742696406778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528805538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24661776,0.000017282673,0.73413694,0.004224758,0.00073965004,0.0009891252,0.00001888603,0.0001815488,0.013074067],"genre_scores_gemma":[0.9968505,0.000016166085,0.002186113,0.0005579463,0.00012126531,0.000077973295,0.0000034170027,0.00003888037,0.00014776418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959662,0.000065442226,0.0011393756,0.0011832782,0.0009580024,0.00068768754],"domain_scores_gemma":[0.9965414,0.0006715944,0.0008827883,0.00056709826,0.0010863232,0.00025083314],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000543661,0.0006403846,0.0005841784,0.0003767453,0.00037477404,0.0013046315,0.0020136808,0.00014101015,0.000085578686],"category_scores_gemma":[0.0007122331,0.00046347853,0.0002462215,0.0006917713,0.00083712244,0.002148573,0.0005471382,0.0006916173,0.00013780853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063625723,0.00077777705,0.0005694671,0.00005372854,0.00009148823,0.0000022749953,0.0041247164,0.0011813442,0.0042319084,0.5505732,0.000030475323,0.43772733],"study_design_scores_gemma":[0.000040417814,0.0017653046,0.000101247366,0.00090306986,0.00003125607,0.000014521782,0.00712509,0.2969247,0.5706516,0.1214953,0.0003156033,0.0006318696],"about_ca_topic_score_codex":0.00004770448,"about_ca_topic_score_gemma":0.000017801854,"teacher_disagreement_score":0.7502327,"about_ca_system_score_codex":0.00022472162,"about_ca_system_score_gemma":0.00012248906,"threshold_uncertainty_score":0.99978167},"labels":[],"label_agreement":null},{"id":"W1529977182","doi":"10.1007/s00182-015-0484-8","title":"Misère-play Hackenbush Sprigs","year":2015,"lang":"da","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical economics; Computer science; Mathematics","score_opus":0.0544581537954976,"score_gpt":0.3308740018835286,"score_spread":0.276415848088031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529977182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15451445,0.006586775,0.7477503,0.014270531,0.048045807,0.0002804946,0.00005086635,0.00010150311,0.028399272],"genre_scores_gemma":[0.9840966,0.0002459674,0.006750377,0.0013963479,0.0038457122,0.0000016899222,0.0000022729484,0.00003479902,0.0036262209],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99484265,0.0006024562,0.0014859239,0.0003715233,0.0022406273,0.00045679905],"domain_scores_gemma":[0.9930641,0.00085621944,0.0014296205,0.00053507107,0.0035609773,0.0005540124],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0042707296,0.0003451314,0.00048753014,0.00057635177,0.000054679716,0.0006950361,0.0049704057,0.0001880856,0.000569864],"category_scores_gemma":[0.002329835,0.00030843224,0.00041202034,0.000297558,0.00047369394,0.0015986068,0.0006334149,0.0007710698,0.001611354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017015663,0.00095498405,0.0018228629,0.000016097567,0.0013781813,0.0031104344,0.03038759,0.0053936522,0.001493413,0.45571876,0.03428185,0.4637406],"study_design_scores_gemma":[0.0014197265,0.0012179441,0.000898285,0.0008842847,0.00014177812,0.003344343,0.0031194307,0.011514484,0.02466446,0.7067126,0.24518096,0.00090167235],"about_ca_topic_score_codex":0.000045812474,"about_ca_topic_score_gemma":0.000012191195,"teacher_disagreement_score":0.82958215,"about_ca_system_score_codex":0.00054238713,"about_ca_system_score_gemma":0.0010803976,"threshold_uncertainty_score":0.99993676},"labels":[],"label_agreement":null},{"id":"W1533329939","doi":"10.1007/978-3-540-45078-8_14","title":"The One-Round Voronoi Game Replayed","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Voronoi diagram; Polygon (computer graphics); Fraction (chemistry); Mathematics; Polyomino; Regular polygon; Discrete mathematics; Computer science; Geometry; Telecommunications","score_opus":0.03409214620184781,"score_gpt":0.27259146106672577,"score_spread":0.23849931486487796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533329939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005500682,0.001160559,0.98113304,0.0035203442,0.0040100953,0.00049437163,0.0000019827542,0.00019896691,0.009425656],"genre_scores_gemma":[0.2082299,0.0007559447,0.76139754,0.015113166,0.0025376612,0.000081573104,0.000006085641,0.00023071757,0.011647425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945029,0.000089877896,0.0008634845,0.0019511571,0.001490393,0.0011021981],"domain_scores_gemma":[0.99425083,0.0015375313,0.00045190152,0.0031518312,0.0003857353,0.00022219584],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019603935,0.000634383,0.00053831167,0.00043393127,0.00071211846,0.0017599668,0.0069545293,0.00038416535,0.00003364628],"category_scores_gemma":[0.0004061767,0.00049313466,0.00020057075,0.00072441925,0.0019357132,0.00075539935,0.001527171,0.001208225,0.0002562584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006353877,0.000026151522,0.00001575386,0.000010214877,0.000016887107,0.00005282782,0.00081497984,0.008833703,0.000078197416,0.14395967,0.00016110855,0.84602416],"study_design_scores_gemma":[0.00008797917,0.00021722764,0.000030544543,0.00023395564,0.000010621464,0.00008939283,5.596231e-7,0.24682663,0.0067788158,0.6961818,0.048580866,0.00096161093],"about_ca_topic_score_codex":0.000044804798,"about_ca_topic_score_gemma":0.00031164134,"teacher_disagreement_score":0.84506255,"about_ca_system_score_codex":0.00048496382,"about_ca_system_score_gemma":0.0006356352,"threshold_uncertainty_score":0.99975204},"labels":[],"label_agreement":null},{"id":"W1533630040","doi":"10.1007/978-3-642-03364-3_43","title":"Pathfinding Strategy for Multiple Non-Playing Characters in 2.5 D Game Worlds","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Pathfinding; Computer science; Computer graphics (images); Human–computer interaction; Theoretical computer science; Shortest path problem","score_opus":0.042652186438964776,"score_gpt":0.29013502451942447,"score_spread":0.24748283808045968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533630040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021571715,0.00015966377,0.99344796,0.00048295362,0.0016696271,0.00094550743,0.0000060955313,0.00014201259,0.0009890053],"genre_scores_gemma":[0.8142632,0.000030870542,0.18378784,0.0010672978,0.0004816991,0.00003302966,0.000006771858,0.000043546403,0.0002856962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504155,0.000032652966,0.0009351173,0.0019629132,0.000824064,0.001203686],"domain_scores_gemma":[0.996756,0.0011659769,0.0004308655,0.0012295616,0.00021923441,0.00019836634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013096564,0.00068173715,0.00073549594,0.0015475026,0.00025150678,0.00083841226,0.003928743,0.0004248676,0.000009022378],"category_scores_gemma":[0.00022166598,0.000681844,0.00020025914,0.00088256644,0.00047053187,0.0010978078,0.0006803017,0.0010254928,0.000040596537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125860515,0.000036562666,0.00033333548,0.000030083283,0.000005323767,0.00009373309,0.0018526978,0.069666736,0.0007501692,0.004987664,0.0000059039894,0.9222252],"study_design_scores_gemma":[0.00021091569,0.00024148925,0.0009606097,0.0006961906,0.0000037338934,0.000025071451,0.0000012583188,0.88055634,0.00444312,0.11159441,0.00038876958,0.00087809266],"about_ca_topic_score_codex":0.00005569812,"about_ca_topic_score_gemma":0.00042574934,"teacher_disagreement_score":0.9213471,"about_ca_system_score_codex":0.00055421604,"about_ca_system_score_gemma":0.00055984576,"threshold_uncertainty_score":0.9995633},"labels":[],"label_agreement":null},{"id":"W1533732250","doi":"10.1002/0471743984.vse0668","title":"Artificial Intelligence: Game Playing Systems","year":2005,"lang":"en","type":"other","venue":"Van Nostrand's Scientific Encyclopedia","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.029567315554073357,"score_gpt":0.2793499618393051,"score_spread":0.24978264628523175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533732250","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000107226246,0.003024428,0.33032924,0.0002703638,0.02021751,0.0011664443,0.0001205018,0.0016199864,0.6431443],"genre_scores_gemma":[0.014321857,0.00091367745,0.017129965,0.00010785412,0.004775933,0.0001447285,0.000108967375,0.000629964,0.96186703],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9927683,0.0002235918,0.0014448059,0.002408881,0.0017054714,0.0014489332],"domain_scores_gemma":[0.9956547,0.0002837237,0.0007310971,0.002583327,0.0002218783,0.0005252801],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013033646,0.00093514,0.00089152413,0.0014441054,0.00047430652,0.0025255957,0.004346866,0.00078718393,0.0039137485],"category_scores_gemma":[0.00023873986,0.0008938263,0.00035708502,0.0018214878,0.0008129474,0.0006965509,0.00053474045,0.0008553516,0.010295108],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015164152,0.00040138903,0.000093051276,0.00020418709,0.00012516583,0.00018633174,0.002462038,0.0016637894,0.0003762113,0.065642595,0.517444,0.41138604],"study_design_scores_gemma":[0.000038057024,0.000067647605,0.000013663983,0.00044688763,0.000046718957,0.00003796351,0.00023305808,0.019201707,0.00061062066,0.0031244897,0.9749346,0.0012446048],"about_ca_topic_score_codex":0.0002160866,"about_ca_topic_score_gemma":0.0004720218,"teacher_disagreement_score":0.45749053,"about_ca_system_score_codex":0.00016317816,"about_ca_system_score_gemma":0.0005185311,"threshold_uncertainty_score":0.99935126},"labels":[],"label_agreement":null},{"id":"W1540121360","doi":"","title":"Improving state evaluation, inference, and search in trick-based card games","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Inference; Computer science; State (computer science); Imperfect; Perfect information; Artificial intelligence; Machine learning; Mathematics; Algorithm; Mathematical economics","score_opus":0.05529363839634508,"score_gpt":0.3486744496508938,"score_spread":0.2933808112545487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540121360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40616414,0.00011727526,0.5897812,0.0011542402,0.0000689142,0.00028451873,4.5696873e-7,0.000091021284,0.0023381829],"genre_scores_gemma":[0.98123336,0.0000093315475,0.018179603,0.00039585299,0.000013313337,0.000009498918,6.026774e-7,0.000002849095,0.00015560644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860406,0.00012555123,0.00025044996,0.0003348744,0.0004158541,0.000269206],"domain_scores_gemma":[0.99915934,0.00021154709,0.00003892411,0.00030834076,0.0002098831,0.000071950664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010902679,0.00009715319,0.000119964025,0.000251024,0.00005424083,0.00021360266,0.00037251232,0.00003523151,0.000024960287],"category_scores_gemma":[0.00027537337,0.00008531639,0.000020624786,0.00056327245,0.00004733913,0.00044377794,0.00006986233,0.00011737489,0.000024007526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043973396,0.000031355612,0.0071106404,0.0000032589635,0.0000012623492,0.0000038927656,0.0008934367,0.004851506,0.00082768674,0.0043254835,0.00004724807,0.98189986],"study_design_scores_gemma":[0.00012490372,0.00011412724,0.023962772,0.000010884101,0.0000017213388,7.957852e-7,0.00007915668,0.9411934,0.0216364,0.012676717,0.00006920493,0.00012989632],"about_ca_topic_score_codex":0.0004719224,"about_ca_topic_score_gemma":0.00021888687,"teacher_disagreement_score":0.9817699,"about_ca_system_score_codex":0.00006274868,"about_ca_system_score_gemma":0.00028106588,"threshold_uncertainty_score":0.34791014},"labels":[],"label_agreement":null},{"id":"W1540218530","doi":"10.1007/11527862_34","title":"Automatic State Abstraction for Pathfinding in Real-Time Video Games","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Pathfinding; Abstraction; Adversarial system; Domain (mathematical analysis); State (computer science); Video game; Plan (archaeology); Human–computer interaction; Artificial intelligence; Theoretical computer science; Programming language; Multimedia","score_opus":0.027409968702692352,"score_gpt":0.28901069773212085,"score_spread":0.2616007290294285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540218530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030112073,0.00011941902,0.99189353,0.0006012737,0.0013301087,0.0008356984,0.000007156915,0.00030088186,0.0019007054],"genre_scores_gemma":[0.21058139,0.0001482632,0.78656256,0.0006775249,0.00074465945,0.00007365316,0.000007927793,0.000083657505,0.0011203408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956165,0.000039102342,0.0009874273,0.0015969083,0.0008541542,0.00090592325],"domain_scores_gemma":[0.99661267,0.0013846563,0.0005047904,0.0011346745,0.00021235259,0.00015085806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015453704,0.00055280706,0.0006258374,0.0012994991,0.00020982484,0.00067453814,0.0026920172,0.00031563872,0.000054476113],"category_scores_gemma":[0.00023263534,0.00054561713,0.00016010633,0.00061591354,0.00051336235,0.0012257639,0.00061480235,0.0006546072,0.00017021067],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048523298,0.000028074872,0.000029776264,0.00003658064,0.0000054133498,0.000035572335,0.0014022766,0.059708044,0.000687028,0.0037043435,0.00002594088,0.9343321],"study_design_scores_gemma":[0.00009729772,0.00012305683,0.00021446502,0.0004908831,0.0000044428634,0.00002680048,4.266042e-7,0.82511955,0.005336465,0.16721979,0.0008055834,0.00056121615],"about_ca_topic_score_codex":0.00009567576,"about_ca_topic_score_gemma":0.0003553211,"teacher_disagreement_score":0.9337709,"about_ca_system_score_codex":0.00075455295,"about_ca_system_score_gemma":0.0005388001,"threshold_uncertainty_score":0.99969953},"labels":[],"label_agreement":null},{"id":"W1543366997","doi":"10.1017/cbo9780511807251.002","title":"Playing games with algorithms: Algorithmic combinatorial game theory","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorial game theory; Ideal (ethics); Computer science; Game complexity; Algorithmic game theory; Game theory; Constraint (computer-aided design); Theoretical computer science; Turns, rounds and time-keeping systems in games; Computational complexity theory; Algorithm; Mathematics; Sequential game; Game mechanics; Video game design; Mathematical economics; Artificial intelligence; Worst-case complexity","score_opus":0.021657216718611517,"score_gpt":0.2509490699804338,"score_spread":0.2292918532618223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543366997","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005518444,0.0004303167,0.42463472,0.00022741227,0.0013467935,0.00041259607,0.000005877575,0.000628219,0.57230854],"genre_scores_gemma":[0.00628661,0.00031709732,0.1296677,0.001406119,0.0022422848,0.00004374212,0.000022664304,0.00020719321,0.8598066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996314,0.00006565754,0.00068277586,0.0012493564,0.0010164303,0.0006717712],"domain_scores_gemma":[0.9971111,0.0004312532,0.000403194,0.0014983942,0.0003111075,0.00024495312],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005603203,0.000797518,0.00075560884,0.00036395813,0.00021404542,0.0004698912,0.0023492696,0.00054843974,0.00038167898],"category_scores_gemma":[0.00004107985,0.0006455194,0.00024145911,0.00012368572,0.0003673642,0.00061767583,0.00041124225,0.0008820537,0.00089291023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016319129,0.000022455191,0.0000013702015,0.000006444459,0.00005898742,0.00012735608,0.00025026526,0.000019422354,0.0000045241823,0.6652496,0.0005594327,0.33368382],"study_design_scores_gemma":[0.0002395543,0.00060392625,0.000008631446,0.00029694574,0.000056190205,0.00012391183,0.000036341415,0.009565488,0.00091947254,0.89398223,0.09289779,0.001269536],"about_ca_topic_score_codex":0.000029288767,"about_ca_topic_score_gemma":0.000011215059,"teacher_disagreement_score":0.33241427,"about_ca_system_score_codex":0.00018740386,"about_ca_system_score_gemma":0.00032377272,"threshold_uncertainty_score":0.999885},"labels":[],"label_agreement":null},{"id":"W1544541733","doi":"10.1609/aimag.v34i1.2459","title":"Reports of the 2012 AIIDE Workshops","year":2013,"lang":"en","type":"article","venue":"AI Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Entertainment; Narrative; Computer science; Multimedia; Artificial intelligence; Engineering; Visual arts; Art","score_opus":0.016028542405376413,"score_gpt":0.2570612207469419,"score_spread":0.24103267834156547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544541733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27291137,0.0010671668,0.58918405,0.0677235,0.0054272623,0.0012741593,0.0000015139401,0.00045690173,0.0619541],"genre_scores_gemma":[0.98448336,0.000006182392,0.0065522757,0.0013181443,0.000073523806,0.000016436124,2.4376644e-7,0.000006900456,0.007542909],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898905,0.00003693956,0.00032274565,0.00021221898,0.00023794886,0.00020111198],"domain_scores_gemma":[0.99854976,0.000077972625,0.00015389804,0.0010112189,0.0001579202,0.00004923588],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019458505,0.00008549015,0.00011182091,0.000035025623,0.00005184802,0.00006552847,0.00072018296,0.000042643118,0.00034669467],"category_scores_gemma":[0.00014404804,0.000056096946,0.000069152826,0.00036063115,0.00010655749,0.0006194657,0.00037106822,0.00012173608,0.00078303943],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025758472,0.00015713798,0.021174327,0.000019292276,0.00003176995,0.00004063814,0.0012602515,0.0007379334,0.023547573,0.045026585,0.5230059,0.38499603],"study_design_scores_gemma":[0.00010113173,0.00012246071,0.2354681,0.00016855999,0.000023333952,0.00026832984,0.00008577286,0.03897724,0.1745154,0.2952355,0.2543465,0.00068767864],"about_ca_topic_score_codex":0.00007022904,"about_ca_topic_score_gemma":0.000034602155,"teacher_disagreement_score":0.711572,"about_ca_system_score_codex":0.000012954456,"about_ca_system_score_gemma":0.000037408416,"threshold_uncertainty_score":0.999995},"labels":[],"label_agreement":null},{"id":"W1548403904","doi":"10.1007/978-3-540-89378-3_5","title":"Knowledge Generation for Improving Simulations in UCT for General Game Playing","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Monte Carlo tree search; Heuristic; Tree (set theory); Variety (cybernetics); Convergence (economics); Artificial intelligence; Domain (mathematical analysis); Machine learning; Theoretical computer science; Monte Carlo method","score_opus":0.06872235864019587,"score_gpt":0.3167640353685558,"score_spread":0.24804167672835992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548403904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017110308,0.000505817,0.9935609,0.00028554862,0.002291846,0.0013266779,0.000016630585,0.00010688537,0.00019467092],"genre_scores_gemma":[0.3718684,0.00001585869,0.6260204,0.0003550893,0.0013375524,0.00006855956,0.000017316488,0.00003962701,0.00027725188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653685,0.000027497632,0.0007577668,0.0015303302,0.00041700326,0.00073053996],"domain_scores_gemma":[0.99723333,0.0010691038,0.00028926932,0.0008638328,0.00043437726,0.000110078734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006752995,0.00045258718,0.00046703918,0.0010062291,0.0004229274,0.00043386588,0.001974444,0.00033397292,0.0000044955677],"category_scores_gemma":[0.00034699374,0.00046297652,0.0001673145,0.0005111895,0.00037131057,0.00079885696,0.00053269445,0.00040429411,0.000009173858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060701705,0.00003021563,0.00003736468,0.000037856164,0.0000043537752,0.000006629912,0.002412782,0.395976,0.0030972054,0.012530784,0.000029750647,0.585831],"study_design_scores_gemma":[0.00016208581,0.00013427729,0.000022652279,0.00008824871,0.000004571061,0.000013307869,1.9957312e-7,0.94768363,0.006843162,0.043491915,0.001061186,0.00049476384],"about_ca_topic_score_codex":0.00003571908,"about_ca_topic_score_gemma":0.00086186995,"teacher_disagreement_score":0.5853362,"about_ca_system_score_codex":0.000503618,"about_ca_system_score_gemma":0.00075760856,"threshold_uncertainty_score":0.9997822},"labels":[],"label_agreement":null},{"id":"W1548895693","doi":"10.1007/978-0-387-35706-5_1","title":"Evaluation Function Tuning via Ordinal Correlation","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Metric (unit); Correlation; Computer science; Function (biology); Feature (linguistics); Quality (philosophy); Evaluation function; Space (punctuation); Artificial intelligence; Ordinal optimization; Mathematics; Data mining; Machine learning; Ordinal data; Engineering","score_opus":0.03255499166891886,"score_gpt":0.2965026661006124,"score_spread":0.26394767443169354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548895693","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023785744,0.004444508,0.93345785,0.00012280443,0.0056676217,0.00047953398,0.0000014623345,0.00022920543,0.05557321],"genre_scores_gemma":[0.43394175,0.0044304975,0.5097229,0.0018458404,0.0060330806,0.00029348632,0.000242095,0.00036048453,0.043129854],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677646,0.0000891816,0.0007258445,0.0009474411,0.001109283,0.0003517698],"domain_scores_gemma":[0.99806035,0.00024412986,0.0004952745,0.0007373139,0.0003868407,0.000076075885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087359274,0.00044207106,0.00041287046,0.00047793888,0.000119627875,0.00017364019,0.00083953235,0.00030477488,0.00018171407],"category_scores_gemma":[0.000035518133,0.0004739328,0.00014187332,0.00014528264,0.00013466743,0.001913821,0.0003223785,0.0005681234,0.00033501946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000786303,0.000015503163,0.000036237572,0.000015337384,0.000016581142,0.0000117791,0.00019923477,0.124935545,0.0000031077714,0.123380035,0.00005880475,0.75131994],"study_design_scores_gemma":[0.00012513119,0.00016749698,0.00007476049,0.00037941284,0.000031628184,0.000014744156,0.0000032411035,0.4780514,0.000042768694,0.4947024,0.026039729,0.00036730006],"about_ca_topic_score_codex":0.000019669384,"about_ca_topic_score_gemma":0.00010155152,"teacher_disagreement_score":0.75095266,"about_ca_system_score_codex":0.0006533225,"about_ca_system_score_gemma":0.00024386219,"threshold_uncertainty_score":0.99977124},"labels":[],"label_agreement":null},{"id":"W1549676634","doi":"","title":"Real-time heuristic search with a priority queue","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Priority queue; Queue; Heuristic; Beam search; Incremental heuristic search; Path (computing); Search algorithm; Artificial intelligence; Machine learning; Algorithm; Computer network","score_opus":0.026675362950403222,"score_gpt":0.3091101925018805,"score_spread":0.28243482955147725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549676634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16090283,0.0000065913923,0.77566713,0.00039569603,0.00007476193,0.00013824244,2.8535078e-7,0.0003299625,0.062484484],"genre_scores_gemma":[0.8445963,0.000006296198,0.15059175,0.00012044092,0.00007533426,0.0000023892374,3.9330723e-7,0.000008991882,0.004598091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986235,0.000038604674,0.0001983238,0.00034384185,0.00038184098,0.00041388176],"domain_scores_gemma":[0.9988449,0.00026562205,0.00003204953,0.0005609594,0.00015002667,0.00014641511],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000807369,0.00010660621,0.00011758954,0.000088131106,0.000101470876,0.0001235393,0.00072587107,0.000046627127,0.00012702741],"category_scores_gemma":[0.000050646577,0.00007999951,0.000027210875,0.000464185,0.000110633664,0.00028274333,0.00018108201,0.00013273204,0.0010603064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120575685,0.00041171385,0.017499277,0.000036360114,0.00005071047,0.00070132344,0.0060797036,0.00044467143,0.02457255,0.6866137,0.0031382516,0.26033115],"study_design_scores_gemma":[0.00040158996,0.0016948086,0.059453383,0.00012136927,0.000022392038,0.00031638157,0.0008950434,0.33592463,0.5609157,0.029829912,0.008611484,0.0018133095],"about_ca_topic_score_codex":0.00096479285,"about_ca_topic_score_gemma":0.00025508556,"teacher_disagreement_score":0.68369347,"about_ca_system_score_codex":0.000057422112,"about_ca_system_score_gemma":0.00011427728,"threshold_uncertainty_score":0.9997175},"labels":[],"label_agreement":null},{"id":"W1549713128","doi":"10.1007/11922155_17","title":"Solving Probabilistic Combinatorial Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Probabilistic logic; Monte Carlo method; Solver; Heuristic; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.020544321648159714,"score_gpt":0.2557867510401933,"score_spread":0.2352424293920336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549713128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009332671,0.00036401188,0.9755218,0.0004508443,0.006681577,0.0005357987,0.0000034458621,0.00034731103,0.016001908],"genre_scores_gemma":[0.616279,0.000031001407,0.3783466,0.001079158,0.002738048,0.000035374425,0.000008771385,0.00010936401,0.0013727085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946555,0.000048455957,0.0008531465,0.0020179984,0.0014345729,0.0009903626],"domain_scores_gemma":[0.9962146,0.00091710786,0.00040016498,0.0018569399,0.0004207725,0.00019036673],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010309669,0.0006885685,0.0006751321,0.00081774656,0.00035372085,0.0010678483,0.005084082,0.0004452783,0.0000329559],"category_scores_gemma":[0.0003371783,0.00065586704,0.00019229407,0.00071304175,0.0014504694,0.0008053678,0.0018668273,0.0010324662,0.00015612316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058650326,0.00007119552,0.00007177079,0.000053907544,0.000010522551,0.0001667826,0.00073566666,0.07711703,0.00014057462,0.3526067,0.00026158564,0.56875837],"study_design_scores_gemma":[0.00008058629,0.00012745157,0.000028931494,0.00026725393,0.0000064522756,0.00003378351,9.842352e-8,0.36365637,0.0019833676,0.6302988,0.0028613685,0.00065552857],"about_ca_topic_score_codex":0.00011188475,"about_ca_topic_score_gemma":0.00012038533,"teacher_disagreement_score":0.61618567,"about_ca_system_score_codex":0.00062743144,"about_ca_system_score_gemma":0.00083320844,"threshold_uncertainty_score":0.9999691},"labels":[],"label_agreement":null},{"id":"W1554010179","doi":"10.1007/978-3-540-75538-8_10","title":"Automatic Strategy Verification for Hex","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Correctness; Computer science; Notation; Programming language; Tree (set theory); Theoretical computer science; Algorithm; Arithmetic; Mathematics","score_opus":0.06068119719418439,"score_gpt":0.31847913712450593,"score_spread":0.2577979399303215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554010179","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010114939,0.0002663525,0.9930614,0.00040919287,0.0018082306,0.00074420363,0.000004256251,0.00027755462,0.0033276374],"genre_scores_gemma":[0.15703075,0.000027037024,0.8404687,0.0011318602,0.00070898194,0.00003338641,0.000008262997,0.000051242776,0.0005397633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996247,0.000020219743,0.00072119624,0.0014314601,0.0008483105,0.00073184405],"domain_scores_gemma":[0.99675894,0.0008492317,0.0003592386,0.0014817946,0.00039030792,0.00016048914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001385737,0.00045827345,0.00043800677,0.00080270134,0.00026793437,0.0006240228,0.0035635452,0.00036799666,0.000036414105],"category_scores_gemma":[0.00018070408,0.00044053028,0.0001488099,0.00056443375,0.00068254326,0.00066586555,0.00048874476,0.0004992373,0.000109410095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025234701,0.000017121178,0.0000059071335,0.00003246194,0.000005044347,0.000012634079,0.0003885672,0.011797889,0.00013252412,0.063854516,0.000023879331,0.9237269],"study_design_scores_gemma":[0.000050869563,0.00015363363,0.000037552185,0.000146153,0.000004722422,0.000018860423,2.795918e-7,0.70529544,0.0058561657,0.28658855,0.0014360707,0.00041168093],"about_ca_topic_score_codex":0.000019541923,"about_ca_topic_score_gemma":0.00009166198,"teacher_disagreement_score":0.9233152,"about_ca_system_score_codex":0.00035616528,"about_ca_system_score_gemma":0.0006060041,"threshold_uncertainty_score":0.9998047},"labels":[],"label_agreement":null},{"id":"W1554761681","doi":"10.1002/0470018860.s00001","title":"<scp>S</scp> amuel's Checkers Player","year":2005,"lang":"en","type":"other","venue":"Encyclopedia of Cognitive Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Chemistry","score_opus":0.017700459482022403,"score_gpt":0.2887828272592685,"score_spread":0.2710823677772461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554761681","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004161397,0.0011046439,0.05316395,0.00007621531,0.0016314646,0.0005185242,0.000042160435,0.00036202528,0.9426849],"genre_scores_gemma":[0.014169997,0.0017166005,0.019685376,0.00035282795,0.0009046098,0.00006322958,0.0000057057346,0.00021953249,0.9628821],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99541146,0.000083570885,0.0005767867,0.0013546894,0.0016260818,0.0009473872],"domain_scores_gemma":[0.9966467,0.00092349824,0.0007040632,0.0009056109,0.00047619137,0.000343912],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008201208,0.00051187794,0.00055826857,0.0010780357,0.00017193552,0.00017859366,0.0038580662,0.00028052414,0.0006421197],"category_scores_gemma":[0.0034452504,0.0004891424,0.00016965397,0.0021461288,0.0025471863,0.00088309916,0.0008758567,0.0004494957,0.0016717798],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054178413,0.00048585059,0.0012363886,0.00011588032,0.0001138003,0.00009250135,0.009883175,0.0000263446,0.0005548603,0.031679,0.5472344,0.40857235],"study_design_scores_gemma":[0.00015913001,0.00015776578,0.0010831701,0.00070041674,0.000034275883,0.000014703682,0.000953567,0.00096117996,0.009730345,0.0017569334,0.9840441,0.00040444543],"about_ca_topic_score_codex":0.00010610153,"about_ca_topic_score_gemma":0.00008085549,"teacher_disagreement_score":0.43680963,"about_ca_system_score_codex":0.00008104655,"about_ca_system_score_gemma":0.0010085539,"threshold_uncertainty_score":0.99975604},"labels":[],"label_agreement":null},{"id":"W1556798312","doi":"10.1109/icmla.2004.1383507","title":"Creating an SVM to play strong poker","year":2005,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institutes of Health; University of Alberta; National Science Foundation","keywords":"Support vector machine; Computer science; Machine learning; Artificial intelligence; Training set; Human–computer interaction","score_opus":0.04349356215248667,"score_gpt":0.3279901815167409,"score_spread":0.28449661936425424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556798312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1383571,0.0000091681795,0.80155575,0.0016869707,0.00012547827,0.00008810047,3.3329397e-7,0.0002581841,0.057918914],"genre_scores_gemma":[0.7344186,3.680982e-7,0.261923,0.0010526773,0.00018137446,0.00000534355,2.4399972e-7,0.00000518872,0.0024132333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990121,0.00002610375,0.00018348856,0.00030440532,0.00019675697,0.00027710307],"domain_scores_gemma":[0.99923724,0.00006351596,0.000026492484,0.00046284465,0.00005235457,0.00015757245],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001908846,0.00008855281,0.00008044887,0.00006451141,0.00010962196,0.00021126443,0.0007536605,0.000031650878,0.00032310883],"category_scores_gemma":[0.000055262906,0.00007739375,0.000026445605,0.00019571083,0.000018206467,0.0008444503,0.00019216837,0.00006968395,0.0012772824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028688687,0.00007743715,0.0020861807,0.0000011322903,0.00000591635,0.000005320644,0.006196557,0.011828835,0.003383933,0.2959843,0.002312098,0.6781154],"study_design_scores_gemma":[0.00005843806,0.00028108782,0.0035995478,0.000021300062,0.0000035601706,0.0000134169595,0.0010826862,0.7360374,0.2096601,0.0029293376,0.045769215,0.00054392614],"about_ca_topic_score_codex":0.00015183711,"about_ca_topic_score_gemma":0.00037366446,"teacher_disagreement_score":0.72420853,"about_ca_system_score_codex":0.000039561175,"about_ca_system_score_gemma":0.00002701444,"threshold_uncertainty_score":0.99950033},"labels":[],"label_agreement":null},{"id":"W1557039239","doi":"10.1007/978-3-540-89694-4_39","title":"General Game Playing with Ants","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Combinatorial game theory; Artificial intelligence; Neuroevolution; Sequential game; Heuristic; Tree (set theory); Video game design; Monte Carlo tree search; Game design; Machine learning; Game theory; Artificial neural network; Mathematical economics","score_opus":0.03200967312283512,"score_gpt":0.26380372756818066,"score_spread":0.23179405444534554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557039239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017758524,0.0004264205,0.9907869,0.00046039038,0.0013414423,0.00034132626,0.0000027860824,0.00025180005,0.0046131015],"genre_scores_gemma":[0.28498164,0.00016748325,0.71088755,0.0019756118,0.00088269205,0.000012199787,0.0000030032652,0.000068696165,0.0010211068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522394,0.000030797128,0.000565235,0.0018560897,0.0013897179,0.00093421014],"domain_scores_gemma":[0.9971466,0.000351088,0.00031495257,0.0016583726,0.00029536508,0.00023362173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043443358,0.000642896,0.0005839861,0.0008087867,0.00035561333,0.0005407838,0.0043132817,0.00031440402,0.00002766965],"category_scores_gemma":[0.00006388185,0.00053316756,0.00011481055,0.00072375365,0.0014329315,0.00088489836,0.001240143,0.0009343591,0.00014269965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137303205,0.000038337188,0.00035174782,0.000021081023,0.000019243358,0.00087740744,0.0031963976,0.09207852,0.00022058563,0.013875109,0.00007597676,0.88923186],"study_design_scores_gemma":[0.00016799709,0.00040203397,0.00029896072,0.00053168094,0.000008233722,0.0007227848,3.1747823e-7,0.9275812,0.007472689,0.05818017,0.0032019909,0.0014319432],"about_ca_topic_score_codex":0.000052419706,"about_ca_topic_score_gemma":0.00013771659,"teacher_disagreement_score":0.8877999,"about_ca_system_score_codex":0.00030841277,"about_ca_system_score_gemma":0.0007786829,"threshold_uncertainty_score":0.999712},"labels":[],"label_agreement":null},{"id":"W1557327310","doi":"10.1007/978-3-540-72665-4_18","title":"Pattern Classification in No-Limit Poker: A Head-Start Evolutionary Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Scratch; Classifier (UML); Artificial intelligence; Head (geology); Machine learning; Limit (mathematics); Operating system; Mathematics","score_opus":0.07049702177687692,"score_gpt":0.2965773750016932,"score_spread":0.22608035322481626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557327310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001481225,0.0004618542,0.98239106,0.000790925,0.0018048399,0.00062545325,0.0000054175193,0.00020127538,0.013571036],"genre_scores_gemma":[0.3227607,0.0000865666,0.67221826,0.00305507,0.0009900142,0.000041335134,0.000024659726,0.00007042494,0.0007529733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941196,0.00007218668,0.0010246853,0.0022277741,0.0015201018,0.0010356462],"domain_scores_gemma":[0.99650365,0.0005928142,0.0003814344,0.0018694624,0.00043714684,0.00021548069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016544547,0.0006428329,0.00059606583,0.0016000152,0.00023430242,0.0004115455,0.004187513,0.00056100026,0.000035283356],"category_scores_gemma":[0.00016781258,0.00063671794,0.0001655105,0.0011549665,0.0010232985,0.00095864566,0.0012319391,0.0013460547,0.00035111044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000115790335,0.00013090031,0.0013370486,0.00005031955,0.0000083891455,0.00009454112,0.0012060344,0.020998787,0.00011995841,0.01775189,0.00007922726,0.9582113],"study_design_scores_gemma":[0.000106564155,0.00013531192,0.0020581337,0.0002921231,0.0000042194333,0.0000597764,0.0000010905668,0.93334144,0.00033447982,0.05971456,0.0031876452,0.0007646628],"about_ca_topic_score_codex":0.00016795036,"about_ca_topic_score_gemma":0.00033407944,"teacher_disagreement_score":0.95744663,"about_ca_system_score_codex":0.00095471105,"about_ca_system_score_gemma":0.0006689694,"threshold_uncertainty_score":0.9996084},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.28257455156000755,"score_gpt":0.41729197661527706,"score_spread":0.1347174250552695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558653343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007116401,0.000059119175,0.64777106,0.02305132,0.0027269006,0.00083188637,0.000014616655,0.0006636843,0.31776503],"genre_scores_gemma":[0.98287827,0.00039970077,0.010055198,0.00048288613,0.00051440723,0.000074666386,0.000008878534,0.000045746834,0.005540227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99360204,0.0005925188,0.0012766991,0.0014436988,0.0019996513,0.001085395],"domain_scores_gemma":[0.9954255,0.00063793187,0.00027421664,0.001319262,0.0018241118,0.0005189358],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020886024,0.0004961211,0.00045009205,0.00086606224,0.00037961826,0.0012969344,0.0030346015,0.00026654443,0.0036564989],"category_scores_gemma":[0.0016411508,0.00048954954,0.00022526414,0.0010499633,0.0004680361,0.0011078019,0.0003864516,0.0010274877,0.012101767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033139648,0.0003114199,0.000008505881,0.0000044612866,0.000033574466,0.00008795116,0.0009965312,0.000975009,0.009780004,0.85489124,0.0018021909,0.131076],"study_design_scores_gemma":[0.000037514077,0.0004950916,0.000023695728,0.00014409231,0.000004341533,0.000035489724,0.0007804939,0.10297585,0.12851565,0.76099294,0.0054461723,0.00054866844],"about_ca_topic_score_codex":0.00065259374,"about_ca_topic_score_gemma":0.00019179183,"teacher_disagreement_score":0.9757619,"about_ca_system_score_codex":0.0003580123,"about_ca_system_score_gemma":0.0011784498,"threshold_uncertainty_score":0.9997556},"labels":[],"label_agreement":null},{"id":"W1559991383","doi":"","title":"Close Reading Oblivion: Character Believability and Intelligent Personalization in Games","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Character (mathematics); Reading (process); Computer science; Context (archaeology); Personalization; Class (philosophy); Artificial intelligence; Human–computer interaction; World Wide Web; Linguistics; History","score_opus":0.026924743168301724,"score_gpt":0.29160622394668656,"score_spread":0.2646814807783848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559991383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5666862,0.00019494307,0.42325458,0.005451308,0.00021133394,0.00026265462,4.4931824e-7,0.00018067879,0.003757859],"genre_scores_gemma":[0.99062073,0.00009316086,0.007964795,0.0009560133,0.000048365273,0.0000047695653,0.0000010877393,0.0000033566157,0.00030770627],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99883646,0.000063544176,0.00028767853,0.0004048572,0.00018628887,0.00022118489],"domain_scores_gemma":[0.99940693,0.00009378906,0.000051603805,0.0003143528,0.0000631834,0.00007016137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044587435,0.000114637885,0.00013251932,0.0001287075,0.00005480052,0.00015412722,0.0003037222,0.00005879802,0.00006305676],"category_scores_gemma":[0.00012162011,0.00010208371,0.000030093574,0.00034087215,0.00005066946,0.0006795033,0.000089015324,0.000105077466,0.00004534426],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011610473,0.00016867058,0.03308074,0.00001272313,0.0000036065019,0.000011767657,0.008231785,0.000027852222,0.002350237,0.2664984,0.00019149523,0.6894111],"study_design_scores_gemma":[0.000189421,0.0005077096,0.3893008,0.00020440355,0.00000870937,0.000054024185,0.0012798057,0.30862403,0.08773037,0.20390493,0.00722072,0.0009750833],"about_ca_topic_score_codex":0.0000533301,"about_ca_topic_score_gemma":0.000045449848,"teacher_disagreement_score":0.68843603,"about_ca_system_score_codex":0.00006442107,"about_ca_system_score_gemma":0.000024109828,"threshold_uncertainty_score":0.41628528},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Narrative; Entertainment; Computer science; Multimedia; Human–computer interaction; Visual arts; Art; Literature","score_opus":0.02883995263335977,"score_gpt":0.29865965176641496,"score_spread":0.2698196991330552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561304027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03329441,0.00015910798,0.9466431,0.0014514351,0.0011425101,0.0006953562,0.0000014144581,0.00037864776,0.016234009],"genre_scores_gemma":[0.98035145,0.000009052732,0.015866365,0.00069296354,0.00019358155,0.00016691955,0.0000066396474,0.00001861492,0.0026944391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981867,0.00016836658,0.00039135813,0.00056550873,0.00030828445,0.00037979],"domain_scores_gemma":[0.9983871,0.000096502205,0.00012627442,0.00083006197,0.00036823787,0.00019181824],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024580152,0.00021969885,0.00023610408,0.00013834886,0.00012565557,0.00060478854,0.0012223152,0.00007670008,0.00019501489],"category_scores_gemma":[0.00007504341,0.00018419456,0.000061017683,0.00039614487,0.00010927443,0.002345863,0.00029852748,0.00027000188,0.003592104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003732887,0.0017134299,0.0014636364,0.00010120983,0.00020800144,0.000052460706,0.087984756,0.010995244,0.016724382,0.4083665,0.09346241,0.37889063],"study_design_scores_gemma":[0.00007296644,0.00035586004,0.0008931542,0.000038186652,0.000006305464,0.000061328064,0.0043367944,0.95836437,0.0073347734,0.0104923155,0.017549403,0.0004945527],"about_ca_topic_score_codex":0.00029113432,"about_ca_topic_score_gemma":0.000013217528,"teacher_disagreement_score":0.9473691,"about_ca_system_score_codex":0.000084925145,"about_ca_system_score_gemma":0.000048007827,"threshold_uncertainty_score":0.99718374},"labels":[],"label_agreement":null},{"id":"W1570029409","doi":"10.1007/978-3-540-24653-4_55","title":"Evolutionary Bayesian Network Dynamic Planner for Game RISK","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Planner; Dynamic Bayesian network; Bayesian network; Variety (cybernetics); Artificial intelligence; Bayesian game; Sequential game; Machine learning; Game theory","score_opus":0.01424545189315369,"score_gpt":0.25754386432445603,"score_spread":0.24329841243130235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570029409","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000244158,0.0010859399,0.99184585,0.000891856,0.0038446696,0.00083923107,0.000026092364,0.00028828485,0.0011536791],"genre_scores_gemma":[0.17580359,0.0001135003,0.82104254,0.0011844333,0.0012416515,0.000044140823,0.000015899042,0.00006973554,0.00048452377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950103,0.00004421295,0.0007713255,0.0020285593,0.0009583001,0.001187261],"domain_scores_gemma":[0.9962563,0.00101486,0.00049077114,0.0016713566,0.0003287543,0.00023795919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000989166,0.000679524,0.00061553356,0.00061243813,0.00049784215,0.00047898391,0.0044035143,0.00050268444,0.000039500883],"category_scores_gemma":[0.00020071564,0.0006464014,0.000272386,0.0006687734,0.0010735161,0.0006880751,0.0011460515,0.0009888811,0.00009428433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010796393,0.000021369864,0.000061120845,0.000020811467,0.00001374685,0.000036360885,0.00041591868,0.5686284,0.000006933032,0.057931043,0.00009046165,0.37276307],"study_design_scores_gemma":[0.000069961985,0.00013574821,0.00006832105,0.00022288463,0.0000076472215,0.000026647196,1.0471343e-7,0.50281996,0.000066207314,0.4945051,0.001639333,0.0004380704],"about_ca_topic_score_codex":0.000054007174,"about_ca_topic_score_gemma":0.00023891356,"teacher_disagreement_score":0.43657407,"about_ca_system_score_codex":0.00084906444,"about_ca_system_score_gemma":0.0010632494,"threshold_uncertainty_score":0.99959874},"labels":[],"label_agreement":null},{"id":"W1572687114","doi":"10.1007/978-3-642-17928-0_1","title":"Solving Hex: Beyond Humans","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Milestone; Computer science; Programming language; Computational science; Geography; Cartography","score_opus":0.0371784039329341,"score_gpt":0.2685304265615198,"score_spread":0.23135202262858573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572687114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049864277,0.0005424003,0.9572247,0.0004300421,0.0032730042,0.00033009212,0.0000025980296,0.00029983892,0.03784744],"genre_scores_gemma":[0.31344593,0.00013747571,0.67806095,0.0038212605,0.0014623703,0.000021195909,0.0000042376896,0.00011433969,0.002932266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504775,0.000036500653,0.00075396546,0.002023793,0.0011293467,0.0010086662],"domain_scores_gemma":[0.99638027,0.00046074443,0.00036950145,0.0022194814,0.00032729277,0.00024268306],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010139603,0.0006702963,0.00060410483,0.0009838676,0.0004299809,0.00073724164,0.006557342,0.00042798242,0.00015872906],"category_scores_gemma":[0.0001274803,0.00063679664,0.00020096284,0.0005965326,0.0013735631,0.0010624214,0.0024664854,0.0011006661,0.00043729614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026918312,0.0000280505,0.00005101839,0.000019259793,0.000010059612,0.0001279453,0.003336358,0.003343114,0.00016413587,0.14457214,0.00006454169,0.84828067],"study_design_scores_gemma":[0.00005775458,0.00017636329,0.000042816453,0.0003015633,0.000008208712,0.00005274555,3.6056133e-7,0.1086245,0.011397881,0.8747952,0.003572668,0.0009699254],"about_ca_topic_score_codex":0.000078044075,"about_ca_topic_score_gemma":0.00025651656,"teacher_disagreement_score":0.8473108,"about_ca_system_score_codex":0.0003138848,"about_ca_system_score_gemma":0.00056487013,"threshold_uncertainty_score":0.99960834},"labels":[],"label_agreement":null},{"id":"W1572882980","doi":"10.1007/3-540-45579-5_6","title":"Awari Retrograde Analysis","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Chess endgame; Algorithm; Parallel computing; Artificial intelligence","score_opus":0.028662821462548678,"score_gpt":0.28063687768884416,"score_spread":0.2519740562262955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572882980","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006888858,0.00046859193,0.9837347,0.0013217119,0.0015476298,0.0002756465,0.0000033549554,0.00030987745,0.012269557],"genre_scores_gemma":[0.33698025,0.0002281603,0.6566312,0.0026946764,0.0011302588,0.000016581325,0.000011597411,0.000072599214,0.0022347325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99443895,0.000046070065,0.00080084585,0.0022214116,0.0015099131,0.0009827927],"domain_scores_gemma":[0.99585974,0.00055328576,0.00039595677,0.002594646,0.00032412205,0.0002722358],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001041485,0.0006496979,0.00084001827,0.0024585593,0.00031228035,0.0009462935,0.006128519,0.00045513405,0.000121849],"category_scores_gemma":[0.00015220666,0.0006102791,0.0004318999,0.0036723553,0.0011475494,0.0007522463,0.0016947697,0.001053325,0.00020731748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031515985,0.000034649274,0.00078327575,0.000009800551,0.000095914285,0.00023820547,0.00072923524,0.07286685,0.000032738066,0.05135441,0.000041669497,0.8738101],"study_design_scores_gemma":[0.00005021957,0.00012898387,0.00020508621,0.000104286024,0.000074490854,0.000046536275,2.3667965e-7,0.7005513,0.0013094784,0.2895618,0.0071035624,0.00086402847],"about_ca_topic_score_codex":0.000112475325,"about_ca_topic_score_gemma":0.0004441618,"teacher_disagreement_score":0.8729461,"about_ca_system_score_codex":0.00042941445,"about_ca_system_score_gemma":0.00044920182,"threshold_uncertainty_score":0.99963486},"labels":[],"label_agreement":null},{"id":"W1576937451","doi":"10.1007/s10796-012-9343-3","title":"Concept learning games","year":2012,"lang":"en","type":"article","venue":"Information Systems Frontiers","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Process (computing); Notation; Domain (mathematical analysis); Human–computer interaction; Knowledge management","score_opus":0.016781034709765878,"score_gpt":0.2457360322075365,"score_spread":0.22895499749777062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576937451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017424172,0.00067528815,0.97020227,0.00011284806,0.0047780243,0.00017661304,9.726725e-7,0.0003317855,0.02197981],"genre_scores_gemma":[0.99033624,0.0000085712945,0.008581809,0.00015689981,0.00017222231,0.000025713507,0.0000042320094,0.0000044439253,0.00070988596],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986624,0.000079111516,0.00042827052,0.000078867175,0.00040712842,0.00034423062],"domain_scores_gemma":[0.99920636,0.000036853733,0.00023488585,0.00026617473,0.00012690367,0.00012884328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004998275,0.00010771712,0.00014162662,0.00015904536,0.0001453267,0.0003551849,0.0004575217,0.000071459894,0.0000081230555],"category_scores_gemma":[0.000122013065,0.00009995621,0.00004682374,0.00024928784,0.000048195056,0.0073260227,0.000083272585,0.0001332512,0.00072246976],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008603931,0.00003454594,0.034965735,0.0000630332,0.00007574026,0.000001106225,0.093165874,0.024624158,0.00008024482,0.32357034,0.15378238,0.36962825],"study_design_scores_gemma":[0.00006893348,0.00002560482,0.00045638334,0.00002188803,0.0000033612002,0.000017619042,0.010454618,0.1438052,0.0017306339,0.00011095364,0.84307647,0.00022830776],"about_ca_topic_score_codex":0.000028014045,"about_ca_topic_score_gemma":8.954429e-8,"teacher_disagreement_score":0.9885938,"about_ca_system_score_codex":0.000080919664,"about_ca_system_score_gemma":0.000034227538,"threshold_uncertainty_score":0.9286128},"labels":[],"label_agreement":null},{"id":"W1579046794","doi":"10.1007/978-0-387-35706-5_9","title":"DF-PN in Go: An Application to the One-Eye Problem","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Problem solver; Solver; Order (exchange); Computer science; Mathematics; Theoretical computer science; Algorithm; Mathematical optimization","score_opus":0.022639719726458465,"score_gpt":0.29932827622194697,"score_spread":0.2766885564954885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579046794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008938667,0.002027629,0.962756,0.002056206,0.0007585153,0.0013434238,0.0000058437754,0.00021391228,0.03074908],"genre_scores_gemma":[0.07346686,0.0029121058,0.8931605,0.0058447644,0.002421796,0.0008690314,0.000046812118,0.00022143383,0.021056693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685526,0.000061563966,0.00080454897,0.0012430713,0.0005310909,0.00050445047],"domain_scores_gemma":[0.9976628,0.00019701483,0.00029654213,0.0016008237,0.00012137765,0.00012147894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004539659,0.0004673574,0.00049775,0.00039115926,0.000084104024,0.00023843022,0.003126162,0.00023265035,0.000019992702],"category_scores_gemma":[0.0000125180995,0.00040630455,0.00009981962,0.0003071364,0.00016217897,0.0011327761,0.0007838706,0.0006205893,0.0004538604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005783839,0.000050395447,0.000085635686,0.000024000898,0.000005502286,0.0000125011375,0.0014664574,0.06320558,0.0000036807853,0.32499248,0.00005969993,0.6100883],"study_design_scores_gemma":[0.00010828198,0.00024968293,0.00021784137,0.00061734504,0.0000056838644,0.0000066729413,0.000013775969,0.042412136,0.00020244691,0.65004784,0.3054238,0.00069448334],"about_ca_topic_score_codex":0.00010071073,"about_ca_topic_score_gemma":0.0024064514,"teacher_disagreement_score":0.60939384,"about_ca_system_score_codex":0.00033471658,"about_ca_system_score_gemma":0.0001398411,"threshold_uncertainty_score":0.9998389},"labels":[],"label_agreement":null},{"id":"W1580378151","doi":"10.1007/978-0-387-35706-5_13","title":"Building the Checkers 10-Piece Endgame Databases","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in Computer Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chess endgame; Database; nobody; Computer science; Artificial intelligence","score_opus":0.038097764308383415,"score_gpt":0.31234599491663956,"score_spread":0.27424823060825615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580378151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002130852,0.012967162,0.92865777,0.00086572586,0.002537072,0.00047715034,0.000020583237,0.00035435168,0.054098897],"genre_scores_gemma":[0.011684022,0.011326474,0.92110986,0.003397299,0.0030469806,0.000119466495,0.00004194554,0.00024461956,0.04902932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99627084,0.00006136748,0.00087874866,0.001355918,0.00073544175,0.00069770054],"domain_scores_gemma":[0.9963699,0.00086406554,0.0005001952,0.0020002548,0.00014143101,0.00012415095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044801002,0.00071807293,0.0006632467,0.00034130138,0.00018625706,0.00031526407,0.003821774,0.00019853715,0.00023157087],"category_scores_gemma":[0.00006748939,0.0005743271,0.00025635524,0.0002214818,0.0005992772,0.001652979,0.0016790505,0.0008381105,0.00040601986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052550877,0.000018451427,0.000013890569,0.00003105453,0.00002276461,0.00008631498,0.00025508078,0.010282507,0.0000035505489,0.5921483,0.00056743657,0.3965654],"study_design_scores_gemma":[0.00010091262,0.00008413093,0.000011415557,0.0007786677,0.00001436521,0.000041211028,0.00000853771,0.01641533,0.0005621084,0.34710056,0.63419974,0.00068306626],"about_ca_topic_score_codex":0.00005262207,"about_ca_topic_score_gemma":0.00012767663,"teacher_disagreement_score":0.6336323,"about_ca_system_score_codex":0.0002873586,"about_ca_system_score_gemma":0.00022690756,"threshold_uncertainty_score":0.9996708},"labels":[],"label_agreement":null},{"id":"W1581788834","doi":"10.1007/978-3-642-02998-1_12","title":"An Active Approach to Automatic Case Generation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Sequence (biology); Domain (mathematical analysis); Artificial intelligence; Knowledge base; Base (topology); Expert system; Active learning (machine learning); Machine learning; Mathematics","score_opus":0.044316280826807705,"score_gpt":0.2948771930240831,"score_spread":0.2505609121972754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581788834","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008718715,0.00005729349,0.9930696,0.00038801707,0.0010259566,0.0006658692,0.0000034915874,0.0002916384,0.0036262907],"genre_scores_gemma":[0.25718132,0.0000036275467,0.7400238,0.0019387106,0.0006747883,0.000015714462,0.000005025364,0.000025528338,0.00013150068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958988,0.000065722576,0.00056455896,0.001888352,0.0009249634,0.0006576105],"domain_scores_gemma":[0.9970637,0.00018767691,0.00022925912,0.0018797775,0.0003067221,0.00033288987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007482261,0.0005329564,0.00046936283,0.00095286395,0.00037182166,0.00096967345,0.003236949,0.0003129749,0.000013164842],"category_scores_gemma":[0.00009936591,0.00050161645,0.00009693863,0.00078898465,0.00036099576,0.0012246626,0.00056587043,0.0006199242,0.000092573166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012654586,0.000048216705,9.040615e-7,0.0000062956333,0.0000035261837,0.00026022675,0.0025503526,0.13610649,0.00033951938,0.009707979,0.000015140083,0.8509601],"study_design_scores_gemma":[0.00003474595,0.00027617475,0.000009408518,0.000070486734,0.0000054226057,0.0007657249,8.265891e-7,0.9383015,0.009026035,0.050769173,0.00017086975,0.0005696103],"about_ca_topic_score_codex":0.000044766282,"about_ca_topic_score_gemma":0.00015571096,"teacher_disagreement_score":0.8503905,"about_ca_system_score_codex":0.00044813528,"about_ca_system_score_gemma":0.00044450077,"threshold_uncertainty_score":0.9997435},"labels":[],"label_agreement":null},{"id":"W1584722190","doi":"10.1007/978-3-642-04380-2_2","title":"Intelligent Expression-Based Character Agent Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Expression (computer science); Character (mathematics); Parameterized complexity; Creativity; Human–computer interaction; Realism; Computational creativity; Virtual actor; Artificial intelligence; Cognitive science; Virtual reality; Programming language; Epistemology; Algorithm; Psychology","score_opus":0.03437540564366268,"score_gpt":0.2738935967231103,"score_spread":0.23951819107944763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584722190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060108236,0.0008520109,0.9890693,0.0009528933,0.005018783,0.0007336581,0.00000518689,0.00033737536,0.0029707109],"genre_scores_gemma":[0.5280879,0.00017690874,0.45783108,0.00782252,0.0028937624,0.00007942263,0.000021703916,0.00015623792,0.0029304544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99387646,0.00007830933,0.0010667042,0.0022014643,0.0017427951,0.0010342513],"domain_scores_gemma":[0.9954996,0.00067839626,0.00054720795,0.0025067697,0.00041545997,0.00035255827],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011516325,0.00082860026,0.00077952433,0.0011735565,0.00032263497,0.0012364696,0.0056807837,0.0005037705,0.000059550628],"category_scores_gemma":[0.00014247815,0.0007202214,0.00025114373,0.00063720375,0.00071702944,0.0006803594,0.0010505144,0.0011015377,0.00038924866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008034433,0.00006742555,0.000026916538,0.000040152758,0.000007375953,0.0001920134,0.0006086573,0.12871796,0.00057836267,0.01326535,0.000080494065,0.8564073],"study_design_scores_gemma":[0.00008892574,0.00027457444,0.000040557105,0.0014119977,0.000008766633,0.000044679182,4.3069662e-7,0.892054,0.033003602,0.055325102,0.016556693,0.001190674],"about_ca_topic_score_codex":0.000031746928,"about_ca_topic_score_gemma":0.000020150186,"teacher_disagreement_score":0.85521656,"about_ca_system_score_codex":0.0006384638,"about_ca_system_score_gemma":0.0007639006,"threshold_uncertainty_score":0.9998003},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03450216205097408,"score_gpt":0.29190051913592235,"score_spread":0.2573983570849483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589331835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020651885,0.0002451869,0.97588956,0.0016974395,0.0015161696,0.0007277135,0.0000064279106,0.00029667182,0.019414317],"genre_scores_gemma":[0.5985713,0.00003955721,0.39568412,0.003567211,0.001124991,0.00002394784,0.0000039904844,0.0000691563,0.000915731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99398196,0.00002451515,0.00081947545,0.0022442292,0.0017410285,0.0011887945],"domain_scores_gemma":[0.9959287,0.0009084814,0.00021306315,0.002177043,0.0003232715,0.00044946437],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011799146,0.00071799627,0.0007032901,0.0012378406,0.00031736854,0.0010178456,0.006425225,0.0003774472,0.00013231536],"category_scores_gemma":[0.00013932562,0.00068586954,0.00015284136,0.0009147303,0.000925888,0.0004830731,0.002348344,0.0012546123,0.0012958337],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069913294,0.00003452627,0.000011967429,0.000020983869,0.0000074784866,0.000070973794,0.0010086597,0.10550114,0.00031782428,0.046378836,0.00010017183,0.84654045],"study_design_scores_gemma":[0.00029165702,0.0005735687,0.0008537646,0.0009919169,0.000021288115,0.00015397882,0.0000023547873,0.569946,0.030343799,0.36268532,0.03046364,0.0036727327],"about_ca_topic_score_codex":0.000050544848,"about_ca_topic_score_gemma":0.000142502,"teacher_disagreement_score":0.84286773,"about_ca_system_score_codex":0.0005091341,"about_ca_system_score_gemma":0.00066970044,"threshold_uncertainty_score":0.9995592},"labels":[],"label_agreement":null},{"id":"W1589775371","doi":"10.1007/978-3-540-87559-8_11","title":"Mimicking Go Experts with Convolutional Neural Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Machine learning; State (computer science); Artificial neural network; Algorithm","score_opus":0.028881556222992683,"score_gpt":0.25203080996713795,"score_spread":0.22314925374414527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589775371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020153417,0.0010869547,0.993726,0.0006404276,0.0020955775,0.0003370273,0.0000016522715,0.00023870589,0.0016720798],"genre_scores_gemma":[0.68098754,0.00009823579,0.3135101,0.0034328524,0.0014367657,0.00002039097,0.0000067151823,0.00007337825,0.00043403913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546003,0.000039673145,0.00057465694,0.0017443695,0.0012461621,0.00093507644],"domain_scores_gemma":[0.99717796,0.0006014809,0.0003204542,0.0013242004,0.00035393093,0.00022196652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038996,0.0006324344,0.0005524322,0.00058371073,0.0004749069,0.0004911554,0.003670459,0.0003392128,0.000029125524],"category_scores_gemma":[0.000057012632,0.0005342342,0.00013338673,0.0006297,0.0019067839,0.0008624122,0.001168302,0.00087490585,0.00002877743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009874035,0.000022331078,0.000120787394,0.0000066077005,0.000010673082,0.00041823505,0.0009983846,0.5746716,0.000014631098,0.00629631,0.00013571818,0.41729483],"study_design_scores_gemma":[0.00008183132,0.00017353735,0.00006479043,0.00022110397,0.0000040404407,0.0006518383,2.8585885e-7,0.98267835,0.0004682543,0.013434585,0.0015226706,0.0006986925],"about_ca_topic_score_codex":0.000032357115,"about_ca_topic_score_gemma":0.00012056762,"teacher_disagreement_score":0.680786,"about_ca_system_score_codex":0.00035126987,"about_ca_system_score_gemma":0.0005142711,"threshold_uncertainty_score":0.9997109},"labels":[],"label_agreement":null},{"id":"W1591786641","doi":"10.1609/socs.v2i1.18187","title":"Automatic Move Pruning in General Single-Player Games","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pruning; Computer science; Reduction (mathematics); Tree (set theory); Overhead (engineering); Class (philosophy); Search tree; Range (aeronautics); Depth-first search; State (computer science); Artificial intelligence; Algorithm; Machine learning; Search algorithm; Mathematics; Engineering","score_opus":0.02651344961679829,"score_gpt":0.28119017343454755,"score_spread":0.25467672381774925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591786641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96927285,0.00002165737,0.00016082941,0.0083764745,0.00444312,0.00020479495,0.000002080326,0.000067008456,0.017451175],"genre_scores_gemma":[0.99702805,0.000009843369,0.0018583261,0.00022164237,0.00030349565,0.000020341764,8.160998e-7,0.000015159697,0.00054232246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99751014,0.000032752152,0.0004720431,0.0004373035,0.0012286855,0.000319079],"domain_scores_gemma":[0.9985297,0.00021327379,0.00017113777,0.00022545106,0.0007940089,0.00006642987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904972,0.00016125737,0.00020699606,0.00013863994,0.00009248346,0.00035324733,0.002263578,0.00009062385,0.000050461484],"category_scores_gemma":[0.0004726324,0.00013699415,0.000119693235,0.0006468889,0.000094054856,0.00051264884,0.0009961836,0.00034579056,0.000026865515],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029407422,0.00048332143,0.009322912,0.00002822793,0.00004101177,0.000007947377,0.0014527839,0.00045637885,0.27716827,0.70465165,0.0005013132,0.005856788],"study_design_scores_gemma":[0.00028911536,0.00009874865,0.0019201284,0.00019559958,0.0000036905021,0.00001610166,0.0001438868,0.07183284,0.8843521,0.04000824,0.00096686283,0.00017267492],"about_ca_topic_score_codex":0.000107811335,"about_ca_topic_score_gemma":0.0000062158188,"teacher_disagreement_score":0.6646434,"about_ca_system_score_codex":0.00033905017,"about_ca_system_score_gemma":0.00012499013,"threshold_uncertainty_score":0.5586459},"labels":[],"label_agreement":null},{"id":"W1592551147","doi":"10.37236/2765","title":"Circular Nim Games","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Security token; Mathematics; Combinatorics; Combinatorial game theory; Discrete mathematics; Computer science; Sequential game; Game theory; Mathematical economics; Computer network","score_opus":0.010765171356181396,"score_gpt":0.23719402688060695,"score_spread":0.22642885552442554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592551147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2378969,0.006381801,0.7446369,0.007757462,0.0013237766,0.00019850777,7.181749e-8,0.000056491484,0.0017480947],"genre_scores_gemma":[0.99877477,0.0004046873,0.00013735631,0.0002575369,0.00010528527,0.0000038342414,4.4082757e-8,0.000010314946,0.00030616322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821836,0.00014021552,0.00043790735,0.00012164654,0.00051473576,0.00056711904],"domain_scores_gemma":[0.99836963,0.00023295746,0.0003622398,0.0004979129,0.00044927277,0.00008798507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097268017,0.00012816826,0.00020181935,0.000101066515,0.00013104879,0.00019243918,0.0022296219,0.000051995146,0.000037425354],"category_scores_gemma":[0.00015704484,0.00008305161,0.00014166038,0.0005058982,0.00008168764,0.00067543,0.0001410833,0.00063345325,0.000171007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020234218,0.000061610284,0.00017787267,0.000002600349,0.000042879852,0.0000058647515,0.00047110676,0.00009858103,0.00068273506,0.98668754,0.002073597,0.009693576],"study_design_scores_gemma":[0.00009057575,0.00030002222,0.00029685214,0.0000108336935,0.000011977787,0.00020519618,0.00012761644,0.0033818067,0.008187893,0.9787251,0.008551299,0.00011082739],"about_ca_topic_score_codex":0.000020287553,"about_ca_topic_score_gemma":0.0000011137167,"teacher_disagreement_score":0.76087785,"about_ca_system_score_codex":0.00021749036,"about_ca_system_score_gemma":0.00038410688,"threshold_uncertainty_score":0.41432294},"labels":[],"label_agreement":null},{"id":"W1594401763","doi":"","title":"Evaluating strategies for running from the cops","year":2009,"lang":"en","type":"article","venue":"Infoscience (Ecole Polytechnique Fédérale de Lausanne)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Minimax; Computer science; Heuristic; Computation; Sequential game; Game theory; Field (mathematics); Cover (algebra); Perspective (graphical); Theoretical computer science; Combinatorial game theory; Repeated game; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Mathematical economics; Engineering","score_opus":0.06441408290215903,"score_gpt":0.365870937390467,"score_spread":0.30145685448830795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594401763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06764263,0.00020469262,0.92310315,0.0045207986,0.0003757511,0.00091239455,0.000013773621,0.0007028704,0.0025239591],"genre_scores_gemma":[0.708712,0.00001499853,0.28649393,0.004214797,0.00020776321,0.00019472493,0.000002918528,0.000011596545,0.00014729923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971824,0.000110789166,0.00055896665,0.00068838114,0.00056823844,0.0008912002],"domain_scores_gemma":[0.99738204,0.0008404259,0.000286154,0.0011004675,0.00023311973,0.00015780027],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019982262,0.0002783713,0.00025632972,0.000120142126,0.00078472873,0.0011066516,0.003423863,0.00016313727,0.000029549796],"category_scores_gemma":[0.00062656315,0.00022906225,0.00014525838,0.00087134447,0.00031379715,0.001800538,0.0002735241,0.00034200976,0.00003890554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003989359,0.00014295254,0.0020286047,0.000011164982,0.000015280759,0.000016812288,0.007948017,0.009058304,0.13006462,0.45062798,0.006687636,0.39335874],"study_design_scores_gemma":[0.00014789378,0.00071801676,0.0039926483,0.00016682809,0.000014447036,0.000018950996,0.0011657899,0.4535817,0.1770104,0.35814756,0.0044411323,0.00059464923],"about_ca_topic_score_codex":0.0004446122,"about_ca_topic_score_gemma":0.00012885488,"teacher_disagreement_score":0.64106935,"about_ca_system_score_codex":0.0001343902,"about_ca_system_score_gemma":0.0006244013,"threshold_uncertainty_score":0.9999303},"labels":[],"label_agreement":null},{"id":"W1595285848","doi":"10.1007/11674399_2","title":"Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adversary; Computer science; Predictability; Exploit; Perfect information; Game tree; Imperfect; Tree (set theory); Adaptation (eye); Evaluation function; Strengths and weaknesses; Function (biology); Game theory; Sequential game; Theoretical computer science; Artificial intelligence; Mathematical economics; Computer security; Mathematics","score_opus":0.02015158814965948,"score_gpt":0.2538248566446211,"score_spread":0.23367326849496164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595285848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008650776,0.0001418205,0.99411386,0.00030197116,0.00060426735,0.00063051295,0.0000037013583,0.00015988653,0.0031788817],"genre_scores_gemma":[0.8640616,0.000010804869,0.1351498,0.00038705807,0.00019652818,0.000020770804,0.000013112732,0.000026531674,0.0001337858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959383,0.00004844012,0.00073241635,0.0010568699,0.0014314655,0.0007925306],"domain_scores_gemma":[0.9975616,0.0005680172,0.0002896538,0.0010559862,0.00039646696,0.0001282997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009202486,0.0005203771,0.0004688302,0.0016603488,0.00014428231,0.0007992906,0.0024419,0.00028845432,0.000011729927],"category_scores_gemma":[0.00008316928,0.00045377557,0.00007783976,0.0011187036,0.00077834463,0.0022459996,0.0006257811,0.00091056165,0.00012082954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008432294,0.000012562977,0.0000447217,0.00001443932,0.0000024212702,0.000021066986,0.0017570726,0.55224854,0.000012748578,0.0051220986,0.00000626513,0.44074962],"study_design_scores_gemma":[0.00014452444,0.00026786778,0.00031629184,0.0004605593,0.000004108035,0.000043229593,0.000002546073,0.96291953,0.00092642923,0.034170203,0.00018929149,0.00055543357],"about_ca_topic_score_codex":0.00042302144,"about_ca_topic_score_gemma":0.0014657155,"teacher_disagreement_score":0.86319655,"about_ca_system_score_codex":0.00057437876,"about_ca_system_score_gemma":0.00086249044,"threshold_uncertainty_score":0.9997914},"labels":[],"label_agreement":null},{"id":"W1597317312","doi":"10.1007/978-3-540-75538-8_11","title":"Feature Construction for Reinforcement Learning in Hearts","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Temporal difference learning; Artificial intelligence; Variety (cybernetics); Set (abstract data type); Representation (politics); Monte Carlo tree search; Machine learning; Mathematics","score_opus":0.034101187640759104,"score_gpt":0.2915072131869799,"score_spread":0.25740602554622083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597317312","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063125735,0.00022899851,0.9924549,0.0013458062,0.002216947,0.0006982391,7.936713e-7,0.00014907532,0.0028421336],"genre_scores_gemma":[0.086303085,0.00005660359,0.909653,0.0015035272,0.00074082153,0.000027409571,0.000007920569,0.00004599806,0.0016616435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965713,0.000024579263,0.00053298636,0.0012906189,0.0007940667,0.00078647357],"domain_scores_gemma":[0.9978877,0.00064352085,0.00029867567,0.0007663268,0.00027378043,0.00013004376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014073538,0.00043528457,0.0004538896,0.0011648028,0.00025177404,0.000400707,0.0017292198,0.0004276131,0.000013578902],"category_scores_gemma":[0.0002224766,0.0004300966,0.00012924167,0.00064227293,0.00067316054,0.0005862925,0.00063608104,0.0010926225,0.00002685477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103001485,0.000007813913,0.00011528354,0.000024558823,0.0000037700238,0.000030732626,0.0006819615,0.2382427,0.00006673779,0.037394773,0.000027104754,0.7233943],"study_design_scores_gemma":[0.0001571412,0.00028465726,0.00004759661,0.0004710466,0.000004025106,0.000075826145,0.0000012320307,0.85634303,0.005491077,0.122269,0.014204858,0.0006504873],"about_ca_topic_score_codex":0.00002753708,"about_ca_topic_score_gemma":0.00023631271,"teacher_disagreement_score":0.7227438,"about_ca_system_score_codex":0.00049470627,"about_ca_system_score_gemma":0.00044216367,"threshold_uncertainty_score":0.9998151},"labels":[],"label_agreement":null},{"id":"W1601871518","doi":"10.1007/978-3-642-12993-3_6","title":"A Study of UCT and Its Enhancements in an Artificial Game","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Heuristics; Tournament; Monte Carlo method; Simple (philosophy); Tree (set theory); Theoretical computer science; Game tree; Ideal (ethics); Artificial intelligence; Mathematical optimization; Game theory; Sequential game; Mathematical economics; Mathematics","score_opus":0.049971045049201926,"score_gpt":0.31555412988650605,"score_spread":0.26558308483730414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601871518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27658644,0.00012576705,0.7209255,0.000116798714,0.0012345449,0.00072103855,0.0000020609991,0.000052202533,0.00023563358],"genre_scores_gemma":[0.96742696,0.000012308252,0.03215249,0.00015102369,0.00018558206,0.000012649661,7.6811426e-7,0.00002042715,0.000037800117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960884,0.000061570456,0.00082426576,0.0015328057,0.0009493314,0.000543632],"domain_scores_gemma":[0.9978263,0.00029406778,0.00034851936,0.0011609611,0.00021959473,0.00015058239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010060015,0.0004301235,0.0005820384,0.0010045334,0.00011379015,0.00032041644,0.0028463057,0.0002918621,0.00001954334],"category_scores_gemma":[0.00011544276,0.00041081823,0.000046912566,0.0006262987,0.00053829415,0.000851408,0.0012941653,0.00091307523,0.0000167507],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028890683,0.0006595125,0.0010849325,0.000041709765,0.000013439459,0.00020902371,0.02575092,0.009905606,0.015380846,0.020964714,5.6756136e-7,0.9259598],"study_design_scores_gemma":[0.0003587703,0.002571991,0.0014355343,0.0004734058,0.000015364973,0.000044598386,0.000012670394,0.52506113,0.12468843,0.3438497,0.00009278733,0.0013956429],"about_ca_topic_score_codex":0.00006752074,"about_ca_topic_score_gemma":0.0026781957,"teacher_disagreement_score":0.9245642,"about_ca_system_score_codex":0.00009807835,"about_ca_system_score_gemma":0.00028022195,"threshold_uncertainty_score":0.99983436},"labels":[],"label_agreement":null},{"id":"W1605316729","doi":"10.1007/11674399_3","title":"Rediscovering *-Minimax Search","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimax; Class (philosophy); Computer science; Algorithm; Sampling (signal processing); Minimax approximation algorithm; Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.03260848473576083,"score_gpt":0.2832781244515413,"score_spread":0.2506696397157805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605316729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015948122,0.00035215166,0.9739767,0.0007051756,0.0021001417,0.00032465608,0.0000042967768,0.00024620674,0.022131214],"genre_scores_gemma":[0.34910148,0.00006338673,0.6438534,0.0013438786,0.0018724749,0.000014957623,0.0000076180977,0.000099341305,0.0036434538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99485344,0.000034109045,0.0006903217,0.0018935677,0.001534799,0.0009937814],"domain_scores_gemma":[0.99695593,0.0005299411,0.00021130376,0.0018449433,0.00027456207,0.00018334674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001039859,0.0005717471,0.0005283865,0.000978361,0.0003081835,0.0009887969,0.005221084,0.000351941,0.000038049457],"category_scores_gemma":[0.00009310576,0.0005482167,0.0001665438,0.00076894544,0.0011755816,0.0009607244,0.0024413108,0.001084501,0.00022946647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040041764,0.000027916827,0.00008806608,0.000029969762,0.000007353232,0.00022192215,0.00075038226,0.13900636,0.00033898224,0.038348213,0.00015390867,0.8210229],"study_design_scores_gemma":[0.00007771649,0.00016805412,0.00009744891,0.00040581412,0.0000053045533,0.000079373625,3.0966734e-7,0.7486147,0.016638858,0.2290933,0.0038451992,0.0009739229],"about_ca_topic_score_codex":0.00014007848,"about_ca_topic_score_gemma":0.0001305624,"teacher_disagreement_score":0.820049,"about_ca_system_score_codex":0.00046565657,"about_ca_system_score_gemma":0.0007177327,"threshold_uncertainty_score":0.9996969},"labels":[],"label_agreement":null},{"id":"W1605378659","doi":"","title":"A Generalized Framework for Analyzing Capturing Races in Go.","year":2002,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Simple (philosophy); Solver; Computer science; Cover (algebra); Upper and lower bounds; Race (biology); Theoretical computer science; Section (typography); Game theory; Basis (linear algebra); Element (criminal law); Resolution (logic); Mathematical economics; Mathematics; Artificial intelligence; Law; Programming language","score_opus":0.07159970791997979,"score_gpt":0.3157745760775969,"score_spread":0.24417486815761713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605378659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05806687,0.00037907186,0.93791467,0.0019344746,0.00025110887,0.00015999393,2.99672e-7,0.00013324319,0.0011602635],"genre_scores_gemma":[0.58160394,0.000024235462,0.41742906,0.0002844907,0.00006668103,0.00002656009,1.1604036e-7,0.0000053682056,0.0005595365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989998,0.000029942172,0.00025059318,0.00030364734,0.000116671144,0.0002993946],"domain_scores_gemma":[0.99922854,0.0002989327,0.000051538133,0.0003343411,0.00003622647,0.000050395058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021168446,0.00009673142,0.00014135014,0.00012864973,0.000068301415,0.00015917831,0.00060509756,0.00006601242,0.00013358876],"category_scores_gemma":[0.00021209617,0.00008652783,0.0000634728,0.0003733604,0.000026192976,0.0003550843,0.00010742628,0.00010230365,0.00010643196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053655567,0.00008272072,0.0057740416,0.000014258323,0.0000158178,0.000014188683,0.006077316,0.005472139,0.00075891544,0.85220236,0.0014016839,0.12818117],"study_design_scores_gemma":[0.00008066074,0.000028943083,0.00018978739,0.000038138085,0.0000025846339,0.000002557284,0.00011299339,0.836392,0.022500908,0.13741048,0.0030117144,0.00022922685],"about_ca_topic_score_codex":0.00010611143,"about_ca_topic_score_gemma":0.00014124543,"teacher_disagreement_score":0.83091986,"about_ca_system_score_codex":0.0000355049,"about_ca_system_score_gemma":0.0000070581827,"threshold_uncertainty_score":0.35285023},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05360482209948655,"score_gpt":0.3185226923221993,"score_spread":0.2649178702227128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605527696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010223964,0.00020797533,0.9913067,0.0015048902,0.004296925,0.00083673635,0.000018725403,0.0008578105,0.0008679835],"genre_scores_gemma":[0.050308034,0.000026907883,0.946662,0.0016563993,0.0009495153,0.00005508572,0.00000876952,0.00005721535,0.00027604637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99526525,0.000033573306,0.0007835761,0.0019244916,0.0010865107,0.0009066086],"domain_scores_gemma":[0.99568653,0.0010983534,0.00047537213,0.0018717268,0.0006347545,0.0002332855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010344434,0.0006663094,0.0006474246,0.0008801865,0.00034701024,0.0009867591,0.004645029,0.00091428024,0.000043204018],"category_scores_gemma":[0.00082277064,0.0006228044,0.00023383106,0.00083034165,0.0010623193,0.00073663436,0.0011309966,0.0011921296,0.00009537444],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009060856,0.00003187936,0.000013009029,0.000034870092,0.000013245455,0.00002253036,0.0013466268,0.019303858,0.000983665,0.1205696,0.000037028476,0.8576346],"study_design_scores_gemma":[0.000048586306,0.00011778236,0.00005860824,0.00018859444,0.0000070889237,0.000025083118,1.3818816e-7,0.5372965,0.011840673,0.4476416,0.0023027775,0.0004726142],"about_ca_topic_score_codex":0.0000576929,"about_ca_topic_score_gemma":0.00013215441,"teacher_disagreement_score":0.857162,"about_ca_system_score_codex":0.00034192833,"about_ca_system_score_gemma":0.0010202423,"threshold_uncertainty_score":0.99962234},"labels":[],"label_agreement":null},{"id":"W1605924412","doi":"10.1109/spdp.1996.570365","title":"The APHID parallel αβ search algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Iterative deepening depth-first search; Parallel computing; Tree (set theory); Parallelism (grammar); Asynchronous communication; Depth-first search; Game tree; Workstation; Search tree; Table (database); Parallel algorithm; Theoretical computer science; Algorithm; Search algorithm; Game theory; Sequential game; Beam search; Operating system; Mathematics; Best-first search","score_opus":0.06304370030554499,"score_gpt":0.2922838583298609,"score_spread":0.22924015802431594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605924412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029446007,0.00031811692,0.94475466,0.008353051,0.0003164037,0.000102556354,2.3488484e-7,0.00019253073,0.045667987],"genre_scores_gemma":[0.30003923,0.0008360479,0.5897812,0.0022905697,0.00048182864,0.00005378954,4.249982e-7,0.00002551403,0.10649134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988757,0.000055508244,0.00016476652,0.00023738197,0.00032223453,0.0003444187],"domain_scores_gemma":[0.99895406,0.00025686852,0.000020765181,0.0006200892,0.000071984614,0.00007622144],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029106013,0.00008090412,0.0000640544,0.000032781692,0.0003258506,0.00030923236,0.0013913147,0.000033571414,0.00020862232],"category_scores_gemma":[0.000035368033,0.000049722454,0.000049166894,0.00029428242,0.0001290511,0.0002636182,0.00027485722,0.00012960535,0.0025025334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.169293e-7,0.000022095963,0.000046389127,4.4549714e-7,0.0000050918798,0.000007612538,0.00054921076,0.00012182969,0.000020516673,0.12035925,0.01658589,0.8622813],"study_design_scores_gemma":[0.000019159843,0.000034456516,0.00006331334,0.0000018240166,6.611329e-7,0.00001027256,0.00012702866,0.9148811,0.0027057922,0.010957225,0.07109881,0.000100338],"about_ca_topic_score_codex":0.00007721121,"about_ca_topic_score_gemma":0.000026882555,"teacher_disagreement_score":0.9147593,"about_ca_system_score_codex":0.000018292787,"about_ca_system_score_gemma":0.000010922764,"threshold_uncertainty_score":0.99827415},"labels":[],"label_agreement":null},{"id":"W1606605033","doi":"10.1007/978-3-642-15399-0_21","title":"Analyzing Computer Game Narratives","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Narrative; Computer science; Compiler; Computer game; Scalability; Reachability; Variety (cybernetics); Game design; Multimedia; Human–computer interaction; Theoretical computer science; Artificial intelligence; Programming language; Linguistics","score_opus":0.025797147146942364,"score_gpt":0.27898889585031966,"score_spread":0.2531917487033773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606605033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040114412,0.0003330485,0.9894099,0.0013910574,0.0047726943,0.00041708545,0.0000036257068,0.0003449257,0.0029265215],"genre_scores_gemma":[0.11066755,0.000041727464,0.88547915,0.0014478842,0.0017684634,0.000011525803,0.0000042571423,0.00006565118,0.0005137854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994355,0.000061801176,0.0009091593,0.0024048304,0.0011960996,0.0010730805],"domain_scores_gemma":[0.9957141,0.0006893831,0.0004926201,0.0023086038,0.00047787855,0.00031741074],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011552764,0.0008424167,0.00082431664,0.0013216562,0.00041888023,0.001278458,0.0063011697,0.00063884264,0.000104451945],"category_scores_gemma":[0.000105478946,0.00077455444,0.00026557106,0.00093433895,0.0020186687,0.0012027215,0.0024372826,0.002149753,0.00028541268],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005111146,0.00004233074,0.00012044273,0.000025338086,0.000022475298,0.00016550056,0.0048864414,0.017051205,0.0013537493,0.045713536,0.000027723185,0.93058616],"study_design_scores_gemma":[0.000109754175,0.0002486521,0.0001043002,0.00040873166,0.000008385139,0.0001142139,7.088363e-7,0.49032688,0.011937768,0.48860136,0.006777156,0.0013620938],"about_ca_topic_score_codex":0.00002762195,"about_ca_topic_score_gemma":0.0002204275,"teacher_disagreement_score":0.9292241,"about_ca_system_score_codex":0.00026609877,"about_ca_system_score_gemma":0.00066429185,"threshold_uncertainty_score":0.9997583},"labels":[],"label_agreement":null},{"id":"W1638792402","doi":"10.1609/aimag.v35i2.2536","title":"Workshops Held at the Ninth Annual AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE): A Report","year":2014,"lang":"en","type":"article","venue":"AI Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ninth; Entertainment; Narrative; Musical; Multimedia; Computer science; Engineering; Visual arts; Library science; Art","score_opus":0.027969752758817704,"score_gpt":0.2923637684316602,"score_spread":0.2643940156728425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1638792402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08381281,0.000051611394,0.879461,0.024310663,0.0011089038,0.00051967235,0.000018884733,0.0002140436,0.010502403],"genre_scores_gemma":[0.99397504,0.000016935954,0.0008188891,0.0019024161,0.00019838719,0.0000413821,0.000009147766,0.000017699565,0.0030200812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974695,0.00011908577,0.0006087348,0.0008238133,0.0005122901,0.00046658583],"domain_scores_gemma":[0.99766076,0.0006723321,0.00025640207,0.0010076306,0.00023508968,0.00016776704],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00056619575,0.00031236527,0.000276763,0.00010345731,0.00025282623,0.0006410072,0.0009284498,0.00008567603,0.00012891843],"category_scores_gemma":[0.0006616967,0.00022611258,0.000090898444,0.00029328544,0.00042462273,0.0008528405,0.0009846222,0.00039653323,0.00096041075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000166234,0.00025342082,0.00082874356,0.000009808412,0.000051850187,0.00019033023,0.0056050806,0.00048834307,0.00061811676,0.10813751,0.005977747,0.8776728],"study_design_scores_gemma":[0.0002896402,0.003519072,0.006191643,0.00073764875,0.00007770081,0.0018826645,0.0053688786,0.45219865,0.0925526,0.27533782,0.15913974,0.0027039405],"about_ca_topic_score_codex":0.000026121388,"about_ca_topic_score_gemma":0.00017935403,"teacher_disagreement_score":0.91016227,"about_ca_system_score_codex":0.00011101301,"about_ca_system_score_gemma":0.000050939063,"threshold_uncertainty_score":0.99981743},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1901535286000289,"score_gpt":0.33377888505309056,"score_spread":0.14362535645306165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646839507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8948166,0.00001681512,0.093565665,0.003371078,0.0007892637,0.00072265905,0.0000054486054,0.00007053247,0.0066419384],"genre_scores_gemma":[0.99855757,0.00004193201,0.0011821865,0.0000972261,0.00005497609,0.00002584639,2.3801738e-7,0.00001120125,0.000028821902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972038,0.000042055253,0.0010232911,0.00038437094,0.00085399597,0.00049248285],"domain_scores_gemma":[0.99762845,0.00045918414,0.0005379809,0.00053167006,0.000760904,0.000081835205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017511663,0.00026048595,0.00033379663,0.0003453076,0.00022737637,0.00041913276,0.0034888107,0.00015035612,0.000042952313],"category_scores_gemma":[0.001025029,0.00017561333,0.00015384445,0.0013706814,0.00073773944,0.0014556672,0.00058021443,0.0008940817,0.000037920505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006963784,0.000088050496,0.0038000871,0.00005440896,0.000012583021,2.7762428e-7,0.012383271,0.0017212374,0.033961065,0.9001586,0.000022155547,0.047728624],"study_design_scores_gemma":[0.000030840605,0.0001688538,0.0017657952,0.00026343804,0.000010387544,0.0000061231576,0.006250085,0.30812725,0.5423823,0.14067356,0.00004334671,0.00027801664],"about_ca_topic_score_codex":0.0004167835,"about_ca_topic_score_gemma":0.0006078813,"teacher_disagreement_score":0.75948507,"about_ca_system_score_codex":0.000103905026,"about_ca_system_score_gemma":0.00019365172,"threshold_uncertainty_score":0.7161303},"labels":[],"label_agreement":null},{"id":"W1653490138","doi":"10.1109/cgames.2015.7272956","title":"Machiavellian agents: Player modelling to deceive and be deceived","year":2015,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Deception; Computer science; Simple (philosophy); Population; State (computer science); Finite-state machine; Game theory; Artificial intelligence; Evolutionary game theory; Human–computer interaction; Computer security; Mathematical economics; Psychology; Algorithm; Social psychology; Epistemology; Mathematics","score_opus":0.13769351785002218,"score_gpt":0.3218899070522863,"score_spread":0.18419638920226414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1653490138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091598295,0.00005301978,0.89663833,0.0027925668,0.00026320093,0.00016715718,0.0000010252836,0.00014780766,0.008338608],"genre_scores_gemma":[0.73807573,0.000014974316,0.25756887,0.0030483662,0.00005007884,0.000010925716,6.045836e-7,0.000010500138,0.0012199522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869883,0.0000393073,0.0002225089,0.0004291829,0.00029581593,0.00031436465],"domain_scores_gemma":[0.9988975,0.00007691698,0.000037051457,0.00040965635,0.00014356653,0.00043533568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002724279,0.00014274055,0.00013701683,0.000105032675,0.000083831925,0.00021954007,0.00065258966,0.00005458292,0.00003536453],"category_scores_gemma":[0.00006368176,0.0001263761,0.000028599485,0.0002542498,0.000041689487,0.00045741172,0.00030583396,0.0000873048,0.00032607812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007961272,0.0002364535,0.0038531558,0.000015224692,0.0000834749,0.00011170824,0.0584698,0.4238777,0.0011165424,0.2970235,0.052519415,0.16261344],"study_design_scores_gemma":[0.00006932966,0.00009025197,0.000061064704,0.000010608156,0.0000032898736,0.000008981074,0.0006002554,0.9523758,0.010402726,0.020887168,0.0152562605,0.00023421632],"about_ca_topic_score_codex":0.00030771646,"about_ca_topic_score_gemma":0.00012346737,"teacher_disagreement_score":0.64647746,"about_ca_system_score_codex":0.00004688855,"about_ca_system_score_gemma":0.000059377704,"threshold_uncertainty_score":0.5153467},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0273082856829337,"score_gpt":0.2861029956219506,"score_spread":0.2587947099390169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664963465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0385784,0.000043371023,0.9249158,0.00023469025,0.00025038808,0.00026871264,7.350486e-7,0.0002379705,0.03546994],"genre_scores_gemma":[0.550276,0.0000015122647,0.4489543,0.00014384917,0.000029925846,0.000044042652,3.9422292e-7,0.000009191337,0.0005407867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986411,0.00005380713,0.00032295162,0.000382727,0.0001897307,0.0004096808],"domain_scores_gemma":[0.9990593,0.00022431796,0.00008012253,0.00044256868,0.00011379038,0.0000799043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047867608,0.00015030532,0.00015748401,0.00006070097,0.00012186775,0.00041678105,0.00061592704,0.00006377599,0.00013879244],"category_scores_gemma":[0.00013238551,0.00012831936,0.00008769597,0.00021252278,0.0001272194,0.0006410737,0.00007921353,0.00008912439,0.000114944545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034446857,0.000031985324,0.000030223018,0.000013362732,0.0000053988397,0.0000012021085,0.0014367637,0.0026710308,0.0020098789,0.98582375,0.00027674367,0.0076962393],"study_design_scores_gemma":[0.00009617886,0.00019754676,0.000013009056,0.000016799448,0.000006995839,0.000027623188,0.004273571,0.52886885,0.06458523,0.39836767,0.0031891933,0.00035730144],"about_ca_topic_score_codex":0.000008704974,"about_ca_topic_score_gemma":0.000013531857,"teacher_disagreement_score":0.58745605,"about_ca_system_score_codex":0.000024228406,"about_ca_system_score_gemma":0.0001027483,"threshold_uncertainty_score":0.52327114},"labels":[],"label_agreement":null},{"id":"W166905011","doi":"","title":"Temperature discovery search","year":2004,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimax; Heuristic; Set (abstract data type); Computer science; Simple (philosophy); Tree (set theory); Combinatorial search; Search algorithm; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Beam search; Combinatorics; Artificial intelligence","score_opus":0.027700812471677442,"score_gpt":0.2940294540270155,"score_spread":0.2663286415553381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166905011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19251527,0.000056616747,0.78653824,0.0052943523,0.0003429662,0.000085660926,4.822021e-7,0.00024028236,0.014926121],"genre_scores_gemma":[0.9657729,0.0000066510775,0.030375458,0.00070719403,0.000069045505,0.00000289611,3.3192993e-7,0.0000038917265,0.0030615756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925315,0.000013844941,0.00009926946,0.00022588857,0.00020668574,0.0002011339],"domain_scores_gemma":[0.99947584,0.000028154067,0.000009687724,0.0003916357,0.00004243627,0.00005222707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001069616,0.00006659456,0.00005918745,0.000044820335,0.00007768768,0.0003536407,0.0006868363,0.00003965808,0.000026351776],"category_scores_gemma":[0.00002034931,0.000050560197,0.000036165395,0.00027654093,0.00004609903,0.0009658615,0.00018598755,0.000115489944,0.0005398734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012546764,0.000039961265,0.00020252817,0.0000021432309,0.000003900335,0.000021904882,0.000679235,0.0023785338,0.012505916,0.9729561,0.000447918,0.010760553],"study_design_scores_gemma":[0.000072875984,0.000084861975,0.0010661132,0.000018322042,0.0000011270841,0.00002545008,0.00024835538,0.0019651065,0.90261734,0.09177686,0.0018754337,0.0002481457],"about_ca_topic_score_codex":0.000112852926,"about_ca_topic_score_gemma":0.00003643381,"teacher_disagreement_score":0.89011145,"about_ca_system_score_codex":0.000037465026,"about_ca_system_score_gemma":0.000088894245,"threshold_uncertainty_score":0.693916},"labels":[],"label_agreement":null},{"id":"W1680175220","doi":"10.1109/cgames.2015.7272961","title":"Exploring options for efficiently evaluating the playability of computer game agents","year":2015,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Human–computer interaction; Game theory; Computer game; Multimedia","score_opus":0.5630705450574971,"score_gpt":0.4239186773164916,"score_spread":0.13915186774100552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1680175220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36176413,0.000012483176,0.63661546,0.0004389807,0.00056139263,0.0002789164,0.0000010918287,0.000057893758,0.00026965173],"genre_scores_gemma":[0.8437963,0.0000012099001,0.1558358,0.00011093113,0.00008892094,0.00007910439,5.8373286e-7,0.000004893314,0.000082250524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870783,0.000100561025,0.0003375823,0.0002722336,0.00036368953,0.0002180777],"domain_scores_gemma":[0.9983143,0.00055204506,0.000099772835,0.00059444003,0.00036546995,0.00007396756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016489489,0.00008882093,0.000121914745,0.00004599801,0.00009438738,0.000081585196,0.0008926427,0.000021407071,0.0000093633],"category_scores_gemma":[0.00035502433,0.000060069877,0.00008067682,0.00025625105,0.00009840245,0.0004094529,0.0003197587,0.00006390366,0.000036439997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004271241,0.0003881308,0.002123039,0.000037358397,0.00004707506,9.63606e-7,0.02556163,0.37387222,0.0012112887,0.21927114,0.0020034174,0.375441],"study_design_scores_gemma":[0.000077931254,0.00026181206,0.00087479467,0.000011427145,0.0000049680357,0.0000013449124,0.00035540765,0.9826987,0.008560639,0.006625338,0.00044606632,0.00008158747],"about_ca_topic_score_codex":0.000050633942,"about_ca_topic_score_gemma":0.0000105728805,"teacher_disagreement_score":0.60882646,"about_ca_system_score_codex":0.000046861547,"about_ca_system_score_gemma":0.00008116611,"threshold_uncertainty_score":0.24495785},"labels":[],"label_agreement":null},{"id":"W168999955","doi":"","title":"Re-Orienting Tournaments by Pushing Vertices.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01699630069008094,"score_gpt":0.26567149618206587,"score_spread":0.24867519549198494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168999955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.967887,0.00036618952,0.003076127,0.0012584185,0.0031177427,0.00016489206,0.0000011989462,0.00034841584,0.023780018],"genre_scores_gemma":[0.9961982,0.00003970715,0.0018817006,0.00049443747,0.00001448392,0.000010793604,0.0000016433065,0.000015162573,0.0013439213],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982421,0.00007817984,0.00034962714,0.000430071,0.00043293394,0.00046709648],"domain_scores_gemma":[0.9989471,0.00012937558,0.000094107876,0.0006177408,0.000067690184,0.00014401284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003780252,0.00016044376,0.00016007807,0.000051950723,0.00027542695,0.00040367592,0.0012507123,0.000073092495,0.00032435948],"category_scores_gemma":[0.00010071361,0.0001672087,0.00006406258,0.00042305142,0.000052672563,0.0011064422,0.000182222,0.00021440285,0.00076545076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001792807,0.00045119328,0.008278327,0.000016369255,0.00006499362,0.00007763652,0.006842129,0.00017411249,0.0029424245,0.41464645,0.042947847,0.5235406],"study_design_scores_gemma":[0.00055586064,0.00022896551,0.0007114773,0.00013647461,0.000022043147,0.000011411195,0.00049343077,0.038181774,0.0778767,0.7177344,0.16307235,0.0009751274],"about_ca_topic_score_codex":0.00012510736,"about_ca_topic_score_gemma":0.000008139079,"teacher_disagreement_score":0.5225655,"about_ca_system_score_codex":0.00008885476,"about_ca_system_score_gemma":0.000033601933,"threshold_uncertainty_score":0.98385763},"labels":[],"label_agreement":null},{"id":"W1700121706","doi":"10.1609/aiide.v8i1.12496","title":"AIIDE 2012 StarCraft Competition","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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Competition (biology); Computer science; Testbed; Scripting language; Video game; Artificial intelligence; Task (project management); Adversary; Entertainment; Video game development; Multimedia; Human–computer interaction; Operations research; Game design; Computer security; Engineering; World Wide Web","score_opus":0.04794524679941556,"score_gpt":0.2896314933173854,"score_spread":0.24168624651796985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1700121706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7770921,0.00016017343,0.15106863,0.007204946,0.001981141,0.001243052,0.0000424406,0.00020296928,0.061004553],"genre_scores_gemma":[0.998413,0.000047167752,0.000526266,0.0003891084,0.00010869187,0.00004032802,0.0000015603157,0.000015357995,0.0004584814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99778247,0.000021991258,0.00064234715,0.00045557006,0.00054822164,0.00054942357],"domain_scores_gemma":[0.99852884,0.00017344842,0.0003954761,0.00028385862,0.00041827594,0.00020012846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032112212,0.0003195433,0.00029615322,0.00016169081,0.00018698034,0.0005734596,0.0011286549,0.00007752572,0.00012350365],"category_scores_gemma":[0.00025525992,0.00023705316,0.00016004803,0.00030487473,0.00036734654,0.0039022148,0.0006741534,0.00032100137,0.00019720853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010402197,0.00055451406,0.0018833561,0.000024506024,0.000043507618,3.996099e-7,0.0039507127,0.000009357236,0.009173484,0.8533926,0.00019076234,0.13067277],"study_design_scores_gemma":[0.000059134927,0.0008516645,0.0016668584,0.00064570777,0.000029090414,0.000030386442,0.008423101,0.015783776,0.7881684,0.18016626,0.0034580668,0.00071760063],"about_ca_topic_score_codex":0.000022899101,"about_ca_topic_score_gemma":0.000004020172,"teacher_disagreement_score":0.77899486,"about_ca_system_score_codex":0.00011939847,"about_ca_system_score_gemma":0.00003385364,"threshold_uncertainty_score":0.96667475},"labels":[],"label_agreement":null},{"id":"W171890969","doi":"10.1609/aaai.v27i1.8674","title":"Automating Collusion Detection in Sequential Games","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Gambling Research Institute, University of Calgary; Alberta Innovates; University of Alberta","keywords":"Collusion; Computer science; Table (database); Computer security; Object (grammar); Domain (mathematical analysis); Artificial intelligence; Microeconomics; Data mining; Economics; Mathematics","score_opus":0.06158317069983366,"score_gpt":0.2953911625888893,"score_spread":0.23380799188905566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171890969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93745345,0.00002019273,0.049389668,0.003020616,0.0009148202,0.0010305721,0.0000014008793,0.00023893997,0.007930354],"genre_scores_gemma":[0.99562424,0.000018774488,0.0038057491,0.00017346346,0.000077195706,0.00010480831,1.8144014e-7,0.00001667335,0.00017890558],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971658,0.000045520475,0.0009570528,0.0006384732,0.0006635813,0.00052959705],"domain_scores_gemma":[0.9980967,0.00015506691,0.000520757,0.00039687296,0.0007267056,0.00010391259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065633736,0.00028951897,0.00032048894,0.0003133666,0.00024428338,0.0004937232,0.00228868,0.00015726834,0.00019960693],"category_scores_gemma":[0.00072612794,0.00022899549,0.00014023039,0.0013451074,0.00032308596,0.0012024047,0.00065485795,0.0004434407,0.0004246966],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018861334,0.00014156586,0.0005687849,0.000031625335,0.000007593296,6.687598e-7,0.001997266,0.00018258147,0.30541882,0.28761765,0.00005048524,0.4039641],"study_design_scores_gemma":[0.000012655798,0.00010666467,0.0010092332,0.00018318876,0.0000033488218,0.0000043511345,0.00058216276,0.216549,0.6448387,0.13650669,0.000016703634,0.00018730988],"about_ca_topic_score_codex":0.00055619766,"about_ca_topic_score_gemma":0.00013764626,"teacher_disagreement_score":0.4037768,"about_ca_system_score_codex":0.00014125441,"about_ca_system_score_gemma":0.00010533828,"threshold_uncertainty_score":0.9338165},"labels":[],"label_agreement":null},{"id":"W172163329","doi":"10.1609/aiide.v5i1.12362","title":"Optimizing Motion-Constrained Pathfinding","year":2009,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Heuristics; Computer science; Smoothing; Motion planning; Rule of thumb; Mathematical optimization; Grid; Truncation (statistics); Artificial intelligence; Algorithm; Theoretical computer science; Mathematics; Computer vision; Machine learning; Shortest path problem; Robot","score_opus":0.04326158108469784,"score_gpt":0.2851119267215241,"score_spread":0.24185034563682622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172163329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6421699,0.000057200057,0.26932183,0.012425003,0.0010117992,0.0013006104,0.000024606445,0.00026123394,0.0734278],"genre_scores_gemma":[0.9976989,0.0000291288,0.0015828493,0.00041897877,0.00005229918,0.000017555989,0.0000010779454,0.000010267298,0.0001889402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977153,0.0000152347475,0.0007047511,0.00063568214,0.0004945769,0.00043447834],"domain_scores_gemma":[0.9985935,0.0001324557,0.0004368538,0.00027750514,0.00042187356,0.00013782865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025082607,0.00033335775,0.00032051772,0.00019702164,0.00022825187,0.000958534,0.001287843,0.0000813932,0.000040067414],"category_scores_gemma":[0.0003637609,0.0002525583,0.00018198501,0.0003765379,0.00028904164,0.0019464687,0.00035124022,0.00033324386,0.000048650727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007124046,0.00028122732,0.00013255361,0.000009201582,0.000024711006,0.0000014985018,0.0037170385,0.00004602631,0.015668679,0.568692,0.000026435886,0.41132936],"study_design_scores_gemma":[0.00004502169,0.0008711389,0.00023583087,0.0005080172,0.000013947601,0.000020692936,0.005552167,0.06468505,0.7138889,0.21361874,0.00013156627,0.0004289381],"about_ca_topic_score_codex":0.000008481442,"about_ca_topic_score_gemma":0.000001343902,"teacher_disagreement_score":0.6982202,"about_ca_system_score_codex":0.00010763923,"about_ca_system_score_gemma":0.00004151853,"threshold_uncertainty_score":0.99999267},"labels":[],"label_agreement":null},{"id":"W1726776292","doi":"10.1609/aaai.v29i1.9445","title":"Solving Games with Functional Regret Estimation","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; Office of Naval Research; Multidisciplinary University Research Initiative; Compute Canada","keywords":"Regret; Abstraction; Generalization; Computer science; Function (biology); Nash equilibrium; Corollary; Mathematical optimization; Sequence (biology); Theoretical computer science; Artificial intelligence; Machine learning; Mathematics; Discrete mathematics","score_opus":0.12537478614474104,"score_gpt":0.29959157432591466,"score_spread":0.17421678818117362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1726776292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16775642,0.000060979724,0.78208137,0.010956759,0.0013728122,0.0008638256,0.0000048955544,0.00044456575,0.036458354],"genre_scores_gemma":[0.9757278,0.000008223486,0.02342536,0.00023499812,0.00010045402,0.000039161223,7.0892474e-7,0.000018285551,0.0004450295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972115,0.000027125483,0.00063486205,0.0006300375,0.0010604687,0.00043597643],"domain_scores_gemma":[0.9971346,0.00014205498,0.00051789376,0.00046074457,0.0015568098,0.00018787303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007943491,0.00030187704,0.00029514823,0.00018880062,0.00022704715,0.00043316596,0.0019585183,0.00011000849,0.000057649082],"category_scores_gemma":[0.00092672236,0.00020779499,0.00010101597,0.0009759618,0.000507369,0.0011156243,0.00039476002,0.00036013284,0.00023575922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011769944,0.00012296817,0.00044883386,0.000018346806,0.000018422437,0.0000010830238,0.0020893645,0.0025172804,0.004053409,0.901123,0.0007907369,0.08869884],"study_design_scores_gemma":[0.000025746722,0.0003555768,0.00017279598,0.00022815561,0.000013762633,0.000020344454,0.0012536066,0.30795476,0.39581886,0.29370913,0.00015793364,0.0002893217],"about_ca_topic_score_codex":0.000059747636,"about_ca_topic_score_gemma":0.00002234931,"teacher_disagreement_score":0.80797136,"about_ca_system_score_codex":0.00011094442,"about_ca_system_score_gemma":0.00032044674,"threshold_uncertainty_score":0.8473634},"labels":[],"label_agreement":null},{"id":"W1729894622","doi":"10.1609/aiide.v8i1.12514","title":"Enhancing the Believability of Character Behaviors Using Non-Verbal Cues","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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; University of Alberta","keywords":"Character (mathematics); Sign (mathematics); Psychology; Cognitive psychology; Video game; Social psychology; Computer science; Multimedia","score_opus":0.05258846070094862,"score_gpt":0.3094974180365885,"score_spread":0.25690895733563984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1729894622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9736641,0.000025700243,0.02279362,0.00061457977,0.0005914954,0.00051540724,0.000012546425,0.00002044584,0.0017620804],"genre_scores_gemma":[0.99920464,0.00002016189,0.00043202325,0.00014464001,0.000086952925,0.000027610371,7.06417e-7,0.000013487787,0.00006980037],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975757,0.00002786792,0.0009088917,0.00043551056,0.0005699714,0.0004820876],"domain_scores_gemma":[0.9980472,0.0002443883,0.00068223645,0.00036737943,0.0005365643,0.00012225172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005721953,0.0003134098,0.00035930012,0.00011155087,0.0002074673,0.00034555947,0.0013139403,0.000079494894,0.000039346334],"category_scores_gemma":[0.0003482766,0.00019728908,0.00020951364,0.00032156124,0.0005946595,0.0022590484,0.00079576013,0.00033458276,0.000022654132],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000372621,0.002002485,0.03125344,0.0001279366,0.00016546571,7.7649895e-7,0.04606246,0.000041680785,0.5373706,0.22843303,0.000037912014,0.1541316],"study_design_scores_gemma":[0.000018527036,0.0002654415,0.002030071,0.00033582927,0.000025241425,0.000008766769,0.0074451915,0.007474741,0.9744446,0.007659772,0.00007021834,0.00022158334],"about_ca_topic_score_codex":0.00008392957,"about_ca_topic_score_gemma":0.000006864645,"teacher_disagreement_score":0.43707404,"about_ca_system_score_codex":0.00012102339,"about_ca_system_score_gemma":0.000058110003,"threshold_uncertainty_score":0.8045215},"labels":[],"label_agreement":null},{"id":"W1745994184","doi":"10.1017/cbo9780511550881.006","title":"JAVA PERMUTATIONS AND COMBINATIONS","year":2000,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Java; Computer science; Programming language","score_opus":0.02958427270656547,"score_gpt":0.2213175738464687,"score_spread":0.19173330113990322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1745994184","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006911387,0.0000992977,0.028211901,0.00009445295,0.00014762537,0.00023331313,0.00006314991,0.00020553307,0.9708756],"genre_scores_gemma":[0.0053758086,0.00014768506,0.00088791014,0.0000780173,0.00003542295,6.8105965e-7,0.0000130193375,0.000018024493,0.9934434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989453,0.000027061937,0.00015812526,0.00047054212,0.00020677026,0.00019223405],"domain_scores_gemma":[0.99895793,0.000111265246,0.00011013609,0.00054367277,0.00013955765,0.00013743981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000053756285,0.00022725982,0.00020892966,0.00020727275,0.0003215134,0.00013555615,0.0007801243,0.0001973351,0.000008016774],"category_scores_gemma":[0.000007872102,0.00028698344,0.00009355286,0.000012825873,0.00031134018,0.00023877836,0.0003821611,0.00028767242,0.00005452288],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030635154,0.000008238356,6.7464345e-7,0.0000077900295,0.000029059685,0.00007850659,0.00018038994,0.0000079627025,0.000005497542,0.982672,0.005824736,0.0111820875],"study_design_scores_gemma":[0.000118309916,0.00004082783,0.000017852484,0.00006344827,0.000058878126,0.00002745169,0.000030288946,0.0030330934,0.00019273967,0.0019548477,0.99407583,0.00038641648],"about_ca_topic_score_codex":0.00009504021,"about_ca_topic_score_gemma":0.0000042995553,"teacher_disagreement_score":0.9882511,"about_ca_system_score_codex":0.00008795764,"about_ca_system_score_gemma":0.00009671661,"threshold_uncertainty_score":0.9999582},"labels":[],"label_agreement":null},{"id":"W1749728770","doi":"10.1109/tai.1999.809806","title":"A dynamic scheduling benchmark: design, implementation and performance evaluation","year":2003,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Testbed; Dynamic priority scheduling; Distributed computing; Scheduling (production processes); Fair-share scheduling; Two-level scheduling; Job shop scheduling; Schedule; Mathematical optimization; Computer network; Operating system","score_opus":0.05812196739568633,"score_gpt":0.35432969824749383,"score_spread":0.2962077308518075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749728770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35873243,0.0000701194,0.6398031,0.00008230266,0.00008980835,0.00017888985,5.7721845e-8,0.000035712852,0.0010075553],"genre_scores_gemma":[0.736675,0.00002329899,0.26317662,0.00006810557,0.0000033067415,0.000021155785,7.0749076e-7,0.0000025138231,0.000029245159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990923,0.00010828254,0.00017155973,0.00022590625,0.00023930855,0.00016267826],"domain_scores_gemma":[0.99955577,0.000066997876,0.00004994498,0.0001821828,0.00010717342,0.00003793407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011161971,0.00007222442,0.000055606237,0.000066871085,0.00012822101,0.00011624978,0.00015336896,0.000023981518,0.00016591905],"category_scores_gemma":[0.000048238497,0.00006698724,0.000011987579,0.000193322,0.000023588653,0.0006742728,0.00003716504,0.00004461673,0.00003344464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028552809,0.000018588556,0.0047435295,0.0000058140845,0.000008514069,5.525999e-7,0.001099675,0.006314796,0.0024779667,0.04817862,0.000038634633,0.9371104],"study_design_scores_gemma":[0.00006150383,0.000068432884,0.0030145147,0.0000051571033,0.000004517795,0.0000060461884,0.0004486696,0.9591122,0.03095279,0.006173792,0.000056499335,0.00009586376],"about_ca_topic_score_codex":0.000012199428,"about_ca_topic_score_gemma":0.000023420489,"teacher_disagreement_score":0.9527974,"about_ca_system_score_codex":0.000054301665,"about_ca_system_score_gemma":0.00008197782,"threshold_uncertainty_score":0.27316603},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0665393189233454,"score_gpt":0.3124185084308653,"score_spread":0.2458791895075199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1750339092","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7635544,0.00009138993,0.21651769,0.003984387,0.001487916,0.0019424472,0.0000601576,0.0001308167,0.012230771],"genre_scores_gemma":[0.9986278,0.000027397477,0.00044393467,0.00028988832,0.00012316518,0.00009768029,0.0000024570008,0.00002205055,0.00036564845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974503,0.000020995636,0.0006967237,0.00056961377,0.0005573115,0.00070503633],"domain_scores_gemma":[0.9981101,0.00035222672,0.00034354517,0.00031092064,0.0006499329,0.0002332551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040847788,0.00036154845,0.00036629013,0.0001411745,0.00021007126,0.0007591083,0.0013588922,0.00008996002,0.00004001466],"category_scores_gemma":[0.00039777104,0.00027014845,0.00020983761,0.0002949096,0.00042100216,0.002078997,0.00071051414,0.00032013992,0.000089730056],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003401015,0.0010246614,0.0034061235,0.00008965341,0.00009053784,6.030011e-7,0.010977739,0.0001172811,0.009038414,0.6741376,0.00023152478,0.30054575],"study_design_scores_gemma":[0.00007964805,0.0011450058,0.0006637227,0.0005839879,0.000030268951,0.00002270841,0.008234131,0.09183978,0.8484663,0.047211535,0.0011095317,0.0006134108],"about_ca_topic_score_codex":0.000022346738,"about_ca_topic_score_gemma":0.0000027821025,"teacher_disagreement_score":0.8394278,"about_ca_system_score_codex":0.00013615139,"about_ca_system_score_gemma":0.00005312926,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W1772160656","doi":"10.1007/978-3-642-38457-8_21","title":"Pathfinding by Demand Sensitive Map Abstraction","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Pathfinding; Computer science; Benchmark (surveying); Abstraction; Path (computing); Artificial intelligence; Shortest path problem; Theoretical computer science; Programming language; Cartography; Geography","score_opus":0.02022950412908025,"score_gpt":0.256685413140508,"score_spread":0.23645590901142777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1772160656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002842769,0.0002709008,0.9908558,0.0009042168,0.002827897,0.00042363818,0.0000057507073,0.00019994764,0.00422758],"genre_scores_gemma":[0.58159524,0.00010393095,0.41152734,0.002402962,0.0011385498,0.000023812578,0.000014006582,0.000085784086,0.0031083487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599034,0.00004053979,0.000602253,0.0016150178,0.0010000103,0.0007518364],"domain_scores_gemma":[0.99733615,0.0006514751,0.00039799584,0.0010874128,0.00032454747,0.00020243497],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078181265,0.00054639444,0.0004670001,0.00058575784,0.0003373982,0.00092359545,0.0022368704,0.00041759058,0.00007246595],"category_scores_gemma":[0.000094842166,0.0005172273,0.00012536847,0.00036432224,0.0007418988,0.0012572677,0.00091595255,0.00095977396,0.00083644874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034328343,0.000029661673,0.000026432235,0.000026305845,0.000014546926,0.00010685878,0.0014040577,0.013490479,0.0023336026,0.011291356,0.0006531531,0.9706201],"study_design_scores_gemma":[0.00009573316,0.0001953179,0.00007609311,0.000524895,0.000011252057,0.00011490034,0.0000014963719,0.6662498,0.07417851,0.25137243,0.005877906,0.001301644],"about_ca_topic_score_codex":0.000069190064,"about_ca_topic_score_gemma":0.00004801269,"teacher_disagreement_score":0.96931845,"about_ca_system_score_codex":0.00041240323,"about_ca_system_score_gemma":0.00027104435,"threshold_uncertainty_score":0.9999415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015246877065557088,"score_gpt":0.22847587315275739,"score_spread":0.2132289960872003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778554682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45350423,0.000027759423,0.5411333,0.00019868111,0.000076665245,0.00014515106,0.000004044053,0.000015963646,0.004894198],"genre_scores_gemma":[0.99679047,0.000018487752,0.00086507684,0.00007667973,0.000012419104,2.4049658e-7,0.0000016202365,0.0000041853664,0.0022307925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998683,0.00010154934,0.00027291055,0.00023721496,0.00042428923,0.00028105226],"domain_scores_gemma":[0.99893177,0.00035062528,0.00019679754,0.00039668207,0.00008269967,0.000041440057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070053415,0.00011365588,0.00020710978,0.00027472636,0.00008842239,0.0000187851,0.0012586181,0.00006528008,0.00003989292],"category_scores_gemma":[0.00004023935,0.00010553076,0.00011164705,0.0011121829,0.00026202534,0.0010319338,0.0003753728,0.0002078119,0.000022005757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027258944,0.00022525842,0.0070973723,0.000049509,0.000037866623,0.00030162185,0.010135725,0.040758517,0.0012925848,0.9228594,0.0004492147,0.0165204],"study_design_scores_gemma":[0.0014378391,0.0012765402,0.055945557,0.00028160817,0.000055342047,0.000040758347,0.08630398,0.8002371,0.0352069,0.004379333,0.014000795,0.000834235],"about_ca_topic_score_codex":0.00039570712,"about_ca_topic_score_gemma":0.00037576564,"teacher_disagreement_score":0.91848,"about_ca_system_score_codex":0.00011149947,"about_ca_system_score_gemma":0.00010240282,"threshold_uncertainty_score":0.43034196},"labels":[],"label_agreement":null},{"id":"W177987302","doi":"10.1609/aiide.v2i1.18756","title":"Biased Cost Pathfinding","year":2006,"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":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; USable; Computer science; Focus (optics); Simple (philosophy); Mathematical optimization; Theoretical computer science; Mathematics; Multimedia","score_opus":0.048090870040945484,"score_gpt":0.2833458941029822,"score_spread":0.23525502406203674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177987302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8151667,0.000047211957,0.100421265,0.005484189,0.0011157024,0.0015296569,0.000037140795,0.00021071007,0.07598741],"genre_scores_gemma":[0.998674,0.000018236251,0.0003931658,0.00023993416,0.00007678854,0.000057053454,0.0000021314,0.000016314449,0.00052237406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99757713,0.00001649188,0.000749946,0.0006469604,0.0005535726,0.00045592646],"domain_scores_gemma":[0.9984878,0.00019567716,0.00047312543,0.00028955212,0.00044951096,0.000104375504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024170049,0.00033930087,0.00031445237,0.00019606421,0.00022068422,0.0010120391,0.0013368502,0.00008163186,0.000048198257],"category_scores_gemma":[0.00026125115,0.00025251976,0.00017836707,0.00041409265,0.00037560207,0.0016040246,0.0005933381,0.00030210722,0.00009583742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011007558,0.00046976705,0.0017177785,0.000021493535,0.000030669144,0.000002283037,0.0012662323,0.000061803206,0.01757167,0.77879274,0.00024356456,0.19971195],"study_design_scores_gemma":[0.00004494469,0.00043173064,0.00060413737,0.00041919772,0.000013069649,0.000014216054,0.0025930763,0.037645087,0.7920542,0.16484006,0.0009200484,0.00042026196],"about_ca_topic_score_codex":0.00008872335,"about_ca_topic_score_gemma":0.0000117534,"teacher_disagreement_score":0.7744825,"about_ca_system_score_codex":0.0001291758,"about_ca_system_score_gemma":0.00004745964,"threshold_uncertainty_score":0.9999927},"labels":[],"label_agreement":null},{"id":"W1806352760","doi":"10.1609/socs.v2i1.18210","title":"Abstract: Block A* and Any-Angle Path-Planning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Grid; Block (permutation group theory); Path (computing); Any-angle path planning; Motion planning; Boundary (topology); Computer science; Algorithm; City block; Mathematical optimization; Mathematics; Artificial intelligence; Geometry; Geography","score_opus":0.026124778634505907,"score_gpt":0.28744674564692707,"score_spread":0.26132196701242116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1806352760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9607211,0.00006094783,0.00006347849,0.00984396,0.00398625,0.00014771365,0.0000040583723,0.000059449983,0.02511308],"genre_scores_gemma":[0.9986767,0.000021939004,0.0004973943,0.00016097845,0.00032053457,0.000008595861,4.892313e-7,0.00001058602,0.00030274843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981364,0.000009813361,0.00029413198,0.00038004303,0.00094053877,0.00023906883],"domain_scores_gemma":[0.9985888,0.00018610098,0.00013296549,0.00016831553,0.00084057817,0.00008325322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004696518,0.00012816553,0.00014372802,0.000060156566,0.00015815244,0.00035099173,0.0014761805,0.000075601645,0.000019268486],"category_scores_gemma":[0.0002868707,0.00010656945,0.00007788472,0.00028595995,0.000102212325,0.00037509933,0.0009198169,0.00028441445,0.000016315124],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051791623,0.00029927838,0.013054575,0.000040515934,0.000060977833,0.000013847214,0.0014949883,0.0001448425,0.23128559,0.74938047,0.0021490508,0.002024086],"study_design_scores_gemma":[0.00028416963,0.00011025968,0.0053398996,0.00021343057,0.0000063496336,0.000040959912,0.00024459115,0.0043776254,0.93773025,0.046083704,0.0053658294,0.00020293485],"about_ca_topic_score_codex":0.00004877557,"about_ca_topic_score_gemma":6.1177394e-7,"teacher_disagreement_score":0.7064447,"about_ca_system_score_codex":0.00009522521,"about_ca_system_score_gemma":0.00007692717,"threshold_uncertainty_score":0.4345776},"labels":[],"label_agreement":null},{"id":"W1809103853","doi":"10.37236/356","title":"Winning Positions in Simplicial Nim","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Mathematics; Simplicial complex; Generalization; Combinatorics; Abstract simplicial complex; Simplicial approximation theorem; Face (sociological concept); h-vector; Simplicial manifold; Simplicial homology; Simplicial set; Pure mathematics","score_opus":0.007879893342489633,"score_gpt":0.2623076644510787,"score_spread":0.2544277711085891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809103853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74793375,0.00042225348,0.24334824,0.005547077,0.0014947392,0.00008974226,1.4768594e-7,0.000026388525,0.0011376425],"genre_scores_gemma":[0.99939126,0.00005704935,0.00019358659,0.00015173023,0.00015409701,0.0000014956079,6.950629e-8,0.0000075351013,0.000043192464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986157,0.00008276317,0.00040620513,0.00010082824,0.00032694376,0.0004675799],"domain_scores_gemma":[0.9989082,0.0002662829,0.00025301657,0.0003235992,0.00019225114,0.000056602155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012295278,0.00009685754,0.00015676346,0.00015640729,0.00013946007,0.0000969403,0.0015380424,0.00006119405,0.000009718811],"category_scores_gemma":[0.00017667441,0.000071194445,0.00008208616,0.00066857715,0.000069051544,0.0004010615,0.0001115305,0.0013862267,0.000015207587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060946527,0.00007741559,0.00053024,7.6895066e-7,0.000009397221,0.000010169743,0.00058918534,0.0001541153,0.0040403795,0.99115807,0.000142178,0.003282014],"study_design_scores_gemma":[0.00012092638,0.0002481711,0.00080044294,0.000010371553,0.0000070849414,0.0002322848,0.00007729517,0.0031110565,0.0104514975,0.9822122,0.0026322461,0.00009644446],"about_ca_topic_score_codex":0.00001903917,"about_ca_topic_score_gemma":0.00006602833,"teacher_disagreement_score":0.25145748,"about_ca_system_score_codex":0.00014091647,"about_ca_system_score_gemma":0.0004571331,"threshold_uncertainty_score":0.6022543},"labels":[],"label_agreement":null},{"id":"W18092659","doi":"10.1007/978-0-85729-341-1_12","title":"2007: Deep Junior Deep Sixes Deep Fritz in Elista, 4–2","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Debugging; Heuristics; Computer science; Deep blue; Deep learning; Artificial intelligence; Software; Cognitive science; Psychology; Operating system; Chemistry","score_opus":0.03713084799564325,"score_gpt":0.2561277116293153,"score_spread":0.21899686363367205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18092659","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000150712885,0.0015879773,0.38554126,0.00018022327,0.0012474714,0.00033071102,0.0000026476937,0.00027454205,0.6108201],"genre_scores_gemma":[0.008985124,0.001082563,0.08801664,0.0020490799,0.0009511032,0.00006646695,0.000018550947,0.00020068992,0.8986298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622935,0.000053169195,0.0010430886,0.0012436877,0.0006445521,0.00078618136],"domain_scores_gemma":[0.9970682,0.00028550692,0.00034377433,0.0017708224,0.00026472795,0.00026694115],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004595806,0.0007018387,0.00071763014,0.0005857225,0.00012774846,0.00025581993,0.003112632,0.00071679946,0.0059506246],"category_scores_gemma":[0.000097059645,0.0006703493,0.00029135853,0.00014123625,0.00030609698,0.0006415818,0.0009282769,0.0008091849,0.006510365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010186798,0.00004667765,0.00006063791,0.00002115738,0.000032008968,0.00016209674,0.0012340309,0.000057988054,0.00000600355,0.8010745,0.0018320641,0.19546263],"study_design_scores_gemma":[0.00013274595,0.00018643447,0.00010102149,0.00020121643,0.00003525215,0.000039826165,0.000114998045,0.024593726,0.0009971727,0.60577863,0.36610395,0.0017150332],"about_ca_topic_score_codex":0.0006551515,"about_ca_topic_score_gemma":0.009827478,"teacher_disagreement_score":0.3642719,"about_ca_system_score_codex":0.00019176514,"about_ca_system_score_gemma":0.00013784898,"threshold_uncertainty_score":0.9995748},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09513926961760284,"score_gpt":0.3262099561051989,"score_spread":0.23107068648759604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182596629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37120178,0.000006750897,0.60702413,0.0036461668,0.0016640135,0.00078110094,0.0000044227577,0.0008809793,0.014790645],"genre_scores_gemma":[0.9693337,0.000071571434,0.027932892,0.0009317478,0.00039513383,0.0003803303,0.00001763353,0.000042385844,0.0008946257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482375,0.00012244885,0.0012675917,0.0014245922,0.0013802849,0.0009813416],"domain_scores_gemma":[0.9973082,0.00023436261,0.0003985288,0.0008981341,0.00073569175,0.00042508377],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006388062,0.00059362105,0.0005077993,0.00069479074,0.0003933024,0.0011885711,0.0029815058,0.00019505715,0.0006445402],"category_scores_gemma":[0.00046973565,0.0005846684,0.00014672762,0.0011071864,0.00025631613,0.0006565018,0.00071020675,0.0008644276,0.0040365946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011401113,0.0003175821,0.00094236666,0.0000062905783,0.000028007866,0.000042919044,0.0008677747,0.008346178,0.00984059,0.32999328,0.00003408394,0.64946693],"study_design_scores_gemma":[0.000088631634,0.0013811416,0.0064126975,0.00035666223,0.0000121713965,0.000073133306,0.0007697775,0.74925506,0.16175571,0.07353584,0.0048084087,0.0015507963],"about_ca_topic_score_codex":0.0002344312,"about_ca_topic_score_gemma":0.00014595504,"teacher_disagreement_score":0.74090886,"about_ca_system_score_codex":0.00028120374,"about_ca_system_score_gemma":0.00021237935,"threshold_uncertainty_score":0.9998483},"labels":[],"label_agreement":null},{"id":"W1862134446","doi":"10.1609/aiide.v10i1.12725","title":"Global State Evaluation in StarCraft","year":2014,"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":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Baseline (sea); Artificial intelligence; Battle; State (computer science); Adversary; Machine learning; Logistic regression; Computer security; Algorithm; Geography","score_opus":0.045408070683866014,"score_gpt":0.3084844192790329,"score_spread":0.26307634859516693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1862134446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9139645,0.000019306139,0.056510765,0.0027233134,0.0004873767,0.00083077926,0.000014857989,0.0000532569,0.025395846],"genre_scores_gemma":[0.9992768,0.000019244768,0.00027644058,0.0002531174,0.000026714439,0.00005275936,0.0000011135645,0.00000832228,0.00008544364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975775,0.000042623207,0.0006868953,0.00060304353,0.00071347516,0.0003764479],"domain_scores_gemma":[0.9985796,0.00014814832,0.0003451901,0.00026369453,0.00056229223,0.00010107376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006595611,0.000270311,0.0002798291,0.00014592058,0.00009212324,0.00060774875,0.0011178793,0.000057000485,0.00003386334],"category_scores_gemma":[0.00070254866,0.00020632856,0.00010329106,0.00046301584,0.00026179026,0.0015063118,0.0005192246,0.00020915591,0.000046214263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014383612,0.0003406743,0.005313733,0.000018224207,0.000022459495,4.5649517e-7,0.0025941096,0.00031657558,0.0013227594,0.3405402,0.000039424456,0.64934754],"study_design_scores_gemma":[0.00007279092,0.0006962311,0.00310246,0.000426281,0.0000105290555,0.0000060896377,0.0023195897,0.3623866,0.12445796,0.5058976,0.00026610334,0.0003577836],"about_ca_topic_score_codex":0.0000763084,"about_ca_topic_score_gemma":0.000060414917,"teacher_disagreement_score":0.64898974,"about_ca_system_score_codex":0.0002415793,"about_ca_system_score_gemma":0.00006567298,"threshold_uncertainty_score":0.84138346},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Championship; Corporation; Intellectual property; Computer science; Operations research; Advertising; Engineering; Business; Political science; Law","score_opus":0.08528845174103022,"score_gpt":0.2779775682452863,"score_spread":0.19268911650425607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863869622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9489109,0.0010891567,0.0027228591,0.0444956,0.00031825848,0.0018910262,0.00027595687,0.000015338159,0.0002809327],"genre_scores_gemma":[0.9961819,0.00013704186,0.00019311577,0.0025985993,0.000033974433,0.00008357159,0.000010534722,0.000022607315,0.0007386657],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9947277,0.0010943767,0.0017537907,0.00077478914,0.0009791916,0.0006701743],"domain_scores_gemma":[0.9949433,0.0026565893,0.00069600076,0.001344992,0.00021548186,0.0001436014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001484654,0.00043342743,0.0006228986,0.00024187966,0.0002542924,0.00017189275,0.0022431435,0.000114013215,0.00007629303],"category_scores_gemma":[0.00088021724,0.00022794848,0.00006217267,0.0028106875,0.0008260583,0.00037466123,0.00041562348,0.00077527185,0.00000751165],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010254098,0.0015976463,0.1834137,0.00027042086,0.00021620862,0.00009652704,0.18490204,0.0027714933,0.011458408,0.009207872,0.5683075,0.036732752],"study_design_scores_gemma":[0.0010421998,0.0006955852,0.045884956,0.002845495,0.00017086261,0.00014077293,0.030574398,0.17627668,0.3934809,0.031900287,0.31321135,0.0037764932],"about_ca_topic_score_codex":0.9640157,"about_ca_topic_score_gemma":0.9996327,"teacher_disagreement_score":0.3820225,"about_ca_system_score_codex":0.00030775837,"about_ca_system_score_gemma":0.00056337577,"threshold_uncertainty_score":0.9295469},"labels":[],"label_agreement":null},{"id":"W1864613557","doi":"","title":"A demonstration of ScriptEase interruptible and resumable behaviors for CRPGs","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Adventure; Computer science; Code (set theory); Human–computer interaction; Generative grammar; Multimedia; Artificial intelligence; Programming language","score_opus":0.04726854120526057,"score_gpt":0.3354657064246685,"score_spread":0.2881971652194079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864613557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21583243,0.000033644767,0.7800223,0.0001521904,0.000118490534,0.00014402029,8.1866966e-7,0.00004222209,0.0036538788],"genre_scores_gemma":[0.87970144,0.000002620729,0.11952328,0.00007300428,0.000013805105,0.000005063833,4.7276413e-7,0.0000030252338,0.0006772814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993284,0.000007894628,0.00023729759,0.0001725668,0.00009875569,0.00015512906],"domain_scores_gemma":[0.999503,0.000087646156,0.000058899845,0.00019434132,0.000099788405,0.000056311048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046075633,0.00005714452,0.00007807529,0.00009175517,0.000038756916,0.000046066234,0.00021917024,0.000035302157,0.00000845685],"category_scores_gemma":[0.000050493007,0.000052147916,0.000027807795,0.00013220469,0.00006748546,0.00037141133,0.000064734246,0.000033840206,0.000003917905],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007744393,0.00018087689,0.013211248,0.000037897287,0.00001281081,0.000006370639,0.002487344,0.000041380394,0.13884564,0.5282913,0.002169609,0.3146381],"study_design_scores_gemma":[0.0001227641,0.00032271212,0.0021569354,0.00002915243,0.000009610237,0.000010284158,0.0006388012,0.034780018,0.94706345,0.013408693,0.0012942132,0.00016335078],"about_ca_topic_score_codex":0.00018515732,"about_ca_topic_score_gemma":0.00026761857,"teacher_disagreement_score":0.8082178,"about_ca_system_score_codex":0.000012940366,"about_ca_system_score_gemma":0.000024810659,"threshold_uncertainty_score":0.21265303},"labels":[],"label_agreement":null},{"id":"W186848537","doi":"10.1609/aiide.v2i1.18769","title":"Automatic Story Generation for Computer Role-Playing Games","year":2006,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Adventure; Computer science; Plot (graphics); Interactivity; Process (computing); Multimedia; Computer game; Simple (philosophy); Human–computer interaction; World Wide Web; Programming language; Artificial intelligence","score_opus":0.040744035362293964,"score_gpt":0.2772168957901623,"score_spread":0.23647286042786833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186848537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70922124,0.000044016273,0.2816657,0.002518145,0.00080125063,0.0010848014,0.000023144676,0.00012032199,0.004521339],"genre_scores_gemma":[0.9954198,0.000009404815,0.0037603192,0.00023678692,0.00020935193,0.00010635924,0.0000043536265,0.000017014625,0.00023660962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979245,0.000019403782,0.0006533937,0.00061865425,0.00041162924,0.00037242443],"domain_scores_gemma":[0.99847966,0.0002274758,0.00046048098,0.00023825475,0.0005193009,0.00007482841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028597718,0.0003104813,0.000305607,0.00016490014,0.00028641344,0.00090843753,0.0009250463,0.00007750503,0.000022936807],"category_scores_gemma":[0.00016155894,0.00023897638,0.0001808392,0.00020188026,0.00024887733,0.0014701076,0.00034711263,0.00021865711,0.000028687915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065397835,0.00038290868,0.00046405327,0.000043192274,0.000045853398,4.9550823e-7,0.0021643187,0.00019400766,0.040113002,0.4627978,0.0005321246,0.49319685],"study_design_scores_gemma":[0.00003529514,0.00045399443,0.00019414484,0.00020709219,0.000012704037,0.000006172967,0.0011243605,0.62641364,0.32069248,0.05021615,0.00037878068,0.00026521643],"about_ca_topic_score_codex":0.000032366133,"about_ca_topic_score_gemma":0.000009608974,"teacher_disagreement_score":0.62621963,"about_ca_system_score_codex":0.00013203562,"about_ca_system_score_gemma":0.00004650435,"threshold_uncertainty_score":0.9745174},"labels":[],"label_agreement":null},{"id":"W1871110144","doi":"10.1609/aiide.v9i1.12678","title":"Guided Emotional State Regulation: Understanding and Shaping Players’ Affective Experiences in Digital Games","year":2013,"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":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Set (abstract data type); Task (project management); Computer science; Adversary; Human–computer interaction; Focus (optics); State (computer science); Cognitive psychology; Software; Multimedia; Psychology; Computer security; Engineering","score_opus":0.09112747875764911,"score_gpt":0.29562553702060496,"score_spread":0.20449805826295586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871110144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9514054,0.000021557289,0.0401889,0.001417403,0.00022365327,0.0006457184,0.000006894025,0.000040848405,0.006049634],"genre_scores_gemma":[0.9993506,0.000026326936,0.00018831552,0.00013059429,0.000025475143,0.00009035576,0.0000011204309,0.00001126328,0.00017592784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978529,0.000014234682,0.0006482217,0.0006400545,0.0004709636,0.0003736222],"domain_scores_gemma":[0.99877626,0.00025980966,0.00035362228,0.00016323685,0.00033001354,0.0001170583],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00018328232,0.00030101434,0.0002924471,0.00023654805,0.00016942495,0.0017113279,0.00065622403,0.000061753926,0.00006755223],"category_scores_gemma":[0.0003670354,0.00023233118,0.00008577636,0.0003373961,0.0005356651,0.0043506217,0.0005445099,0.00023979756,0.000028327951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016045824,0.0004507711,0.008856464,0.00005534123,0.00008163001,0.0000025037366,0.06711249,0.00016287371,0.0064698625,0.66990644,0.00014454257,0.24659663],"study_design_scores_gemma":[0.00009509266,0.0006928728,0.003602816,0.0011383661,0.00000672471,0.000028743754,0.10106026,0.16319616,0.16385186,0.5656933,0.00003471191,0.0005990741],"about_ca_topic_score_codex":0.000052134536,"about_ca_topic_score_gemma":0.00000892846,"teacher_disagreement_score":0.24599756,"about_ca_system_score_codex":0.00021809258,"about_ca_system_score_gemma":0.000042251682,"threshold_uncertainty_score":0.999325},"labels":[],"label_agreement":null},{"id":"W187444948","doi":"10.1609/aiide.v4i1.18705","title":"PaSSAGE: A Demonstration of Player Modelling in Interactive Storytelling","year":2008,"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":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Component (thermodynamics); Storytelling; Human–computer interaction; Multimedia; Artificial intelligence; Narrative","score_opus":0.06659650951982518,"score_gpt":0.2829024432694621,"score_spread":0.21630593374963694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187444948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82833445,0.00003344693,0.16071852,0.00068050576,0.00028998512,0.0005400333,0.000009813281,0.000034799054,0.009358464],"genre_scores_gemma":[0.99866796,0.00010590157,0.00095801783,0.00007870867,0.000027824906,0.000034517558,0.0000010221072,0.000014069107,0.00011197156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99748194,0.000027840904,0.0010136128,0.0005881948,0.00053804397,0.00035037383],"domain_scores_gemma":[0.99818474,0.00027685767,0.0006575255,0.0002440712,0.00054766814,0.00008911741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027511772,0.00031069273,0.00040664015,0.00030928955,0.00013069651,0.00019976894,0.0009901435,0.00009331172,0.00002060982],"category_scores_gemma":[0.00020925325,0.0002495616,0.00015969762,0.0004431185,0.0004425146,0.0020952504,0.00038096396,0.0004272086,0.000017409153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012025546,0.0021932395,0.010270709,0.00012386631,0.00016895808,0.000013965655,0.05043272,0.010072754,0.037017833,0.6812115,0.000056494442,0.20723544],"study_design_scores_gemma":[0.000051425475,0.00048825107,0.00025953338,0.000654564,0.00000849329,0.000019811243,0.006026501,0.33148167,0.6217369,0.03894562,0.000037525497,0.00028970535],"about_ca_topic_score_codex":0.00007865578,"about_ca_topic_score_gemma":0.000012291061,"teacher_disagreement_score":0.64226586,"about_ca_system_score_codex":0.00014167078,"about_ca_system_score_gemma":0.00008413904,"threshold_uncertainty_score":0.99999565},"labels":[],"label_agreement":null},{"id":"W1875122754","doi":"10.1109/wqv.1993.262947","title":"Motion understanding from qualitative visual dynamics","year":2002,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Representation (politics); Motion (physics); Function (biology); Computer science; Dynamics (music); Expression (computer science); Artificial intelligence; Component (thermodynamics); Depiction; Physics","score_opus":0.17396370686973534,"score_gpt":0.3692506639952722,"score_spread":0.19528695712553684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875122754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012769851,0.000021882634,0.96810037,0.0014728762,0.000292654,0.000054316177,0.0000018063172,0.00020136112,0.017084898],"genre_scores_gemma":[0.9698798,0.000006027122,0.029138071,0.00018963045,0.00003999599,0.000002243179,0.0000020517143,0.0000049769956,0.0007371758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910015,0.00009148943,0.00017476881,0.00025493602,0.00020819726,0.00017047205],"domain_scores_gemma":[0.99934775,0.00031269106,0.00004964291,0.00020412872,0.000033755026,0.00005201334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015985843,0.00008189493,0.00008311144,0.00006162671,0.00010068326,0.00014305756,0.00034905234,0.00004424458,0.00038664724],"category_scores_gemma":[0.00006364844,0.000075993776,0.000036593356,0.00023479013,0.000058304664,0.00054409396,0.000098113145,0.00007735137,0.0005812059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.528292e-7,0.000046919202,0.00013470471,9.097451e-7,0.000009843226,0.0000037010107,0.020454615,0.00011297226,0.00009430111,0.9411545,0.0005388445,0.03744783],"study_design_scores_gemma":[0.000019413694,0.000026841066,0.000023945318,0.000004288019,0.000001307398,5.2679786e-7,0.009159576,0.79091865,0.0012803823,0.19844253,0.000032009197,0.00009054534],"about_ca_topic_score_codex":0.00024747333,"about_ca_topic_score_gemma":0.0002465283,"teacher_disagreement_score":0.95711,"about_ca_system_score_codex":0.00024671276,"about_ca_system_score_gemma":0.0000048646007,"threshold_uncertainty_score":0.74704194},"labels":[],"label_agreement":null},{"id":"W1884151215","doi":"10.1609/aiide.v9i1.12683","title":"Predicting Army Combat Outcomes in StarCraft","year":2013,"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":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dependency (UML); Computer science; Artificial intelligence; Domain (mathematical analysis); Machine learning; Order (exchange); Operations research; Engineering","score_opus":0.03831036017914126,"score_gpt":0.2823835848707102,"score_spread":0.24407322469156895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884151215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787954,0.000014318015,0.0056404388,0.0043984344,0.00038114353,0.0008633651,0.000008797628,0.00006671127,0.009831407],"genre_scores_gemma":[0.99876285,0.000025024994,0.00033415185,0.00037328203,0.00002507237,0.000110893096,8.039351e-7,0.000015139837,0.00035279404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974311,0.000021675574,0.000876049,0.00063797814,0.00054241944,0.00049078185],"domain_scores_gemma":[0.998438,0.0002854083,0.0004036082,0.00029729563,0.0004413266,0.00013438678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023224394,0.00035041926,0.0004061424,0.00023648803,0.00012681348,0.0009559787,0.0014466486,0.00008144557,0.00008981062],"category_scores_gemma":[0.00050837407,0.0002497757,0.00014970498,0.00036660902,0.00033790976,0.0026235844,0.00081683666,0.00040997178,0.00013175179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014652021,0.0014974298,0.14700025,0.000067459565,0.000117519805,0.000003252294,0.012206169,0.00009414397,0.01562576,0.44253755,0.00015097074,0.38055298],"study_design_scores_gemma":[0.00012733394,0.0012895917,0.019623974,0.0010579108,0.000016557346,0.000014727654,0.018653043,0.1660604,0.4892779,0.30284053,0.00016856416,0.0008694733],"about_ca_topic_score_codex":0.00023761982,"about_ca_topic_score_gemma":0.000027360607,"teacher_disagreement_score":0.47365212,"about_ca_system_score_codex":0.00013178831,"about_ca_system_score_gemma":0.000042591902,"threshold_uncertainty_score":0.99999547},"labels":[],"label_agreement":null},{"id":"W189007800","doi":"10.1609/aiide.v5i1.12369","title":"Learning Character Behaviors Using Agent Modeling in Games","year":2009,"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":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Mechanism (biology); Character (mathematics)","score_opus":0.07578842551817157,"score_gpt":0.31044543303142874,"score_spread":0.2346570075132572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189007800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9705092,0.000017797447,0.024780348,0.001201923,0.0002488015,0.00040537206,0.000002788408,0.000049236518,0.0027845558],"genre_scores_gemma":[0.99909186,0.000045432032,0.00043095456,0.00024907984,0.000039395924,0.000015994347,8.9031647e-7,0.00001241743,0.00011395973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759406,0.000023238892,0.0007972685,0.00064481114,0.00048042633,0.0004601717],"domain_scores_gemma":[0.99891174,0.00007022601,0.00036654057,0.0002144501,0.00032681075,0.00011023222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028069614,0.0003327552,0.00034917894,0.00027695924,0.00015018982,0.0007082974,0.0010174877,0.00008650624,0.00002161072],"category_scores_gemma":[0.00024630973,0.00026288902,0.00015257312,0.00038732486,0.00015357956,0.0019244042,0.0003725621,0.0004970653,0.000022238639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031671138,0.0011672523,0.0038463017,0.000030122106,0.000042191634,0.000008132722,0.016488427,0.004525221,0.06878315,0.18395445,0.000009107497,0.72082895],"study_design_scores_gemma":[0.000038024165,0.0006845308,0.00035718922,0.00063425576,0.00001113238,0.000012426424,0.005707451,0.7501025,0.20436029,0.037688684,0.00003672421,0.00036678402],"about_ca_topic_score_codex":0.000045979155,"about_ca_topic_score_gemma":0.0000044947597,"teacher_disagreement_score":0.7455773,"about_ca_system_score_codex":0.00017962547,"about_ca_system_score_gemma":0.000045721885,"threshold_uncertainty_score":0.99998236},"labels":[],"label_agreement":null},{"id":"W1892351060","doi":"10.1007/s00182-017-0608-4","title":"Two-player Tower of Hanoi","year":2017,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Tower; Mathematics; Mathematical economics; Characterization (materials science); Combinatorics; Transfer (computing); Type (biology); Class (philosophy); Computer science; Artificial intelligence; Geography; Physics","score_opus":0.031181330870869394,"score_gpt":0.3483884644706121,"score_spread":0.31720713359974273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892351060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31114292,0.000269706,0.64738894,0.0033285196,0.0062835263,0.000061878796,0.000004631039,0.000020229785,0.031499628],"genre_scores_gemma":[0.990867,0.000032595857,0.0076836203,0.00021212857,0.0004262188,5.941997e-7,1.2479104e-7,0.000006224532,0.0007714472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985686,0.00007053242,0.000500175,0.000116333125,0.0006192653,0.00012507023],"domain_scores_gemma":[0.99735695,0.00024160101,0.000990703,0.00046402524,0.0008804078,0.00006633083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010901949,0.000090252484,0.0001758996,0.0001742947,0.00005458146,0.00020524548,0.003881072,0.00003613812,0.00020719667],"category_scores_gemma":[0.00071444525,0.00007371347,0.00016039136,0.000030449852,0.0002733601,0.0010070018,0.00035898446,0.000170778,0.0000463687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023370559,0.00018182148,0.002489633,0.000002999785,0.00026609557,0.00022914556,0.0026772902,0.0005407453,0.012970286,0.76072204,0.0007716249,0.2189146],"study_design_scores_gemma":[0.0005319822,0.00024662341,0.004384069,0.00022340755,0.000020923073,0.0004315408,0.00030605224,0.0029608745,0.22949931,0.7537024,0.0074613476,0.00023148004],"about_ca_topic_score_codex":0.00001716091,"about_ca_topic_score_gemma":0.000004725885,"teacher_disagreement_score":0.6797241,"about_ca_system_score_codex":0.000045651028,"about_ca_system_score_gemma":0.00010435993,"threshold_uncertainty_score":0.7212062},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09497848147463588,"score_gpt":0.32779302477373623,"score_spread":0.23281454329910034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190498140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9192082,0.00013895117,0.02488516,0.0051975814,0.0013372721,0.00055230886,0.000007313203,0.0002011545,0.048472017],"genre_scores_gemma":[0.99305195,0.00009913379,0.00608379,0.0001777978,0.00008849217,0.000031195865,6.520198e-7,0.000020098196,0.00044686988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965433,0.000026270416,0.0011244622,0.0008674866,0.0007511107,0.00068738684],"domain_scores_gemma":[0.9972483,0.00026779005,0.000536577,0.0005530427,0.0012709543,0.00012335379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068994844,0.00037173618,0.0004555616,0.00025574933,0.00021760345,0.00066691707,0.0025582286,0.00017616057,0.00027635202],"category_scores_gemma":[0.0010367037,0.00030911795,0.00021490993,0.001434744,0.00044535764,0.0014582627,0.0007133846,0.00064427394,0.00017984313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003647793,0.00021646147,0.00044326458,0.00004496199,0.0000151477825,0.000010985798,0.00358198,0.0008436158,0.065673985,0.8765774,0.0001189274,0.052436836],"study_design_scores_gemma":[0.000018856566,0.00009725558,0.0013915456,0.00037299213,0.0000069657676,0.000015708378,0.00721336,0.032788426,0.71854603,0.23907433,0.00013910365,0.0003354252],"about_ca_topic_score_codex":0.00009675774,"about_ca_topic_score_gemma":0.00010499196,"teacher_disagreement_score":0.652872,"about_ca_system_score_codex":0.000110439796,"about_ca_system_score_gemma":0.0004689017,"threshold_uncertainty_score":0.9999361},"labels":[],"label_agreement":null},{"id":"W1927466156","doi":"10.1109/cig.2015.7317956","title":"Space and depth-related enhancements of the history-ADS strategy in game playing","year":2015,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristic; Heuristics; Computer science; Context (archaeology); Metric (unit); Pruning; Tree (set theory); Field (mathematics); Search tree; Variety (cybernetics); Artificial intelligence; Search algorithm; Algorithm; Mathematics; Engineering; Geography","score_opus":0.070430436381434,"score_gpt":0.2866222990897317,"score_spread":0.2161918627082977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927466156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9024829,0.00061023305,0.037983943,0.00060388236,0.00084981596,0.00018414107,1.8860932e-7,0.000052266263,0.05723258],"genre_scores_gemma":[0.993694,0.000008700548,0.0015171681,0.000072401475,0.0000064230508,0.0000030853325,5.369292e-8,0.000003415332,0.004694758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991326,0.00005990701,0.00022753862,0.00018681622,0.00022665983,0.00016651151],"domain_scores_gemma":[0.99943537,0.00005924002,0.000098698816,0.00029451944,0.00005898377,0.00005321792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032997417,0.00007318159,0.00010317449,0.00005169364,0.000014732645,0.000020227193,0.00047551174,0.00005062999,0.000032183292],"category_scores_gemma":[0.000094892945,0.00005267053,0.000018733712,0.00019577984,0.000072547526,0.00025004635,0.0002115998,0.00010570984,0.000024978164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047115784,0.00041348828,0.39101526,0.000048452683,0.000073325704,0.00003299707,0.03754747,0.009349131,0.05266393,0.40429175,0.017000137,0.08751692],"study_design_scores_gemma":[0.0009275245,0.0004883247,0.04741426,0.0002173369,0.000018771863,0.000025632988,0.002707944,0.55313295,0.31305435,0.06494012,0.016179329,0.00089345884],"about_ca_topic_score_codex":0.00054958725,"about_ca_topic_score_gemma":0.00036368097,"teacher_disagreement_score":0.54378384,"about_ca_system_score_codex":0.00019643774,"about_ca_system_score_gemma":0.00011373786,"threshold_uncertainty_score":0.21478419},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1055475456976191,"score_gpt":0.32319587754650286,"score_spread":0.21764833184888377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193176855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5797498,0.00002757123,0.4109732,0.0002913055,0.00015027152,0.00019834166,4.2827443e-7,0.00011283229,0.008496231],"genre_scores_gemma":[0.9438854,0.0000021605306,0.05497043,0.000371581,0.000021698568,0.000018997345,2.7866918e-7,0.000005497155,0.0007239669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989,0.00012904897,0.00026745358,0.0002860446,0.00015361438,0.00026387078],"domain_scores_gemma":[0.9992312,0.00016694433,0.00005895585,0.00037713355,0.000117298005,0.00004845343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058016164,0.00009040603,0.000102976184,0.00013647687,0.00006734644,0.00007646532,0.00044005766,0.00005371385,0.00012786621],"category_scores_gemma":[0.0003803748,0.00008189569,0.00003153987,0.00032877648,0.000029646928,0.000660397,0.0001828358,0.00009912955,0.0003291955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036840604,0.000823621,0.121254645,0.000014152655,0.000021135209,0.00039880062,0.08278565,0.0005541486,0.025044885,0.5292266,0.001336819,0.23817113],"study_design_scores_gemma":[0.00025397586,0.0003346513,0.21236832,0.00009912374,0.000004024786,0.000027718448,0.0033152634,0.5356454,0.2263136,0.019087229,0.0018999804,0.0006506584],"about_ca_topic_score_codex":0.00025011998,"about_ca_topic_score_gemma":0.00031695404,"teacher_disagreement_score":0.5350913,"about_ca_system_score_codex":0.000037032158,"about_ca_system_score_gemma":0.000046805737,"threshold_uncertainty_score":0.42312518},"labels":[],"label_agreement":null},{"id":"W1943755952","doi":"10.1609/aaai.v26i1.8148","title":"Alpha-Beta Pruning for Games with Simultaneous Moves","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":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pruning; Minimax; BETA (programming language); Computer science; Alpha (finance); Computation; Class (philosophy); Monte Carlo tree search; Action (physics); Mathematical optimization; Mathematics; Algorithm; Artificial intelligence; Statistics","score_opus":0.06542046453595184,"score_gpt":0.3008025722434135,"score_spread":0.23538210770746165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943755952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25456,0.00029017974,0.6982523,0.018599257,0.0015579227,0.0021500043,0.000033140772,0.000585005,0.023972142],"genre_scores_gemma":[0.9679116,0.00004596017,0.030315138,0.00043912692,0.00011760982,0.000080831975,0.0000010646592,0.000032175587,0.001056516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968837,0.00002871504,0.0007750561,0.0009403392,0.00072271953,0.0006494815],"domain_scores_gemma":[0.995733,0.00070385874,0.00053876755,0.0006352959,0.0022392892,0.00014979215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048805037,0.00038918926,0.0004605702,0.00013669938,0.0003764738,0.00057979824,0.0026052915,0.00013785077,0.000065632485],"category_scores_gemma":[0.00132077,0.00028462266,0.00020870377,0.0010298324,0.0005132962,0.00064275146,0.0005175951,0.00035648549,0.00005934816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010234882,0.00019400982,0.00014880451,0.00006438981,0.000043193944,0.000005166371,0.001956511,0.0009723025,0.049543995,0.8253349,0.00012448952,0.121509895],"study_design_scores_gemma":[0.000024658262,0.00030240114,0.000023507286,0.0002865931,0.000022403337,0.000020038093,0.0015178686,0.11997942,0.759585,0.11727634,0.00064245815,0.00031928375],"about_ca_topic_score_codex":0.000026980872,"about_ca_topic_score_gemma":0.0000451454,"teacher_disagreement_score":0.71335155,"about_ca_system_score_codex":0.00006566657,"about_ca_system_score_gemma":0.00033868963,"threshold_uncertainty_score":0.9999606},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0481980177279456,"score_gpt":0.32637121151912946,"score_spread":0.2781731937911839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944385714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063658906,0.0003802765,0.98588455,0.0009853067,0.0023666134,0.00038807822,0.000012401832,0.000097517404,0.0035193625],"genre_scores_gemma":[0.872206,0.00007498872,0.12562606,0.00092520687,0.0006983843,0.000025626952,0.000013676616,0.00003439656,0.00039570616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532264,0.000057369274,0.0007340544,0.0017904947,0.0014455452,0.00064989756],"domain_scores_gemma":[0.9967194,0.0016781343,0.00019424323,0.00089286076,0.0003383755,0.00017698522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005352826,0.0005131344,0.00048401207,0.0010469237,0.00022102363,0.00077259267,0.0039714617,0.00031200887,0.00020595973],"category_scores_gemma":[0.00049267587,0.0005291849,0.00012646231,0.000712818,0.0006562755,0.00087167154,0.0014417317,0.0009989053,0.00039884305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009585925,0.0003104138,0.0017345833,0.00001535901,0.000032023945,0.000107344145,0.010305602,0.38214427,0.000041389656,0.04629474,0.00002209718,0.5589826],"study_design_scores_gemma":[0.000091870614,0.000054395845,0.0003520976,0.00050320855,0.0000057732586,0.000015478561,0.0000023360383,0.7409476,0.00016754425,0.257338,0.00005907107,0.00046263618],"about_ca_topic_score_codex":0.0004352175,"about_ca_topic_score_gemma":0.0004386513,"teacher_disagreement_score":0.8658401,"about_ca_system_score_codex":0.00033764687,"about_ca_system_score_gemma":0.0005917663,"threshold_uncertainty_score":0.999716},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11166523154844951,"score_gpt":0.22726046341502099,"score_spread":0.11559523186657147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1947291763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38984433,0.000017378103,0.60915387,0.00002865636,0.00022699672,0.000079850346,1.5426212e-7,0.000037144724,0.0006116225],"genre_scores_gemma":[0.9983731,0.000003092377,0.0013590971,0.0001256421,0.00006857337,3.2873893e-7,0.0000015177658,0.0000052436308,0.00006343165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988466,0.00022027172,0.00014604133,0.00041811503,0.0001022885,0.00026668236],"domain_scores_gemma":[0.9992035,0.00015128027,0.000084659405,0.00034525612,0.00014356835,0.00007172158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005229742,0.000106284824,0.000108645916,0.00014235695,0.0001063215,0.0000494413,0.0005730432,0.00007489193,0.000039283932],"category_scores_gemma":[0.000088381,0.00012676827,0.000051877327,0.0006720696,0.0000935722,0.0006578696,0.00017929834,0.00014327659,0.00004861346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006122077,0.000020101697,0.011159802,9.46776e-7,0.0000034620289,0.000008616783,0.00008117324,0.8539724,0.00002962234,0.12953092,0.00000904753,0.0051778043],"study_design_scores_gemma":[0.00012781136,0.000021309444,0.004967539,0.0000072517078,0.000008432777,0.0000028604431,0.00004222302,0.96743864,0.000068551446,0.027144408,0.000034778477,0.00013617399],"about_ca_topic_score_codex":0.00013217377,"about_ca_topic_score_gemma":0.00017412854,"teacher_disagreement_score":0.60852873,"about_ca_system_score_codex":0.00021525413,"about_ca_system_score_gemma":0.000046964633,"threshold_uncertainty_score":0.51694596},"labels":[],"label_agreement":null},{"id":"W1965935527","doi":"10.1016/j.tcs.2005.09.042","title":"Solving <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>7</mml:mn><mml:mo>×</mml:mo><mml:mn>7</mml:mn></mml:math> Hex with domination, fill-in, and virtual connections","year":2005,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Scroll; Algorithm; Computer science; Artificial intelligence; Theology; Philosophy","score_opus":0.01570695631548021,"score_gpt":0.25018469921805636,"score_spread":0.23447774290257614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965935527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74241155,0.00030802592,0.24892823,0.0018907276,0.0018258954,0.00016514622,0.00006925881,0.0003129725,0.004088194],"genre_scores_gemma":[0.9629217,0.00019201657,0.033430986,0.0018172906,0.0012065837,0.00015837558,0.000031829873,0.00014635213,0.00009487376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906165,0.0004313149,0.0016123229,0.0025148967,0.002552459,0.0022724872],"domain_scores_gemma":[0.99333537,0.0024065287,0.0008578326,0.0018958418,0.00049751316,0.0010069187],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.0038432174,0.00087004306,0.0005509196,0.0005794411,0.0024617417,0.0028335983,0.003556855,0.000760357,0.00061166467],"category_scores_gemma":[0.0012505952,0.0010436622,0.000474815,0.0021911557,0.008162032,0.002861672,0.0031071939,0.0013905757,0.0013045957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024840157,0.00035586275,0.000020102196,0.000101760466,0.00011217722,0.00024578403,0.005646348,0.0064227735,0.0010994846,0.96565706,0.0014169185,0.018673321],"study_design_scores_gemma":[0.00059594074,0.0015447494,0.00011276969,0.00066830654,0.00013739888,0.00078500295,0.00077220774,0.9076576,0.07644876,0.008910097,0.001314464,0.0010526653],"about_ca_topic_score_codex":0.00026460612,"about_ca_topic_score_gemma":0.00029681533,"teacher_disagreement_score":0.956747,"about_ca_system_score_codex":0.00009959855,"about_ca_system_score_gemma":0.0011850656,"threshold_uncertainty_score":0.999473},"labels":[],"label_agreement":null},{"id":"W1966037378","doi":"10.1016/j.scico.2007.01.005","title":"ScriptEase: A generative/adaptive programming paradigm for game scripting","year":2007,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scripting language; Programming language; Programmer; Game development tool; Game programming; Game design; Process (computing); Human–computer interaction; Video game development; Game art design; Adaptation (eye); Generative grammar; Construct (python library); Game Developer; Game design document; Multimedia; Artificial intelligence","score_opus":0.04936147975289325,"score_gpt":0.3183360852273099,"score_spread":0.26897460547441665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966037378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029184986,0.00024090896,0.9671495,0.00029911828,0.0014187029,0.0012079998,0.000001364488,0.0003478019,0.00014963448],"genre_scores_gemma":[0.45434082,0.00000117364,0.54525167,0.00009423697,0.00023330904,0.000044904824,8.059348e-7,0.000013205506,0.000019853975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952692,0.000056736717,0.00091678725,0.0011561478,0.0010718993,0.001529243],"domain_scores_gemma":[0.9972243,0.0003269424,0.0005047567,0.0008131927,0.00076385366,0.00036700701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0046632346,0.00034786726,0.0004214721,0.00062038365,0.0006401479,0.0008390885,0.0027747867,0.00009273397,0.0000022937481],"category_scores_gemma":[0.00023109993,0.0003309166,0.00020851503,0.002457149,0.001399176,0.0021166806,0.0006963646,0.000232123,0.000010852732],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017143408,0.00012443025,0.0002171043,0.000025295336,0.000014683066,0.0000100553225,0.0030269043,0.00045109377,0.0047286605,0.14501087,0.000035458877,0.84633833],"study_design_scores_gemma":[0.00046711182,0.0017649496,0.0008154018,0.00031069203,0.00002635413,0.00007649699,0.0010020913,0.7413903,0.20773195,0.02139975,0.023885489,0.0011294277],"about_ca_topic_score_codex":0.00005333366,"about_ca_topic_score_gemma":0.000023531165,"teacher_disagreement_score":0.8452089,"about_ca_system_score_codex":0.00017659625,"about_ca_system_score_gemma":0.00042355168,"threshold_uncertainty_score":0.9999143},"labels":[],"label_agreement":null},{"id":"W1967439097","doi":"10.1016/j.tcs.2015.03.022","title":"The complexity of zero-visibility cops and robber","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Memorial University of Newfoundland","funders":"Narodowe Centrum Nauki","keywords":"Visibility; Zero (linguistics); Class (philosophy); Tree (set theory); Mathematics; Zero-sum game; Discrete mathematics; Computational complexity theory; Combinatorics; Theoretical computer science; Complexity class; Computer science; Time complexity; Algorithm; Game theory; Artificial intelligence; Mathematical economics; Geography","score_opus":0.07225129867103225,"score_gpt":0.31593751795210256,"score_spread":0.24368621928107032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967439097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089910015,0.000071191156,0.9046563,0.0022867478,0.0005199123,0.00014942104,8.818441e-7,0.00008200055,0.002323552],"genre_scores_gemma":[0.9079699,0.0000041029284,0.091793865,0.00018043946,0.000038435137,0.0000024759515,8.934236e-8,0.0000034409604,0.0000072444273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767184,0.00018236779,0.00036626344,0.00054985983,0.0007800143,0.0004496506],"domain_scores_gemma":[0.99746305,0.00055563357,0.00009706738,0.00107092,0.00048144304,0.00033189266],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0037766164,0.00013767573,0.00019327164,0.00005991097,0.0004158541,0.0003857525,0.0026835043,0.000037478396,0.0000054310904],"category_scores_gemma":[0.000497717,0.00008733077,0.000040858824,0.00076851354,0.02191307,0.00052036665,0.0018795981,0.00016262448,0.00003063047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008237007,0.000028158634,0.0003332558,0.0000022763138,0.0000018465826,0.0000013871978,0.0007238074,0.000064234126,0.00012623462,0.9605416,0.000081520564,0.038087424],"study_design_scores_gemma":[0.00004308552,0.00012968943,0.0010204145,0.000007220237,0.0000015047615,0.000012651141,0.000023626884,0.32378298,0.0069082915,0.66785663,0.00012605492,0.00008783358],"about_ca_topic_score_codex":0.000021240605,"about_ca_topic_score_gemma":0.000003836885,"teacher_disagreement_score":0.81805986,"about_ca_system_score_codex":0.00004672535,"about_ca_system_score_gemma":0.00018725259,"threshold_uncertainty_score":0.9807487},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.053929065270828816,"score_gpt":0.3095958223270369,"score_spread":0.2556667570562081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196854640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45078456,0.000027592108,0.515707,0.0030007586,0.0012982051,0.0014221298,0.00003418944,0.00011911699,0.027606452],"genre_scores_gemma":[0.99822235,0.000010333011,0.001059073,0.00020435864,0.000079918515,0.00005399918,0.0000013178466,0.000016298844,0.00035236706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976069,0.00000743322,0.0007907901,0.0006145078,0.0004709218,0.00050945155],"domain_scores_gemma":[0.99804264,0.00042890318,0.0004940952,0.00026031036,0.0006255334,0.00014850475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005829938,0.00030021317,0.00027977204,0.00022366321,0.000301823,0.000628186,0.001092332,0.00008607545,0.000029333425],"category_scores_gemma":[0.00048755782,0.00022883617,0.00021467805,0.0002918742,0.00033058625,0.00091563945,0.00039830612,0.00028237855,0.000048956364],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022815238,0.00059995096,0.00020107398,0.00003641122,0.00005765826,0.0000012343803,0.0044265306,0.00016970473,0.019068126,0.5385525,0.0000930295,0.43656564],"study_design_scores_gemma":[0.000044070188,0.0005305798,0.00031495435,0.0002561645,0.000015422029,0.0000126218965,0.0091960635,0.027830275,0.9030541,0.0579751,0.00044492396,0.00032573534],"about_ca_topic_score_codex":0.000018186403,"about_ca_topic_score_gemma":0.000007834603,"teacher_disagreement_score":0.883986,"about_ca_system_score_codex":0.00014943951,"about_ca_system_score_gemma":0.00004693781,"threshold_uncertainty_score":0.93316686},"labels":[],"label_agreement":null},{"id":"W1970607503","doi":"10.1016/j.tcs.2013.02.032","title":"Impartial coloring games","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Greedy coloring; Graph coloring; Complete coloring; Fractional coloring; List coloring; Combinatorics; Edge coloring; Mathematics; Graph; Discrete mathematics; Combinatorial game theory; Computer science; Graph power; Sequential game; Game theory; Mathematical economics; Line graph","score_opus":0.017884919955491116,"score_gpt":0.27568016414118746,"score_spread":0.2577952441856963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970607503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14892806,0.000014482564,0.84271157,0.0018999627,0.00096734683,0.00021521529,2.0647774e-7,0.00035191863,0.004911263],"genre_scores_gemma":[0.8611244,0.000001980024,0.13796674,0.0006504143,0.00020323647,0.000024791172,1.0296798e-7,0.0000068809113,0.000021465257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971972,0.00007859791,0.00034667284,0.00076824246,0.0007583562,0.0008509079],"domain_scores_gemma":[0.99797595,0.00029070873,0.00006706615,0.00096654333,0.00030285804,0.00039685625],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009199941,0.0001931992,0.00019772744,0.00018087847,0.00043557785,0.0011854164,0.0036651292,0.000051712726,0.0003243977],"category_scores_gemma":[0.00016009188,0.00015632776,0.000071373244,0.0011688949,0.0033268924,0.0018915444,0.0015979488,0.00020665486,0.0020415531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012501717,0.000029874058,0.000115894276,0.0000016709621,0.0000018326731,0.0000047858384,0.00041682375,0.00016265553,0.0022014594,0.89287615,0.0001971383,0.10399044],"study_design_scores_gemma":[0.000039331862,0.0001385191,0.0011304928,0.000012236239,0.0000015166657,0.000022810285,0.000013546799,0.65604925,0.04861878,0.29355496,0.00019962376,0.00021895948],"about_ca_topic_score_codex":0.000026759239,"about_ca_topic_score_gemma":7.5332025e-7,"teacher_disagreement_score":0.71219635,"about_ca_system_score_codex":0.000071012124,"about_ca_system_score_gemma":0.00012760935,"threshold_uncertainty_score":0.99985147},"labels":[],"label_agreement":null},{"id":"W1978012637","doi":"10.1016/s0304-3975(00)00081-5","title":"Multi-cut αβ-pruning in game-tree search","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Tree (set theory); Search tree; Computer science; Mathematics; Artificial intelligence; Algorithm; Theoretical computer science; Machine learning; Combinatorics; Search algorithm; Horticulture","score_opus":0.04424988244330528,"score_gpt":0.32716459449050206,"score_spread":0.28291471204719676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978012637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19398218,0.000027491613,0.80094886,0.001170833,0.00047662738,0.00017156749,2.6118434e-7,0.0002145538,0.0030076017],"genre_scores_gemma":[0.797716,0.00001166416,0.20165806,0.00046962962,0.00009412576,0.0000063798007,1.9045682e-7,0.000009535187,0.000034414858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613833,0.00019739929,0.00045654314,0.0010601291,0.0010022586,0.0011453623],"domain_scores_gemma":[0.99778813,0.00042252333,0.000054534958,0.0011483022,0.00022699678,0.00035951234],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025289399,0.00023662529,0.0002616131,0.00048584945,0.0002888455,0.0006527061,0.004674426,0.0000802196,0.00007152627],"category_scores_gemma":[0.0002222664,0.00020907073,0.00007045722,0.0029455593,0.0035121709,0.0011839775,0.0019811755,0.00045036772,0.00047166485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008226563,0.00012534611,0.0019384143,0.0000031042784,0.0000016669669,0.000105996536,0.0020725934,0.0023649815,0.0020622876,0.8469458,0.000011116918,0.14436047],"study_design_scores_gemma":[0.00012364198,0.00012131793,0.004890015,0.00004448416,0.0000011046338,0.00006495232,0.000042210137,0.9390355,0.010766026,0.04448883,0.00014479319,0.0002771732],"about_ca_topic_score_codex":0.00004324199,"about_ca_topic_score_gemma":0.000034297183,"teacher_disagreement_score":0.9366705,"about_ca_system_score_codex":0.00014742745,"about_ca_system_score_gemma":0.00019981217,"threshold_uncertainty_score":0.9991997},"labels":[],"label_agreement":null},{"id":"W1978312982","doi":"10.1016/j.tcs.2003.08.013","title":"Periodicity and arithmetic-periodicity in hexadecimal games","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Arithmetic; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.01535544461742095,"score_gpt":0.26707115867993225,"score_spread":0.2517157140625113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978312982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38485542,0.00007176559,0.6110252,0.00061594055,0.0003067017,0.00013418868,4.86739e-7,0.00009560476,0.0028946376],"genre_scores_gemma":[0.85261756,0.000011247089,0.146703,0.00061245885,0.00003556645,0.0000074398836,8.129961e-8,0.000006301986,0.0000063533253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676377,0.00024721754,0.00042167396,0.0010290508,0.0007280896,0.0008101884],"domain_scores_gemma":[0.9982882,0.0003762019,0.000064573986,0.0007770027,0.00014360195,0.00035039693],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024640223,0.00024253687,0.00030653575,0.00030669014,0.0004109012,0.00081230036,0.0018113665,0.00008039272,0.000066288965],"category_scores_gemma":[0.00058550114,0.0002090903,0.00005068042,0.001471432,0.006464244,0.0009003158,0.00079851603,0.00034638747,0.000062654726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003994764,0.00006743034,0.0031027424,0.0000041718154,0.0000012887451,0.000026403703,0.0013234203,0.00008182816,0.00042992336,0.9611204,0.000008275413,0.033830117],"study_design_scores_gemma":[0.00021120337,0.00031088435,0.016121812,0.00005173845,0.00000366641,0.00017063174,0.0000934539,0.5101954,0.02558046,0.4461759,0.000536952,0.00054792274],"about_ca_topic_score_codex":0.00002173771,"about_ca_topic_score_gemma":0.000007467654,"teacher_disagreement_score":0.5149445,"about_ca_system_score_codex":0.00008496594,"about_ca_system_score_gemma":0.00020938234,"threshold_uncertainty_score":0.9962396},"labels":[],"label_agreement":null},{"id":"W1980941589","doi":"10.1109/cig.2013.6633608","title":"Creating large numbers of game AIs by learning behavior for cooperating units","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Human–computer interaction","score_opus":0.029328692075565786,"score_gpt":0.2940058455128764,"score_spread":0.26467715343731063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980941589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4159019,0.000024608515,0.57991093,0.00009478609,0.0000897162,0.00031540362,0.0000023505977,0.00012437804,0.0035359038],"genre_scores_gemma":[0.9486511,0.0000022604675,0.04752453,0.00012734711,0.000027053302,0.00010546392,0.0000044017156,0.0000123851305,0.003545486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988476,0.000048043963,0.00034396606,0.00025824402,0.00017045334,0.00033171408],"domain_scores_gemma":[0.9988451,0.00027928088,0.00012989498,0.0002279243,0.000446022,0.00007176625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028170145,0.00011213622,0.00015823529,0.00004390947,0.00017359242,0.0001650366,0.00047986477,0.00005652699,0.00034109878],"category_scores_gemma":[0.0004683154,0.00010206014,0.00004107084,0.00028373415,0.000042471973,0.0006031948,0.00015708746,0.00011936114,0.00009932166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008291728,0.0004909847,0.094518535,0.00009632911,0.00006423236,0.0000046340115,0.025230775,0.003288059,0.29229033,0.11453094,0.017781371,0.4516955],"study_design_scores_gemma":[0.00019061929,0.00029888988,0.00088051014,0.000055667322,0.000011951619,0.000005270123,0.004433962,0.64195466,0.34696126,0.00045197588,0.0043382356,0.00041696228],"about_ca_topic_score_codex":0.0009190895,"about_ca_topic_score_gemma":0.000041717198,"teacher_disagreement_score":0.6386666,"about_ca_system_score_codex":0.000019518875,"about_ca_system_score_gemma":0.000043381337,"threshold_uncertainty_score":0.4161892},"labels":[],"label_agreement":null},{"id":"W1982693575","doi":"10.1145/1328202.1328229","title":"Story scripting for automating cinematics and cut-scenes in video games","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scripting language; Computer science; Computer graphics (images); Video game; Multimedia; World Wide Web; Computer vision; Artificial intelligence; Human–computer interaction; Programming language","score_opus":0.04013155293632845,"score_gpt":0.31740770179164707,"score_spread":0.2772761488553186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982693575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21816754,0.0001449905,0.7791857,0.00048508437,0.00021552712,0.00018424721,1.9918949e-7,0.00016093714,0.0014557474],"genre_scores_gemma":[0.6488387,0.0000036255603,0.35058174,0.00027747234,0.000052815318,0.000007795451,1.5604267e-7,0.0000065173617,0.00023117158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989185,0.000025458732,0.00034524163,0.00025154004,0.00014277117,0.00031652764],"domain_scores_gemma":[0.9987707,0.0007905032,0.00008961829,0.00022251983,0.000068533875,0.000058122187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014918286,0.00010194843,0.00014599,0.00015305934,0.00010831196,0.00011332703,0.0003208915,0.000048383878,0.0000057091247],"category_scores_gemma":[0.0005946562,0.00009260244,0.000027474496,0.0002145843,0.000051607083,0.0004150852,0.00014128623,0.00009031592,0.00000727769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070358587,0.00006428802,0.016704382,0.00016453446,0.000010743623,0.00001463709,0.0122416625,0.00042272816,0.0071534063,0.15729634,0.0013781909,0.80454206],"study_design_scores_gemma":[0.000113330236,0.000073266674,0.005171045,0.00014226497,0.0000034334448,0.000012424782,0.003622799,0.9234804,0.04881577,0.016745407,0.0015428959,0.0002769563],"about_ca_topic_score_codex":0.000050037324,"about_ca_topic_score_gemma":0.00038293298,"teacher_disagreement_score":0.9230577,"about_ca_system_score_codex":0.000035453377,"about_ca_system_score_gemma":0.000027117267,"threshold_uncertainty_score":0.37762177},"labels":[],"label_agreement":null},{"id":"W1985144852","doi":"10.5555/2820144.2820147","title":"A game genre agnostic framework for game-design","year":2015,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Game design; Computer science; Video game design; Process (computing); Game Developer; Screening game; Game art design; Game mechanics; Human–computer interaction; Sequential game; Order (exchange); Game theory; Programming language; Mathematics","score_opus":0.15309887846635337,"score_gpt":0.3492299064699055,"score_spread":0.19613102800355212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985144852","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010145542,0.0001585908,0.99363387,0.0016646136,0.0008403215,0.00046491768,0.0000011433425,0.00040381268,0.001818178],"genre_scores_gemma":[0.40061918,0.000005285624,0.59692025,0.0010922352,0.00017762168,0.00007472529,5.9682077e-7,0.000013969446,0.0010961178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850774,0.00006817324,0.0002740918,0.0004278246,0.00030254593,0.00041960922],"domain_scores_gemma":[0.99743617,0.0013062289,0.00007582692,0.00069515157,0.00024531723,0.0002412979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005339045,0.00015844108,0.00017669231,0.000079897465,0.000047019446,0.00022692597,0.0011785175,0.00012202855,0.000039576385],"category_scores_gemma":[0.0016670645,0.00013580106,0.0000800188,0.000325827,0.000071086244,0.00039167248,0.00019752426,0.00013167424,0.0008900094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027261594,0.00010439576,0.00016922531,0.000011858302,0.000021410357,0.000019500378,0.0041907113,0.006788664,0.00013861907,0.8879389,0.015731275,0.08485814],"study_design_scores_gemma":[0.000067309804,0.0002766444,0.000029485162,0.000030156434,0.000006214345,0.00001026071,0.00019007054,0.25479633,0.014494839,0.720948,0.00890616,0.00024458457],"about_ca_topic_score_codex":0.00003028966,"about_ca_topic_score_gemma":0.0000060479338,"teacher_disagreement_score":0.39960462,"about_ca_system_score_codex":0.000058597183,"about_ca_system_score_gemma":0.00016661381,"threshold_uncertainty_score":0.9998879},"labels":[],"label_agreement":null},{"id":"W1989745730","doi":"10.1109/sitis.2013.166","title":"MAS Controlled NPCs in 3D Virtual Learning Environment","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Computer science; Metaverse; Human–computer interaction; Context (archaeology); Interface (matter); Instructional simulation; Multimedia; Narrative; Virtual reality; Virtual agent; Multi-agent system; Virtual machine; Intelligent agent; Artificial intelligence","score_opus":0.014825426214053748,"score_gpt":0.22951209178708737,"score_spread":0.21468666557303362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989745730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14652973,0.000044577297,0.83261013,0.0014226832,0.00017950384,0.00040979154,5.079546e-8,0.00014164926,0.01866189],"genre_scores_gemma":[0.9730892,0.0000174489,0.0190476,0.00031841837,0.000031462212,0.00006808413,2.3371481e-7,0.000005892034,0.00742165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988383,0.00009274402,0.00029134634,0.00027884563,0.0002219697,0.0002767772],"domain_scores_gemma":[0.99937195,0.00021239347,0.000055824206,0.00027727053,0.000016076337,0.00006650026],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002628284,0.00010582494,0.00018047538,0.00008367156,0.000055244946,0.00013830083,0.00050368474,0.00004938988,0.001237797],"category_scores_gemma":[0.00008833915,0.00008591431,0.00004488083,0.00010840228,0.00005123647,0.00044184396,0.00022628788,0.00016533223,0.0050318935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029792393,0.00026631137,0.01791035,0.0000032545108,0.000030006477,0.000031541833,0.0040195086,0.058999896,0.00852883,0.14175212,0.0013517838,0.7670766],"study_design_scores_gemma":[0.00045015683,0.00016397054,0.0027290757,0.0000073724827,0.0000017407915,0.000002678498,0.00047055676,0.9813543,0.004901086,0.004368706,0.0053302404,0.00022013746],"about_ca_topic_score_codex":0.00024983793,"about_ca_topic_score_gemma":0.00001889934,"teacher_disagreement_score":0.9223544,"about_ca_system_score_codex":0.000052369047,"about_ca_system_score_gemma":0.000017176088,"threshold_uncertainty_score":0.9996752},"labels":[],"label_agreement":null},{"id":"W1989985245","doi":"10.1016/j.dam.2004.04.001","title":"Fun with algorithms","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Algorithm; Combinatorics","score_opus":0.022159716576036687,"score_gpt":0.2613993383699683,"score_spread":0.23923962179393163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989985245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068928655,0.000017890789,0.9630592,0.00040689373,0.00006318365,0.00025311677,0.0000014360627,0.00029694272,0.029008495],"genre_scores_gemma":[0.3385099,0.00000430948,0.66113734,0.00016199182,0.000042053663,0.000042954412,0.0000014575071,0.000018672277,0.0000813472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871844,0.000003889417,0.0002620685,0.00031732713,0.00037498164,0.00032326626],"domain_scores_gemma":[0.9989365,0.00006178901,0.00011194812,0.00074329576,0.000046730576,0.00009977078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014591803,0.00018445605,0.00019727269,0.000058945927,0.00011158276,0.00016267518,0.00084669987,0.00005509394,0.000017319753],"category_scores_gemma":[0.000014020491,0.0001364672,0.00004142153,0.00032492448,0.000113109374,0.00020697716,0.00017720228,0.0001267184,0.00046811352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002251763,0.000068813424,0.000003019697,0.000023696486,0.00001598151,0.000012667805,0.0033895506,0.0010931812,0.001065623,0.9838253,0.00004015023,0.010459765],"study_design_scores_gemma":[0.00030198402,0.000134589,0.000025500733,0.00008056032,0.00002211038,0.000052566247,0.0016126265,0.019152941,0.11539151,0.86163723,0.0010019658,0.00058639195],"about_ca_topic_score_codex":0.000008667146,"about_ca_topic_score_gemma":0.000007947731,"teacher_disagreement_score":0.33161703,"about_ca_system_score_codex":0.00004461479,"about_ca_system_score_gemma":0.00006173463,"threshold_uncertainty_score":0.6016808},"labels":[],"label_agreement":null},{"id":"W1994325523","doi":"10.1016/j.tcs.2012.05.014","title":"polish—Let us play the cleaning game","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Graph; Vertex (graph theory); Mathematics; Complete bipartite graph; Discrete mathematics; Computer science","score_opus":0.021243932082185567,"score_gpt":0.28496814932973086,"score_spread":0.2637242172475453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994325523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08847484,0.0000744993,0.89912105,0.002333752,0.001811071,0.0001588525,7.263106e-7,0.00027733107,0.0077479025],"genre_scores_gemma":[0.94594765,0.000004099588,0.05072111,0.0026284046,0.0006579859,0.000011736625,1.6987958e-7,0.00001085492,0.000018013698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966353,0.00018826188,0.00034715552,0.0005764989,0.0009934533,0.0012593096],"domain_scores_gemma":[0.9973459,0.00064639514,0.00009314209,0.0013216935,0.0001637479,0.00042910743],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029784418,0.00022254311,0.00019124435,0.00013737098,0.00069172814,0.0008269689,0.005163772,0.000060858074,0.00011345504],"category_scores_gemma":[0.00026111802,0.0001434874,0.000088667075,0.0013951964,0.004685021,0.0016941491,0.0020608758,0.0003593706,0.0007194505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023623015,0.000039275285,0.00052855007,0.000001285171,0.000002558948,0.0000028391432,0.0027966634,0.00017340278,0.00023248058,0.9514582,0.00020757859,0.04455476],"study_design_scores_gemma":[0.000087422115,0.00018845165,0.007928596,0.00004093529,0.00000971795,0.00016644066,0.00008336956,0.7011114,0.030352049,0.25328308,0.0061598136,0.00058871444],"about_ca_topic_score_codex":0.000013933977,"about_ca_topic_score_gemma":9.0813774e-7,"teacher_disagreement_score":0.8574728,"about_ca_system_score_codex":0.000084643376,"about_ca_system_score_gemma":0.000108188266,"threshold_uncertainty_score":0.9980236},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05601123108821538,"score_gpt":0.28864093309208705,"score_spread":0.23262970200387167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994685255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22025867,0.006603092,0.6940303,0.064126655,0.0027986001,0.0010884823,0.0000049172386,0.00048051495,0.010608797],"genre_scores_gemma":[0.9921971,0.0006120502,0.005134101,0.0015034748,0.00036441447,0.000036144,4.3802729e-7,0.000011057282,0.00014124473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787086,0.00016207859,0.00050832325,0.00056226726,0.00039691248,0.00049955334],"domain_scores_gemma":[0.99855626,0.00040952384,0.000094042276,0.000778372,0.00007426018,0.00008751871],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006563566,0.0002206578,0.00019252634,0.00016017986,0.00021984385,0.0004433803,0.0016093254,0.00010892993,0.00015739613],"category_scores_gemma":[0.00012331775,0.00016419223,0.000067680536,0.0009067923,0.00027900585,0.00064505136,0.000220306,0.0003632396,0.0008813222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068255104,0.00016548503,0.0009766718,0.0000074676227,0.0000060313637,0.00006455004,0.008065276,0.00022955955,0.0004528014,0.28780857,0.001613179,0.7006036],"study_design_scores_gemma":[0.00002946287,0.00024629867,0.0021564146,0.000060659546,0.000012208307,0.00013605754,0.008764655,0.47095442,0.04161439,0.43429685,0.040853858,0.0008747182],"about_ca_topic_score_codex":0.000041872278,"about_ca_topic_score_gemma":0.0011956058,"teacher_disagreement_score":0.7719384,"about_ca_system_score_codex":0.000027776847,"about_ca_system_score_gemma":0.000016059308,"threshold_uncertainty_score":0.9998966},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03679734623591062,"score_gpt":0.3270783915183024,"score_spread":0.2902810452823918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995987707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1030022,0.00005842266,0.8740005,0.0013121957,0.0009870502,0.00008352681,2.4931612e-7,0.00019050388,0.020365372],"genre_scores_gemma":[0.9508153,0.0000034470208,0.04720224,0.0013547663,0.000053293144,0.0000013265237,3.599094e-8,0.0000030545061,0.00056651025],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981797,0.000006528213,0.00018666127,0.00045782296,0.0006225458,0.00054677424],"domain_scores_gemma":[0.9989332,0.000062082414,0.000054506705,0.00062497397,0.00014957691,0.0001756754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018232531,0.000081716345,0.00006910752,0.00017507224,0.00029620028,0.00023069956,0.0023134968,0.000028533557,0.0000454662],"category_scores_gemma":[0.00017987464,0.00007302619,0.000034744193,0.0016594767,0.0007327618,0.001040952,0.00035742507,0.00009170562,0.00069187494],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060177654,0.00008341096,0.006591479,0.0000050621557,0.0000044637986,0.00004627413,0.011466358,0.00007212141,0.18082981,0.21118481,0.0025494325,0.58716077],"study_design_scores_gemma":[0.000027489767,0.000044886245,0.00823621,0.000008497962,9.644549e-7,0.00001124939,0.00030709093,0.026392506,0.92769957,0.019939156,0.017120115,0.00021228132],"about_ca_topic_score_codex":0.000023018376,"about_ca_topic_score_gemma":0.000014654339,"teacher_disagreement_score":0.8478131,"about_ca_system_score_codex":0.00007020936,"about_ca_system_score_gemma":0.000187017,"threshold_uncertainty_score":0.8892883},"labels":[],"label_agreement":null},{"id":"W1997306964","doi":"10.1109/igic.2013.6659132","title":"Towards the design of a human-like FPS NPC using pheromone maps","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Categorization; Computer science; Limiting; Artificial intelligence; Pheromone; Quake (natural phenomenon); Human–computer interaction; Process (computing); Machine learning; Engineering; Programming language; Biology","score_opus":0.14699676460362562,"score_gpt":0.3215466838260952,"score_spread":0.17454991922246957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997306964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044500463,0.000058958707,0.9503566,0.0005831397,0.00022085143,0.0002988604,2.6393235e-7,0.00009144332,0.0038894292],"genre_scores_gemma":[0.85397124,0.0000037435855,0.14490457,0.00032653497,0.00004590196,0.0000150082715,1.4376786e-7,0.000008013931,0.0007248216],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988297,0.00011304787,0.0002941454,0.0002309946,0.0002837082,0.00024840864],"domain_scores_gemma":[0.9989206,0.0001278377,0.00010075027,0.00064503896,0.00015561676,0.000050156763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038130768,0.00011276103,0.00014046989,0.00004730625,0.00014138725,0.00015175645,0.0012455295,0.00004757882,0.00032350788],"category_scores_gemma":[0.000038058577,0.00007125408,0.000056217425,0.000295746,0.00015686269,0.0004559016,0.00030521525,0.00009141503,0.00023144438],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072661096,0.00033133078,0.0005189399,0.000029494753,0.00009823929,0.000014217645,0.012738846,0.011509378,0.43870085,0.27219155,0.021560386,0.2422995],"study_design_scores_gemma":[0.000052743857,0.00015045574,0.00033127418,0.000026126,0.000009217229,0.000013275793,0.0006440216,0.4955511,0.40122315,0.10148261,0.0002676136,0.00024840262],"about_ca_topic_score_codex":0.0019968257,"about_ca_topic_score_gemma":0.000021002756,"teacher_disagreement_score":0.80947083,"about_ca_system_score_codex":0.000027167636,"about_ca_system_score_gemma":0.000059529608,"threshold_uncertainty_score":0.35421845},"labels":[],"label_agreement":null},{"id":"W1997414364","doi":"10.1109/mci.2011.940622","title":"Simultaneous Dual Level Creation for Games","year":2011,"lang":"en","type":"article","venue":"IEEE Computational Intelligence Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Dual (grammatical number); Computer science; Artificial intelligence","score_opus":0.11248533864093782,"score_gpt":0.32817824891469743,"score_spread":0.2156929102737596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997414364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039900094,0.000080208156,0.9903524,0.0003912175,0.0011375877,0.00051265553,0.00003413566,0.0003229991,0.0031788226],"genre_scores_gemma":[0.67124665,0.000010047871,0.3269473,0.00037525236,0.00017627882,0.000069141846,0.000018782748,0.000021216425,0.0011353274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975763,0.000064618376,0.0007005696,0.00070025446,0.00048373843,0.0004745039],"domain_scores_gemma":[0.9968854,0.0013588953,0.00023104447,0.00045431362,0.00090684823,0.00016347689],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003942298,0.00029949652,0.0002689836,0.00024954628,0.00021748578,0.00016588806,0.0009994229,0.0001158617,0.00016235656],"category_scores_gemma":[0.00048260472,0.00030073797,0.00015911805,0.0005181167,0.00023447625,0.00065552746,0.0001231646,0.00016138016,0.0011335487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009144295,0.00035776352,0.00016446137,0.000033084016,0.000064050175,0.000055539018,0.004353107,0.36308423,0.0006720512,0.30201778,0.0026113007,0.3264952],"study_design_scores_gemma":[0.00005588762,0.00025123107,0.00031320567,0.000024279963,0.000010844681,0.00005000937,0.00007348462,0.73206186,0.027117454,0.23753591,0.0021701525,0.00033565203],"about_ca_topic_score_codex":0.000039158404,"about_ca_topic_score_gemma":0.00003299936,"teacher_disagreement_score":0.66725665,"about_ca_system_score_codex":0.00009067677,"about_ca_system_score_gemma":0.00016143195,"threshold_uncertainty_score":0.99994445},"labels":[],"label_agreement":null},{"id":"W1998496300","doi":"10.1016/j.artint.2007.04.011","title":"PickPocket: A computer billiards shark","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Probabilistic logic; Artificial intelligence; Table (database); Domain (mathematical analysis); Olympiad; Task (project management); Machine learning; Mathematics; Data mining; Engineering","score_opus":0.06163264361899398,"score_gpt":0.3233859235981768,"score_spread":0.26175327997918285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998496300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025221933,0.00011708364,0.9653444,0.0010980866,0.002336473,0.0003170734,0.0000027399128,0.0006322313,0.004929965],"genre_scores_gemma":[0.8925405,0.000021551194,0.10516263,0.0012436868,0.00076877105,0.000014153352,0.0000025065917,0.00003055775,0.00021561766],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959968,0.000087694476,0.0011077662,0.0009884272,0.0007308263,0.001088487],"domain_scores_gemma":[0.99720865,0.0006039138,0.00021722965,0.0012546583,0.00035528842,0.00036022687],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018242634,0.0003781618,0.00033785345,0.00036630357,0.00036027667,0.00044792957,0.0023921765,0.00019485928,0.00026038027],"category_scores_gemma":[0.00022453177,0.00036075266,0.00021290228,0.0014512956,0.00033156434,0.00087718177,0.00058849395,0.00040537774,0.0037391116],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017593738,0.00013191011,0.0002506733,0.0000056182785,0.000015840398,0.000080062426,0.0012699128,0.00043798378,0.0019969468,0.3892047,0.0005158262,0.6060729],"study_design_scores_gemma":[0.000019619416,0.00032413664,0.00070357794,0.000052915857,0.000011537373,0.00006488436,0.00042093772,0.15345144,0.650782,0.17816207,0.015128887,0.0008780063],"about_ca_topic_score_codex":0.00018789114,"about_ca_topic_score_gemma":0.0003177353,"teacher_disagreement_score":0.8673186,"about_ca_system_score_codex":0.00013065082,"about_ca_system_score_gemma":0.00011126919,"threshold_uncertainty_score":0.9998844},"labels":[],"label_agreement":null},{"id":"W2000224079","doi":"10.1109/cig.2007.368109","title":"A Multi-Agent Architecture for Game Playing","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Sequential game; Game design; Non-cooperative game; Game Developer; Video game design; Screening game; Heuristics; Combinatorial game theory; Game art design; Simulations and games in economics education; Repeated game; Game mechanics; Simultaneous game; Human–computer interaction; Game development tool; Video game development; Field (mathematics); Premise; Game theory; Mathematical economics","score_opus":0.06165693264603187,"score_gpt":0.3315621469082537,"score_spread":0.2699052142622218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000224079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012980319,0.000040010586,0.9841156,0.0006477018,0.00038342894,0.0002523262,6.8473815e-7,0.00022410248,0.0013558107],"genre_scores_gemma":[0.45896128,8.6139585e-7,0.53959966,0.00061843795,0.00006844737,0.000009698674,3.3111098e-7,0.0000057214306,0.00073558977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899334,0.000010168237,0.00020803172,0.0002858987,0.00014603858,0.00035651174],"domain_scores_gemma":[0.99920684,0.00026438254,0.000042668355,0.0003346728,0.000059621216,0.000091789574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004092034,0.00009749627,0.0000897977,0.000089471345,0.00008682557,0.00008480563,0.000629112,0.000048449707,0.000020191117],"category_scores_gemma":[0.00011180056,0.000079685975,0.000073662246,0.00017010391,0.000035247012,0.0001311629,0.00013094101,0.000084433705,0.00009202453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002681252,0.00015804738,0.001258451,0.000021983324,0.00002558767,0.000029080755,0.0068474924,0.0021104328,0.037864126,0.08470272,0.001546839,0.8654084],"study_design_scores_gemma":[0.000289329,0.00021219865,0.0031130274,0.00003095624,0.000007208075,0.000038934693,0.00044013772,0.599646,0.29670596,0.020250719,0.07865106,0.00061449467],"about_ca_topic_score_codex":0.00003395571,"about_ca_topic_score_gemma":0.00018825837,"teacher_disagreement_score":0.8647939,"about_ca_system_score_codex":0.000030032983,"about_ca_system_score_gemma":0.000022863858,"threshold_uncertainty_score":0.32494998},"labels":[],"label_agreement":null},{"id":"W2003861737","doi":"10.1109/cig.2013.6633646","title":"Recursive Monte Carlo search for imperfect information games","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Perfect information; Computer science; Monte Carlo tree search; Monte Carlo method; Set (abstract data type); Imperfect; Search algorithm; State (computer science); Search problem; Theoretical computer science; Algorithm; Mathematical economics; Mathematics","score_opus":0.02511492083177371,"score_gpt":0.28381767024182103,"score_spread":0.25870274941004734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003861737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1016623,0.00003228037,0.88661486,0.002722042,0.0003531033,0.0008041474,0.00000205962,0.00020134884,0.0076078554],"genre_scores_gemma":[0.9465962,0.000011866752,0.05144298,0.00072821294,0.000060286253,0.00017099245,0.0000013702007,0.0000050379276,0.0009830219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911046,0.000026592048,0.00022317645,0.00015730078,0.00019351445,0.00028893963],"domain_scores_gemma":[0.9989345,0.00020039205,0.000045138328,0.00034702648,0.000394543,0.00007840346],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021594597,0.00009112578,0.00009534282,0.00010138192,0.00009810852,0.0003618225,0.0006081366,0.000050642677,0.000090834954],"category_scores_gemma":[0.00010190336,0.000073769814,0.000063352614,0.00019128302,0.000042441552,0.0028011228,0.00013842972,0.000072372,0.0011193239],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070701053,0.000025357082,0.00069966004,0.000023033375,0.000020014599,4.594507e-7,0.008473458,0.0013581824,0.0005886969,0.15027392,0.039858058,0.7986721],"study_design_scores_gemma":[0.00013313041,0.00038742324,0.0013638581,0.000020988407,0.000004444,0.000007669789,0.002193742,0.7736999,0.1816929,0.019436507,0.020679224,0.0003802599],"about_ca_topic_score_codex":0.00078040524,"about_ca_topic_score_gemma":0.000022459046,"teacher_disagreement_score":0.8449339,"about_ca_system_score_codex":0.000043343935,"about_ca_system_score_gemma":0.000054057662,"threshold_uncertainty_score":0.9996584},"labels":[],"label_agreement":null},{"id":"W2004870292","doi":"10.1109/taai.2013.42","title":"On Enhancing Recent Multi-player Game Playing Strategies Using a Spectrum of Adaptive Data Structures","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Ranking (information retrieval); Set (abstract data type); Perspective (graphical); Field (mathematics); Scheme (mathematics); Semantics (computer science); Basis (linear algebra); Human–computer interaction; Artificial intelligence; Mathematics","score_opus":0.14430276889247942,"score_gpt":0.34535442841723607,"score_spread":0.20105165952475665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004870292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2111525,0.000049068978,0.7868646,0.00014649222,0.00029445608,0.00022628199,0.0000038926455,0.00008757856,0.0011751775],"genre_scores_gemma":[0.8007546,0.0000108620925,0.19904546,0.000101153324,0.000041565334,0.0000029554426,0.0000015493815,0.000009837653,0.0000320179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982556,0.00006911768,0.00041513512,0.00055933127,0.0003359503,0.00036487886],"domain_scores_gemma":[0.99822056,0.0002395288,0.00018718958,0.0011576347,0.000117874624,0.00007718117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020369985,0.00019154522,0.00022216435,0.00013347802,0.00009657869,0.00027978633,0.0015932819,0.00006806974,0.0003733828],"category_scores_gemma":[0.00012184404,0.00015486176,0.000033675125,0.0002837266,0.000094691495,0.0016466997,0.00069319323,0.00018162628,0.000080097176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045101664,0.0002543261,0.0005932148,0.00004273525,0.00014242707,0.00002486737,0.0076495996,0.05516723,0.22826797,0.63107824,0.00064609176,0.0760882],"study_design_scores_gemma":[0.00005660591,0.0000951968,0.0007439768,0.00005020854,0.000005070298,0.000006446549,0.0016046147,0.7725208,0.18665904,0.038005047,0.000027996257,0.00022501062],"about_ca_topic_score_codex":0.0025348398,"about_ca_topic_score_gemma":0.0007130668,"teacher_disagreement_score":0.7173536,"about_ca_system_score_codex":0.00006175157,"about_ca_system_score_gemma":0.00015615764,"threshold_uncertainty_score":0.63150793},"labels":[],"label_agreement":null},{"id":"W2005854230","doi":"10.1109/fpt.2013.6718424","title":"From C to Blokus Duo with LegUp high-level synthesis","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Verilog; High-level synthesis; Field-programmable gate array; Computer science; Stratix; Pruning; Software; Bitwise operation; Computer architecture; Hardware description language; Integer (computer science); Embedded system; Parallel computing; Programming language","score_opus":0.03473519993422045,"score_gpt":0.24579304109545191,"score_spread":0.21105784116123147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005854230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2522904,0.000008454583,0.73457855,0.006682773,0.00024395302,0.00020610644,0.0000034429133,0.00025166292,0.005734674],"genre_scores_gemma":[0.71802086,8.421566e-7,0.2782917,0.00091004674,0.000098727745,0.00006818474,2.9310056e-7,0.000008979502,0.0026003593],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871486,0.000032957654,0.00019474093,0.0004490687,0.00029629061,0.0003120954],"domain_scores_gemma":[0.9985392,0.0003460508,0.000040591294,0.0007664723,0.00012685059,0.00018081805],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000082704864,0.00014694086,0.00015991776,0.000077002216,0.000078536665,0.00032064042,0.0011408463,0.00004873488,0.0012468015],"category_scores_gemma":[0.000096681026,0.000104314415,0.000031188498,0.000304323,0.00004984728,0.00060302956,0.00025908076,0.000072519804,0.007872629],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014784174,0.00018197659,0.002211963,0.000004983419,0.00009202123,0.0000378408,0.003431289,0.0007027038,0.012719498,0.10106275,0.060255345,0.81928486],"study_design_scores_gemma":[0.00008275978,0.00026232933,0.025405189,0.00008235363,0.0000204161,0.00001052349,0.00079111994,0.030631643,0.8844436,0.049030088,0.008267693,0.0009723316],"about_ca_topic_score_codex":0.011758291,"about_ca_topic_score_gemma":0.00039428863,"teacher_disagreement_score":0.87172407,"about_ca_system_score_codex":0.000031084113,"about_ca_system_score_gemma":0.000041267922,"threshold_uncertainty_score":0.9996662},"labels":[],"label_agreement":null},{"id":"W2006652402","doi":"10.1109/tciaig.2014.2309077","title":"An Enhanced Solver for the Game of Amazons","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Solver; Chess endgame; Computer science; Combinatorial game theory; Game complexity; Game theory; Theoretical computer science; Problem solver; Computational complexity theory; Sequential game; Mathematical economics; Algorithm; Artificial intelligence; Mathematics; Programming language; Computational science","score_opus":0.03134361171356633,"score_gpt":0.31529853571692124,"score_spread":0.2839549240033549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006652402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014074789,0.0000488503,0.98389435,0.0011888597,0.00038797143,0.00029028745,0.0000072840844,0.00004999531,0.00005760618],"genre_scores_gemma":[0.97208065,0.00005493533,0.026969561,0.0007166347,0.000038325416,0.000082153936,0.0000010975831,0.000009839349,0.00004681807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986525,0.00007561358,0.00042447657,0.0003750624,0.00024905935,0.00022328463],"domain_scores_gemma":[0.99749166,0.0018139125,0.0000959336,0.00032777482,0.00020704632,0.00006366592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038086847,0.00015724846,0.00018881657,0.00018752419,0.00014524865,0.000100216406,0.0006101316,0.000066049,0.000019697323],"category_scores_gemma":[0.00002626899,0.00012541935,0.000090495145,0.00034740765,0.00026042154,0.0004291325,0.0000040319724,0.00018417627,0.0000135046985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019565952,0.000121591984,0.0000093735625,0.0000086747605,0.000012112159,1.8286212e-7,0.0011656978,0.6397819,0.00045991482,0.030153515,0.00001197108,0.3282555],"study_design_scores_gemma":[0.000052835607,0.0002779786,0.00023288836,0.000035286015,0.000007455733,0.0000026958471,0.0002231292,0.8165371,0.09244273,0.08987927,0.00017794252,0.00013068515],"about_ca_topic_score_codex":0.000065460845,"about_ca_topic_score_gemma":0.00009959839,"teacher_disagreement_score":0.95800585,"about_ca_system_score_codex":0.000021336979,"about_ca_system_score_gemma":0.000060032424,"threshold_uncertainty_score":0.5114453},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1142824154970506,"score_gpt":0.3346387999782774,"score_spread":0.2203563844812268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006791053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41271883,0.0006402238,0.5463137,0.012350347,0.008126607,0.0004420372,0.000003900439,0.0008059416,0.018598365],"genre_scores_gemma":[0.97733,0.000008232074,0.018334946,0.0022770567,0.000117360374,0.000008684604,1.6772825e-7,0.0000074490213,0.0019161],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99724084,0.000035577625,0.00025442394,0.0007266744,0.0010912748,0.00065123383],"domain_scores_gemma":[0.99796283,0.00005888958,0.00008547792,0.0010450425,0.00042701338,0.00042073664],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014832033,0.0001491455,0.00014158805,0.00018808285,0.0002880992,0.00064415886,0.003233911,0.000050698618,0.00004168595],"category_scores_gemma":[0.00044859143,0.00013045895,0.000053360553,0.0017266978,0.0007031715,0.0018667047,0.00078536174,0.00015033502,0.0021399646],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031650106,0.00034490885,0.008736526,0.00001720857,0.000018057774,0.000096937234,0.085207894,0.0011080011,0.05705818,0.15805435,0.08276438,0.6065619],"study_design_scores_gemma":[0.00023310057,0.00039908467,0.004281763,0.00005219383,0.0000073726146,0.000061534745,0.002575531,0.305985,0.51289666,0.09204505,0.08047167,0.0009910099],"about_ca_topic_score_codex":0.000045420133,"about_ca_topic_score_gemma":0.000024649938,"teacher_disagreement_score":0.6055709,"about_ca_system_score_codex":0.000118603115,"about_ca_system_score_gemma":0.0006300959,"threshold_uncertainty_score":0.99863696},"labels":[],"label_agreement":null},{"id":"W2009450360","doi":"10.1016/j.tcs.2010.07.004","title":"Parameterized pursuit-evasion games","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Pursuit-evasion; Computer science; Evasion (ethics); Mathematics; Theoretical computer science; Artificial intelligence; Algorithm; Biology; Genetics","score_opus":0.018033996881260575,"score_gpt":0.2857333243694043,"score_spread":0.26769932748814373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009450360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22185048,0.0000071503428,0.77054906,0.0017543735,0.0023389054,0.00016559538,5.9476776e-7,0.00038784533,0.0029460064],"genre_scores_gemma":[0.6986277,0.0000021550911,0.30055732,0.0006084262,0.00017241226,0.000008699515,2.3672357e-7,0.0000077708855,0.000015254064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965655,0.000094508476,0.00038511405,0.0010120509,0.0011113037,0.0008314849],"domain_scores_gemma":[0.99708015,0.00048612204,0.00009386421,0.0016276102,0.00027726145,0.00043501577],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021919694,0.00024230842,0.00025044667,0.00024365673,0.0005019258,0.0011863266,0.005822652,0.000100746554,0.00018967659],"category_scores_gemma":[0.00047080175,0.00019318472,0.000103382976,0.0013407129,0.005363877,0.0011787362,0.0018942392,0.0005090376,0.00059957185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004628898,0.000045409553,0.000049787523,0.0000017603047,0.0000015399995,0.000010312044,0.00027557547,0.000020116562,0.037994288,0.80624646,0.000055237364,0.15529488],"study_design_scores_gemma":[0.00007828381,0.00017270213,0.00063354516,0.000012672818,0.0000030068738,0.00006639003,0.0000062328795,0.4779967,0.12943663,0.39026636,0.0010199798,0.00030750417],"about_ca_topic_score_codex":0.000005892052,"about_ca_topic_score_gemma":0.0000022639124,"teacher_disagreement_score":0.4779766,"about_ca_system_score_codex":0.000031344523,"about_ca_system_score_gemma":0.00016845009,"threshold_uncertainty_score":0.9998505},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08793558553946206,"score_gpt":0.2975744220529197,"score_spread":0.2096388365134576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012061263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010355269,0.0011533272,0.97618324,0.005939893,0.001923509,0.00052149507,0.000007679502,0.00076259795,0.0031530056],"genre_scores_gemma":[0.94351333,0.00047442288,0.05411265,0.0010553619,0.00048966723,0.000049718525,0.0000031265758,0.000048938477,0.00025278688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945994,0.00023733907,0.0015137864,0.0016016599,0.00082988234,0.0012179329],"domain_scores_gemma":[0.99648213,0.0008334204,0.00032918045,0.0015127361,0.00032322304,0.0005193254],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008379681,0.000632952,0.0005791581,0.00045897238,0.000619312,0.0010770622,0.0024588918,0.00027949244,0.0006680625],"category_scores_gemma":[0.0005219692,0.0006478434,0.00020850982,0.0015528136,0.00087838044,0.0014568779,0.0009309169,0.00063923345,0.0034786405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008021105,0.00016324648,0.000041795978,0.000010265412,0.000017602673,0.0000490008,0.0017724604,0.00049411005,0.00067746174,0.44959635,0.0004430857,0.5467266],"study_design_scores_gemma":[0.000007943509,0.0002457774,0.00003604279,0.000057894857,0.000015507276,0.00009144581,0.0006711804,0.53465277,0.08217529,0.37780708,0.0034921684,0.00074685575],"about_ca_topic_score_codex":0.00018248288,"about_ca_topic_score_gemma":0.00014709984,"teacher_disagreement_score":0.93315804,"about_ca_system_score_codex":0.00011230525,"about_ca_system_score_gemma":0.000053234435,"threshold_uncertainty_score":0.9999599},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023071604099321547,"score_gpt":0.26147787488091195,"score_spread":0.2384062707815904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012220350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95774406,0.0013354539,0.011194727,0.0014029052,0.005014862,0.0005950745,0.000683383,0.0013144109,0.020715108],"genre_scores_gemma":[0.9662243,0.0013099221,0.022155927,0.0031614967,0.0026418653,0.0012971961,0.0006084883,0.0013698387,0.00123095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9792883,0.00068168517,0.0050701345,0.0043238252,0.005766848,0.004869214],"domain_scores_gemma":[0.9826055,0.0036715793,0.0046159457,0.006944554,0.0005670721,0.0015953225],"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.0031008048,0.0018796118,0.0011254711,0.0030633712,0.0040216683,0.0059254146,0.003377648,0.00070092716],"category_scores_gemma":[0.002381185,0.003794758,0.0037030992,0.0025176788,0.0028365292,0.0029319716,0.0038057046,0.0036631718,0.016745897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092908967,0.0016392063,0.000021121476,0.002040753,0.0012456399,0.001670525,0.008977439,0.0070783203,0.0021617014,0.9623021,0.008225955,0.0037081635],"study_design_scores_gemma":[0.00162329,0.002566365,0.000059579088,0.0039293733,0.001340788,0.00097253756,0.0026055565,0.9064122,0.052238874,0.016766444,0.008291381,0.0031936178],"about_ca_topic_score_codex":0.0017844174,"about_ca_topic_score_gemma":0.0008754338,"teacher_disagreement_score":0.94553566,"about_ca_system_score_codex":0.00021083375,"about_ca_system_score_gemma":0.0019093758,"threshold_uncertainty_score":0.99987715},"labels":[],"label_agreement":null},{"id":"W2017334312","doi":"10.1016/j.tcs.2015.04.005","title":"The optimal capture time of the one-cop-moves game","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Computer science; Graph; Combinatorial game theory; Monotonic function; Game tree; Set (abstract data type); Depth-first search; Greedy algorithm; Mathematics; Combinatorics; Sequential game; Mathematical optimization; Theoretical computer science; Search algorithm; Algorithm; Game theory; Mathematical economics","score_opus":0.022938131111920657,"score_gpt":0.2674338826879437,"score_spread":0.24449575157602305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017334312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07090442,0.0001073203,0.9159027,0.0060818824,0.0011919873,0.00025244555,0.0000013902336,0.00012403092,0.0054338663],"genre_scores_gemma":[0.9607946,0.0000024901926,0.03843298,0.00052506535,0.00012419319,0.000004844956,8.080858e-8,0.0000072684106,0.00010847656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969608,0.00022149026,0.0003790728,0.0005264582,0.0013125385,0.000599624],"domain_scores_gemma":[0.9969504,0.0006020432,0.00014373416,0.0015770867,0.00046857903,0.0002581881],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024948532,0.00017687424,0.00019886652,0.00006139931,0.00044083557,0.00050101784,0.0072287708,0.000061268125,0.000016546232],"category_scores_gemma":[0.00052567484,0.00009357731,0.00010307396,0.0012615846,0.008491088,0.0005261598,0.0025166085,0.00028132214,0.00019925235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008240049,0.00003689236,0.0000367993,0.0000014308006,0.0000040125315,0.0000016120566,0.0024876737,0.0012678854,0.0006687299,0.9826232,0.00027727603,0.012586233],"study_design_scores_gemma":[0.000062531086,0.00013838324,0.00036282084,0.000028603092,0.000005211618,0.0000229446,0.000060813974,0.69739616,0.038030557,0.26311898,0.0005960969,0.00017691455],"about_ca_topic_score_codex":0.00001209772,"about_ca_topic_score_gemma":0.0000014809486,"teacher_disagreement_score":0.8898902,"about_ca_system_score_codex":0.0000660881,"about_ca_system_score_gemma":0.0003735541,"threshold_uncertainty_score":0.9981426},"labels":[],"label_agreement":null},{"id":"W2018622637","doi":"10.1109/igic.2012.6329840","title":"Achieving desirable gameplay objectives by niched evolution of game parameters","year":2012,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Game design; Value (mathematics); Game mechanics; Evolutionary computation; Computation; Human–computer interaction; Artificial intelligence; Machine learning; Algorithm","score_opus":0.028868232803209475,"score_gpt":0.2743584851334497,"score_spread":0.24549025233024022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018622637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34038624,0.00051045587,0.65567327,0.00008959787,0.00024565423,0.00010119111,7.491406e-7,0.00010684143,0.0028860003],"genre_scores_gemma":[0.94530606,0.00001113592,0.054108385,0.0000711633,0.00002550621,0.00000941311,4.624525e-7,0.000008086425,0.0004597716],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986485,0.000112887996,0.00030340152,0.00025154586,0.00025493104,0.00042868202],"domain_scores_gemma":[0.9989202,0.00029471135,0.0001359948,0.0004630772,0.00007518033,0.00011083568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005011151,0.00013005012,0.00017743937,0.00009786709,0.000057427555,0.000050666164,0.0006212158,0.00006886181,0.00004034302],"category_scores_gemma":[0.00022774148,0.00011531784,0.00007487701,0.00038106318,0.00011429616,0.0012451122,0.00016553787,0.000108405475,0.00010341467],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046984722,0.00093687297,0.18429175,0.0000612281,0.00013123598,0.0000016472355,0.012843198,0.0020778524,0.4489153,0.2580971,0.006724427,0.08587236],"study_design_scores_gemma":[0.000108292385,0.00022335272,0.01476098,0.00004654985,0.000018039647,0.000011899533,0.001261879,0.03837152,0.9355301,0.007975419,0.0011971411,0.0004947993],"about_ca_topic_score_codex":0.00027709157,"about_ca_topic_score_gemma":0.000008534957,"teacher_disagreement_score":0.60491985,"about_ca_system_score_codex":0.00011064841,"about_ca_system_score_gemma":0.000041871015,"threshold_uncertainty_score":0.47025248},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04959359877610941,"score_gpt":0.3435625851067528,"score_spread":0.2939689863306434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020135152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5471362,0.00024629038,0.43617943,0.00044618468,0.00021865711,0.00006337495,2.3893116e-7,0.000105190215,0.015604424],"genre_scores_gemma":[0.9529938,0.000011621797,0.04608318,0.00021237024,0.00004176858,6.0291313e-7,4.913731e-7,0.0000036468987,0.0006524976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992594,0.00001684767,0.0002273332,0.00020651513,0.000078388206,0.00021152459],"domain_scores_gemma":[0.9994701,0.00020594521,0.00002578626,0.0001983707,0.000038934366,0.000060849812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050448294,0.0000694888,0.00009469074,0.0001278317,0.00003127195,0.000040378804,0.0003112632,0.0000364771,0.000016326825],"category_scores_gemma":[0.000054709388,0.000061555394,0.000013455183,0.00033520264,0.000051039755,0.00021032925,0.00021299742,0.00009949726,0.00004726938],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007064077,0.00029004624,0.018914176,0.000007975704,0.000004120163,0.00004225024,0.0033527426,0.000043348933,0.0021148226,0.27186006,0.00029773964,0.70306563],"study_design_scores_gemma":[0.00053251506,0.0003784024,0.12468981,0.00012979121,0.0000045620377,0.000064696345,0.0026192877,0.6894796,0.11272648,0.047680724,0.020859176,0.00083497196],"about_ca_topic_score_codex":0.00009899459,"about_ca_topic_score_gemma":0.00198005,"teacher_disagreement_score":0.7022307,"about_ca_system_score_codex":0.000019247256,"about_ca_system_score_gemma":0.00002086589,"threshold_uncertainty_score":0.25101563},"labels":[],"label_agreement":null},{"id":"W2020448983","doi":"10.1007/bf03322855","title":"Finding Sum of Powers on Arithmetic Progressions with Application of Cauchy’s Equation","year":2002,"lang":"en","type":"article","venue":"Results in Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Mathematics; Sums of powers; Cauchy distribution; Algebra over a field; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.06706539319022989,"score_gpt":0.31604131001678926,"score_spread":0.24897591682655937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020448983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08460691,0.000038692942,0.9083973,0.0004717741,0.000057409852,0.00054164836,0.0000061655023,0.00005248396,0.0058275806],"genre_scores_gemma":[0.85134727,0.000010138635,0.14853081,0.000006013937,0.0000066078787,0.000017523875,0.0000011098842,0.000005997335,0.00007451196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987808,0.000031301104,0.00051218446,0.00018474876,0.00035365406,0.00013733508],"domain_scores_gemma":[0.998566,0.00042113583,0.0003881239,0.00050657033,0.00009126174,0.000026963693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039335183,0.00008724058,0.00016683475,0.0001746401,0.00002816081,0.000016678901,0.00039327022,0.000050418093,0.0000034383902],"category_scores_gemma":[0.00036721618,0.00006829748,0.00002502447,0.0005311439,0.00008072597,0.00011613668,0.000049207716,0.0000883605,0.000018088349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000798844,0.003366608,0.002242295,0.0006655385,0.000051617135,0.00001468258,0.061911285,0.04015902,0.0054266118,0.59211755,0.00034190627,0.29362303],"study_design_scores_gemma":[0.00015123936,0.00020393844,0.00017931395,0.00050846464,0.0000054964166,0.0000026258142,0.0004134552,0.94498956,0.037194654,0.01620701,0.00003867614,0.000105572224],"about_ca_topic_score_codex":0.000013100838,"about_ca_topic_score_gemma":0.000013580326,"teacher_disagreement_score":0.9048305,"about_ca_system_score_codex":0.00003925032,"about_ca_system_score_gemma":0.000015754344,"threshold_uncertainty_score":0.27850905},"labels":[],"label_agreement":null},{"id":"W2020778009","doi":"10.5555/2394101.2394160","title":"Model-based design of computer-controlled game character behavior","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Formalism (music); Slicing; Programming language; Game programming; Game design; Game Developer; Abstraction; Sequential game; Theoretical computer science; Human–computer interaction; Game theory; Game design document; Computer graphics (images)","score_opus":0.06396046713891099,"score_gpt":0.30490407371027006,"score_spread":0.24094360657135908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020778009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034203168,0.000013107452,0.9641302,0.00015358887,0.00029154867,0.0005249421,6.6580196e-7,0.00017541437,0.00050735805],"genre_scores_gemma":[0.6255116,6.5871984e-7,0.3738794,0.0003701881,0.000044397115,0.000017111457,4.1881293e-7,0.000006978333,0.00016923092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833906,0.000056691228,0.0005742641,0.00033423587,0.00033635972,0.00035941985],"domain_scores_gemma":[0.998513,0.00040122084,0.00017516493,0.0005928758,0.00020729493,0.000110469264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094113615,0.00016287068,0.0003339175,0.00014257553,0.000040595987,0.000065213266,0.0009177548,0.000085729145,0.000050623992],"category_scores_gemma":[0.00003143547,0.00013422994,0.00013643278,0.00025016363,0.000087033855,0.00030567113,0.00010645977,0.00010595757,0.000079250705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006089424,0.0016598357,0.00309825,0.00002429904,0.00006494515,0.00011517656,0.0017643922,0.25317428,0.082784295,0.096801765,0.0006927843,0.5592111],"study_design_scores_gemma":[0.0003828257,0.00012124079,0.00067797856,0.000008449563,0.000009639289,0.000002276753,0.0000051550737,0.9018172,0.09588062,0.0009239182,0.000026867485,0.00014384177],"about_ca_topic_score_codex":0.000018464792,"about_ca_topic_score_gemma":0.000007214089,"teacher_disagreement_score":0.6486429,"about_ca_system_score_codex":0.00003436366,"about_ca_system_score_gemma":0.0001000044,"threshold_uncertainty_score":0.5473738},"labels":[],"label_agreement":null},{"id":"W2022377489","doi":"10.3166/ria.23.293-326","title":"STRADA, une approche adaptative pour les jeux de stratégie modernes","year":2009,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Art","score_opus":0.12828468079280242,"score_gpt":0.32779156969263884,"score_spread":0.19950688889983642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022377489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016273748,0.0085506085,0.9101371,0.039174482,0.0013686966,0.00069054455,0.00003120608,0.00036311985,0.023410482],"genre_scores_gemma":[0.8524396,0.0012671404,0.088653244,0.00076764403,0.00095779356,0.000039365386,0.000009533878,0.00006666329,0.055799052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935768,0.00046935945,0.0015928681,0.001688856,0.0007104938,0.0019616154],"domain_scores_gemma":[0.99564576,0.00083933014,0.00055402296,0.0016379585,0.00071553816,0.0006073622],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012677219,0.00087443687,0.000791685,0.00029665433,0.00072522444,0.0008332245,0.0027049882,0.0006028318,0.0007554756],"category_scores_gemma":[0.00061457994,0.0009852558,0.00048846396,0.0019072412,0.00091353984,0.0014461674,0.00028521632,0.0012070701,0.0025356947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038316073,0.00075588364,0.000060670827,0.00008401444,0.00004872607,0.00020003597,0.022078903,0.1733335,0.0076328693,0.27298495,0.003747733,0.5190344],"study_design_scores_gemma":[0.00003314214,0.00048431812,0.00010752223,0.00042479672,0.00005028179,0.0001578411,0.011507805,0.6508736,0.14103828,0.18067469,0.013889884,0.00075780693],"about_ca_topic_score_codex":0.0012500263,"about_ca_topic_score_gemma":0.00030037246,"teacher_disagreement_score":0.8361658,"about_ca_system_score_codex":0.0003716491,"about_ca_system_score_gemma":0.00071365177,"threshold_uncertainty_score":0.99925977},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.037882443939869115,"score_gpt":0.3196235751881126,"score_spread":0.28174113124824346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022504108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37123004,0.000021589572,0.62706625,0.00056557084,0.00005876271,0.00040429702,8.1977925e-7,0.00004987249,0.000602814],"genre_scores_gemma":[0.9597791,0.000004333955,0.039103467,0.00023970721,0.000023541965,0.000035457135,0.0000013522936,0.0000053761496,0.0008076805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999098,0.00002649108,0.00020259692,0.00025011366,0.0001487016,0.00027407188],"domain_scores_gemma":[0.99934405,0.00022438748,0.000019277062,0.00023249668,0.000111534406,0.00006826168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031059238,0.00007314503,0.000096046264,0.00010623423,0.000060699105,0.00014191716,0.000272331,0.00004454434,0.00013489899],"category_scores_gemma":[0.00003926689,0.00006438029,0.000022053086,0.0001879827,0.000029562569,0.00064627273,0.0001636554,0.00006436512,0.00007861503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005454225,0.0006155577,0.20481868,0.00009790034,0.000027345695,0.000011472603,0.016828999,0.11255018,0.0036216131,0.17072304,0.005173767,0.4854769],"study_design_scores_gemma":[0.00012634732,0.00007024994,0.011486614,0.000004946835,5.993955e-7,6.409173e-7,0.00026984053,0.9733687,0.0018294405,0.012175282,0.00058073946,0.00008658603],"about_ca_topic_score_codex":0.00053332566,"about_ca_topic_score_gemma":0.000475911,"teacher_disagreement_score":0.86081856,"about_ca_system_score_codex":0.000021172604,"about_ca_system_score_gemma":0.000022548913,"threshold_uncertainty_score":0.26253518},"labels":[],"label_agreement":null},{"id":"W2022522100","doi":"10.1016/j.tcs.2005.09.047","title":"Tuning evaluation functions by maximizing concordance","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Concordance; Computer science; Mathematics; Algorithm; Biology; Bioinformatics","score_opus":0.029274080074199692,"score_gpt":0.3047333935201485,"score_spread":0.2754593134459488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022522100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020243753,0.00014622266,0.9680267,0.002955655,0.0008009585,0.00019846071,0.0000011458732,0.0002979108,0.0073291934],"genre_scores_gemma":[0.81862783,0.0000033443691,0.18025862,0.00084473134,0.00020718185,0.000015854444,9.2249036e-7,0.0000068956324,0.00003459112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968756,0.00015205186,0.00036352465,0.0008045519,0.0011840672,0.0006201981],"domain_scores_gemma":[0.99806666,0.00029267732,0.000096088035,0.0008524155,0.00043998632,0.00025217864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028346241,0.00018071882,0.0001639532,0.00016081372,0.00069400144,0.0006248413,0.0023504233,0.000048997932,0.00016742016],"category_scores_gemma":[0.00025211292,0.00016496936,0.00005715793,0.0012456129,0.0021968666,0.0016988768,0.0007350985,0.00022885791,0.0005303748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020024197,0.000031663352,0.000032811786,9.237017e-7,0.0000017580112,8.1247913e-7,0.00036888575,0.001447199,0.0022261892,0.5682763,0.0005157365,0.4270957],"study_design_scores_gemma":[0.00007235563,0.0000815917,0.00007626149,0.00001814404,0.0000049507153,0.00001893004,0.00001965754,0.9291681,0.019095447,0.04916176,0.0020722302,0.00021059184],"about_ca_topic_score_codex":0.00000583724,"about_ca_topic_score_gemma":0.0000020524512,"teacher_disagreement_score":0.9277209,"about_ca_system_score_codex":0.00020729085,"about_ca_system_score_gemma":0.00020127885,"threshold_uncertainty_score":0.8094446},"labels":[],"label_agreement":null},{"id":"W2026829590","doi":"10.1007/s10994-008-5091-5","title":"Effective short-term opponent exploitation in simplified poker","year":2008,"lang":"en","type":"article","venue":"Machine Learning","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Nash equilibrium; Fictitious play; Computer science; Adversary; Best response; Bayesian game; Context (archaeology); Set (abstract data type); Convergence (economics); Game theory; Term (time); Mathematical economics; Repeated game; Artificial intelligence; Mathematical optimization; Mathematics; Computer security; Economics","score_opus":0.03764273235022859,"score_gpt":0.2966816643115067,"score_spread":0.25903893196127814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026829590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7460401,0.00008807688,0.2517368,0.0002728005,0.00016492757,0.00019841909,2.344891e-7,0.00017517534,0.0013234513],"genre_scores_gemma":[0.99593925,0.000019882575,0.0035627917,0.00010978671,0.000054001022,0.000044963122,0.000003942466,0.000013339562,0.0002520212],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866104,0.0002141119,0.0002483529,0.0003585917,0.00023850698,0.00027941907],"domain_scores_gemma":[0.9993294,0.0002667987,0.000056318466,0.0002399781,0.000043848002,0.00006366716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033456547,0.00013750631,0.00016036292,0.00018188135,0.00018061681,0.00005653328,0.00038592058,0.000052863794,0.000030355519],"category_scores_gemma":[0.0002429973,0.00013397487,0.000051904983,0.00034402782,0.00004696053,0.00042607827,0.00018088745,0.0003305243,0.00012800751],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034746645,0.000144986,0.58572185,0.000015712292,0.000018166224,0.00029249192,0.020841593,0.04344433,0.011902393,0.0053315666,0.00008559016,0.33216658],"study_design_scores_gemma":[0.00019879753,0.00025544825,0.32069096,0.000052397296,0.0000040016935,0.000065153356,0.00022102278,0.6581988,0.016343785,0.0020017028,0.0015277497,0.00044019608],"about_ca_topic_score_codex":0.00017888962,"about_ca_topic_score_gemma":0.00007562769,"teacher_disagreement_score":0.61475444,"about_ca_system_score_codex":0.00008306299,"about_ca_system_score_gemma":0.000021302121,"threshold_uncertainty_score":0.5463337},"labels":[],"label_agreement":null},{"id":"W2031066963","doi":"10.1109/cig.2014.6932867","title":"Automatic generation of fantasy role-playing modules","year":2014,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Fantasy; Adventure; Computer science; Monster; Treasure; Relation (database); Human–computer interaction; Generator (circuit theory); Multimedia; Artificial intelligence; Art; Literature","score_opus":0.03968512493452538,"score_gpt":0.2759991789568376,"score_spread":0.23631405402231223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031066963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30125016,0.000014190073,0.6926795,0.00012399946,0.00013214354,0.00004152758,1.3937888e-7,0.00010222032,0.0056561236],"genre_scores_gemma":[0.8577925,0.0000015140894,0.14196846,0.00010176648,0.000054715998,0.0000036436536,5.309296e-7,0.0000031836091,0.00007367357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992623,0.00004752161,0.00022796063,0.00016661464,0.00017406083,0.0001215421],"domain_scores_gemma":[0.99940836,0.00007714815,0.000072273986,0.00035202727,0.00005810625,0.00003206379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021745823,0.00006422359,0.00009796403,0.000061182436,0.00005876073,0.000060362185,0.0004310324,0.000030401503,0.00005517116],"category_scores_gemma":[0.00007945454,0.000054302032,0.000031510637,0.00013054295,0.00003114717,0.00031268306,0.000088291294,0.000034643082,0.00010357067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.6461984e-7,0.000021709138,0.00061756786,0.000007276085,0.0000048001248,2.7402947e-7,0.0006252442,0.0015102095,0.08770297,0.39060077,0.00022536267,0.51868355],"study_design_scores_gemma":[0.0000105173685,0.000021410835,0.0004166593,0.000005049212,0.0000011703745,0.0000013565401,0.000019923542,0.7547522,0.23721516,0.0073768203,0.00012849501,0.00005120854],"about_ca_topic_score_codex":0.000055787317,"about_ca_topic_score_gemma":0.00003075153,"teacher_disagreement_score":0.753242,"about_ca_system_score_codex":0.000010789708,"about_ca_system_score_gemma":0.000009486668,"threshold_uncertainty_score":0.22143726},"labels":[],"label_agreement":null},{"id":"W2031856686","doi":"10.1016/j.tcs.2002.11.003","title":"Periodicity in one-dimensional peg duotaire","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science","keywords":"Conjecture; PEG ratio; Combinatorics; Mathematics; Hop (telecommunications); Solitaire Cryptographic Algorithm; Discrete mathematics; Computer science; Telecommunications","score_opus":0.02443893551405692,"score_gpt":0.2725862962438209,"score_spread":0.24814736072976398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031856686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2783171,0.000028832597,0.714173,0.0009722522,0.00058202253,0.00014399026,3.5661765e-7,0.0001379509,0.0056444756],"genre_scores_gemma":[0.86173487,0.000001443298,0.13746402,0.00073323946,0.000042752363,0.0000062533836,1.2718687e-7,0.0000060955417,0.000011196837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967664,0.00021415294,0.00039178357,0.0009002559,0.0009506157,0.0007767889],"domain_scores_gemma":[0.9982809,0.00030970303,0.00005957281,0.0008712486,0.00018949044,0.00028912182],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021196841,0.0001976241,0.00023838127,0.0002649481,0.00038903696,0.00040246837,0.0022941602,0.00006739435,0.00015173387],"category_scores_gemma":[0.00037790547,0.00017702389,0.00006437184,0.0016943373,0.0036030523,0.00083274976,0.0007175223,0.00030851783,0.00030569202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033572992,0.00010853961,0.0006842073,0.0000023194332,0.0000011587447,0.00002454587,0.00051533,0.0006589276,0.00079491804,0.9844326,0.00001855296,0.012755562],"study_design_scores_gemma":[0.000102253885,0.0001490414,0.002542378,0.000038232523,0.0000016122946,0.000053614873,0.000017811044,0.4969398,0.024425771,0.47526175,0.00014867212,0.00031904958],"about_ca_topic_score_codex":0.000010310316,"about_ca_topic_score_gemma":0.000005767214,"teacher_disagreement_score":0.5834178,"about_ca_system_score_codex":0.00012224939,"about_ca_system_score_gemma":0.00031502816,"threshold_uncertainty_score":0.99910855},"labels":[],"label_agreement":null},{"id":"W2034395812","doi":"10.1016/j.tcs.2015.01.055","title":"Lemmings is PSPACE-complete","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Creatures; Computer science; Mathematical economics; Artificial intelligence; Mathematics; Biology","score_opus":0.05312825676127521,"score_gpt":0.30303378698114386,"score_spread":0.24990553021986867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034395812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019675568,0.00003232592,0.9610923,0.0062863263,0.0012167637,0.00014716083,0.0000012704788,0.00037351644,0.011174802],"genre_scores_gemma":[0.78087974,0.0000014953237,0.2164934,0.002374866,0.00018741799,0.000004981829,1.9484388e-7,0.00000862422,0.00004928054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644524,0.00009547208,0.00035298718,0.0009645579,0.0012953457,0.0008464017],"domain_scores_gemma":[0.9971799,0.00021453413,0.00008671846,0.0013176453,0.000491393,0.0007097795],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002072223,0.00023326215,0.00024259188,0.0002298387,0.00035120916,0.0008422631,0.004736062,0.000061803374,0.000072129114],"category_scores_gemma":[0.00024316988,0.00019570271,0.00008012916,0.0016359309,0.0039942884,0.0012681956,0.0019526689,0.00023817837,0.0015067422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040708705,0.000032615935,0.00008961804,0.0000017067695,0.0000021954515,0.0000141365945,0.0025945173,0.00008651109,0.00037407424,0.96223253,0.0013654882,0.033202525],"study_design_scores_gemma":[0.00007546812,0.00020443712,0.000095256335,0.000014587323,0.0000024228316,0.000047623773,0.000033185603,0.5265366,0.016500587,0.45182258,0.004389194,0.0002780986],"about_ca_topic_score_codex":0.000017411505,"about_ca_topic_score_gemma":9.339637e-7,"teacher_disagreement_score":0.7612042,"about_ca_system_score_codex":0.00011697775,"about_ca_system_score_gemma":0.00029587658,"threshold_uncertainty_score":0.9992707},"labels":[],"label_agreement":null},{"id":"W2039023026","doi":"10.1007/s001860000072","title":"The bounce algorithm for mathematical programming","year":2000,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Ball (mathematics); Point (geometry); Mathematical optimization; Interior point method; Computer science; Set (abstract data type); Rest (music); Mathematics; Algorithm; Geometry; Physics","score_opus":0.22175211753221646,"score_gpt":0.538634412973693,"score_spread":0.3168822954414765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039023026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004236046,0.00012221329,0.9914227,0.0028972318,0.000047503603,0.0011542132,0.0000028223433,0.00006708137,0.003862615],"genre_scores_gemma":[0.0010045549,0.000025448404,0.9944429,0.000027589358,0.0000643086,0.000763643,7.0993684e-7,0.000015930276,0.003654959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660605,0.0008806403,0.00070017023,0.0003614969,0.00083107996,0.00062053977],"domain_scores_gemma":[0.9899371,0.008157732,0.00002671406,0.0009991534,0.0007423519,0.00013691226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011477955,0.00013144151,0.0002670721,0.0001045238,0.0009974337,0.00069813925,0.0017253872,0.000087062224,0.00029923115],"category_scores_gemma":[0.004599907,0.00008405007,0.00012780908,0.0007542029,0.00075703353,0.00032966604,0.00023574116,0.00031377547,0.00026241905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021517521,0.00010595331,1.3216948e-7,0.000020564908,0.0000094870875,4.7323024e-7,0.00053019915,0.000065133696,0.00025631898,0.4136654,0.0001010102,0.58524317],"study_design_scores_gemma":[0.0000351112,0.00010953958,7.486399e-7,0.000031578245,0.0000031439286,0.000008170295,0.00021264316,0.6072137,0.013086743,0.37022632,0.009002564,0.00006974938],"about_ca_topic_score_codex":0.00000899914,"about_ca_topic_score_gemma":0.0000046038203,"teacher_disagreement_score":0.6071486,"about_ca_system_score_codex":0.000046488945,"about_ca_system_score_gemma":0.00016082048,"threshold_uncertainty_score":0.7671554},"labels":[],"label_agreement":null},{"id":"W2039906165","doi":"10.1109/cig.2014.6932879","title":"Parallel UCT search on GPUs","year":2014,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Parallel computing; Block (permutation group theory); Speedup; CUDA; Parallel algorithm; Algorithm; Mathematics","score_opus":0.05838739606505329,"score_gpt":0.3190929700512611,"score_spread":0.2607055739862078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039906165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012755117,0.000006562346,0.87822926,0.0057789437,0.00027835937,0.00006318797,8.305208e-8,0.00020399029,0.10268448],"genre_scores_gemma":[0.9360326,0.000004135594,0.0558052,0.004034938,0.00007069083,0.0000050717567,1.8939771e-7,0.000005416876,0.004041784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903685,0.0000616946,0.00012050513,0.00027321855,0.00026726778,0.00024045243],"domain_scores_gemma":[0.9991248,0.00018297297,0.000015911855,0.0005538323,0.000045342014,0.000077143246],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032971555,0.000074270094,0.00007573304,0.000056872505,0.00007463223,0.000117789044,0.0008360707,0.000028200639,0.00012502035],"category_scores_gemma":[0.0000652934,0.000058190642,0.000035894856,0.00016283881,0.00004411769,0.00016849743,0.00015664278,0.00009904073,0.0037075153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027874335,0.000031711817,0.00029953936,0.0000010875318,0.00000256731,0.0000024607573,0.00023634787,0.0016705662,0.00022092073,0.7857674,0.009043393,0.20272125],"study_design_scores_gemma":[0.000077402554,0.0003989493,0.0013041613,0.000013235992,0.0000011317769,0.0000072771427,0.000059112466,0.7268641,0.083865546,0.06409769,0.12299204,0.00031938223],"about_ca_topic_score_codex":0.00007144481,"about_ca_topic_score_gemma":0.000015046015,"teacher_disagreement_score":0.92327744,"about_ca_system_score_codex":0.000016449168,"about_ca_system_score_gemma":0.000018293907,"threshold_uncertainty_score":0.9970682},"labels":[],"label_agreement":null},{"id":"W2040854954","doi":"10.1145/1496984.1496988","title":"An emergent framework for realistic psychosocial behaviour in non player characters","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Psychosocial; Computer science; Work (physics); Human–computer interaction; Cognitive science; Psychology; Engineering; Psychotherapist","score_opus":0.05789720791362575,"score_gpt":0.35723784104817763,"score_spread":0.2993406331345519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040854954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39440292,0.0000035252892,0.60356885,0.0006709026,0.00069073524,0.000225767,0.000002524794,0.00007845508,0.0003563322],"genre_scores_gemma":[0.9246,0.000014296481,0.074465774,0.000471824,0.00020801944,0.00007520584,0.0000033826207,0.000012045354,0.00014946744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986051,0.0000333023,0.0003261886,0.00041273513,0.0002683519,0.00035432942],"domain_scores_gemma":[0.9991432,0.00010169003,0.000075164,0.00046684674,0.00009785785,0.00011528142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002015978,0.00013268393,0.00015701738,0.00010663172,0.00013995549,0.00005218829,0.0007937647,0.00012408629,0.00006171248],"category_scores_gemma":[0.00009375668,0.00012881958,0.00007014181,0.00027194296,0.000053374977,0.0003967343,0.00005027083,0.0001528989,0.00006376583],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017787829,0.002028628,0.24363004,0.000028519407,0.000037753423,0.0001250944,0.038729843,0.0011437498,0.006960423,0.6099936,0.009529487,0.087615],"study_design_scores_gemma":[0.00027705717,0.00065084494,0.78627956,0.000066195076,0.000011531306,0.000020265576,0.0005918426,0.1018053,0.01582421,0.0926753,0.0008282863,0.0009695839],"about_ca_topic_score_codex":0.0005287583,"about_ca_topic_score_gemma":0.00036138602,"teacher_disagreement_score":0.54264957,"about_ca_system_score_codex":0.000068901216,"about_ca_system_score_gemma":0.00006550458,"threshold_uncertainty_score":0.525311},"labels":[],"label_agreement":null},{"id":"W2041356670","doi":"10.1016/j.disc.2004.11.016","title":"Tandem-win graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Tandem; Discrete mathematics; Characterization (materials science)","score_opus":0.031119267248758825,"score_gpt":0.2927926974345515,"score_spread":0.2616734301857927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041356670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02130933,0.000109238485,0.94855994,0.001986703,0.00017698787,0.0001564504,0.0000014925592,0.00032365948,0.027376186],"genre_scores_gemma":[0.66474634,0.000015825608,0.3338254,0.00033340478,0.00008205466,0.000013164066,9.3076454e-7,0.000014276998,0.0009685973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988109,0.00002206571,0.0003316046,0.00023909633,0.0003093134,0.00028702267],"domain_scores_gemma":[0.998944,0.00012569636,0.00010011949,0.00068605936,0.00005316949,0.0000909985],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026354537,0.00014255181,0.00016505875,0.00007768481,0.00010006889,0.00017203587,0.00096333784,0.000055271477,0.00009386639],"category_scores_gemma":[0.000100386016,0.00011851379,0.00009436483,0.00028234094,0.00007615554,0.0004227387,0.0002003298,0.000109427,0.0008880579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.4436914e-7,0.00006987727,0.00014140927,0.0000146618495,0.000013561853,0.0000052302353,0.0043988996,0.00020646061,0.0004237618,0.9631995,0.0019508511,0.029575344],"study_design_scores_gemma":[0.00007792068,0.000054037424,0.000094034156,0.0000589991,0.0000127078065,0.000029619145,0.0005198485,0.43164977,0.028309442,0.52068263,0.018081786,0.0004292197],"about_ca_topic_score_codex":0.0000036542124,"about_ca_topic_score_gemma":0.000011244748,"teacher_disagreement_score":0.643437,"about_ca_system_score_codex":0.000027875489,"about_ca_system_score_gemma":0.000023754514,"threshold_uncertainty_score":0.99988985},"labels":[],"label_agreement":null},{"id":"W2041674345","doi":"10.1007/s11083-011-9198-0","title":"Lattices of Games","year":2011,"lang":"en","type":"article","venue":"Order","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Distributive lattice; Mathematics; Distributive property; Lattice (music); Combinatorial game theory; Combinatorics; Complete lattice; Congruence lattice problem; Set (abstract data type); Map of lattices; Partially ordered set; Discrete mathematics; Algebra over a field; Mathematical economics; Game theory; Pure mathematics; Sequential game; Computer science; Universality (dynamical systems)","score_opus":0.06924299315783805,"score_gpt":0.2901136555825268,"score_spread":0.22087066242468872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041674345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20276691,0.00026738795,0.6434125,0.00038576568,0.0005937319,0.000102259444,6.773657e-7,0.00016814376,0.15230267],"genre_scores_gemma":[0.9192606,0.000007840383,0.07994282,0.000098468154,0.000015641228,0.000002421465,6.313161e-8,0.0000031308011,0.0006689632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995449,0.0000149393945,0.0001180237,0.000120402416,0.0000967426,0.00010499701],"domain_scores_gemma":[0.9995121,0.000033149787,0.000049896043,0.00029695476,0.00008341025,0.000024523633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008712395,0.000044937726,0.00006555993,0.000036222078,0.000018410938,0.000013091453,0.0004966007,0.000023875797,0.0003469932],"category_scores_gemma":[0.000045314693,0.000037817907,0.000021080383,0.00019626852,0.000061770195,0.0002291819,0.00010019369,0.0000340692,0.00027221497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007141858,0.00019173892,0.019964248,0.000019533747,0.000028444003,0.0000110004175,0.016144449,0.00002412393,0.0021623096,0.59526694,0.0017350074,0.36444506],"study_design_scores_gemma":[0.000111201276,0.00029394293,0.028319696,0.00005473363,0.000015480242,0.000012211805,0.0007540675,0.02218007,0.7263276,0.1840956,0.03731728,0.00051813433],"about_ca_topic_score_codex":0.000076413766,"about_ca_topic_score_gemma":0.000014522334,"teacher_disagreement_score":0.72416526,"about_ca_system_score_codex":0.0000028976224,"about_ca_system_score_gemma":0.000020989404,"threshold_uncertainty_score":0.37993324},"labels":[],"label_agreement":null},{"id":"W2041979085","doi":"10.1109/pacrim.2013.6625444","title":"Improved tree-based strategies for a Connect6 threat-based hardware design","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst; CMC Microsystems","keywords":"Computer science; Field-programmable gate array; Implementation; Tree (set theory); State (computer science); Field (mathematics); Embedded system; Computer security; Software engineering; Algorithm","score_opus":0.06585309085783696,"score_gpt":0.2900256066696806,"score_spread":0.2241725158118436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041979085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016474847,0.00003335789,0.99233085,0.0024700365,0.00023282279,0.0012458062,0.0000030332178,0.00054680166,0.0014898352],"genre_scores_gemma":[0.6199055,3.7840329e-7,0.3780022,0.0011814376,0.00004317444,0.00049165566,0.0000027118328,0.00001537901,0.00035760234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840325,0.00009100646,0.00032266567,0.0005124091,0.00019110086,0.0004795541],"domain_scores_gemma":[0.99762017,0.0010952506,0.000099048724,0.0006951628,0.00035896362,0.00013142348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003515073,0.00023043896,0.00022237583,0.000110880996,0.00016554113,0.0007489923,0.0010430056,0.00009972283,0.00026129544],"category_scores_gemma":[0.00015243038,0.00018476688,0.00013887981,0.00024858353,0.00010753583,0.00084361853,0.00005430678,0.000085618456,0.00021429513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015245064,0.00056954485,0.00039161547,0.00013287782,0.000089191715,0.000013013201,0.0011720922,0.034668952,0.08575162,0.3485847,0.025456032,0.5030179],"study_design_scores_gemma":[0.00018039728,0.00031008234,0.000037217804,0.000011704762,0.0000049262144,3.9740954e-7,0.00024126393,0.7649417,0.20455247,0.029170971,0.0003275662,0.00022132664],"about_ca_topic_score_codex":0.0005018272,"about_ca_topic_score_gemma":0.00017645123,"teacher_disagreement_score":0.7302727,"about_ca_system_score_codex":0.00004817803,"about_ca_system_score_gemma":0.0005059269,"threshold_uncertainty_score":0.7534574},"labels":[],"label_agreement":null},{"id":"W2042822538","doi":"10.1016/s0020-0255(99)00097-3","title":"Risk management in game-tree pruning","year":2000,"lang":"en","type":"article","venue":"Information Sciences","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Computer science; Minimax; Adversary; Game tree; Tree (set theory); Machine learning; Artificial intelligence; Game theory; Theoretical computer science; Mathematical optimization; Sequential game; Mathematics; Mathematical economics; Computer security","score_opus":0.02737789844365746,"score_gpt":0.2962745157962355,"score_spread":0.268896617352578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042822538","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21656659,0.00004258815,0.29151025,0.00070701295,0.0003064175,0.00027069642,9.89441e-7,0.00021142958,0.49038404],"genre_scores_gemma":[0.96436876,0.00010760717,0.034771476,0.00047053877,0.0000128846605,0.000015589902,4.511344e-7,0.000001101252,0.0002515604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879795,0.000035774865,0.0003499621,0.0001437134,0.00043342492,0.00023914728],"domain_scores_gemma":[0.9995482,0.00005722203,0.00009840701,0.00022637681,0.000030385314,0.000039435206],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008687845,0.00007251385,0.00006627142,0.00028256036,0.00016056448,0.0004642567,0.0010581024,0.000023939047,0.0001384352],"category_scores_gemma":[0.000038585084,0.00006221474,0.000022814274,0.0011473121,0.00013836594,0.005225761,0.00009905657,0.000077172816,0.0013934191],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010270379,0.0000065274767,0.0016673272,0.0000018251666,0.0000011648772,0.0000010200241,0.0033895283,0.013703443,9.3429736e-7,0.027919272,0.00013472045,0.9531732],"study_design_scores_gemma":[0.00010042977,0.00006111612,0.022187851,0.000031809446,0.0000018002916,0.0000060663397,0.0015395391,0.86211616,0.0007673317,0.03420567,0.078744665,0.00023757965],"about_ca_topic_score_codex":0.00014202559,"about_ca_topic_score_gemma":0.00005186328,"teacher_disagreement_score":0.95293564,"about_ca_system_score_codex":0.000031990738,"about_ca_system_score_gemma":0.00002941457,"threshold_uncertainty_score":0.9993841},"labels":[],"label_agreement":null},{"id":"W2043109726","doi":"10.1109/cgames.2012.6314555","title":"Software design patterns for enabling auto dynamic difficulty in video games","year":2012,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Reusability; Video game; Software; Multimedia; Human–computer interaction; Software design; Software engineering; Software development; Programming language","score_opus":0.053298624777978906,"score_gpt":0.3082104759092939,"score_spread":0.254911851131315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043109726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048843216,0.00013669062,0.94947344,0.00036021316,0.0004586055,0.00038400805,0.0000025548466,0.00029471805,0.000046535453],"genre_scores_gemma":[0.77763426,0.000009759754,0.22153756,0.00026570295,0.000057548175,0.00009101779,0.0000017941754,0.000012379136,0.00038996554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847716,0.000064761836,0.000318039,0.00034075422,0.00018624307,0.000613013],"domain_scores_gemma":[0.99869,0.00063761865,0.00006893111,0.00042365928,0.0000660083,0.00011376013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005393367,0.00016039013,0.00017192481,0.00013741315,0.00008229114,0.00013599823,0.00074771664,0.00008047058,0.000043588116],"category_scores_gemma":[0.00032133705,0.0001348523,0.00007331708,0.00024699757,0.000029401965,0.0009035452,0.00018920204,0.000103962,0.00009227924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030294917,0.00056133623,0.07309332,0.00009155151,0.000034078144,0.000011130835,0.011788354,0.00795318,0.006017007,0.023264864,0.0019913644,0.8751635],"study_design_scores_gemma":[0.0002472679,0.00016256057,0.03154423,0.000117261996,0.000010466602,0.000015235297,0.0008615935,0.89172345,0.05933913,0.01173815,0.0034064793,0.00083419314],"about_ca_topic_score_codex":0.0000966313,"about_ca_topic_score_gemma":0.0001310439,"teacher_disagreement_score":0.8837702,"about_ca_system_score_codex":0.00010820725,"about_ca_system_score_gemma":0.000040114915,"threshold_uncertainty_score":0.54991174},"labels":[],"label_agreement":null},{"id":"W2043691638","doi":"10.1109/cig.2013.6633647","title":"Creativity and competitiveness in polyomino-developing game playing agents","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Polyomino; Computer science; Theoretical computer science; Representation (politics); Coin flipping; State (computer science); Automaton; Variety (cybernetics); Artificial intelligence; Mathematics; Algorithm","score_opus":0.05294851217079621,"score_gpt":0.3027326465755108,"score_spread":0.2497841344047146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043691638","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6619572,0.000023749199,0.33133683,0.0007439375,0.000084330895,0.00013801681,1.6005677e-7,0.0000624731,0.005653284],"genre_scores_gemma":[0.9704118,0.0000134017255,0.028796747,0.0003800128,0.000014261553,0.000019571547,2.450573e-7,0.0000044231774,0.00035955035],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990853,0.000060017705,0.00019108936,0.0002893002,0.00013060236,0.00024365398],"domain_scores_gemma":[0.9994538,0.0002034568,0.00003997763,0.00019795826,0.00004638451,0.000058423375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016859404,0.000101127436,0.0001348958,0.000102257145,0.000058024096,0.00019518705,0.00035142136,0.000038908005,0.00017347379],"category_scores_gemma":[0.000057807854,0.00009156477,0.000015784897,0.00022437179,0.00006856158,0.00078631955,0.0003109177,0.000081538834,0.00016321294],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003081754,0.00006388511,0.6154458,0.00002430308,0.000010800738,0.000025503932,0.004154086,0.00008583153,0.003423402,0.20115668,0.00008032935,0.17552632],"study_design_scores_gemma":[0.000092731534,0.000023468123,0.830473,0.00008684027,9.4607515e-7,0.000010189008,0.0003818971,0.13241518,0.021807587,0.0139718475,0.0004443061,0.00029202263],"about_ca_topic_score_codex":0.0013124644,"about_ca_topic_score_gemma":0.00015381671,"teacher_disagreement_score":0.30845457,"about_ca_system_score_codex":0.000047528752,"about_ca_system_score_gemma":0.00003589702,"threshold_uncertainty_score":0.3733903},"labels":[],"label_agreement":null},{"id":"W2043865630","doi":"10.1016/j.tcs.2011.09.021","title":"Canonical forms of uptimals","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Order (exchange); Mathematics; Game theory; Canonical form; Publication; Computer science; Mathematical economics; Algebra over a field; Pure mathematics","score_opus":0.039435229842599326,"score_gpt":0.2883830887407444,"score_spread":0.24894785889814508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043865630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100778215,0.00001419502,0.8726479,0.0001003697,0.00037293567,0.00010706537,6.2845584e-7,0.00012413356,0.025854595],"genre_scores_gemma":[0.7418763,0.0000019503393,0.2579145,0.0001660371,0.000030048737,0.0000031087081,6.42698e-8,0.0000043799328,0.0000035889898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769646,0.000058987505,0.00042904232,0.00057174737,0.00067867327,0.0005650618],"domain_scores_gemma":[0.9981682,0.00018899761,0.00010271964,0.0010126287,0.0002672963,0.00026020876],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014305451,0.00015064342,0.00022852754,0.00017381313,0.00017102271,0.00010062599,0.003945138,0.00005471467,0.00016439572],"category_scores_gemma":[0.00014255024,0.000114080976,0.000084925305,0.0010607619,0.0049767224,0.0008028005,0.0013442361,0.00015268393,0.00013805504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006266497,0.00006842721,0.00022703451,0.000003565371,0.0000024736278,0.0000070896353,0.0014976872,0.000014524276,0.00073670497,0.9662866,0.000011505854,0.031138116],"study_design_scores_gemma":[0.000040763283,0.0002548709,0.0016668659,0.000015088031,0.0000028567847,0.000023781284,0.000011576887,0.16952129,0.13537845,0.6928903,0.000026331893,0.00016784933],"about_ca_topic_score_codex":0.000011321107,"about_ca_topic_score_gemma":9.853879e-7,"teacher_disagreement_score":0.6410981,"about_ca_system_score_codex":0.000034822617,"about_ca_system_score_gemma":0.00020509187,"threshold_uncertainty_score":0.99773115},"labels":[],"label_agreement":null},{"id":"W2043891929","doi":"10.5555/777092.777206","title":"Memory-efficient A* heuristics for multiple sequence alignment","year":2002,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Octree; Pairwise comparison; Heuristic; Sequence (biology); Offset (computer science); Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.10078102435376936,"score_gpt":0.299922876042191,"score_spread":0.19914185168842163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043891929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004069471,0.00007203829,0.9880185,0.0014213234,0.0006247138,0.00038611083,0.0000053238186,0.00025035892,0.0051521207],"genre_scores_gemma":[0.849233,0.000009838022,0.14713794,0.00061478605,0.00007469391,0.00005614593,7.223965e-7,0.000009098484,0.0028637834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986358,0.00002490859,0.00028131026,0.0004029,0.00028566772,0.0003693584],"domain_scores_gemma":[0.99877626,0.0003457574,0.000065619344,0.0005830873,0.00011812686,0.00011116195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021447938,0.00013319992,0.00012445034,0.00005504632,0.00015569429,0.00012600818,0.0008540234,0.000046048295,0.0001411615],"category_scores_gemma":[0.00025336735,0.00011685467,0.00007465037,0.00019055669,0.00007558963,0.00012340961,0.00017378788,0.000059540293,0.0004834603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010832249,0.0008637923,0.0003315528,0.000048520913,0.000042403677,0.00004598788,0.006079277,0.06625327,0.008922699,0.27331114,0.052811477,0.59127903],"study_design_scores_gemma":[0.00006128887,0.000065371,0.000010582589,0.000005977729,0.0000026640685,0.0000055963696,0.00008264533,0.8900299,0.09620357,0.002303501,0.011068056,0.000160842],"about_ca_topic_score_codex":0.000033215754,"about_ca_topic_score_gemma":0.000012104807,"teacher_disagreement_score":0.8451635,"about_ca_system_score_codex":0.00007457294,"about_ca_system_score_gemma":0.0000143541265,"threshold_uncertainty_score":0.6214065},"labels":[],"label_agreement":null},{"id":"W2044564598","doi":"10.1016/s0166-218x(01)00211-6","title":"On the binary solitaire cone","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Inoue Foundation for Science","keywords":"Solitaire Cryptographic Algorithm; Mathematics; Cone (formal languages); Combinatorics; Binary number; Arithmetic; Algorithm","score_opus":0.035849167485007674,"score_gpt":0.2792160222905045,"score_spread":0.24336685480549686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044564598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07822009,0.000034522833,0.7679242,0.0055539967,0.00017427634,0.00051014643,0.0000020537707,0.000344628,0.14723612],"genre_scores_gemma":[0.9684349,0.000017713764,0.029639933,0.0012167788,0.00005976894,0.000078074656,0.0000013974186,0.000020542815,0.0005309295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875015,0.000016727703,0.00029090032,0.00027025546,0.00035201357,0.00031995034],"domain_scores_gemma":[0.99819666,0.00057212106,0.00011323156,0.0010144884,0.00003546735,0.00006805627],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031543453,0.00017518229,0.00017254334,0.000048113583,0.00022400623,0.00014951725,0.0011915275,0.00005777153,0.00010431942],"category_scores_gemma":[0.00008402748,0.00011060167,0.00006698825,0.00030996214,0.00014823447,0.00011085099,0.000260056,0.00016938928,0.0012551504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032900105,0.00006110038,0.0000029892583,0.000008928804,0.000010480948,0.000009720805,0.0016741182,0.00012260128,0.0011330235,0.9908308,0.002077317,0.0040656533],"study_design_scores_gemma":[0.000052581065,0.0000585257,0.000017901983,0.000036452606,0.000008172236,0.000014332461,0.0013576588,0.07888597,0.009476645,0.9077473,0.002100155,0.00024429627],"about_ca_topic_score_codex":0.0000032812882,"about_ca_topic_score_gemma":0.0000020571028,"teacher_disagreement_score":0.89021474,"about_ca_system_score_codex":0.000028406703,"about_ca_system_score_gemma":0.000025488513,"threshold_uncertainty_score":0.9995225},"labels":[],"label_agreement":null},{"id":"W2045081103","doi":"10.3138/carto.44.4.301","title":"Self-Adjusting Legends for Proportional Symbol Maps","year":2009,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symbol (formal); Arithmetic; Mathematics; Statistics; Linguistics; Philosophy","score_opus":0.01662440382751383,"score_gpt":0.3008440833234222,"score_spread":0.2842196794959084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045081103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011143446,0.0001950248,0.9751014,0.01019739,0.0019893753,0.0008110357,0.000033287288,0.0001946949,0.0003343466],"genre_scores_gemma":[0.9731398,0.00060947554,0.020323008,0.0048257047,0.0006785221,0.00013025968,0.0002311622,0.000011994842,0.000050050134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980285,0.00004228458,0.0007941404,0.00018941921,0.0006425873,0.00030305545],"domain_scores_gemma":[0.9970502,0.00018683828,0.00056235626,0.0001900933,0.0018970121,0.00011345273],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013074367,0.00018698364,0.00014688831,0.0007277793,0.0008778964,0.0011928225,0.00091105205,0.00010587368,0.000005777872],"category_scores_gemma":[0.00028791762,0.0001438454,0.000244927,0.0005225329,0.0000795524,0.00247614,0.00006835405,0.00017344061,0.0000031134823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081345635,0.000076453056,0.0016657128,0.000027721013,0.00014068336,0.0000010713226,0.002339698,0.0006654649,0.00009754202,0.8610909,0.0033484397,0.13046497],"study_design_scores_gemma":[0.0013203783,0.00071519957,0.004982829,0.00010195105,0.00009831542,0.0005011188,0.0015284051,0.39867303,0.0012637991,0.2594195,0.33076692,0.0006285305],"about_ca_topic_score_codex":0.0000052127384,"about_ca_topic_score_gemma":0.0000051937777,"teacher_disagreement_score":0.9619964,"about_ca_system_score_codex":0.000037742306,"about_ca_system_score_gemma":0.000107134845,"threshold_uncertainty_score":0.999844},"labels":[],"label_agreement":null},{"id":"W2046062574","doi":"10.1016/j.disc.2006.01.029","title":"Hex and combinatorics","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Enumerative combinatorics; Extremal combinatorics; Algebraic combinatorics; Discrete mathematics","score_opus":0.017423255086028776,"score_gpt":0.2593164744615726,"score_spread":0.2418932193755438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046062574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054963253,0.00015588284,0.9194898,0.00057078333,0.0001727464,0.000116990246,0.0000013747251,0.000183757,0.02434541],"genre_scores_gemma":[0.92455983,0.000009245839,0.07443336,0.000055520857,0.000037156184,0.00000641218,9.984361e-7,0.000009898225,0.0008876074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999225,0.000013578639,0.0002169823,0.00017345275,0.00019138899,0.00017957589],"domain_scores_gemma":[0.99936414,0.0001130377,0.00007065599,0.000367697,0.000041519055,0.00004293142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014995417,0.00010047677,0.00012345758,0.00004204553,0.00008373631,0.00017243379,0.00038625463,0.000039516253,0.000007749821],"category_scores_gemma":[0.00004401223,0.00008607612,0.000029969386,0.00017196151,0.00007189259,0.00020962498,0.00018557998,0.000065143606,0.000072672025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.9001583e-7,0.000033867535,0.00028234118,0.000020148409,0.0000024890392,0.0000051644543,0.00054407294,0.00001588892,0.00017841227,0.9969791,0.0005972272,0.0013410713],"study_design_scores_gemma":[0.000035223828,0.00002384166,0.00022504998,0.000017865666,0.0000043172427,0.000014363219,0.00013351797,0.09467689,0.006849065,0.8964564,0.0014150251,0.00014839592],"about_ca_topic_score_codex":0.000022612227,"about_ca_topic_score_gemma":0.000005523243,"teacher_disagreement_score":0.86959654,"about_ca_system_score_codex":0.00001462744,"about_ca_system_score_gemma":0.000011789237,"threshold_uncertainty_score":0.35100824},"labels":[],"label_agreement":null},{"id":"W2046774921","doi":"10.1177/154193120204600323","title":"A Graph Theoretic Model of Human Cognition in Chess","year":2002,"lang":"en","type":"article","venue":"Proceedings of the Human Factors and Ergonomics Society Annual Meeting","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer chess; Computer science; Graph; Artificial intelligence; Cognition; Search engine; Selection (genetic algorithm); Order (exchange); Combinatorial game theory; Machine learning; Human–computer interaction; Theoretical computer science; Cognitive science; Game theory; Sequential game; Information retrieval; Psychology; Mathematics; Mathematical economics; Advertising","score_opus":0.03967543476956933,"score_gpt":0.24985220483748735,"score_spread":0.21017677006791802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046774921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981134,0.00005934182,0.000262712,0.000063326675,0.000037693084,0.00013148153,0.0000062201134,0.000026331845,0.0012994731],"genre_scores_gemma":[0.9983746,0.00004216541,0.0014790827,0.000033981534,0.000019635801,0.0000051794273,3.2839534e-7,0.000010174894,0.000034852303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989558,0.000007554527,0.00041344666,0.00025869103,0.00014337411,0.00022112958],"domain_scores_gemma":[0.9993061,0.000057747882,0.0003502829,0.000103025355,0.00014414925,0.00003873503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004051722,0.00014573066,0.00022550889,0.000051188545,0.00024639085,0.00006201265,0.00062616816,0.00009006746,0.00000285328],"category_scores_gemma":[0.000047902937,0.000116421535,0.00016028793,0.00018144888,0.000347518,0.00044633282,0.00033747937,0.00018334862,3.0396134e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015349438,0.0003956431,0.09846509,0.0005235101,0.00009312983,1.02931835e-7,0.26343012,0.0018947156,0.20811258,0.425139,0.0005669378,0.0013638035],"study_design_scores_gemma":[0.00035760185,0.00019556671,0.009268224,0.0006117607,0.000052879957,0.000001688674,0.025697723,0.3261499,0.37824732,0.25879103,0.000009427473,0.0006168699],"about_ca_topic_score_codex":0.00004627201,"about_ca_topic_score_gemma":0.000008624057,"teacher_disagreement_score":0.3242552,"about_ca_system_score_codex":0.000031531406,"about_ca_system_score_gemma":0.0000062677063,"threshold_uncertainty_score":0.47475326},"labels":[],"label_agreement":null},{"id":"W2047316657","doi":"10.1109/tciaig.2014.2345398","title":"Stronger Virtual Connections in Hex","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Bottleneck; Computer science; Connection (principal bundle); Set (abstract data type); Solver; Theoretical computer science; Search algorithm; Search tree; Tree (set theory); Iterative deepening depth-first search; Computational complexity theory; Algorithm; Monte Carlo method; Beam search; Mathematics; Best-first search; Programming language; Combinatorics","score_opus":0.027510376347812254,"score_gpt":0.2917056138452298,"score_spread":0.2641952374974176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047316657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041913223,0.0000353026,0.9547783,0.0021543445,0.00055102404,0.0001673638,0.0000037916723,0.000090268986,0.0003063621],"genre_scores_gemma":[0.99017715,0.000047124384,0.008610502,0.00091542123,0.000037296748,0.000051484487,0.0000013186065,0.0000114425375,0.00014825883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982022,0.00013955077,0.0005080007,0.0005329653,0.00029861814,0.00031867053],"domain_scores_gemma":[0.99854547,0.00094630773,0.00006325973,0.00024689865,0.00010238036,0.00009566843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035246628,0.00020693318,0.00022397356,0.00056407263,0.00014217106,0.00015834683,0.000412809,0.000098217766,0.000056434983],"category_scores_gemma":[0.000030364527,0.0002149613,0.000068059235,0.00072003115,0.00018969309,0.0006179985,0.000007257342,0.00041873025,0.00012142498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011363342,0.00016892081,0.00015563068,0.0000039214806,0.000006712394,0.000003835697,0.0007599668,0.70904714,0.00004293295,0.049961902,0.00002617531,0.23981148],"study_design_scores_gemma":[0.00009512098,0.000255696,0.0013699017,0.00007628631,0.0000033785975,0.000017126224,0.00042183115,0.9267939,0.007557443,0.062693365,0.00044038292,0.00027560774],"about_ca_topic_score_codex":0.00016121572,"about_ca_topic_score_gemma":0.00047166357,"teacher_disagreement_score":0.94826394,"about_ca_system_score_codex":0.00007667907,"about_ca_system_score_gemma":0.00007287894,"threshold_uncertainty_score":0.87658674},"labels":[],"label_agreement":null},{"id":"W2048516670","doi":"10.1109/cig.2012.6374157","title":"The huddle: Combining AI techniques to coordinate a player's game characters","year":2012,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Game design; State (computer science); Artificial intelligence; Fantasy; Metagaming; Video game design; Strategy; Non-cooperative game; Game theory; Human–computer interaction; Simultaneous game; Mathematical economics; Algorithm; Mathematics","score_opus":0.029027042852881723,"score_gpt":0.3064793138870827,"score_spread":0.277452271034201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048516670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04128582,0.000104071616,0.9160531,0.021505335,0.001426661,0.00052591984,8.939604e-7,0.0010902074,0.018007983],"genre_scores_gemma":[0.98305875,0.000010424307,0.010128258,0.005184116,0.00013162223,0.000065948545,2.9536673e-7,0.0000119988745,0.0014085672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998578,0.00006688287,0.0002621775,0.00023866839,0.00025661517,0.0005976335],"domain_scores_gemma":[0.99874187,0.00026425192,0.00006683235,0.0006328594,0.00009659178,0.00019762221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006041095,0.0001454622,0.0001287084,0.00008100869,0.0002488457,0.0003491875,0.0013140774,0.000055728007,0.000028657227],"category_scores_gemma":[0.00012394342,0.0000983933,0.000054287313,0.00038119903,0.00007803766,0.00086312584,0.00048348977,0.00018630495,0.00064117974],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001194797,0.000082209095,0.0019356306,0.0000034965128,0.000022335526,0.000006036145,0.004612044,0.000012127673,0.0075049885,0.5909347,0.018091794,0.3767827],"study_design_scores_gemma":[0.000055987035,0.00025386733,0.0034150677,0.00006243312,0.0000081300095,0.000054849155,0.00083964324,0.010723226,0.63066036,0.012347955,0.34087592,0.0007025571],"about_ca_topic_score_codex":0.000074688985,"about_ca_topic_score_gemma":0.000015199134,"teacher_disagreement_score":0.94177294,"about_ca_system_score_codex":0.00004190109,"about_ca_system_score_gemma":0.00002929473,"threshold_uncertainty_score":0.8241282},"labels":[],"label_agreement":null},{"id":"W2050912278","doi":"10.1016/j.dam.2014.07.029","title":"The fast robber on interval and chordal graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interval graph; Chordal graph; Combinatorics; Mathematics; Vertex (graph theory); Graph; Pathwidth; Discrete mathematics; Split graph; Interval (graph theory); Line graph; 1-planar graph","score_opus":0.01634910283833329,"score_gpt":0.2565800278507998,"score_spread":0.2402309250124665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050912278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0318921,0.000022390535,0.92136526,0.00097295037,0.0002123293,0.0002663266,0.0000012981044,0.00015713941,0.045110185],"genre_scores_gemma":[0.93710613,0.000019251956,0.062182963,0.0003448105,0.00006377493,0.000047392117,8.564253e-7,0.000019619156,0.00021519388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988966,0.000021145755,0.0002738468,0.00026993826,0.00026477358,0.00027367056],"domain_scores_gemma":[0.99860704,0.0005045384,0.0001076576,0.00067625794,0.000027643018,0.0000768668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044489515,0.00016261764,0.00016192328,0.000039799503,0.00025372425,0.000319851,0.00079260115,0.00004796257,0.000005669068],"category_scores_gemma":[0.00007867482,0.00010245704,0.000051088882,0.00013930668,0.00018938443,0.00009150928,0.00029476997,0.00015446777,0.00015148045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030264428,0.000019251658,0.000007717963,0.0000113470405,0.000009276981,3.785496e-7,0.001412478,0.000026133584,0.0003740073,0.9443749,0.00030413343,0.05345732],"study_design_scores_gemma":[0.00008613189,0.0001004892,0.00010779045,0.00004051443,0.00001076178,0.00000731298,0.00079087395,0.110281855,0.010496218,0.8717121,0.006083925,0.0002820154],"about_ca_topic_score_codex":0.0000037252937,"about_ca_topic_score_gemma":0.000012595344,"teacher_disagreement_score":0.905214,"about_ca_system_score_codex":0.000011767044,"about_ca_system_score_gemma":0.0000084437615,"threshold_uncertainty_score":0.41780767},"labels":[],"label_agreement":null},{"id":"W2053224708","doi":"10.1007/s00182-015-0473-y","title":"Grundy values of Fibonacci nim","year":2015,"lang":"de","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Thompson Rivers University; Pacific Institute for the Mathematical Sciences","keywords":"Fibonacci number; Combinatorics; Value (mathematics); Mathematics; Pisano period; Fibonacci polynomials; Statistics","score_opus":0.0556402941168552,"score_gpt":0.3405083313536427,"score_spread":0.28486803723678755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053224708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.293184,0.022264587,0.62005734,0.0071018087,0.047883466,0.0002696688,0.00006259785,0.00005900934,0.009117483],"genre_scores_gemma":[0.989069,0.00046578876,0.0059904316,0.00040964558,0.0027518838,9.936861e-7,0.000002029648,0.000024485973,0.001285762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99536765,0.00057299645,0.0015458363,0.0002602463,0.0019519306,0.00030131542],"domain_scores_gemma":[0.9928153,0.0009022178,0.0017797803,0.00042477736,0.0037727673,0.00030515742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038540002,0.00025473404,0.00049385946,0.0005555645,0.00003075367,0.00023032379,0.0037449093,0.00013857133,0.00029967836],"category_scores_gemma":[0.0020485187,0.00022621454,0.00039005736,0.00025922756,0.00049166917,0.0010226532,0.00054458185,0.0004768347,0.0004180995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025805014,0.0014695199,0.003695396,0.00003956157,0.0026695516,0.0011062843,0.04185727,0.013568625,0.0026892603,0.53143656,0.0183117,0.38057575],"study_design_scores_gemma":[0.000766341,0.0012348889,0.00058667257,0.0007476794,0.00015453773,0.00047640808,0.0023807527,0.011605949,0.036607996,0.91028124,0.034733683,0.00042383224],"about_ca_topic_score_codex":0.000038013044,"about_ca_topic_score_gemma":0.0000032095177,"teacher_disagreement_score":0.69588494,"about_ca_system_score_codex":0.00027089077,"about_ca_system_score_gemma":0.0008118938,"threshold_uncertainty_score":0.9224762},"labels":[],"label_agreement":null},{"id":"W2054080154","doi":"10.1016/j.tcs.2003.04.001","title":"Appendix A: Report on the First International Clobber Tournament","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Tournament; Computer science; Mathematics; Appendix; Calculus (dental); Mathematical economics; Combinatorics; Medicine; Orthodontics; Geology","score_opus":0.022064625004885288,"score_gpt":0.2852826769892971,"score_spread":0.26321805198441184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054080154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131417,0.000007731101,0.9174843,0.016452434,0.0028071967,0.00018755416,4.9123196e-7,0.0001270847,0.049791504],"genre_scores_gemma":[0.9603547,0.0000032658695,0.036152985,0.0032351525,0.00015821625,0.000012854663,3.0707312e-7,0.0000067870455,0.00007575367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706286,0.000099193756,0.00038003584,0.00074060773,0.0011978814,0.0005193962],"domain_scores_gemma":[0.99776065,0.000485488,0.000114280665,0.0012550217,0.00020962066,0.00017493796],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027654115,0.000180902,0.00013614699,0.00012672893,0.0006549951,0.00077236554,0.0038570869,0.000040726176,0.0004916642],"category_scores_gemma":[0.00053923705,0.000113787544,0.00008375843,0.00073145225,0.0022153254,0.0004562073,0.00074030407,0.00026941282,0.0011350617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025939662,0.00006325004,0.00019351006,6.1041334e-7,0.0000046484784,0.00007930346,0.00025765726,0.00032276625,0.000028334454,0.99129784,0.001073517,0.0066759484],"study_design_scores_gemma":[0.000085971566,0.00021509954,0.00051202596,0.000049980787,0.0000041325143,0.00054667104,0.00003451807,0.2715659,0.029085537,0.6385099,0.058991164,0.00039903822],"about_ca_topic_score_codex":0.0000030864885,"about_ca_topic_score_gemma":0.0000012875286,"teacher_disagreement_score":0.947213,"about_ca_system_score_codex":0.0001345987,"about_ca_system_score_gemma":0.00012192055,"threshold_uncertainty_score":0.99964267},"labels":[],"label_agreement":null},{"id":"W2056100961","doi":"10.1080/13873950903139585","title":"Anger evaluation for fuzzy agents with dynamic personality","year":2009,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling of Dynamical Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Anger; Fuzzy logic; Personality; Computer science; Psychology; Mathematics; Artificial intelligence; Social psychology","score_opus":0.07524871275300421,"score_gpt":0.3021083112189256,"score_spread":0.2268595984659214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056100961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1536258,0.000086814216,0.84511834,0.00024888862,0.00008590379,0.0005551357,0.0000032925316,0.0000608999,0.00021490689],"genre_scores_gemma":[0.8480412,0.0000023397793,0.15180975,0.000042356656,0.00004056356,0.00002796558,0.0000033798224,0.0000067011824,0.000025785426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831206,0.000079003716,0.00045707286,0.0003986225,0.000501584,0.0002516413],"domain_scores_gemma":[0.99898213,0.0002181118,0.00014055215,0.00032041216,0.00023245232,0.00010636227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064377015,0.00017169128,0.0003560076,0.000056165405,0.00008158211,0.0001374964,0.00036923494,0.00008055107,0.0000028368938],"category_scores_gemma":[0.000012440042,0.00012488053,0.00007674102,0.00013006877,0.00007646361,0.00019497945,0.000054922122,0.00008353167,0.0000046596456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046157027,0.0004498651,0.000050247232,0.00040175355,0.00006506565,0.0000034828083,0.0015966498,0.25922891,0.000076775206,0.68498313,0.00004712451,0.05305082],"study_design_scores_gemma":[0.00013317305,0.00025771724,0.00007456363,0.00015988633,0.000021636577,0.000016245043,0.000019103289,0.84982467,0.000016820983,0.14933093,0.000007474965,0.00013778605],"about_ca_topic_score_codex":0.000011502391,"about_ca_topic_score_gemma":0.0000011087752,"teacher_disagreement_score":0.69441533,"about_ca_system_score_codex":0.000045216693,"about_ca_system_score_gemma":0.000027623497,"threshold_uncertainty_score":0.509248},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09049253033088579,"score_gpt":0.32004136535498845,"score_spread":0.22954883502410267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056740053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08373875,0.013012685,0.86883646,0.013674194,0.0039778813,0.0013690012,0.000014583172,0.0003290811,0.01504736],"genre_scores_gemma":[0.97379047,0.0015068018,0.023522679,0.00006579476,0.00022997902,0.00002165376,5.583121e-7,0.00001452599,0.0008475399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811995,0.0001600093,0.00041048246,0.00050316716,0.00040719102,0.00039922132],"domain_scores_gemma":[0.9976402,0.00053783774,0.00010473556,0.0013044951,0.00026795402,0.00014479937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007316731,0.00022855855,0.00032157914,0.00008162421,0.00020584403,0.00020603977,0.0014902041,0.00018358807,0.0000095390615],"category_scores_gemma":[0.000030151077,0.00014570118,0.00012304605,0.000101087964,0.00036053616,0.00016031001,0.003869545,0.000497982,0.000031694544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013710277,0.00013764964,0.00045097634,0.00008639678,0.0001060975,0.000010605361,0.009486856,0.0020738041,0.00006646332,0.105802864,0.0027124872,0.8790521],"study_design_scores_gemma":[0.00016146695,0.00021409248,0.0080965385,0.00027758777,0.000049459028,0.00002517353,0.00039481555,0.94357646,0.0031328634,0.034062102,0.009158579,0.00085086556],"about_ca_topic_score_codex":0.0005169555,"about_ca_topic_score_gemma":0.00072269177,"teacher_disagreement_score":0.94150263,"about_ca_system_score_codex":0.000021682128,"about_ca_system_score_gemma":0.00008781315,"threshold_uncertainty_score":0.59415215},"labels":[],"label_agreement":null},{"id":"W2057333812","doi":"10.1109/cig.2012.6374133","title":"Deck-based prisoner's dilemma","year":2012,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Deck; Prisoner's dilemma; Computer science; Dilemma; Mathematical economics; Repeated game; Game theory; Iterated function; Mathematics; Engineering; Structural engineering","score_opus":0.041865094301164966,"score_gpt":0.29212350181119234,"score_spread":0.25025840751002737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057333812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06057152,0.0000626532,0.925874,0.0010781551,0.00055986334,0.00007640484,2.1322522e-7,0.00031807294,0.011459138],"genre_scores_gemma":[0.8902519,7.365232e-7,0.108331576,0.0009396354,0.00011746427,0.0000094624265,3.1533023e-7,0.0000053366457,0.00034362279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907625,0.000033388515,0.00015492253,0.00016530286,0.00020364363,0.00036651135],"domain_scores_gemma":[0.99917215,0.00011703718,0.000036667672,0.00047972245,0.000050175782,0.00014423946],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002524997,0.00008680501,0.000078399884,0.00005526239,0.00007006952,0.000090537666,0.00066572207,0.00004136589,0.00018645235],"category_scores_gemma":[0.00007120398,0.00007058144,0.00004667063,0.00022666967,0.000041627558,0.00066859025,0.00012875616,0.00006688656,0.0015514413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036450679,0.00024749662,0.07215279,0.000005786515,0.0000096121,0.000004301831,0.00081088516,0.00027536842,0.0017119652,0.77845097,0.012423494,0.13390368],"study_design_scores_gemma":[0.00012777261,0.00012586454,0.027317949,0.000019486311,0.00000835912,0.000013530379,0.000098939,0.20422097,0.4470681,0.010474542,0.30975583,0.0007686604],"about_ca_topic_score_codex":0.00005621471,"about_ca_topic_score_gemma":0.000010802398,"teacher_disagreement_score":0.8296803,"about_ca_system_score_codex":0.000025460966,"about_ca_system_score_gemma":0.000034475113,"threshold_uncertainty_score":0.999226},"labels":[],"label_agreement":null},{"id":"W2059745530","doi":"10.1109/cig.2014.6932860","title":"Automated design for playability in computer game agents","year":2014,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Simple (philosophy); Finite-state machine; State (computer science); Controller (irrigation); Human–computer interaction; Basis (linear algebra); Game design; Computer game; Artificial intelligence; Control engineering; Multimedia; Programming language; Engineering","score_opus":0.0726121322410247,"score_gpt":0.3233846805399265,"score_spread":0.2507725482989018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059745530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03138312,0.000002477525,0.96646875,0.0004231731,0.0003610302,0.00038517627,4.1086787e-7,0.00065926794,0.00031657508],"genre_scores_gemma":[0.6769506,3.2880874e-7,0.32246304,0.00045803573,0.00003773676,0.000028418173,5.2187295e-7,0.0000048385427,0.00005654268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987463,0.00013671869,0.00029475035,0.00038399277,0.00014161562,0.0002966638],"domain_scores_gemma":[0.99876285,0.0005871203,0.00004833657,0.00046647023,0.00006995503,0.00006525755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008142794,0.00010934742,0.00015306474,0.00008051576,0.000038102466,0.00010615436,0.000736227,0.00006179154,0.000026816542],"category_scores_gemma":[0.00014180287,0.00009561748,0.000047074,0.00021988414,0.000046231085,0.00028311342,0.00014708588,0.00005803186,0.00014921284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056954017,0.0006283747,0.011077161,0.00005856808,0.00002754764,0.000008703145,0.0038308061,0.28082174,0.0009015077,0.13544463,0.025539704,0.5416043],"study_design_scores_gemma":[0.0000848072,0.000107569125,0.003993255,0.000007406463,7.958998e-7,0.0000011532524,0.0000036691843,0.9684561,0.006518512,0.019740934,0.0009656679,0.00012016807],"about_ca_topic_score_codex":0.000054731525,"about_ca_topic_score_gemma":0.000033114487,"teacher_disagreement_score":0.6876343,"about_ca_system_score_codex":0.00004786322,"about_ca_system_score_gemma":0.000030353682,"threshold_uncertainty_score":0.38991675},"labels":[],"label_agreement":null},{"id":"W2064120571","doi":"10.1016/j.jnt.2014.06.005","title":"Carmichael numbers with<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>p</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">|</mml:mo><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math>","year":2014,"lang":"lv","type":"article","venue":"Journal of Number Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Counterexample; Mathematics; Prime (order theory); Prime number; Algorithm; Discrete mathematics; Combinatorics; Arithmetic","score_opus":0.018510000872982345,"score_gpt":0.25195759778388566,"score_spread":0.2334475969109033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064120571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9080845,0.0028570073,0.011687428,0.00201493,0.009856884,0.0002584099,0.00093815965,0.00076452235,0.063538134],"genre_scores_gemma":[0.9741951,0.001989614,0.009288697,0.0043053697,0.006538988,0.0008061863,0.00048186426,0.0016160972,0.0007780677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9755399,0.0021943368,0.005682876,0.004103694,0.006859474,0.005619668],"domain_scores_gemma":[0.9780446,0.0054927594,0.007368703,0.004617352,0.0012056853,0.0032708752],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.008516943,0.002685291,0.0015381959,0.0013522443,0.0038152675,0.004325606,0.008175537,0.0044278977,0.025792046],"category_scores_gemma":[0.004210747,0.00412078,0.0045869234,0.0029566702,0.004835245,0.004927649,0.0046191583,0.00584417,0.00815324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034670169,0.001131978,0.00009149073,0.0010895008,0.003709707,0.003168404,0.0076695997,0.005356325,0.0024137644,0.80950195,0.14890009,0.0135002],"study_design_scores_gemma":[0.004864793,0.006113405,0.00012406256,0.005717782,0.004766002,0.0137479305,0.01059035,0.11655013,0.73426443,0.062481463,0.034128238,0.0066513964],"about_ca_topic_score_codex":0.0027709005,"about_ca_topic_score_gemma":0.0018312361,"teacher_disagreement_score":0.7470205,"about_ca_system_score_codex":0.0001730515,"about_ca_system_score_gemma":0.0038075608,"threshold_uncertainty_score":0.9985881},"labels":[],"label_agreement":null},{"id":"W2064948331","doi":"10.1109/icicisys.2009.5358028","title":"The adaptive learning mechanism design for game agents' real-time behavior control","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Adaptability; Computer science; Key (lock); Mechanism (biology); Process (computing); Control (management); Adaptive behavior; Artificial intelligence; Adaptive learning; Game theory; Architecture","score_opus":0.0514844078886825,"score_gpt":0.29989083345766676,"score_spread":0.24840642556898426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064948331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016245,0.000019648865,0.9942062,0.0010838243,0.00017695453,0.0008856677,7.674637e-7,0.00031891378,0.0016835388],"genre_scores_gemma":[0.9028408,0.000021174441,0.09084038,0.0004436053,0.00007907541,0.00014620436,4.6241655e-7,0.000011769679,0.005616521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985186,0.00016294596,0.0002755369,0.0003530902,0.00025145104,0.00043839394],"domain_scores_gemma":[0.99838865,0.0008455079,0.00011632177,0.00039453566,0.0001652721,0.00008969656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078389817,0.00015432511,0.00016010007,0.000044150696,0.00039884707,0.00024074125,0.0009586247,0.0000681929,0.0000414177],"category_scores_gemma":[0.00016681227,0.00010746132,0.000105910454,0.00014784359,0.000050737235,0.0003015752,0.00005549457,0.00012841399,0.00024717682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007520052,0.00009740306,0.000011887592,6.4962285e-7,0.000023973327,0.000014481147,0.0011302594,0.0034550861,0.021275887,0.72629076,0.0017361892,0.24588819],"study_design_scores_gemma":[0.00016678627,0.0010117822,0.00016615627,0.0000072118305,0.00002287139,0.0000067735214,0.000180784,0.85421926,0.048365727,0.09428928,0.0013264363,0.00023693615],"about_ca_topic_score_codex":0.000029216395,"about_ca_topic_score_gemma":0.0000038292524,"teacher_disagreement_score":0.9033658,"about_ca_system_score_codex":0.0000503522,"about_ca_system_score_gemma":0.000057436126,"threshold_uncertainty_score":0.43821454},"labels":[],"label_agreement":null},{"id":"W2065404513","doi":"10.1016/j.disc.2014.05.002","title":"A winning strategy for<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mn>3</mml:mn><mml:mo>×</mml:mo><mml:mi>n</mml:mi></mml:math>Cylindrical Hex","year":2014,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"London School of Economics and Political Science","keywords":"Mathematics; Scroll; Circumference; Combinatorics; Algorithm; Discrete mathematics; Geometry; Theology; Philosophy","score_opus":0.03323576613227676,"score_gpt":0.27800724431614376,"score_spread":0.24477147818386702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065404513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.781993,0.0005004932,0.20513645,0.0007526342,0.0019229245,0.0002149126,0.00025129388,0.00040564995,0.008822693],"genre_scores_gemma":[0.9554744,0.00021626435,0.04015322,0.000898312,0.0017441813,0.0004969826,0.00022846431,0.0004542488,0.0003339552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909024,0.00028989962,0.0024146857,0.0018505239,0.0022573352,0.0022851508],"domain_scores_gemma":[0.9919702,0.0023932655,0.0019394587,0.0025291352,0.00030620166,0.00086177065],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002441145,0.001100433,0.00074721593,0.0003079261,0.0015086804,0.0022630591,0.0031147846,0.0014645447,0.00045362502],"category_scores_gemma":[0.0021579587,0.0014211582,0.0014575508,0.0009332882,0.0012707245,0.0014243794,0.002047961,0.001441963,0.0026441938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002217232,0.00041656414,0.000008824547,0.0012521547,0.00051616976,0.00022762896,0.0064457417,0.0043544313,0.00095611776,0.97548455,0.0034371926,0.006678901],"study_design_scores_gemma":[0.0005642196,0.0012721879,0.00001422222,0.0013104577,0.0005782917,0.00039689217,0.0025148292,0.90470463,0.063558005,0.021113167,0.0027102416,0.0012628816],"about_ca_topic_score_codex":0.00031483077,"about_ca_topic_score_gemma":0.00019085009,"teacher_disagreement_score":0.9543714,"about_ca_system_score_codex":0.00004862386,"about_ca_system_score_gemma":0.0008003019,"threshold_uncertainty_score":0.99983174},"labels":[],"label_agreement":null},{"id":"W2066952345","doi":"10.1109/vecims.2010.5609362","title":"An AI based solution for the control of 3D real-time sensor based gaming","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Scripting language; Computer science; Human–computer interaction; Game engine; Relation (database); Forcing (mathematics); Variety (cybernetics); Adversary; Augmented reality; Function (biology); Virtual reality; Artificial intelligence; Computer security; Database","score_opus":0.022063066603823824,"score_gpt":0.2932032834222188,"score_spread":0.27114021681839495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066952345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008491107,0.0000028581087,0.98677087,0.0034833173,0.0002930517,0.00038211403,0.000004709501,0.00013627285,0.0004357227],"genre_scores_gemma":[0.8129882,2.6184676e-7,0.185833,0.0009694744,0.00007775993,0.000025931731,0.0000012078622,0.0000072839816,0.000096837066],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900573,0.00005987633,0.00025013494,0.0002481768,0.00019914506,0.00023693404],"domain_scores_gemma":[0.99779534,0.0010725685,0.0001038611,0.00071990286,0.00025057216,0.000057751447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007398579,0.000098574346,0.00013124301,0.00005876394,0.00014975501,0.00008214655,0.00069700845,0.00006818143,0.00012241828],"category_scores_gemma":[0.00019341781,0.000067369976,0.000072818744,0.00013905311,0.00011978217,0.0002712012,0.00002319133,0.00010313298,0.000031609517],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004758942,0.00012108313,0.0005009847,0.000010457562,0.000011040215,9.862152e-7,0.00020739532,0.0066725085,0.8922776,0.01698183,0.0006231018,0.08254541],"study_design_scores_gemma":[0.0001155403,0.00009765716,0.00022611163,0.0000041386247,0.00000772058,5.0734144e-7,0.000016379014,0.83019274,0.16834015,0.00039622458,0.0005257861,0.000077047196],"about_ca_topic_score_codex":0.0003291173,"about_ca_topic_score_gemma":0.000099904304,"teacher_disagreement_score":0.82352024,"about_ca_system_score_codex":0.000011980468,"about_ca_system_score_gemma":0.000110785855,"threshold_uncertainty_score":0.27472678},"labels":[],"label_agreement":null},{"id":"W2068885397","doi":"10.1109/cec.2009.4983005","title":"Coevolving intelligent game players in a cultural framework","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Coevolution; Computer science; Artificial intelligence; Order (exchange); Repeated game; Sequential game; Human–computer interaction; Game theory; Mathematical economics; Mathematics","score_opus":0.03743177205206489,"score_gpt":0.3235044157954102,"score_spread":0.28607264374334535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068885397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07621007,0.00016460754,0.91242546,0.002388168,0.00035763838,0.00014924638,1.677872e-7,0.00025939377,0.008045278],"genre_scores_gemma":[0.9148076,0.000034333643,0.082965925,0.0017327935,0.00005847538,0.0000046042433,3.07936e-7,0.000003997745,0.00039192484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857175,0.000040571445,0.0003408865,0.00038447548,0.00025817088,0.0004041457],"domain_scores_gemma":[0.99916935,0.00016553536,0.000054056014,0.00044790353,0.00006229911,0.00010083372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022114463,0.00014961224,0.00016050426,0.00013345151,0.00004710135,0.00023067438,0.0009911307,0.00009843991,0.00012410546],"category_scores_gemma":[0.00024348599,0.0001243516,0.00006559831,0.000603921,0.000048273207,0.00063526415,0.00012216164,0.0002807713,0.0004062742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083563455,0.00012286549,0.001956364,0.0000025919078,0.0000054530587,0.000052361425,0.009513521,0.0028010183,0.00082177145,0.7049081,0.00128881,0.27851886],"study_design_scores_gemma":[0.00009377994,0.0003560399,0.008917645,0.0002200412,0.000003868816,0.000036080142,0.002299032,0.5860212,0.061375994,0.3325593,0.007245033,0.0008719989],"about_ca_topic_score_codex":0.00009344727,"about_ca_topic_score_gemma":0.000052116364,"teacher_disagreement_score":0.8385976,"about_ca_system_score_codex":0.00010209511,"about_ca_system_score_gemma":0.0000345763,"threshold_uncertainty_score":0.5221968},"labels":[],"label_agreement":null},{"id":"W2069547117","doi":"10.1145/2347583.2347587","title":"Evolving dungeon crawler levels with relative placement","year":2012,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Web crawler; Computer science; Process (computing); Genetic programming; Fitness function; Set (abstract data type); Focus (optics); Video game; Function (biology); World Wide Web; Genetic algorithm; Multimedia; Artificial intelligence; Machine learning; Programming language","score_opus":0.05760342759764708,"score_gpt":0.296467969406877,"score_spread":0.2388645418092299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069547117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014789277,0.00011044115,0.920557,0.00063771347,0.00025690903,0.00013680739,2.8872066e-7,0.00017128371,0.06334026],"genre_scores_gemma":[0.8874058,0.000001310373,0.107669584,0.00027305193,0.000070592905,0.000012378192,1.8712736e-7,0.0000068778454,0.0045601823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989236,0.000043298198,0.00016046924,0.00021470872,0.000279092,0.00037885204],"domain_scores_gemma":[0.99921507,0.00014557337,0.000059098402,0.00037206555,0.00009335194,0.000114860755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003119867,0.000115383955,0.00009547979,0.000056311863,0.000107937514,0.0000895942,0.00040096385,0.000038530445,0.00046793083],"category_scores_gemma":[0.000050577575,0.00008142565,0.000025635089,0.00022561438,0.00005305489,0.0017903425,0.00018438016,0.00010743288,0.0006676377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001848641,0.0002683137,0.053829946,0.000011276413,0.0000942727,0.000010875877,0.02211239,0.00073699653,0.0019832838,0.87687814,0.005985056,0.038070947],"study_design_scores_gemma":[0.00062547746,0.0013127453,0.13693082,0.00029136255,0.000068436224,0.00011870925,0.004606665,0.22448727,0.54077107,0.03492827,0.053049844,0.0028093322],"about_ca_topic_score_codex":0.000037782902,"about_ca_topic_score_gemma":0.000024059978,"teacher_disagreement_score":0.8726165,"about_ca_system_score_codex":0.00006880288,"about_ca_system_score_gemma":0.000035128618,"threshold_uncertainty_score":0.85813546},"labels":[],"label_agreement":null},{"id":"W2069859193","doi":"10.1016/j.aam.2010.10.004","title":"Lattice point methods for combinatorial games","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Dalhousie University; National Science Foundation","keywords":"Mathematics; Lattice (music); Combinatorics; Combinatorial analysis; Discrete mathematics","score_opus":0.025241757531192538,"score_gpt":0.3759550201433229,"score_spread":0.3507132626121303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069859193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013052966,0.000152848,0.9811137,0.00017855596,0.0020004918,0.0005517679,0.0000011241758,0.00015660221,0.014539646],"genre_scores_gemma":[0.04638989,0.000034981873,0.95307994,0.00011176464,0.00010516292,0.00022307171,7.704545e-7,0.000019394272,0.00003500752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986198,0.000018661298,0.00047636047,0.000359327,0.00017751916,0.00034833988],"domain_scores_gemma":[0.99664503,0.0023313619,0.00018895726,0.0007022504,0.00006406388,0.00006835462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117467,0.00017927254,0.00029555324,0.000077908226,0.00007955113,0.00009763155,0.0010820978,0.00010608691,0.000013258553],"category_scores_gemma":[0.000697164,0.00016511478,0.000060519174,0.0003045351,0.00013002848,0.000392166,0.0002083298,0.00027601607,0.000043387234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043169753,0.00010301785,0.000009607099,0.000059708043,0.0000026045345,5.604153e-7,0.0009162598,0.000047211455,0.0033062848,0.84515506,0.00003044233,0.15036494],"study_design_scores_gemma":[0.00014361154,0.000027833596,0.0000029551506,0.000013768831,0.0000046479536,0.0000036966082,0.0001902409,0.05173457,0.056743335,0.86628354,0.024665926,0.00018584798],"about_ca_topic_score_codex":0.0000012640646,"about_ca_topic_score_gemma":0.000015322941,"teacher_disagreement_score":0.15017909,"about_ca_system_score_codex":0.000025296218,"about_ca_system_score_gemma":0.000038750015,"threshold_uncertainty_score":0.6733185},"labels":[],"label_agreement":null},{"id":"W2069939081","doi":"10.1016/j.tcs.2013.11.023","title":"UNO is hard, even for a single player","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Mattel","keywords":"Simple (philosophy); Computer science; Combinatorial game theory; Mathematical economics; Theoretical computer science; Computational complexity theory; Game theory; Repeated game; Mathematics; Algorithm","score_opus":0.032638003009175416,"score_gpt":0.2799198894126399,"score_spread":0.2472818864034645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069939081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027595755,0.000020715355,0.9628033,0.0047815973,0.0008574606,0.0005114907,0.0000018402854,0.0002447773,0.003183081],"genre_scores_gemma":[0.7285557,8.5718557e-7,0.26898316,0.002184824,0.00015353759,0.000046593796,2.7153288e-7,0.000009277433,0.00006580242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716115,0.0000537189,0.00035866708,0.0009273577,0.0006632592,0.0008358422],"domain_scores_gemma":[0.997566,0.00049072306,0.000079998754,0.0010577061,0.00047616137,0.0003294492],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008940715,0.00021300685,0.00022063307,0.000165019,0.00044187478,0.0010494498,0.003587595,0.000069805545,0.00025188393],"category_scores_gemma":[0.00019695857,0.00017344342,0.000110286564,0.0008729014,0.002319334,0.0013892878,0.0010120987,0.00014321896,0.0010882488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030729448,0.00006722236,0.000028517135,0.0000046346418,0.0000034385282,0.000001660588,0.00083412975,0.00005337385,0.0085069295,0.90556055,0.001328098,0.08360835],"study_design_scores_gemma":[0.000056933462,0.0002450937,0.00014351677,0.00001638793,0.00000238262,0.000016182918,0.0000104618175,0.5045795,0.085092016,0.40885675,0.0007639619,0.00021681463],"about_ca_topic_score_codex":0.0000150179585,"about_ca_topic_score_gemma":4.9010197e-7,"teacher_disagreement_score":0.7009599,"about_ca_system_score_codex":0.0000787208,"about_ca_system_score_gemma":0.000117899894,"threshold_uncertainty_score":0.99998754},"labels":[],"label_agreement":null},{"id":"W2070474485","doi":"10.4028/www.scientific.net/amm.411-414.1979","title":"The Realization of Genetic Algorithm in Terms of Checkers Evaluation Function","year":2013,"lang":"en","type":"article","venue":"Applied Mechanics and Materials","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Realization (probability); Algorithm; Genetic algorithm; Chromosome; Function (biology); Evaluation function; Computer science; Hill climbing; Mathematics; Artificial intelligence; Machine learning; Statistics","score_opus":0.01785929426297549,"score_gpt":0.24788628307286292,"score_spread":0.23002698880988742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070474485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06753148,0.000026960839,0.9315187,0.000029671615,0.00027119252,0.00046160398,0.000001279947,0.000009368753,0.00014975529],"genre_scores_gemma":[0.9840996,0.000112054346,0.015649796,0.000019674548,0.000016565706,0.00009082639,0.0000025659226,0.000004119171,0.0000047995773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992706,0.000039551636,0.00031199833,0.00012716281,0.00016275902,0.00008788684],"domain_scores_gemma":[0.99951833,0.000034943696,0.00017282343,0.0001911308,0.000068395915,0.000014345539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063446537,0.000053967164,0.000100287005,0.000039949588,0.00003241328,0.00004649403,0.00014984912,0.000041359326,0.000017314069],"category_scores_gemma":[0.000021507194,0.000040052266,0.000008433347,0.000107965854,0.000015120108,0.000081885235,0.000066222616,0.000015123075,0.0000044198005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003489077,0.00000894386,0.0000031812322,0.000008299319,0.0000034584166,2.5966882e-8,0.00019097766,0.000036350844,0.1909091,0.57529795,0.000015855252,0.23352236],"study_design_scores_gemma":[0.00005738568,0.000035795692,0.00053438,0.000008562555,0.000005696086,3.4655312e-7,0.00007585527,0.04040331,0.29639417,0.66241336,0.000029431018,0.000041682986],"about_ca_topic_score_codex":0.00011637918,"about_ca_topic_score_gemma":0.000008641441,"teacher_disagreement_score":0.9165681,"about_ca_system_score_codex":0.000011481077,"about_ca_system_score_gemma":0.000014208161,"threshold_uncertainty_score":0.1633284},"labels":[],"label_agreement":null},{"id":"W2073055172","doi":"10.1109/cig.2014.6932890","title":"Using partial satisfaction planning to automatically select NPCs' goals and generate plans in a simulation game","year":2014,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Scripting language; Selection (genetic algorithm); Order (exchange); Artificial intelligence; State (computer science); Motion planning; Control (management); Robot; Algorithm","score_opus":0.07215507090733456,"score_gpt":0.3574347841411342,"score_spread":0.28527971323379964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073055172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48091164,0.0000024992191,0.5186358,0.000099666155,0.00006423291,0.000082103594,1.9129276e-7,0.000074386284,0.0001294726],"genre_scores_gemma":[0.914692,4.5867722e-7,0.084917046,0.0002972358,0.000065960434,0.0000051561688,3.329788e-7,0.000006111222,0.00001573741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888545,0.00010806194,0.00029243235,0.00029860387,0.00017104729,0.00024437666],"domain_scores_gemma":[0.99938935,0.00025133774,0.000051093386,0.00017994082,0.00004091908,0.00008738158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003853426,0.000104247105,0.0001367793,0.00013977944,0.00006525805,0.00020201948,0.00013990658,0.00005659063,0.000011877344],"category_scores_gemma":[0.00015447548,0.000098497025,0.000014893989,0.00027971077,0.000019164301,0.00040989215,0.00006387203,0.00007643506,0.000030950585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007265678,0.000008339761,0.041012146,0.000004491385,0.0000031548639,0.0000025248003,0.0018191361,0.9035159,0.010911031,0.006552956,0.0000113745355,0.036151677],"study_design_scores_gemma":[0.00004461733,0.00005687318,0.02307671,0.000026541424,0.0000020421353,0.0000035126855,0.000021466325,0.96412295,0.010439444,0.00199457,0.00008429513,0.0001269968],"about_ca_topic_score_codex":0.00026190912,"about_ca_topic_score_gemma":0.0002578043,"teacher_disagreement_score":0.43378034,"about_ca_system_score_codex":0.00004774601,"about_ca_system_score_gemma":0.00003079776,"threshold_uncertainty_score":0.40165922},"labels":[],"label_agreement":null},{"id":"W2076264749","doi":"10.1007/s10878-010-9328-4","title":"Fast searching games on graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Time complexity; Discrete mathematics; Graph; Pathwidth; Quadratic equation; Chordal graph; Line graph","score_opus":0.013975031462997141,"score_gpt":0.27683168646508555,"score_spread":0.2628566550020884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076264749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036934108,0.000015357067,0.9436128,0.0014915639,0.015508576,0.00010243803,4.0979108e-7,0.000051352086,0.0022833557],"genre_scores_gemma":[0.843208,0.000020207786,0.15603219,0.0001317364,0.0005650488,0.0000011620027,4.3041916e-7,0.000011595393,0.00002964756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985612,0.00009309514,0.00045097843,0.00014187617,0.0005715714,0.0001812985],"domain_scores_gemma":[0.9984356,0.00021621845,0.00041081413,0.00027771527,0.0004977764,0.00016187131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007395385,0.000110788525,0.00017868173,0.0002964409,0.00012393967,0.0002716074,0.00082152925,0.000088591005,0.00003363553],"category_scores_gemma":[0.00079493975,0.00009495455,0.00010950093,0.00039620616,0.000056567962,0.00089452305,0.00007652354,0.00054239924,0.000015040987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052389736,0.00020595895,0.00028485866,0.000003943912,0.00002159906,0.000021255111,0.0008032647,0.27090308,0.0021648167,0.6990901,0.0010435574,0.025405131],"study_design_scores_gemma":[0.0008091407,0.0012524732,0.00024357604,0.000091195354,0.000019610647,0.00010897903,0.000107262684,0.55841047,0.037220355,0.3984311,0.0029180232,0.00038779923],"about_ca_topic_score_codex":0.000004117742,"about_ca_topic_score_gemma":4.601977e-7,"teacher_disagreement_score":0.8062739,"about_ca_system_score_codex":0.000030513875,"about_ca_system_score_gemma":0.00015884585,"threshold_uncertainty_score":0.3872134},"labels":[],"label_agreement":null},{"id":"W2079050722","doi":"10.1016/j.tcs.2014.01.025","title":"On lattices from combinatorial game theory modularity and a representation theorem: Finite case","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Distributive property; Distributive lattice; Modular design; Mathematics; Closure (psychology); Modularity (biology); Representation (politics); Set (abstract data type); Context (archaeology); Finite set; Representation theorem; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.02126817729949018,"score_gpt":0.2903496638602661,"score_spread":0.26908148656077596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079050722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25939393,0.000012433952,0.73619205,0.00044491037,0.0010385462,0.00014472647,0.0000022163129,0.00016716252,0.002604012],"genre_scores_gemma":[0.9628086,0.0000029652015,0.03617366,0.00073775026,0.0002541854,0.000007479338,8.9908025e-7,0.0000099218605,0.0000045107745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996712,0.00065049867,0.00034527297,0.0010815186,0.00071637536,0.00049427705],"domain_scores_gemma":[0.99358284,0.0046300623,0.00011783167,0.0011831792,0.00018520688,0.00030085305],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002809983,0.00023566312,0.0002633994,0.00017117352,0.00048398672,0.00085372844,0.0016481172,0.00008943859,0.000040132523],"category_scores_gemma":[0.0013225423,0.00019235461,0.00005991709,0.0006837925,0.0038770244,0.00083954586,0.0010585123,0.00029878368,0.000096386975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003021156,0.000060404556,0.000056099965,0.0000022430593,0.000004580814,0.00006995568,0.0012921556,0.00044799192,0.00009049864,0.89695823,0.0000070440447,0.10098056],"study_design_scores_gemma":[0.0000946603,0.00016811474,0.000116443465,0.000014739305,0.0000046173013,0.000035117435,0.000013554816,0.45944086,0.003371884,0.53658605,0.000018087416,0.00013587254],"about_ca_topic_score_codex":0.00004682338,"about_ca_topic_score_gemma":0.0000026452649,"teacher_disagreement_score":0.7034147,"about_ca_system_score_codex":0.000039566974,"about_ca_system_score_gemma":0.000048487418,"threshold_uncertainty_score":0.99883384},"labels":[],"label_agreement":null},{"id":"W2079678732","doi":"10.1016/j.disc.2013.05.023","title":"Dead ends in misère play: The misère monoid of canonical numbers","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Monoid; Integer (computer science); Combinatorics; Left and right; Dead end; Dead body; Discrete mathematics; Computer science","score_opus":0.023520981532640484,"score_gpt":0.2786696937595663,"score_spread":0.2551487122269258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079678732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7971295,0.00020239808,0.17122222,0.0046434514,0.00031534422,0.00081861543,0.000008240936,0.00013054012,0.025529686],"genre_scores_gemma":[0.95989466,0.000011196553,0.039400745,0.00013316535,0.000030930885,0.000049293652,0.0000011135162,0.0000152145685,0.00046367865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984453,0.00006266492,0.0005599567,0.00024236544,0.00035539144,0.0003343238],"domain_scores_gemma":[0.99836284,0.00045295543,0.00018229791,0.00084489834,0.00008069401,0.00007631572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003330317,0.00016655301,0.00026336327,0.00006323679,0.00005468453,0.000105838735,0.001401642,0.00008550984,0.00011020747],"category_scores_gemma":[0.00020988578,0.000111285946,0.00010070083,0.0003547849,0.00019338717,0.00027833608,0.0002874781,0.00020126419,0.00021583235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008532086,0.0004818299,0.006404681,0.00029159192,0.00009793381,0.00003494134,0.07404746,0.0018333527,0.0051519894,0.86912066,0.0058295513,0.0366975],"study_design_scores_gemma":[0.00025788505,0.00015082161,0.0025740825,0.00034938497,0.000029501425,0.000048051705,0.008823411,0.6433593,0.048663735,0.29290375,0.0020783236,0.0007617589],"about_ca_topic_score_codex":0.0005566259,"about_ca_topic_score_gemma":0.000244378,"teacher_disagreement_score":0.6415259,"about_ca_system_score_codex":0.000040755887,"about_ca_system_score_gemma":0.00008551157,"threshold_uncertainty_score":0.45381093},"labels":[],"label_agreement":null},{"id":"W2082667841","doi":"10.1109/tciaig.2013.2284385","title":"A Heuristic-Based Planner and Improved Controller for a Two-Layered Approach for the Game of Billiards","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Heuristics; Mathematical optimization; Heuristic; Domain (mathematical analysis); State (computer science); Class (philosophy); Controller (irrigation); Planner; Sequence (biology); Artificial intelligence; Algorithm; Mathematics","score_opus":0.035028196253588856,"score_gpt":0.2970997863229458,"score_spread":0.262071590069357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082667841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025647238,0.0001764193,0.9939549,0.001584741,0.00017426378,0.0014533574,0.00004025069,0.000036182082,0.000015168224],"genre_scores_gemma":[0.91714656,0.000022128312,0.081209645,0.0007004197,0.00002799693,0.0008279731,0.0000026857442,0.000012313519,0.000050257808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986028,0.000050005823,0.00048470535,0.00042140283,0.00018556158,0.0002554992],"domain_scores_gemma":[0.996531,0.0027472202,0.00012013975,0.0001888478,0.0003440187,0.000068766865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031152213,0.00019585209,0.00027049138,0.0001954402,0.00015229815,0.00015712959,0.00035082665,0.0000714816,0.000008258028],"category_scores_gemma":[0.00004488532,0.0001429793,0.00011014896,0.00024449994,0.0002848377,0.00026274208,0.0000047322014,0.00015530203,0.0000024639005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011442957,0.00018646482,0.000016430373,0.00004553685,0.000043464846,1.8451352e-7,0.00062188104,0.7969594,0.00039345975,0.0063504637,0.000061005645,0.19520727],"study_design_scores_gemma":[0.00033975948,0.0002925832,0.00011698041,0.00003147042,0.000016125838,0.0000037598152,0.00025260713,0.9565743,0.009741662,0.03240063,0.00006853073,0.0001615806],"about_ca_topic_score_codex":0.0001687513,"about_ca_topic_score_gemma":0.000023709707,"teacher_disagreement_score":0.91458184,"about_ca_system_score_codex":0.000023055061,"about_ca_system_score_gemma":0.00008455905,"threshold_uncertainty_score":0.5830527},"labels":[],"label_agreement":null},{"id":"W2084771774","doi":"10.1145/1496984.1497017","title":"Synthesizing neural networks for learning in games","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exploit; Point (geometry); Process (computing); Artificial neural network; Artificial intelligence; Character (mathematics); Sequential game; Game mechanics; Human–computer interaction; Machine learning; Game theory; Computer security","score_opus":0.0541353412096143,"score_gpt":0.28495798914306564,"score_spread":0.23082264793345134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084771774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07359233,0.00011215065,0.92363596,0.00056791893,0.00020636404,0.00012276019,3.6561566e-8,0.00020898592,0.0015535103],"genre_scores_gemma":[0.9648045,0.000017872691,0.034129202,0.00025245256,0.00007632565,0.000022162005,1.9966753e-7,0.000007119405,0.000690223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911356,0.00004010328,0.00019785826,0.000249724,0.0000970745,0.00030167238],"domain_scores_gemma":[0.9992214,0.00047599606,0.000040659725,0.00018646511,0.000034874774,0.000040642622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021298758,0.00008358116,0.00011429033,0.00007683673,0.00012898755,0.000052962765,0.0004609524,0.00004375368,0.000012832512],"category_scores_gemma":[0.00020057449,0.000076115226,0.000050077346,0.00022832974,0.000047469122,0.00035351305,0.00010242222,0.0001331561,0.000014934886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012136896,0.00004966296,0.037420094,0.0000063556304,0.00000644277,0.00004724488,0.0023605765,0.41160983,0.0002672337,0.035725888,0.0008036651,0.51169086],"study_design_scores_gemma":[0.000025546628,0.000036929454,0.0012638451,0.0000072742764,5.1584425e-7,0.000014134268,0.00008456581,0.99397904,0.0024089627,0.0009440794,0.0011311633,0.00010392417],"about_ca_topic_score_codex":0.0000543915,"about_ca_topic_score_gemma":0.000042791948,"teacher_disagreement_score":0.8912121,"about_ca_system_score_codex":0.000021912503,"about_ca_system_score_gemma":0.000019215457,"threshold_uncertainty_score":0.3103889},"labels":[],"label_agreement":null},{"id":"W2085293560","doi":"10.3166/ria.15.143-172","title":"Les concepts spatiaux dans la programmation du go","year":2001,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.08025907701739567,"score_gpt":0.33290220785959296,"score_spread":0.2526431308421973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085293560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033068243,0.0036914877,0.87538576,0.010511439,0.0035258431,0.0008671203,0.000012414285,0.00044010527,0.07249759],"genre_scores_gemma":[0.9441633,0.0022588714,0.013683037,0.00022475977,0.0010068703,0.00012334881,0.0000186897,0.00007787435,0.03844325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99435157,0.0007033209,0.0015580674,0.0013824981,0.00066275574,0.0013418032],"domain_scores_gemma":[0.99570966,0.0010146244,0.00055029785,0.0015650262,0.0007219432,0.00043847266],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015911481,0.0006675345,0.00059280766,0.0002575933,0.0007480551,0.0010537577,0.0021328556,0.0005410056,0.0015942118],"category_scores_gemma":[0.00084398536,0.0007499226,0.00039744267,0.0019245142,0.0016638141,0.0015338566,0.00054314267,0.000755422,0.008009755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002197036,0.0005329472,0.0029781582,0.000095580814,0.000037268095,0.0004531846,0.019687595,0.03757607,0.00083302014,0.34274948,0.0016604072,0.5933743],"study_design_scores_gemma":[0.000032840973,0.00027555882,0.00025817793,0.00042157373,0.000041851137,0.0008289596,0.0044775093,0.6275635,0.0329023,0.013902798,0.318625,0.00066995446],"about_ca_topic_score_codex":0.002232543,"about_ca_topic_score_gemma":0.0009846055,"teacher_disagreement_score":0.9110951,"about_ca_system_score_codex":0.00039162184,"about_ca_system_score_gemma":0.00027298313,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W2088306445","doi":"10.1016/j.disc.2012.01.002","title":"Characterizations of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-copwin graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scroll; Vertex (graph theory); Combinatorics; Order (exchange); Discrete mathematics; Graph","score_opus":0.026386083277995066,"score_gpt":0.26777340620684853,"score_spread":0.24138732292885345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088306445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90415955,0.00012568168,0.09211306,0.0002582363,0.00077529036,0.000100019104,0.00007140129,0.00017845251,0.0022183023],"genre_scores_gemma":[0.9648077,0.00009887088,0.034151968,0.0002706589,0.0002681119,0.00011345958,0.00007347574,0.00008865562,0.00012713253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701476,0.0000674685,0.00094130426,0.0004527894,0.00079670205,0.0007269916],"domain_scores_gemma":[0.99707824,0.0004514927,0.0007440669,0.0013581499,0.000109390494,0.00025865922],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069302955,0.0003494198,0.00030849263,0.00015553094,0.00034879954,0.00029882614,0.0012587397,0.00030103367,0.00006082356],"category_scores_gemma":[0.0004716904,0.00037340896,0.00039357535,0.000533569,0.00034913849,0.00107035,0.00070291996,0.00032332688,0.00093247526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014294304,0.00022408582,0.000059720438,0.00024745532,0.00010285217,0.00001548895,0.005876377,0.00014825225,0.0032592628,0.98892653,0.00017978196,0.0009458833],"study_design_scores_gemma":[0.00012277601,0.0001442813,0.0001357857,0.00030597343,0.00011093408,0.000068110836,0.0007374701,0.95575094,0.033174742,0.008161669,0.00089597836,0.00039130688],"about_ca_topic_score_codex":0.0000540798,"about_ca_topic_score_gemma":0.000021576352,"teacher_disagreement_score":0.98076487,"about_ca_system_score_codex":0.000015201002,"about_ca_system_score_gemma":0.00014691011,"threshold_uncertainty_score":0.9998718},"labels":[],"label_agreement":null},{"id":"W2090335209","doi":"10.1109/itw.2010.5593331","title":"A UCT agent for Tron: Initial investigations","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Waterloo","keywords":"Monte Carlo tree search; Computer science; Randomness; Monte Carlo method; Tree (set theory); Mathematical optimization; Mathematics; Statistics","score_opus":0.08130451495277091,"score_gpt":0.34696498496926853,"score_spread":0.2656604700164976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090335209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07408422,0.0000039559536,0.9120309,0.0042447685,0.0011517872,0.0002144481,0.0000018045192,0.00019303022,0.008075099],"genre_scores_gemma":[0.6651979,3.2204628e-7,0.33205357,0.0011067615,0.0001948996,0.000059230282,0.0000012720863,0.000004611871,0.0013814083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936235,0.000010878069,0.0001523649,0.00019597204,0.00010734756,0.00017109353],"domain_scores_gemma":[0.9993478,0.00012995806,0.00003223475,0.00034112527,0.00007708213,0.00007178245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014541914,0.00006442612,0.00006139954,0.000047677302,0.00011565152,0.00011738418,0.0005456893,0.000042548618,0.000090026086],"category_scores_gemma":[0.00019941974,0.00005638759,0.00004826654,0.00013513946,0.000087677436,0.00030569846,0.000091607166,0.0000939151,0.00018794928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001189331,0.000028353072,0.00018682407,0.000002470866,0.0000043384684,0.0000011683165,0.00050257007,0.000022009484,0.009289681,0.84220284,0.007956878,0.13980165],"study_design_scores_gemma":[0.00010825601,0.0001408972,0.00067302963,0.0000059809395,0.000006425195,0.000013678014,0.000103021215,0.160573,0.3317927,0.2697105,0.23656365,0.00030882133],"about_ca_topic_score_codex":0.000033451877,"about_ca_topic_score_gemma":0.00018111659,"teacher_disagreement_score":0.5911137,"about_ca_system_score_codex":0.000007648278,"about_ca_system_score_gemma":0.000079231475,"threshold_uncertainty_score":0.24157704},"labels":[],"label_agreement":null},{"id":"W2092175787","doi":"10.1145/1121341.1121510","title":"Poker as a group project for artificial intelligence","year":2006,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Group (periodic table); Flexibility (engineering); Computer science; Project-based learning; Artificial intelligence; Quarter (Canadian coin); Project management; Intelligent agent; Mathematics education; Psychology; Engineering; Mathematics; Systems engineering","score_opus":0.05816810640267276,"score_gpt":0.32993191859209164,"score_spread":0.27176381218941886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092175787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045400863,0.000043079875,0.97537476,0.0012523934,0.00053270895,0.00063259236,0.0000020807397,0.00040868422,0.01721359],"genre_scores_gemma":[0.7706233,0.0000034059585,0.22573139,0.0005493784,0.00040906804,0.00017450415,0.000004616977,0.000018359673,0.0024859703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820316,0.00003586765,0.00045634044,0.0005520451,0.00028327212,0.00046929496],"domain_scores_gemma":[0.9989286,0.00025643126,0.00008772646,0.0005307946,0.00014549687,0.00005095485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037376827,0.00018080874,0.00016516823,0.0001546115,0.00017411193,0.00033067042,0.0010105285,0.000085912834,0.00007115713],"category_scores_gemma":[0.00012271322,0.00015687456,0.00013032374,0.0005110893,0.000102213446,0.0005385134,0.0001804737,0.00009500439,0.00055676885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011045847,0.00009834849,0.00003946779,0.000004941213,0.000004114299,0.0000046872524,0.00016746619,0.000106737956,0.0011524983,0.8769378,0.0025908554,0.118882015],"study_design_scores_gemma":[0.000017135626,0.0002314396,0.000039208928,0.000009645593,0.000004788513,0.000015187861,0.00019228844,0.13524121,0.10873097,0.73405534,0.021155136,0.00030767775],"about_ca_topic_score_codex":0.0011445776,"about_ca_topic_score_gemma":0.00045652495,"teacher_disagreement_score":0.76608324,"about_ca_system_score_codex":0.000047115198,"about_ca_system_score_gemma":0.00009672945,"threshold_uncertainty_score":0.7156323},"labels":[],"label_agreement":null},{"id":"W2096877261","doi":"","title":"The Taming of Two Alley CATs","year":2012,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Combinatorics; Mathematics; Alley; Graph; Vertex (graph theory); Sequence (biology); Computer science; Theoretical computer science; Discrete mathematics; Geography; Biology","score_opus":0.04575716196901032,"score_gpt":0.32290914669758125,"score_spread":0.27715198472857094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096877261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071130924,0.00045717543,0.88491,0.0011876244,0.0008591498,0.00008435941,1.2321684e-7,0.000088048626,0.04128263],"genre_scores_gemma":[0.980622,0.0000103444845,0.018113561,0.00011337669,0.000066673216,0.0000027203707,3.5114834e-8,0.0000022685163,0.0010690449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994182,0.000027643871,0.0001364708,0.00007350495,0.00013899324,0.00020520252],"domain_scores_gemma":[0.99929005,0.00022626483,0.000043759617,0.00035443468,0.00004287978,0.00004260831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037347525,0.00004226688,0.000047439342,0.000015877495,0.00008877008,0.000037243022,0.00065243756,0.0000127827525,0.000020845973],"category_scores_gemma":[0.000060451104,0.000025299732,0.00002655066,0.00011421888,0.00006258932,0.00029112853,0.0001825989,0.000040577746,0.00014601645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.963062e-7,0.00002390035,0.0051774126,0.0000012188917,0.00000568229,2.7278577e-7,0.00211436,0.00003942821,0.0019370818,0.8026412,0.0012996218,0.18675922],"study_design_scores_gemma":[0.000061999075,0.00005938642,0.0059605814,0.00001702108,0.0000060484635,0.00001431648,0.00097093824,0.063546136,0.8212462,0.042574815,0.0652391,0.00030347763],"about_ca_topic_score_codex":0.00014526263,"about_ca_topic_score_gemma":0.000056446705,"teacher_disagreement_score":0.90949106,"about_ca_system_score_codex":0.000008820204,"about_ca_system_score_gemma":0.000014928138,"threshold_uncertainty_score":0.18767947},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04074702411668039,"score_gpt":0.275774518047986,"score_spread":0.2350274939313056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097778153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47332966,0.0000673506,0.5250256,0.00076099363,0.000016986116,0.00006344797,2.419008e-7,0.0000710824,0.0006646125],"genre_scores_gemma":[0.9421909,0.000041477786,0.05736319,0.00012327581,0.000012930508,0.0000041315,4.6041347e-7,0.000004584602,0.000259071],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922776,0.000035645913,0.00009289496,0.00024934454,0.00021237109,0.0001820084],"domain_scores_gemma":[0.99954987,0.00017658714,0.000013931927,0.000121149475,0.000053509648,0.00008494787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012051712,0.00008264534,0.000088113906,0.00005245143,0.00023866411,0.00007758645,0.00013068168,0.000020784819,0.000022395652],"category_scores_gemma":[0.000018816367,0.000060452534,0.000010847698,0.0001277814,0.0002451692,0.00017959498,0.000051275216,0.00010192985,0.000005885024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001897745,0.0002725047,0.4794741,0.0001425047,0.00007236835,0.00040316427,0.087211736,0.015223892,0.004716426,0.08856848,0.00058082415,0.32314423],"study_design_scores_gemma":[0.00059791736,0.0017720407,0.05336554,0.00007362545,0.000015059122,0.00046671668,0.0028936416,0.7723733,0.14312583,0.0009559497,0.023448532,0.0009118552],"about_ca_topic_score_codex":0.00014401872,"about_ca_topic_score_gemma":0.00004474646,"teacher_disagreement_score":0.7571494,"about_ca_system_score_codex":0.0000098940445,"about_ca_system_score_gemma":0.00004824763,"threshold_uncertainty_score":0.24651827},"labels":[],"label_agreement":null},{"id":"W2097870794","doi":"10.1109/nafips.2004.1337393","title":"Fuzzy logic in agent-based game design","year":2004,"lang":"en","type":"article","venue":"IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04.","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fuzzy logic; Computer science; Fuzzy electronics; Artificial intelligence; Game design; Human–computer interaction; Computer game; Quality (philosophy); Fuzzy control system; Neuro-fuzzy; Multimedia","score_opus":0.03220420032887639,"score_gpt":0.27464877432532087,"score_spread":0.24244457399644448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097870794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10323619,0.00072769687,0.8791311,0.0051032347,0.0018299314,0.0012583516,0.000023448489,0.00060543336,0.008084626],"genre_scores_gemma":[0.9468216,0.0000071545305,0.05157335,0.0013910215,0.00009148011,0.000038897848,0.0000033783137,0.000017369908,0.000055787637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99666137,0.00018079714,0.0013114288,0.0003249031,0.00087460654,0.000646923],"domain_scores_gemma":[0.9972718,0.00020099159,0.0009448973,0.0007136523,0.000756873,0.00011178301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017365841,0.00033285687,0.00034884844,0.00042981096,0.00035513085,0.00035622224,0.0021895422,0.00018993378,0.0000031269813],"category_scores_gemma":[0.000982115,0.00026646862,0.00013998809,0.001751927,0.00027326492,0.0035733548,0.00017213513,0.00038602488,0.00014498991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057220048,0.00017476949,0.0007760956,0.0002546865,0.000015145104,0.0000056577724,0.022074755,0.9258093,0.0006642474,0.0037686238,0.0011189756,0.04528051],"study_design_scores_gemma":[0.003172083,0.0008968717,0.0033998555,0.0056539024,0.00009640453,0.000112463065,0.008033816,0.16417453,0.5212999,0.28518286,0.0051238164,0.0028535323],"about_ca_topic_score_codex":0.00023266574,"about_ca_topic_score_gemma":0.00003296712,"teacher_disagreement_score":0.8435854,"about_ca_system_score_codex":0.00028134487,"about_ca_system_score_gemma":0.00092375115,"threshold_uncertainty_score":0.9999788},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0564658959255539,"score_gpt":0.27905845387784867,"score_spread":0.22259255795229477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098487995","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5377637,0.000041492192,0.37714425,0.002951577,0.00091714296,0.0014608492,0.000018889908,0.00014582701,0.079556234],"genre_scores_gemma":[0.9961993,0.00004680484,0.003280438,0.00022275336,0.00002004773,0.000041782896,8.356952e-7,0.000013210297,0.00017484104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998002,0.000017398752,0.0006733121,0.00056124694,0.00038555224,0.00036050857],"domain_scores_gemma":[0.99875575,0.00008787771,0.00032683864,0.00024885358,0.00048649943,0.00009415635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002235184,0.00027323005,0.00026721347,0.0002303233,0.00009155387,0.00036570907,0.0011889674,0.00007523346,0.00011632796],"category_scores_gemma":[0.00034211593,0.00020757793,0.000090475776,0.0005329808,0.0002923902,0.0018507267,0.00055819924,0.00028514588,0.000038455597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044124204,0.0012738706,0.006185335,0.00004077429,0.000058833117,0.0000042259726,0.019178504,0.000843405,0.0030844668,0.7568625,0.000054583397,0.21197224],"study_design_scores_gemma":[0.000076544515,0.0010747899,0.00086215034,0.0006705044,0.000013203821,0.000012568122,0.009355232,0.28820014,0.5501697,0.14881612,0.00015156361,0.00059746037],"about_ca_topic_score_codex":0.00009174966,"about_ca_topic_score_gemma":0.000017712702,"teacher_disagreement_score":0.6080464,"about_ca_system_score_codex":0.00009773719,"about_ca_system_score_gemma":0.00005072562,"threshold_uncertainty_score":0.8464782},"labels":[],"label_agreement":null},{"id":"W2098838647","doi":"10.5281/zenodo.7949817","title":"Cutthroat, an All-Small Game on Graphs","year":2005,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Colored; White (mutation); Stars; Graph; Combinatorial game theory; Discrete mathematics; Sequential game; Game theory; Mathematical economics; Computer science","score_opus":0.0814530477393542,"score_gpt":0.28894212038870376,"score_spread":0.20748907264934957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098838647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17854147,0.0001830209,0.4288152,0.012267167,0.0006779832,0.0013194497,0.000082914696,0.007840311,0.37027252],"genre_scores_gemma":[0.98986953,0.00006684093,0.0064741424,0.0014310754,0.0002560763,5.496598e-8,0.00014660631,0.00080598093,0.00094971515],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793285,0.0003063238,0.0002733287,0.0006014546,0.00041788557,0.00046818194],"domain_scores_gemma":[0.9982935,0.00003268351,0.000091301525,0.0009612383,0.0003600573,0.0002612276],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00061898865,0.0001633607,0.00012674664,0.00027323092,0.001007921,0.0012645748,0.0028370023,0.000065612134,0.0034166651],"category_scores_gemma":[0.00028415452,0.00016881432,0.000058709367,0.0005856344,0.0001589232,0.00074162247,0.0010732958,0.00028134108,0.022161802],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002773975,0.00033517205,0.0000027257777,0.000009042202,0.000024999248,0.000018121986,0.0037597546,0.00096200645,0.0034901593,0.18581139,0.051032692,0.7545262],"study_design_scores_gemma":[0.0001106402,0.0004463251,0.00014159466,0.000013766563,0.000004091909,0.000055848548,0.00012056071,0.015379505,0.0056737717,0.0030852025,0.9747448,0.00022387218],"about_ca_topic_score_codex":0.000015471414,"about_ca_topic_score_gemma":0.0000017771903,"teacher_disagreement_score":0.92371213,"about_ca_system_score_codex":0.00012002019,"about_ca_system_score_gemma":0.000004077579,"threshold_uncertainty_score":0.9997722},"labels":[],"label_agreement":null},{"id":"W2098897955","doi":"","title":"Strategy Grafting in Extensive Games","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Combinatorial game theory; Turns, rounds and time-keeping systems in games; Abstraction; Game mechanics; Competition (biology); Sequential game; Game theory; Human–computer interaction; Video game design; Mathematical economics; Mathematics","score_opus":0.041010902886990906,"score_gpt":0.3084238254850512,"score_spread":0.2674129225980603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098897955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30279315,0.00024169027,0.59370553,0.005483464,0.0002712287,0.00021117041,1.9500543e-7,0.0004427856,0.09685079],"genre_scores_gemma":[0.98027533,0.00000810377,0.018033009,0.0011196525,0.000031390944,0.0000018012252,1.2805916e-7,0.0000021743426,0.00052843266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912786,0.000028067068,0.00020288255,0.0002566317,0.00013492926,0.000249609],"domain_scores_gemma":[0.9995028,0.00006826121,0.000034401266,0.00028825793,0.00006142922,0.000044869983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015507465,0.00008110473,0.000097209966,0.00009472,0.000032872293,0.000115882365,0.00049524294,0.00003537402,0.000032016334],"category_scores_gemma":[0.00007523077,0.00007092468,0.000028705324,0.00034329694,0.000024405188,0.00043681636,0.000053669497,0.00009694289,0.00015058252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001514215,0.000039102943,0.00057470606,7.073483e-7,0.0000012527388,0.000053983047,0.00085205416,0.0011181288,0.0018973566,0.30166498,0.00046996048,0.69332623],"study_design_scores_gemma":[0.0001257793,0.00037266163,0.041213877,0.00004888343,0.000001985822,0.00003782438,0.0014777204,0.36585882,0.10342144,0.48527607,0.0015876604,0.00057725655],"about_ca_topic_score_codex":0.000091444475,"about_ca_topic_score_gemma":0.000067129884,"teacher_disagreement_score":0.692749,"about_ca_system_score_codex":0.000021999891,"about_ca_system_score_gemma":0.000031892072,"threshold_uncertainty_score":0.28922245},"labels":[],"label_agreement":null},{"id":"W2098954282","doi":"10.1109/icsmc.2011.6084216","title":"Reinforcement learning and the effects of parameter settings in the game of Chung Toi","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reinforcement learning; Artificial neural network; Computer science; Reinforcement; Artificial intelligence; Recurrent neural network; Temporal difference learning; Machine learning; Action (physics); Engineering","score_opus":0.01934206153522624,"score_gpt":0.2529023497526191,"score_spread":0.23356028821739286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098954282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7943562,0.00019975225,0.1904588,0.0005597666,0.00011574132,0.00052402116,3.1099354e-8,0.000026572185,0.013759109],"genre_scores_gemma":[0.99645156,0.000024469482,0.0031097524,0.00024603045,0.000005238991,0.0000120152645,3.7500158e-8,0.0000019773652,0.0001489206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924165,0.00013648975,0.00023197845,0.00011151558,0.00015952802,0.0001188592],"domain_scores_gemma":[0.99844706,0.001164025,0.00011250282,0.00023500997,0.000029746827,0.000011662507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076961523,0.000058968857,0.00011541284,0.000036281068,0.000025695046,0.000019955469,0.00047531773,0.000021723108,0.00001347232],"category_scores_gemma":[0.000410755,0.000028784329,0.000033040946,0.00014994011,0.00019308037,0.000120793346,0.00016776187,0.000101415375,0.0000033414879],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090895635,0.000099979996,0.019991882,0.00021243855,0.00005212509,0.000010842123,0.2565705,0.0006128598,0.0047992463,0.5758557,0.00018871737,0.14151482],"study_design_scores_gemma":[0.0006360017,0.0008366396,0.0116125075,0.00025406133,0.000026097334,0.00001290114,0.004508442,0.27118844,0.6675052,0.042382244,0.0007605217,0.00027693767],"about_ca_topic_score_codex":0.00030738773,"about_ca_topic_score_gemma":0.000011829755,"teacher_disagreement_score":0.66270596,"about_ca_system_score_codex":0.0000041445646,"about_ca_system_score_gemma":0.000008762375,"threshold_uncertainty_score":0.117379084},"labels":[],"label_agreement":null},{"id":"W2101196715","doi":"10.1109/cgames.2011.6000357","title":"Adaptive AI to play tower defense game","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Tower; Computer science; Path (computing); Algorithm; Mathematical optimization; Artificial intelligence; Engineering; Mathematics; Computer network; Structural engineering","score_opus":0.07638981227746561,"score_gpt":0.28699898651164096,"score_spread":0.21060917423417536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101196715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008160695,0.000011533201,0.89343536,0.00057865924,0.0003890185,0.00013436248,5.923704e-7,0.00022315526,0.09706661],"genre_scores_gemma":[0.8549435,0.0000013806102,0.13742185,0.0039055452,0.00004037996,0.000014151273,8.0858946e-8,0.0000066804955,0.003666395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989436,0.000027277489,0.00018216914,0.00035517744,0.0001924129,0.000299358],"domain_scores_gemma":[0.9990822,0.00005691325,0.000028398597,0.00055115245,0.00011610786,0.00016520097],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014896976,0.00011400957,0.00010586176,0.00008628969,0.00004382805,0.00006443921,0.00088529865,0.000046939815,0.0009116551],"category_scores_gemma":[0.000044961867,0.00009470488,0.00005039147,0.00028504728,0.00004566236,0.0004165099,0.0002338066,0.00009302205,0.003297054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041178555,0.00015901226,0.00081065315,0.0000012335767,0.000025043388,0.0000797685,0.03774606,0.00021445173,0.00045236797,0.80393875,0.027718939,0.12881257],"study_design_scores_gemma":[0.00019658488,0.0019671128,0.0063475673,0.00006579794,0.000019398734,0.00007807121,0.0023983528,0.085879266,0.5037638,0.22310968,0.1742109,0.0019634925],"about_ca_topic_score_codex":0.00031896032,"about_ca_topic_score_gemma":0.00014329472,"teacher_disagreement_score":0.84678286,"about_ca_system_score_codex":0.000027347332,"about_ca_system_score_gemma":0.000047142537,"threshold_uncertainty_score":0.9981984},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10045159529685105,"score_gpt":0.3046174899691713,"score_spread":0.20416589467232027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101861158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050372956,0.002131496,0.95009595,0.013324685,0.0015030782,0.00032337787,0.0000020650843,0.00024147249,0.027340582],"genre_scores_gemma":[0.9946568,0.00058373326,0.003991951,0.00013328223,0.00012640604,0.000020732847,1.7584514e-7,0.0000122820065,0.00047465417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780357,0.00010166343,0.00073483674,0.00042322525,0.00046356904,0.00047312555],"domain_scores_gemma":[0.9976128,0.00068518653,0.00020798658,0.0011548281,0.00023802082,0.00010118676],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005815466,0.00017894163,0.00018966464,0.0000851409,0.00036423365,0.00017281176,0.0021304889,0.00008138403,0.0002667081],"category_scores_gemma":[0.0003224119,0.00013044398,0.00013466286,0.0006495375,0.00046175774,0.00040777322,0.000309619,0.00021446202,0.0014667007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026334767,0.000067372406,0.000010091798,0.0000023480331,0.000007747047,0.0000040020323,0.0014486111,0.00017530224,0.00042236518,0.5897261,0.00023022402,0.40790325],"study_design_scores_gemma":[0.0000060014563,0.00016506412,0.000017738814,0.000019890904,0.0000051290435,0.0000056949275,0.0005142293,0.12005359,0.16513844,0.70448196,0.009353995,0.00023825765],"about_ca_topic_score_codex":0.00007655875,"about_ca_topic_score_gemma":0.00013149853,"teacher_disagreement_score":0.9896195,"about_ca_system_score_codex":0.00002866025,"about_ca_system_score_gemma":0.00002115032,"threshold_uncertainty_score":0.9993108},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034215705805012646,"score_gpt":0.31247784181369387,"score_spread":0.2782621360086812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102256448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23719212,0.00004686624,0.7598346,0.001873305,0.0005640684,0.00019250723,0.0000042526767,0.00006922523,0.00022308428],"genre_scores_gemma":[0.9836237,0.000071342896,0.015531297,0.000514993,0.00003745809,0.000044761848,5.2301715e-7,0.000013027298,0.00016290967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980324,0.00008689403,0.0005124341,0.0005807362,0.0004064595,0.00038109356],"domain_scores_gemma":[0.9987434,0.0006367431,0.000047870053,0.00031200986,0.00013936165,0.00012060077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039899407,0.00021990307,0.00022756936,0.00062463904,0.00012495827,0.00019555123,0.00062153034,0.0001318436,0.00005365762],"category_scores_gemma":[0.00001922295,0.00022280833,0.00007602745,0.00083956827,0.00024710223,0.00066724845,0.000010149078,0.00087502284,0.00009688057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001829125,0.00021349076,0.0004251898,0.0000082544075,0.0000074219856,0.000025893229,0.001856137,0.63883287,0.00039119183,0.0061610024,0.000020819922,0.35203946],"study_design_scores_gemma":[0.000087613575,0.00012844158,0.0034761853,0.000060859373,0.0000027018523,0.00003185785,0.00039242939,0.94867355,0.023988388,0.022711897,0.00015132713,0.000294761],"about_ca_topic_score_codex":0.0005261312,"about_ca_topic_score_gemma":0.0025835377,"teacher_disagreement_score":0.7464315,"about_ca_system_score_codex":0.000052713596,"about_ca_system_score_gemma":0.000134677,"threshold_uncertainty_score":0.908586},"labels":[],"label_agreement":null},{"id":"W2102509082","doi":"10.5555/2343776.2343816","title":"Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization","year":2012,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tree traversal; Nash equilibrium; Counterfactual thinking; Computer science; Mathematical optimization; Regret; Game tree; Sampling (signal processing); Minification; Perfect information; Algorithm; Game theory; Mathematics; Mathematical economics; Repeated game; Machine learning","score_opus":0.04266426858457787,"score_gpt":0.2869270409759873,"score_spread":0.24426277239140945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102509082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21704443,0.00016406491,0.77262425,0.0005066426,0.0009928196,0.00023088706,0.0000017766941,0.00030724087,0.008127883],"genre_scores_gemma":[0.9473203,0.0000036471574,0.051408198,0.00033585777,0.00017770793,0.000017560646,0.0000023981536,0.0000128139445,0.0007215507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998318,0.000074492,0.00036054483,0.00032488708,0.00045154116,0.00047052183],"domain_scores_gemma":[0.99893945,0.00011541776,0.00013063487,0.0005656357,0.00015016104,0.00009867251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003233842,0.00017240031,0.00015268165,0.0000654231,0.00009577925,0.0001790604,0.0006069516,0.00009157902,0.00009173984],"category_scores_gemma":[0.00011099071,0.00014910704,0.00007476189,0.00034916433,0.00007818138,0.0010570673,0.00025202375,0.000099733574,0.00041991766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075720585,0.0013339667,0.008777087,0.00010908609,0.00012738067,0.0000083218865,0.106056936,0.3668078,0.009081645,0.41162476,0.031075524,0.06492179],"study_design_scores_gemma":[0.00006012552,0.000044641794,0.00032787962,0.000014219102,0.000006769218,0.000009773145,0.00046576743,0.9512326,0.044088677,0.00058288244,0.0029328975,0.00023375667],"about_ca_topic_score_codex":0.00008445095,"about_ca_topic_score_gemma":0.000006889108,"teacher_disagreement_score":0.73027587,"about_ca_system_score_codex":0.00009761797,"about_ca_system_score_gemma":0.000039803705,"threshold_uncertainty_score":0.60804087},"labels":[],"label_agreement":null},{"id":"W2102527195","doi":"10.1007/978-0-85729-341-1_5","title":"2003: Deep Junior Confounds Kasparov, Drawing 3–3 in New York","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Champion; Deep blue; Dignity; Artificial intelligence; Art; History; Computer science; Political science; Law; Archaeology","score_opus":0.07930357482132858,"score_gpt":0.2685238143707961,"score_spread":0.1892202395494675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102527195","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003786691,0.000667328,0.32309687,0.00018264593,0.0012290706,0.00022131858,5.560565e-7,0.00020773991,0.6743907],"genre_scores_gemma":[0.0026169864,0.00010290761,0.031882506,0.00092567905,0.0003763366,0.0000058144806,0.0000038069127,0.000055818527,0.96403015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99748826,0.000023004459,0.00071236334,0.0008277802,0.00041961775,0.0005289729],"domain_scores_gemma":[0.9980122,0.00011316534,0.00024096359,0.0012164344,0.00017301814,0.00024424773],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00028084993,0.00047022902,0.0005337055,0.00038723697,0.00008154479,0.0002660463,0.0021751933,0.0004731446,0.002745129],"category_scores_gemma":[0.000070781985,0.00045870457,0.00013191029,0.00019779058,0.0001576652,0.00041513407,0.00051629846,0.00058498676,0.003998497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033725123,0.000009645425,0.000035871974,0.000005557453,0.000016701237,0.000046822992,0.0010491873,0.000013542233,0.000004965794,0.86255634,0.010180843,0.12607716],"study_design_scores_gemma":[0.00007218208,0.00008489499,0.00003093203,0.00016911881,0.000015381016,0.000018797507,0.000035753696,0.003602197,0.00075092557,0.3773531,0.6170186,0.0008481297],"about_ca_topic_score_codex":0.0014995486,"about_ca_topic_score_gemma":0.004217982,"teacher_disagreement_score":0.60683775,"about_ca_system_score_codex":0.00013501318,"about_ca_system_score_gemma":0.0006419445,"threshold_uncertainty_score":0.9997865},"labels":[],"label_agreement":null},{"id":"W2102585303","doi":"10.1145/1390156.1390166","title":"Strategy evaluation in extensive games with importance sampling","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Computer science; Variance (accounting); Context (archaeology); Monte Carlo method; Sampling (signal processing); Importance sampling; Domain (mathematical analysis); Mathematical optimization; Variance reduction; Machine learning; Mathematics; Statistics","score_opus":0.1314348583327641,"score_gpt":0.3434807252798406,"score_spread":0.21204586694707647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102585303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5958757,0.0001286545,0.39784616,0.00023338807,0.000057405356,0.00018897606,1.3859227e-7,0.00007717829,0.005592385],"genre_scores_gemma":[0.95942605,0.00001854595,0.040144354,0.00021383505,0.000024791965,0.000022221737,7.2094235e-7,0.000004993781,0.00014451801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988156,0.000042583546,0.0002227063,0.00033169423,0.00037250848,0.00021488157],"domain_scores_gemma":[0.99918884,0.000088674235,0.0000676151,0.00035712565,0.00025556178,0.000042179527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031012736,0.00009515969,0.00010942133,0.0000864286,0.00006527995,0.00004576683,0.00033718214,0.00003329148,0.00007305102],"category_scores_gemma":[0.00008380962,0.000074897114,0.00001804591,0.00039964015,0.00007320932,0.0005633826,0.000046096764,0.00009031266,0.00005345278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000495177,0.00025668944,0.24385703,0.000012746009,0.000030178577,0.0003356868,0.010311872,0.13441285,0.0032258693,0.17720133,0.0009239884,0.42938223],"study_design_scores_gemma":[0.00025899775,0.00028539402,0.1887885,0.000052917054,0.0000058716373,0.00018382038,0.0013822962,0.731529,0.0187441,0.05801456,0.0002344604,0.00052009773],"about_ca_topic_score_codex":0.00014595516,"about_ca_topic_score_gemma":0.0005675823,"teacher_disagreement_score":0.5971161,"about_ca_system_score_codex":0.00005989607,"about_ca_system_score_gemma":0.00018889821,"threshold_uncertainty_score":0.30542156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1476889815550019,"score_gpt":0.3228816404081994,"score_spread":0.17519265885319749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102669142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069518583,0.00013799958,0.9910008,0.0008537394,0.0002004781,0.0006055203,0.0000088098095,0.000046855454,0.00019396105],"genre_scores_gemma":[0.910043,0.000057873538,0.08910814,0.00047094913,0.000025541085,0.00024630586,7.932812e-7,0.000011247771,0.00003615224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854976,0.00004255517,0.00048635737,0.00042503848,0.00026182408,0.00023446714],"domain_scores_gemma":[0.9989441,0.00040407732,0.00008218525,0.00023143372,0.00027040034,0.0000677858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029659632,0.00017554397,0.0001944675,0.0002721024,0.00013230261,0.000061014067,0.00052356994,0.000067336085,0.000008534752],"category_scores_gemma":[0.000022960483,0.00014196563,0.0000885803,0.00049102126,0.000116160416,0.00038979173,0.000007705733,0.00015969964,0.000008437557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003627724,0.00020606977,0.0000034177665,0.000023219933,0.000018857163,3.0210325e-7,0.0076117306,0.83735514,0.000054257893,0.017789556,0.000007839618,0.13689332],"study_design_scores_gemma":[0.00004512935,0.0001976227,0.00009455913,0.000049921724,0.0000100912475,0.000006689527,0.00075013924,0.94434154,0.009754079,0.04456904,0.000026319462,0.00015489172],"about_ca_topic_score_codex":0.0001082665,"about_ca_topic_score_gemma":0.000036974594,"teacher_disagreement_score":0.90309113,"about_ca_system_score_codex":0.000036858924,"about_ca_system_score_gemma":0.00008762052,"threshold_uncertainty_score":0.57891905},"labels":[],"label_agreement":null},{"id":"W2104019257","doi":"","title":"Concurrent action execution with shared fluents","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Precondition; Action (physics); Situation calculus; Distributed computing; Mathematical optimization; Programming language; Mathematics","score_opus":0.06329942950207597,"score_gpt":0.33575369228840757,"score_spread":0.2724542627863316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104019257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055050526,0.000011258773,0.9360517,0.00021853327,0.00043714157,0.000098680655,2.4445035e-7,0.000204957,0.007926929],"genre_scores_gemma":[0.98728454,0.000002757965,0.011955265,0.00016950321,0.00005088658,0.0000034818038,0.0000013082681,0.000003627298,0.00052865053],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991869,0.000011918693,0.00014500623,0.00021828983,0.00023434783,0.00020358579],"domain_scores_gemma":[0.99952734,0.00004091058,0.000049429615,0.00022599575,0.00008860116,0.00006774237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020224143,0.00007352463,0.000058041285,0.000063957705,0.00007073143,0.00009082538,0.00030633705,0.000032217373,0.00007011713],"category_scores_gemma":[0.00001630548,0.000056296456,0.00001985125,0.00023932228,0.00003491223,0.000569769,0.000059465037,0.00006642487,0.00026198506],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012795933,0.000096406315,0.0035651114,0.0000056818053,0.000012147151,0.00001556317,0.00081811124,0.00013267582,0.0057100425,0.11126256,0.0017372031,0.8766317],"study_design_scores_gemma":[0.0002799181,0.0004859912,0.03099397,0.000067663925,0.000010928723,0.00005814896,0.00066132814,0.08865018,0.8417555,0.0060477783,0.03036191,0.00062668335],"about_ca_topic_score_codex":0.000060558934,"about_ca_topic_score_gemma":0.00013399016,"teacher_disagreement_score":0.932234,"about_ca_system_score_codex":0.00006023616,"about_ca_system_score_gemma":0.000022659982,"threshold_uncertainty_score":0.3367375},"labels":[],"label_agreement":null},{"id":"W2104784127","doi":"","title":"A new algorithm for generating equilibria in massive zero-sum games","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nash equilibrium; Computer science; Measure (data warehouse); Range (aeronautics); Zero-sum game; Competition (biology); Abstraction; Zero (linguistics); Mathematical economics; Monopoly; Game theory; Combinatorial game theory; Turns, rounds and time-keeping systems in games; State (computer science); Sequential game; Theoretical computer science; Algorithm; Game mechanics; Artificial intelligence; Mathematics; Video game design; Economics","score_opus":0.036700570047294184,"score_gpt":0.3139890392549305,"score_spread":0.2772884692076363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104784127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008207214,0.00009419506,0.9878158,0.0006330328,0.0005418033,0.00028449332,8.008659e-7,0.0001495094,0.0022731838],"genre_scores_gemma":[0.0473946,0.0000027790143,0.9486708,0.000501789,0.0002726605,0.00001294102,0.000001016343,0.000011870419,0.0031315342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984665,0.000020652507,0.00040135346,0.00040832334,0.00019859256,0.0005045864],"domain_scores_gemma":[0.9990308,0.0003358289,0.0000799034,0.000347759,0.00007688582,0.00012881425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005706608,0.00013818723,0.00016059409,0.00014606147,0.000061632294,0.00017713374,0.0006812459,0.00007705174,0.00004359049],"category_scores_gemma":[0.0001207597,0.00012715957,0.00006835761,0.00037675534,0.000028955457,0.00050463027,0.00020758164,0.00009615813,0.00005895872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002708229,0.000016852331,0.00021022945,0.0000022092895,0.0000045779448,0.000013352922,0.0007573574,0.00023451891,0.006786483,0.032053296,0.0028339499,0.9570845],"study_design_scores_gemma":[0.000107373926,0.00007135908,0.00011952142,0.000014677056,0.0000015936351,0.0000045807296,0.00017405316,0.86222005,0.11124566,0.022970019,0.0028732007,0.0001978999],"about_ca_topic_score_codex":0.00025642192,"about_ca_topic_score_gemma":0.00024957498,"teacher_disagreement_score":0.9568866,"about_ca_system_score_codex":0.00006437625,"about_ca_system_score_gemma":0.00011636313,"threshold_uncertainty_score":0.5185417},"labels":[],"label_agreement":null},{"id":"W2105011545","doi":"","title":"Reinforcement of Local Pattern Cases for Playing Tetris.","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Reinforcement learning; Forgetting; Reinforcement; Computer science; Temporal difference learning; Artificial intelligence; Base (topology); Discounting; Machine learning; Mathematics; Engineering; Cognitive psychology; Psychology","score_opus":0.08052113224613068,"score_gpt":0.3037157008917632,"score_spread":0.22319456864563253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105011545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03611524,0.000030767522,0.9618511,0.00013943514,0.00016372772,0.00014564468,9.844397e-7,0.000059235717,0.0014938569],"genre_scores_gemma":[0.97890335,0.0000093085355,0.020338347,0.00025364218,0.000028822473,0.000014139357,6.962898e-7,0.000004038874,0.00044766496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991946,0.000008519922,0.00026700788,0.00016956982,0.00017949395,0.00018079716],"domain_scores_gemma":[0.9992382,0.00027315595,0.000066800385,0.00028449396,0.00009389605,0.000043471096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099713434,0.000072116745,0.000110406036,0.000063811225,0.00009279374,0.000014078632,0.0004195897,0.000028834907,0.00003718439],"category_scores_gemma":[0.000058213624,0.00006089566,0.00005899159,0.00013133377,0.000086508764,0.0002021566,0.00012022535,0.000033677305,0.000039602368],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032009146,0.00017665997,0.011871312,0.00007966418,0.0000551541,0.00013972886,0.004321711,0.016913557,0.002360073,0.058063142,0.013050892,0.8929361],"study_design_scores_gemma":[0.000120143064,0.0004040162,0.0004582328,0.00002311885,0.0000038742232,0.00008270603,0.00042851586,0.54170465,0.45232737,0.00078224664,0.0034483895,0.00021675466],"about_ca_topic_score_codex":0.0003152518,"about_ca_topic_score_gemma":0.000028752898,"teacher_disagreement_score":0.9427881,"about_ca_system_score_codex":0.000024236491,"about_ca_system_score_gemma":0.00004402106,"threshold_uncertainty_score":0.24832529},"labels":[],"label_agreement":null},{"id":"W2105676720","doi":"10.1109/itw.2010.5593380","title":"Using Markov decision theory to provide a fair challenge in a roll-and-move board game","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Adversary; Markov decision process; Simple (philosophy); Game theory; Artificial intelligence; Focus (optics); Markov chain; Management science; Game design; Markov process; Operations research; Machine learning; Mathematical economics; Computer security; Mathematics; Engineering","score_opus":0.03454065373321936,"score_gpt":0.31958781805161457,"score_spread":0.2850471643183952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105676720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39191377,0.0000354462,0.6026603,0.0010625729,0.0003217703,0.00027102616,3.0351478e-7,0.00009004392,0.0036447395],"genre_scores_gemma":[0.75025445,0.000007674365,0.2489412,0.0005217408,0.000052998515,0.000015166494,4.869895e-8,0.00000954214,0.00019721358],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846977,0.00007073231,0.0003127317,0.00052518304,0.0002679734,0.00035363363],"domain_scores_gemma":[0.99866134,0.00045670712,0.00005027097,0.0006083357,0.000065919914,0.00015742083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084437366,0.0001552419,0.00018339852,0.00022973686,0.00005504883,0.00018647622,0.0007650157,0.000103296254,0.00006564268],"category_scores_gemma":[0.0003740748,0.00012845387,0.000044851462,0.00034196553,0.00006722296,0.00049907307,0.00047841133,0.00025928117,0.00011272126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049961338,0.00007322372,0.0008318581,0.000005222604,0.000004200756,0.000029420882,0.0045818062,0.00016936407,0.007542036,0.15978767,0.00007042951,0.8268548],"study_design_scores_gemma":[0.000236861,0.0002336269,0.0037905348,0.000116666444,0.000005965149,0.000035883546,0.00080239313,0.40371975,0.02207547,0.55761176,0.0106898835,0.00068117137],"about_ca_topic_score_codex":0.00027550917,"about_ca_topic_score_gemma":0.0018818148,"teacher_disagreement_score":0.82617366,"about_ca_system_score_codex":0.000036833317,"about_ca_system_score_gemma":0.000077086144,"threshold_uncertainty_score":0.5238197},"labels":[],"label_agreement":null},{"id":"W2106226474","doi":"10.1007/978-3-642-31866-5_19","title":"Blunder Cost in Go and Hex","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tournament; Computer science; Point (geometry); Fixed point; Mathematical economics; Operations research; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.037397928329448805,"score_gpt":0.2816853625290097,"score_spread":0.24428743419956092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106226474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000330873,0.0013668346,0.9910894,0.0009448749,0.0014715944,0.0004504491,0.00000195751,0.00010153714,0.0042424616],"genre_scores_gemma":[0.69122446,0.00031242313,0.30369127,0.0032398896,0.0007915476,0.000025872556,0.0000026347213,0.00006184024,0.00065009005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996451,0.000039712297,0.00055419246,0.0013433712,0.0007480564,0.00086363894],"domain_scores_gemma":[0.99769115,0.00061389734,0.00019814886,0.0011387054,0.00013069085,0.00022739777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010292908,0.00048061492,0.00048525896,0.0008482868,0.00015449518,0.0005176058,0.0025868635,0.0003494941,0.000039218998],"category_scores_gemma":[0.00010394476,0.0004497995,0.00006899608,0.00058869505,0.0010847247,0.00095114054,0.001713587,0.00088244985,0.00014055055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026552423,0.000023921271,0.00074034574,0.000017611412,0.0000034729762,0.00004190927,0.0017344577,0.0032674014,0.00007225037,0.025004491,0.000014291716,0.96907717],"study_design_scores_gemma":[0.00017852585,0.00014333999,0.0012332646,0.0005665621,0.000007910236,0.00013347546,0.0000012203817,0.5302684,0.004059944,0.4547884,0.007232928,0.0013860745],"about_ca_topic_score_codex":0.00006500156,"about_ca_topic_score_gemma":0.00042189236,"teacher_disagreement_score":0.9676911,"about_ca_system_score_codex":0.00030786125,"about_ca_system_score_gemma":0.00030042732,"threshold_uncertainty_score":0.9997954},"labels":[],"label_agreement":null},{"id":"W2107243490","doi":"10.1016/j.tcs.2005.05.007","title":"Games on triangulations","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Artificial Intelligence in Medicine (Canada); University of New Brunswick","funders":"","keywords":"Combinatorial game theory; Computer science; Theoretical computer science; Variation (astronomy); Combinatorics; Position (finance); Time complexity; Mathematics; Game theory; Sequential game; Mathematical economics","score_opus":0.02323360527989452,"score_gpt":0.3010453241538673,"score_spread":0.27781171887397277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107243490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021996489,0.000014165059,0.9539289,0.006876128,0.0005421435,0.00013550106,5.908228e-7,0.00033297992,0.01617313],"genre_scores_gemma":[0.79677975,0.0000015892257,0.2013102,0.0015566972,0.00029826423,0.0000056066788,1.6203884e-7,0.000005194487,0.00004254427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976949,0.00007538723,0.0002899749,0.00066763884,0.00073755987,0.000534503],"domain_scores_gemma":[0.9981535,0.00038968836,0.00005538583,0.0009953412,0.00015577687,0.00025032158],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010289645,0.00015818312,0.00015028442,0.0002433235,0.0004308561,0.00049253734,0.002708256,0.000043522155,0.00014112127],"category_scores_gemma":[0.00018559897,0.00012817362,0.00007004821,0.0011595036,0.002169543,0.0008572542,0.00057657977,0.00017889842,0.0012716032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026999953,0.00004609634,0.000010976215,4.4289104e-7,0.0000010281373,0.0000021578999,0.00033370242,0.0016673943,0.00016713154,0.751806,0.00013432914,0.24582803],"study_design_scores_gemma":[0.00006170191,0.00015925334,0.00044022803,0.000013364289,0.0000016001478,0.000012645361,0.0000051262646,0.7731347,0.023944333,0.19977278,0.002265532,0.00018874263],"about_ca_topic_score_codex":0.0000015395567,"about_ca_topic_score_gemma":9.706217e-7,"teacher_disagreement_score":0.77478325,"about_ca_system_score_codex":0.000085628664,"about_ca_system_score_gemma":0.000104427985,"threshold_uncertainty_score":0.999506},"labels":[],"label_agreement":null},{"id":"W2107397894","doi":"10.1016/s0004-3702(01)00085-6","title":"Partial order bounding: A new approach to evaluation in game tree search","year":2001,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounding overwatch; Order (exchange); Computer science; Tree (set theory); Artificial intelligence; Mathematics; Combinatorics; Economics","score_opus":0.24262151392340375,"score_gpt":0.3917934106083933,"score_spread":0.14917189668498954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107397894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07640362,0.00007343533,0.90482765,0.002663438,0.000722355,0.0009356015,7.1428815e-7,0.00018613931,0.014187047],"genre_scores_gemma":[0.9584218,0.000023974131,0.039812878,0.0005221638,0.00041776703,0.00011902647,0.000004351558,0.000027581551,0.0006504344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952352,0.0003450034,0.000955636,0.0012073811,0.0012431759,0.0010135727],"domain_scores_gemma":[0.9976534,0.00027236345,0.00010531575,0.001114461,0.00041575756,0.00043868963],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002484362,0.00032685738,0.00033925744,0.0005933204,0.00017579287,0.0006091675,0.0019279933,0.00016501069,0.00035172392],"category_scores_gemma":[0.0011338352,0.00033981452,0.00010197201,0.0038188505,0.0001461385,0.0009236894,0.0004234566,0.00039685477,0.0033765459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065602406,0.0003402676,0.0006673586,0.0000044062417,0.000009732432,0.000019621082,0.009137491,0.05758871,0.0016936448,0.19598454,0.0003392833,0.73414934],"study_design_scores_gemma":[0.00003817476,0.00013669448,0.00036444727,0.0000347285,0.000009533509,0.000025220248,0.0010603553,0.84595156,0.04950773,0.098052055,0.0043383273,0.0004811998],"about_ca_topic_score_codex":0.0014886383,"about_ca_topic_score_gemma":0.0014403787,"teacher_disagreement_score":0.8820182,"about_ca_system_score_codex":0.00032361588,"about_ca_system_score_gemma":0.0005882401,"threshold_uncertainty_score":0.9999054},"labels":[],"label_agreement":null},{"id":"W2110045670","doi":"10.1007/11674399_7","title":"An Improved Safety Solver for Computer Go","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Solver; Computer science; Problem solver; Position (finance); Function (biology); Algorithm; Mathematical optimization; Computational science; Mathematics; Programming language","score_opus":0.021593454050595744,"score_gpt":0.27291674599836024,"score_spread":0.2513232919477645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110045670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003186312,0.00016955828,0.99176127,0.0006565354,0.004000912,0.0011003902,0.00002629346,0.00039492466,0.0018582682],"genre_scores_gemma":[0.027626969,0.000016300766,0.9665762,0.002496422,0.002295001,0.000034752633,0.000030147843,0.000090198635,0.0008339851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940101,0.00004808644,0.0010641656,0.0026767622,0.0009547325,0.0012461686],"domain_scores_gemma":[0.9952601,0.00085926295,0.00047351056,0.0025117735,0.00059914525,0.0002961617],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012904034,0.0008663357,0.00082556915,0.00081007427,0.00051461504,0.0011481678,0.0062054074,0.00058924686,0.000028177634],"category_scores_gemma":[0.00006060963,0.0008143006,0.0003098234,0.00055129256,0.0011163946,0.0013243146,0.0012516933,0.00083173974,0.00008126504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020250267,0.00007322644,0.000028079487,0.00003545999,0.000013678253,0.000029514023,0.00049243815,0.110087365,0.0003944468,0.019789625,0.00033713135,0.8686988],"study_design_scores_gemma":[0.0001661783,0.00046620352,0.000048710637,0.00014375823,0.00000984554,0.000027283999,1.2038353e-7,0.86433285,0.0031953666,0.12193394,0.00876708,0.0009086656],"about_ca_topic_score_codex":0.000081355734,"about_ca_topic_score_gemma":0.00029728588,"teacher_disagreement_score":0.8677901,"about_ca_system_score_codex":0.00048334457,"about_ca_system_score_gemma":0.0006895979,"threshold_uncertainty_score":0.9998887},"labels":[],"label_agreement":null},{"id":"W2112168226","doi":"10.1007/11922155_20","title":"Optimization of a Billiard Player – Position Play","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Ball (mathematics); Dynamical billiards; Focus (optics); Plan (archaeology); Optimization problem; Artificial intelligence; Human–computer interaction; Mathematical optimization; Operations research; Simulation; Algorithm; Mathematics","score_opus":0.01893790826202742,"score_gpt":0.254161185421682,"score_spread":0.23522327715965455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112168226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007668281,0.00018620832,0.99296117,0.000412369,0.001229884,0.00033999182,0.0000072651665,0.00012372535,0.0046627154],"genre_scores_gemma":[0.19816795,0.000034121178,0.800441,0.0005471026,0.00038376692,0.000008394693,0.000013343763,0.000038791903,0.00036547473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663806,0.00003297782,0.000719097,0.0011363273,0.0010032137,0.00047032273],"domain_scores_gemma":[0.9975784,0.00037141968,0.00045844598,0.0011005265,0.0003984444,0.000092805094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005765204,0.00041084725,0.00046326334,0.0009133171,0.00015095253,0.0002789229,0.0024398824,0.0003451102,0.000034873094],"category_scores_gemma":[0.00007223944,0.00038199103,0.00013541183,0.0006795433,0.00071104214,0.00069792155,0.0007112811,0.00045076438,0.000032829063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038067167,0.00002455194,0.00003123445,0.000015174383,0.000004870621,0.00002251768,0.00030994083,0.86711395,0.00022050185,0.011788468,0.000048662263,0.12041632],"study_design_scores_gemma":[0.000061156294,0.00014346954,0.000036490143,0.00028480103,0.0000067586907,0.000029895322,9.744645e-8,0.90562135,0.0154593205,0.07766702,0.00026785917,0.00042178118],"about_ca_topic_score_codex":0.00007026176,"about_ca_topic_score_gemma":0.000050575916,"teacher_disagreement_score":0.19809127,"about_ca_system_score_codex":0.00025635585,"about_ca_system_score_gemma":0.00037494922,"threshold_uncertainty_score":0.9998632},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Software deployment; Load balancing (electrical power); Multimedia; Human–computer interaction; Software engineering","score_opus":0.0528076355882725,"score_gpt":0.2736525821452432,"score_spread":0.22084494655697068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112320870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04989692,0.000039017803,0.8902764,0.005611675,0.00034140167,0.00011522191,7.9652676e-7,0.00037600336,0.05334258],"genre_scores_gemma":[0.89671934,0.0000016259245,0.098121315,0.00073049346,0.000059072507,0.0000050508615,5.4186967e-7,0.000006460529,0.004356098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991248,0.000023567522,0.00011964484,0.00023861953,0.00027474202,0.00021862512],"domain_scores_gemma":[0.9991471,0.00002965299,0.000034833487,0.00046723153,0.00014969562,0.00017147942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016201046,0.00008893683,0.00009663305,0.00004530935,0.00004296733,0.00011978828,0.0006723525,0.000024775898,0.00003076082],"category_scores_gemma":[0.000022049171,0.000063218,0.000016461136,0.00027247018,0.00007878087,0.0002599291,0.00015059448,0.000068682886,0.0004971082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042279033,0.00029802712,0.055810954,0.000012443734,0.00006818726,0.00025276,0.012351699,0.0037104792,0.0014849704,0.749028,0.057772677,0.11916747],"study_design_scores_gemma":[0.0008266687,0.0022714038,0.005831494,0.00008615482,0.000024617979,0.0003162326,0.003553771,0.4006696,0.28517544,0.059081715,0.24008197,0.0020809318],"about_ca_topic_score_codex":0.00028584042,"about_ca_topic_score_gemma":0.0010989842,"teacher_disagreement_score":0.84682244,"about_ca_system_score_codex":0.000034732115,"about_ca_system_score_gemma":0.00011691725,"threshold_uncertainty_score":0.6389486},"labels":[],"label_agreement":null},{"id":"W2113474338","doi":"10.1109/cig.2008.5035619","title":"An evaluation of models for predicting opponent positions in first-person shooter video games","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hidden Markov model; Artificial intelligence; Cheating; Adversary; Video game; Machine learning; Fictitious play; Human intelligence; Human–computer interaction; Game theory; Computer security; Multimedia; Psychology","score_opus":0.1616356568821887,"score_gpt":0.3436679192584451,"score_spread":0.1820322623762564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113474338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3842012,0.000033519147,0.61396134,0.0005987493,0.00008088773,0.00033244575,0.000002482391,0.00004769215,0.0007417067],"genre_scores_gemma":[0.94573325,0.000006664306,0.053996693,0.000084665015,0.000033930526,0.00010357286,0.0000034844181,0.000005897576,0.000031857828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878156,0.00007142904,0.00028135965,0.00028282628,0.00039971026,0.00018309809],"domain_scores_gemma":[0.9990886,0.0001459985,0.000072851784,0.00034461738,0.00029801743,0.00004993459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071685715,0.00008315318,0.00011551013,0.00014324552,0.00010863778,0.000029355015,0.00038450523,0.000049302835,0.000026635185],"category_scores_gemma":[0.00008966059,0.00007856741,0.000051176907,0.00019556555,0.00004690902,0.0010243584,0.00003561605,0.000051058778,0.0000040346404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025296064,0.00046963035,0.0066964086,0.000020889585,0.00001906329,0.0000027045146,0.028513977,0.8742468,0.0046583447,0.03242629,0.0005840188,0.052336585],"study_design_scores_gemma":[0.000098173085,0.00011518865,0.0017899041,0.00002626133,0.000006661934,0.000004914318,0.00041104856,0.965554,0.020546399,0.011354115,0.000009183462,0.00008414039],"about_ca_topic_score_codex":0.0003204236,"about_ca_topic_score_gemma":0.00032971305,"teacher_disagreement_score":0.561532,"about_ca_system_score_codex":0.000080786194,"about_ca_system_score_gemma":0.000089203946,"threshold_uncertainty_score":0.32038862},"labels":[],"label_agreement":null},{"id":"W2114336530","doi":"10.1007/s13218-010-0081-8","title":"A GGP Feature Learning Algorithm","year":2011,"lang":"de","type":"article","venue":"KI - Künstliche Intelligenz","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Feature (linguistics); Computer science; Artificial intelligence; Simple (philosophy); Algorithm; Machine learning; Quality (philosophy)","score_opus":0.0644535964446665,"score_gpt":0.28788759482533405,"score_spread":0.22343399838066755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114336530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018026849,0.017105283,0.933032,0.001372726,0.011854655,0.0009765996,0.000034440658,0.0012700442,0.03255158],"genre_scores_gemma":[0.4531605,0.0075600524,0.446201,0.004263278,0.008394563,0.00025130017,0.00009227727,0.0006685493,0.07940847],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.992534,0.00064111035,0.0013616835,0.002125003,0.0012500216,0.0020882252],"domain_scores_gemma":[0.9950098,0.00052170426,0.0007176487,0.0021690452,0.0007670256,0.00081478764],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014533425,0.0011688503,0.0009983844,0.00057938776,0.0007949644,0.0008411304,0.0043395828,0.0010221661,0.0028538506],"category_scores_gemma":[0.00077017874,0.0011805899,0.000692728,0.0019683454,0.0008183851,0.0011793511,0.0015514104,0.0028546255,0.031112075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005469307,0.00056897546,0.0014421677,0.000072647505,0.00047388478,0.00058976526,0.03325447,0.0001859625,0.0005101577,0.019628128,0.019347752,0.9238714],"study_design_scores_gemma":[0.00017221896,0.0010586253,0.0006410039,0.00043818326,0.0002792894,0.00015551051,0.002894315,0.18250343,0.148504,0.014779334,0.6462194,0.0023547225],"about_ca_topic_score_codex":0.000964825,"about_ca_topic_score_gemma":0.00010584873,"teacher_disagreement_score":0.92151666,"about_ca_system_score_codex":0.00031926183,"about_ca_system_score_gemma":0.0004759273,"threshold_uncertainty_score":0.99944586},"labels":[],"label_agreement":null},{"id":"W2114656401","doi":"10.1145/2159365.2159408","title":"Descriptions","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Game programming; Multimedia; Video game development; Video game; Game art design; Programming language; Game Developer; Game design; World Wide Web; Human–computer interaction; Game design document","score_opus":0.14786236659696125,"score_gpt":0.27933516811643927,"score_spread":0.13147280151947802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114656401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030629567,0.000007899376,0.7733017,0.00011294221,0.00019043186,0.000020751326,4.0289617e-8,0.00017734327,0.2231259],"genre_scores_gemma":[0.763344,0.0000015771332,0.23447096,0.0002588076,0.0000118294965,0.000003328564,2.9557969e-8,0.0000014246588,0.0019080506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996631,0.000008596657,0.000069857735,0.00010429373,0.000056285076,0.00009782845],"domain_scores_gemma":[0.99965173,0.000010148338,0.000010561235,0.0002635243,0.000028498796,0.000035565652],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005458232,0.00003105927,0.000027066779,0.000030242825,0.000040702405,0.000027560322,0.00045891744,0.000013957238,0.00044833485],"category_scores_gemma":[0.000014730195,0.000025761006,0.000018821087,0.000121889505,0.000026085623,0.0003105052,0.00008420336,0.000027386479,0.0015006925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.9861474e-7,0.000018610275,0.00065772986,1.9783761e-7,0.0000012738665,0.0000023249033,0.0011459303,7.319125e-7,0.00028685326,0.96159804,0.0013052298,0.034982897],"study_design_scores_gemma":[0.000030338411,0.00010425867,0.010115833,0.0000058097285,0.0000030844733,0.000023734538,0.0004144538,0.038048495,0.2726158,0.65501684,0.023299517,0.0003218276],"about_ca_topic_score_codex":0.000092798226,"about_ca_topic_score_gemma":0.00002594839,"teacher_disagreement_score":0.760281,"about_ca_system_score_codex":0.000005954038,"about_ca_system_score_gemma":0.000011269834,"threshold_uncertainty_score":0.99927676},"labels":[],"label_agreement":null},{"id":"W2114735315","doi":"","title":"Bootstrapping from Game Tree Search","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Evaluation function; Beam search; Heuristic; Computer science; Search algorithm; Artificial intelligence; Null-move heuristic; Bootstrapping (finance); Search tree; Function (biology); Best-first search; Outcome (game theory); Tree (set theory); Node (physics); Machine learning; Algorithm; Mathematics; Engineering","score_opus":0.061774324301722056,"score_gpt":0.3135268052003696,"score_spread":0.25175248089864755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114735315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07300913,0.000060860842,0.8777428,0.003481227,0.00014499357,0.000065086344,4.073328e-7,0.00029786333,0.045197614],"genre_scores_gemma":[0.9745878,0.000007483186,0.023174088,0.0011549275,0.00010488151,0.0000011572344,5.815643e-7,0.000002890046,0.0009661961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989653,0.00003063252,0.00017186042,0.0003086644,0.00025211464,0.00027139447],"domain_scores_gemma":[0.9992712,0.0000940068,0.00002050111,0.00048212725,0.000044557702,0.00008760256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012399956,0.000086592816,0.000095177056,0.000063630316,0.000051406263,0.00019052839,0.0009045888,0.000043000324,0.0001748934],"category_scores_gemma":[0.00002449095,0.000076337354,0.000048375707,0.0002453332,0.00003352711,0.0004094966,0.00008748806,0.0001118908,0.0007210716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029855528,0.00005646878,0.00046989176,6.048048e-7,0.0000071216996,0.000025514822,0.0015679325,0.00045610793,0.013703693,0.12593868,0.0014097403,0.85636127],"study_design_scores_gemma":[0.000084927226,0.00019124059,0.022872768,0.000024525878,0.0000032650516,0.0000063435155,0.000296516,0.49198017,0.30446124,0.17270783,0.006954708,0.00041645605],"about_ca_topic_score_codex":0.00020495363,"about_ca_topic_score_gemma":0.000038781436,"teacher_disagreement_score":0.90157866,"about_ca_system_score_codex":0.000022667366,"about_ca_system_score_gemma":0.000035747787,"threshold_uncertainty_score":0.92681575},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05366474124327942,"score_gpt":0.30969076569125964,"score_spread":0.2560260244479802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114793692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37917313,0.000014006968,0.6039934,0.0018611582,0.0009806869,0.00050735887,0.0000029588919,0.00022659202,0.013240653],"genre_scores_gemma":[0.9846784,0.000014681268,0.0147765055,0.0003677846,0.00010910249,0.000017128083,6.138098e-7,0.000012462737,0.000023363717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975267,0.000044636734,0.0008788415,0.00042454494,0.00065673894,0.00046851728],"domain_scores_gemma":[0.9976628,0.00019318494,0.0006676159,0.00044033225,0.0009246652,0.000111439535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951126,0.00029180894,0.00030900314,0.00026388862,0.00038581554,0.0006333635,0.002238525,0.00013214022,0.000059690476],"category_scores_gemma":[0.0008539945,0.00023220066,0.00017448803,0.0008032338,0.00030384256,0.0022087707,0.00049452845,0.00033513826,0.000201473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002694909,0.000058381476,0.00022427314,0.000033583245,0.000010594617,9.64569e-8,0.0016057703,0.00080564583,0.067797415,0.7776586,0.00007316985,0.15170553],"study_design_scores_gemma":[0.000009964339,0.000117115276,0.00008736813,0.00015475418,0.000008633204,0.000006171011,0.00033599252,0.40509665,0.47777185,0.11612077,0.00010623878,0.00018450976],"about_ca_topic_score_codex":0.00009535409,"about_ca_topic_score_gemma":0.000007842199,"teacher_disagreement_score":0.6615378,"about_ca_system_score_codex":0.000101356534,"about_ca_system_score_gemma":0.00009749853,"threshold_uncertainty_score":0.9468868},"labels":[],"label_agreement":null},{"id":"W2115451979","doi":"10.1109/tciaig.2014.2346690","title":"Automated Planning and Player Modeling for Interactive Storytelling","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Storytelling; Interactive storytelling; Planner; Entertainment; Narrative; Human–computer interaction; Multimedia; Automated planning and scheduling; Agency (philosophy); Perception; Domain (mathematical analysis); Process (computing); Artificial intelligence","score_opus":0.046527835226701134,"score_gpt":0.3296732094588575,"score_spread":0.28314537423215635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115451979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034289632,0.00009796859,0.96420294,0.00051396794,0.0003752767,0.00023702609,0.0000043054238,0.0002266308,0.000052258412],"genre_scores_gemma":[0.94294775,0.000028391065,0.056322165,0.00057072984,0.000035719113,0.000055492925,0.0000016354326,0.000014306972,0.000023823239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852884,0.00007076479,0.00041467874,0.00051820406,0.00019973585,0.0002678027],"domain_scores_gemma":[0.998267,0.0012648099,0.00007499756,0.00014930672,0.00015525808,0.000088645655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033428828,0.00020622676,0.00022020847,0.0003595643,0.00023245327,0.0002046303,0.00025965873,0.00008726198,0.000004745259],"category_scores_gemma":[0.00003159607,0.00021014307,0.00005527639,0.00024450262,0.00010136824,0.00064905174,0.0000068365057,0.00027454365,0.000010008466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003186774,0.000053480995,0.000029629055,0.000015300988,0.000015378571,0.0000014715204,0.0022314873,0.8811362,0.000051398267,0.0049829404,0.0000115545745,0.11143928],"study_design_scores_gemma":[0.00007544874,0.00015769045,0.00003836401,0.0001501656,0.0000065355543,0.000013498146,0.00043213312,0.95542324,0.004964441,0.03844558,0.00007203501,0.00022085884],"about_ca_topic_score_codex":0.00003340886,"about_ca_topic_score_gemma":0.000016717482,"teacher_disagreement_score":0.9086581,"about_ca_system_score_codex":0.000047543104,"about_ca_system_score_gemma":0.000043269814,"threshold_uncertainty_score":0.8569386},"labels":[],"label_agreement":null},{"id":"W2115498309","doi":"10.1016/j.disc.2005.10.013","title":"On the biased <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si9.gif\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math>-in-a-row game","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Order (exchange); Scroll; Combinatorics; Limit (mathematics); Discrete mathematics; Mathematical analysis; Theology; Philosophy","score_opus":0.030854778058483547,"score_gpt":0.26731498438581824,"score_spread":0.2364602063273347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115498309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9567944,0.00011880439,0.030116959,0.0019795392,0.00048134723,0.00013616722,0.000020440648,0.00023637182,0.01011598],"genre_scores_gemma":[0.9809369,0.00006488619,0.016704783,0.0014737064,0.00030930724,0.00014993474,0.000013307707,0.00009292404,0.00025424064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662507,0.000105953746,0.0008517299,0.00063584186,0.0009874032,0.00079399615],"domain_scores_gemma":[0.9962968,0.0012416864,0.0005013555,0.0017004344,0.00006658648,0.00019309306],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010753432,0.00039363914,0.0002796978,0.00014427227,0.00034982126,0.00060049654,0.0017919904,0.00030894627,0.00015771824],"category_scores_gemma":[0.000806542,0.00036396636,0.00038080825,0.0005033729,0.0003371584,0.00058287027,0.00062085805,0.0005393404,0.0033823834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025323718,0.00016256733,0.000004578545,0.000091739435,0.00005745593,0.000068352834,0.0058375574,0.0020106533,0.00041594947,0.98756653,0.001167839,0.0025914614],"study_design_scores_gemma":[0.00015669929,0.00019838975,0.000014245934,0.0003448651,0.000042679814,0.000056302448,0.00096203625,0.9462974,0.027669689,0.022129659,0.0017507832,0.0003772733],"about_ca_topic_score_codex":0.000081275546,"about_ca_topic_score_gemma":0.00013217663,"teacher_disagreement_score":0.9654369,"about_ca_system_score_codex":0.000035615256,"about_ca_system_score_gemma":0.00018911659,"threshold_uncertainty_score":0.9998812},"labels":[],"label_agreement":null},{"id":"W2115867107","doi":"10.1109/tciaig.2013.2290088","title":"Analysis of ReGEN as a Graph-Rewriting System for Quest Generation","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Narrative; Computer science; Rewriting; Context (archaeology); Graph; Video game; Graph rewriting; Representation (politics); Multimedia; Human–computer interaction; Theoretical computer science; Programming language","score_opus":0.03904835426595322,"score_gpt":0.30680727847253203,"score_spread":0.2677589242065788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115867107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064939566,0.000087588014,0.93355644,0.00061194575,0.00024625534,0.00039280887,0.000012649053,0.00006710374,0.00008567385],"genre_scores_gemma":[0.97207415,0.000035299156,0.027361827,0.0002519415,0.00003070989,0.0001821388,0.000007127387,0.000009104239,0.000047714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983116,0.00007830468,0.0006501852,0.0004548727,0.00028484414,0.00022022663],"domain_scores_gemma":[0.9985044,0.00061684835,0.00015394649,0.00023109435,0.00042004374,0.00007367836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029273084,0.0001707191,0.00030478413,0.00087104883,0.00015123577,0.0001683037,0.00033455095,0.000084196916,0.000024567902],"category_scores_gemma":[0.000020232754,0.00017071162,0.00016929819,0.0012740853,0.00011803302,0.00060257805,0.000004375978,0.00013421309,0.000024684035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075658722,0.00009306151,0.00009634229,0.000029564157,0.00013147578,0.0000011699948,0.00084501575,0.8467346,0.0005732252,0.030338176,0.00002080758,0.12112901],"study_design_scores_gemma":[0.00004067803,0.00013637662,0.0002745963,0.000070923576,0.00006137026,0.0000056609533,0.00063276675,0.9411672,0.042897504,0.014532029,0.000012160263,0.00016873535],"about_ca_topic_score_codex":0.00053536304,"about_ca_topic_score_gemma":0.00018705928,"teacher_disagreement_score":0.9071346,"about_ca_system_score_codex":0.000059432066,"about_ca_system_score_gemma":0.00006845267,"threshold_uncertainty_score":0.6961418},"labels":[],"label_agreement":null},{"id":"W2116123331","doi":"","title":"A general solution to the graph history interaction problem","year":2004,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Correctness; Computer science; Graph; Theoretical computer science; Overhead (engineering); Algorithm; Programming language","score_opus":0.046600271554238806,"score_gpt":0.2794680005227006,"score_spread":0.2328677289684618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116123331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094486205,0.00004993258,0.9669109,0.011009081,0.0010716852,0.00017841271,9.837239e-8,0.00017848454,0.0111528095],"genre_scores_gemma":[0.8818224,0.0000056538197,0.112594396,0.0030310594,0.0001755595,0.00004708542,3.545677e-7,0.0000059069953,0.0023175827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992725,0.00002266318,0.00014926086,0.00021808788,0.00016324024,0.0001742011],"domain_scores_gemma":[0.9994931,0.000022179507,0.00003765587,0.00033545526,0.000060500264,0.000051095736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017540764,0.00007050513,0.00005031831,0.00007694333,0.000090650894,0.000058216083,0.0005496881,0.00002569651,0.00004703958],"category_scores_gemma":[0.000025827527,0.000048368616,0.00004521164,0.00019643133,0.000031399337,0.0004164788,0.00013322533,0.00008793796,0.00060692657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098229,0.00010589267,0.00007368662,0.000003756153,0.000012948575,0.000005378632,0.008739978,0.03685046,0.0154598085,0.7463154,0.043996066,0.1484268],"study_design_scores_gemma":[0.00013418385,0.0004927905,0.0012250022,0.00007308603,0.000011777631,0.00008405073,0.0004461553,0.083836295,0.09287227,0.18104194,0.63906837,0.0007140943],"about_ca_topic_score_codex":0.0011273549,"about_ca_topic_score_gemma":0.0011797398,"teacher_disagreement_score":0.87237376,"about_ca_system_score_codex":0.00036395233,"about_ca_system_score_gemma":0.000066567125,"threshold_uncertainty_score":0.78010154},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010368082131558508,"score_gpt":0.24754596782144508,"score_spread":0.23717788568988657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119296376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060481906,0.00021434945,0.93153447,0.0008903741,0.000114412134,0.00009133191,4.635639e-7,0.00044353164,0.006229147],"genre_scores_gemma":[0.96907437,0.0000016981406,0.02848195,0.00025063107,0.00006475137,0.0000073041447,0.0000029797682,0.000019563642,0.0020967766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986787,0.00009801167,0.00020698756,0.00038735566,0.0002718607,0.00035708916],"domain_scores_gemma":[0.9993958,0.0000892896,0.000115411916,0.00027559305,0.00007649699,0.000047437403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002392487,0.00016154756,0.00014922477,0.00011034481,0.00020885549,0.00021190847,0.0005059295,0.000041384967,0.000033261662],"category_scores_gemma":[0.000052614512,0.0001358463,0.00004191509,0.00038264066,0.00007000623,0.00044641702,0.00017804481,0.00041502272,0.00014198288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000459942,0.0001152778,0.074227706,0.000017112156,0.000037905444,0.00021631068,0.0027855986,0.60673714,0.004028623,0.07598835,0.00024341655,0.23555657],"study_design_scores_gemma":[0.000065673754,0.00015300894,0.0027167695,0.000031074702,0.0000041692797,0.000028859027,0.00008351883,0.98800194,0.00096278643,0.0034857185,0.00425976,0.00020671343],"about_ca_topic_score_codex":0.00097381824,"about_ca_topic_score_gemma":0.00051278766,"teacher_disagreement_score":0.90859246,"about_ca_system_score_codex":0.000060337064,"about_ca_system_score_gemma":0.000034177556,"threshold_uncertainty_score":0.55396515},"labels":[],"label_agreement":null},{"id":"W2119409773","doi":"10.48550/arxiv.1203.1633","title":"The Complexity of the Puzzles of Final Fantasy XIII-2","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Fantasy; Mathematical economics; Economics; Art; Literature","score_opus":0.26030224689479653,"score_gpt":0.2343077495961803,"score_spread":0.02599449729861622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119409773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6216285,0.0002989158,0.36810482,0.00074314984,0.0019013447,0.0005054332,0.000040856576,0.00008790515,0.006689071],"genre_scores_gemma":[0.9984792,0.00010005486,0.0007368285,0.000024091316,0.000048884274,4.698858e-7,0.000001080702,0.000007401085,0.0006020212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985474,0.00024140535,0.00031143075,0.00043038547,0.00016359014,0.0003058116],"domain_scores_gemma":[0.9969965,0.0003046137,0.0005829181,0.0018111389,0.00023770353,0.000067102505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044828255,0.0002007283,0.00027715095,0.00006860721,0.0002457999,0.0000442609,0.004509631,0.00015226797,0.00002103747],"category_scores_gemma":[0.000087649016,0.00014077598,0.00029961622,0.0004405071,0.0017016392,0.00019102806,0.0037402352,0.00044674583,0.00002556337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019236419,0.00007950244,0.006620026,0.000041876512,0.00006014176,0.000004552635,0.0005790708,0.012879919,0.00014089159,0.9777305,0.00019994736,0.0016443435],"study_design_scores_gemma":[0.00014228097,0.00005059892,0.025154362,0.00022176086,0.00012463865,0.000006067647,0.00052133156,0.1902571,0.031534594,0.74924415,0.0022136427,0.0005294439],"about_ca_topic_score_codex":0.00039461523,"about_ca_topic_score_gemma":0.00031054215,"teacher_disagreement_score":0.37685063,"about_ca_system_score_codex":0.000073162446,"about_ca_system_score_gemma":0.00019135984,"threshold_uncertainty_score":0.8380091},"labels":[],"label_agreement":null},{"id":"W2119449734","doi":"10.5281/zenodo.7949826","title":"Vertex deletion games with parity rules","year":2005,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Parity (physics); Feedback vertex set; Undirected graph; Combinatorial game theory; Graph; Neighbourhood (mathematics); Discrete mathematics; Sequential game; Game theory; Mathematical economics","score_opus":0.03686037197315816,"score_gpt":0.2550208498718524,"score_spread":0.21816047789869425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119449734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09088156,0.0001680183,0.7697474,0.006433865,0.00016724599,0.00055047916,0.000038230635,0.0029816781,0.12903155],"genre_scores_gemma":[0.9854692,0.000054177723,0.012931295,0.0003193585,0.00013444769,4.7238615e-8,0.000113245944,0.00044658416,0.0005316147],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844587,0.00018974475,0.00020223316,0.00042369112,0.00039666102,0.000341805],"domain_scores_gemma":[0.99872035,0.000028934905,0.00008085377,0.0005727898,0.00045611794,0.00014095253],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004572444,0.00012367254,0.00010836376,0.00014647738,0.0012821109,0.0010431922,0.0015927701,0.000047666355,0.00241761],"category_scores_gemma":[0.00026354348,0.0001142158,0.000033141554,0.00043029318,0.00016703532,0.00080770266,0.00085532846,0.0001991482,0.013348743],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029565203,0.00014464348,0.000012426949,0.000013853048,0.000021347203,0.000010513904,0.0016900825,0.00044415318,0.001332797,0.07241231,0.055456273,0.86843204],"study_design_scores_gemma":[0.000120882156,0.00019956278,0.00061426987,0.000022343387,0.0000048284487,0.00009197807,0.0001169339,0.017224438,0.0043627387,0.0013455711,0.975706,0.00019046155],"about_ca_topic_score_codex":0.000017426655,"about_ca_topic_score_gemma":0.0000016788641,"teacher_disagreement_score":0.9202497,"about_ca_system_score_codex":0.000120750825,"about_ca_system_score_gemma":0.000005011706,"threshold_uncertainty_score":0.9999938},"labels":[],"label_agreement":null},{"id":"W2119670089","doi":"10.1007/978-3-540-74915-8_39","title":"Game Characterizations and the PSPACE-Completeness of Tree Resolution Space","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Completeness (order theory); PSPACE; Tree (set theory); Computer science; Space (punctuation); Resolution (logic); Mathematics; Programming language; Algorithm; Combinatorics; Operating system; Computational complexity theory","score_opus":0.037834759826331055,"score_gpt":0.2752767526982613,"score_spread":0.23744199287193024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119670089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036889847,0.0004698636,0.99273926,0.0024760566,0.00095763407,0.0004529045,0.0000046914997,0.00007674381,0.0024539728],"genre_scores_gemma":[0.7259888,0.0002915761,0.27109295,0.0013570844,0.0006024111,0.000015275511,0.0000068778236,0.000048880735,0.0005961142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701095,0.00006630965,0.0006317366,0.000960953,0.00083638506,0.000493656],"domain_scores_gemma":[0.9966506,0.0011536113,0.0004801284,0.001260202,0.00035040814,0.00010505162],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014511339,0.00037314437,0.0005331132,0.0006634096,0.0002386511,0.00031127039,0.0024535733,0.00023566792,0.000009187518],"category_scores_gemma":[0.0002107734,0.00027652073,0.00011069004,0.00074522634,0.0030726155,0.00047854666,0.0011336061,0.00053879165,0.000014009756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029875402,0.00002350509,0.000099053825,0.000038753566,0.000013436857,0.00002057335,0.003331987,0.009651495,0.0005051035,0.42419958,0.0000071686813,0.5620795],"study_design_scores_gemma":[0.00023398579,0.00010431136,0.00069082074,0.00038787213,0.000013948555,0.000066913744,0.0000011638342,0.74113524,0.0048530926,0.25020975,0.0018312939,0.0004716481],"about_ca_topic_score_codex":0.00007808962,"about_ca_topic_score_gemma":0.0002596496,"teacher_disagreement_score":0.7314837,"about_ca_system_score_codex":0.00011919925,"about_ca_system_score_gemma":0.00026519585,"threshold_uncertainty_score":0.9999687},"labels":[],"label_agreement":null},{"id":"W2121229460","doi":"10.1145/1160633.1160761","title":"Robust game play against unknown opponents","year":2006,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.044724679747160254,"score_gpt":0.25533168493866454,"score_spread":0.21060700519150427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121229460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100837566,0.000056155575,0.7818975,0.0010300995,0.000614595,0.0001261828,8.5887035e-7,0.00046033022,0.11497673],"genre_scores_gemma":[0.95733345,0.0000060727243,0.032409843,0.0005801784,0.00017013581,0.000008877907,0.0000029157936,0.000010474545,0.009478069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865353,0.00003478308,0.00028067437,0.0003806824,0.00029369618,0.00035665324],"domain_scores_gemma":[0.9991688,0.00007695441,0.000059724414,0.0005432034,0.00007258169,0.00007873726],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016092388,0.00013811066,0.00012318062,0.00008903548,0.00008341919,0.00021119886,0.0010053422,0.00006365619,0.00010556102],"category_scores_gemma":[0.000027685974,0.000119386386,0.00006389136,0.0003086823,0.000068705485,0.0004930365,0.00024833842,0.00010094421,0.0012268969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005691635,0.00032596814,0.0043044263,0.000007928786,0.00001801185,0.000102674996,0.000492716,0.048274767,0.009130908,0.77095777,0.0384752,0.12790391],"study_design_scores_gemma":[0.00022291261,0.000105919506,0.011538784,0.00004550135,0.0000072282933,0.000024462455,0.00008735831,0.6665778,0.10785602,0.044926662,0.16757332,0.0010339908],"about_ca_topic_score_codex":0.00021995808,"about_ca_topic_score_gemma":0.00017003139,"teacher_disagreement_score":0.85649586,"about_ca_system_score_codex":0.000045647717,"about_ca_system_score_gemma":0.000040218518,"threshold_uncertainty_score":0.99955076},"labels":[],"label_agreement":null},{"id":"W2121328774","doi":"","title":"Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions","year":2012,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Counterfactual thinking; Computer science; Monte Carlo tree search; Regret; Monte Carlo method; Mathematical optimization; Game tree; Thompson sampling; Limit (mathematics); Minification; Tree (set theory); Algorithm; Mathematics; Game theory; Repeated game; Machine learning; Mathematical economics; Statistics","score_opus":0.03613825230177032,"score_gpt":0.27688978012022736,"score_spread":0.24075152781845705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121328774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5994927,0.00029467035,0.39650413,0.00029533936,0.0010445707,0.0004798117,0.0000046169616,0.00029199655,0.0015921197],"genre_scores_gemma":[0.9985308,0.000002324427,0.0010478948,0.00014634918,0.00008326397,0.00006677184,0.0000041090375,0.000008438375,0.000110031055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983499,0.00005812383,0.00058902445,0.00015278195,0.00046840854,0.00038177078],"domain_scores_gemma":[0.99898124,0.000054244592,0.0003667512,0.00026140115,0.00024319494,0.000093170136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003018792,0.00017463411,0.00017381081,0.00028237407,0.00018485694,0.0006319874,0.00034795387,0.000084412575,0.000004374629],"category_scores_gemma":[0.00005433799,0.00013869724,0.00002938258,0.0005879015,0.000052316736,0.0046495614,0.00005704898,0.0001709925,0.000076494296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036391393,0.00007355898,0.0076111387,0.00018348558,0.000010048412,0.0000018243321,0.03354396,0.92466813,0.0000664827,0.0022257145,0.000533551,0.031045724],"study_design_scores_gemma":[0.000111712805,0.00004089285,0.0019311005,0.00014744548,0.0000044813683,0.00006809832,0.0026907674,0.9916565,0.00061422173,0.0000032901162,0.0025460648,0.00018544261],"about_ca_topic_score_codex":0.00013268917,"about_ca_topic_score_gemma":0.000013715649,"teacher_disagreement_score":0.39903808,"about_ca_system_score_codex":0.00015695338,"about_ca_system_score_gemma":0.00007887545,"threshold_uncertainty_score":0.6094269},"labels":[],"label_agreement":null},{"id":"W2121513215","doi":"10.5555/2484920.2484965","title":"Evaluating state-space abstractions in extensive-form games","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Abstraction; Metric (unit); Domain (mathematical analysis); Perfect information; Theoretical computer science; Focus (optics); Task (project management); State (computer science); Quality (philosophy); State space; Space (punctuation); Artificial intelligence; Algorithm; Mathematics","score_opus":0.08231356342286796,"score_gpt":0.3665186465027483,"score_spread":0.28420508307988035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121513215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7352336,0.000050800776,0.24279849,0.005446776,0.00040773817,0.0003861253,3.7115313e-7,0.0002598176,0.0154162785],"genre_scores_gemma":[0.9094185,0.00001219517,0.08647039,0.00049670617,0.000028097678,0.000054870576,3.033527e-7,0.000007213369,0.003511707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987506,0.000038820617,0.0003011291,0.00031309458,0.00026713184,0.000329219],"domain_scores_gemma":[0.99890876,0.000273376,0.00007549306,0.00043115488,0.00023322349,0.00007800779],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030898993,0.000108692075,0.00011455574,0.0001340697,0.00007958419,0.00024087832,0.00049095403,0.000038061506,0.0006037652],"category_scores_gemma":[0.00022260379,0.000094286814,0.000037538703,0.00029978543,0.000050847022,0.0018082327,0.00015626055,0.00015974841,0.002985038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027687481,0.00013835277,0.0040790765,0.000009073192,0.000012127841,0.000015585678,0.004724679,0.013362013,0.016959311,0.058782794,0.0048745587,0.89703965],"study_design_scores_gemma":[0.0000828508,0.00011263056,0.050672956,0.000028668332,0.0000020770594,0.000014310383,0.001806042,0.8046408,0.03830045,0.102580234,0.0014024621,0.00035650635],"about_ca_topic_score_codex":0.0017390008,"about_ca_topic_score_gemma":0.00039728393,"teacher_disagreement_score":0.89668316,"about_ca_system_score_codex":0.00006540119,"about_ca_system_score_gemma":0.00006808678,"threshold_uncertainty_score":0.99779123},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03659273412157045,"score_gpt":0.30773480410735377,"score_spread":0.27114206998578333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123018439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43172768,0.00015558446,0.5167361,0.007962072,0.0005035772,0.0001683955,2.0449207e-7,0.000542487,0.042203903],"genre_scores_gemma":[0.9740448,0.00002663461,0.024690906,0.00087929214,0.000023102979,0.0000024954481,1.4613744e-7,0.000001397364,0.00033121838],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99933267,0.000020591982,0.00015915078,0.00021392576,0.00010649696,0.0001671523],"domain_scores_gemma":[0.9995615,0.00006837503,0.00003540678,0.00026038344,0.00005130765,0.000023031345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001274364,0.00006531562,0.00007733633,0.00009008887,0.000025878917,0.00007310144,0.0003317821,0.0000416582,0.000022262917],"category_scores_gemma":[0.000113184964,0.00005522672,0.00002461512,0.00019807527,0.000026740283,0.00051852886,0.00003915212,0.000087429085,0.00020629239],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003695134,0.00009568724,0.0010689051,8.8211254e-7,0.0000010021354,0.000116918185,0.0011152496,0.0006376186,0.005239822,0.11202275,0.00096345774,0.878734],"study_design_scores_gemma":[0.00007844939,0.00033645495,0.43719125,0.000024503712,0.0000015403962,0.00007950853,0.0014130727,0.03456466,0.14228901,0.3813343,0.0023006164,0.00038663275],"about_ca_topic_score_codex":0.000029953595,"about_ca_topic_score_gemma":0.000020021216,"teacher_disagreement_score":0.8783474,"about_ca_system_score_codex":0.00002495521,"about_ca_system_score_gemma":0.000015790547,"threshold_uncertainty_score":0.265154},"labels":[],"label_agreement":null},{"id":"W2124464337","doi":"10.1613/jair.2497","title":"Dynamic Control in Real-Time Heuristic Search","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Háskólinn í Reykjavík; Ministrstvo za visoko šolstvo, znanost in tehnologijo","keywords":"Computer science; Incremental heuristic search; Heuristic; Completeness (order theory); Bounded function; Action (physics); Constant (computer programming); Search problem; Mathematical optimization; Time complexity; State (computer science); Search algorithm; Beam search; Algorithm; Artificial intelligence; Mathematics","score_opus":0.1420727133656529,"score_gpt":0.4191170462261772,"score_spread":0.2770443328605243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124464337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46884462,0.00038283583,0.524943,0.0029919583,0.0005820617,0.00048045343,0.0000032611777,0.00006395473,0.0017078331],"genre_scores_gemma":[0.98633516,0.0010327651,0.012005683,0.000053139236,0.00020794028,0.000009409006,4.299676e-7,0.000027344831,0.00032815692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926937,0.0012165098,0.0018294529,0.00052960205,0.0024748072,0.0012558791],"domain_scores_gemma":[0.9938601,0.0025368484,0.0003009083,0.00078841107,0.002086584,0.00042709906],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008394702,0.00025224808,0.00061148906,0.0018842344,0.00041161026,0.0002644245,0.0030966254,0.00019252545,0.00022214456],"category_scores_gemma":[0.0019545753,0.00022709132,0.00023675503,0.0028235223,0.00093176536,0.0010646397,0.00035680676,0.0017039189,0.0013903083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014384552,0.0031397492,0.005352716,0.00010556764,0.00019189842,0.011930089,0.021925736,0.05135221,0.23571606,0.10561403,0.002671516,0.56056195],"study_design_scores_gemma":[0.0001171733,0.0015462812,0.0015406313,0.00022246345,0.0000076214715,0.0009356251,0.0015841927,0.85202724,0.057031523,0.08409059,0.00041010324,0.0004865841],"about_ca_topic_score_codex":0.00037828466,"about_ca_topic_score_gemma":0.00010782734,"teacher_disagreement_score":0.800675,"about_ca_system_score_codex":0.0005282728,"about_ca_system_score_gemma":0.0011757552,"threshold_uncertainty_score":0.9993872},"labels":[],"label_agreement":null},{"id":"W2124729717","doi":"10.1109/icpp.2002.1040888","title":"Distributed game-tree search using transposition table driven work scheduling","year":2003,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transposition (logic); Tree (set theory); Parallel computing; Parallel algorithm; Scheduling (production processes); Processor scheduling; Depth-first search; Parallelism (grammar); Alpha (finance); Search algorithm; Algorithm; Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence; Combinatorics","score_opus":0.05517936581506377,"score_gpt":0.3007534903804039,"score_spread":0.2455741245653401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124729717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21621875,0.000065894616,0.7817635,0.00022127281,0.00017531689,0.00011317605,0.0000016751733,0.00017527092,0.0012651272],"genre_scores_gemma":[0.8149575,0.000004930389,0.18477574,0.000088200206,0.000028659082,0.0000037953223,0.0000028266747,0.000009041939,0.00012930782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851996,0.00010967432,0.00025080758,0.0003746729,0.0003075957,0.00043727187],"domain_scores_gemma":[0.9992201,0.00007604809,0.00003863401,0.00041250206,0.00013681692,0.00011595197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002884017,0.00013172661,0.0001360871,0.00008388947,0.00017753933,0.00024137317,0.00054792024,0.000077149285,0.000087265376],"category_scores_gemma":[0.000051545067,0.00012754172,0.000049648228,0.0010631097,0.000068707304,0.00061217655,0.000055519286,0.00017106174,0.0001184387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024469928,0.00032057174,0.026386525,0.00003069691,0.000059598126,0.0000705623,0.0028211006,0.54724777,0.07172977,0.32236695,0.00017890574,0.02876308],"study_design_scores_gemma":[0.00009789102,0.00006094981,0.0011393193,0.00008958895,0.000010713867,0.000016582244,0.00027614812,0.74426687,0.24682173,0.0060816756,0.00077914435,0.00035939537],"about_ca_topic_score_codex":0.00007265223,"about_ca_topic_score_gemma":0.00002044583,"teacher_disagreement_score":0.59873873,"about_ca_system_score_codex":0.00009681291,"about_ca_system_score_gemma":0.000101030826,"threshold_uncertainty_score":0.5201},"labels":[],"label_agreement":null},{"id":"W2128644877","doi":"10.1109/robio.2006.340106","title":"Yet Another Simple Characterization of Searchable Polygons by 1-Searcher","year":2006,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Simon Fraser University","keywords":"Computer science; Polygon (computer graphics); Simple (philosophy); Representation (politics); Characterization (materials science); Boundary (topology); Simple polygon; Theoretical computer science; Information retrieval; Mathematics; Regular polygon","score_opus":0.026200885920698393,"score_gpt":0.2784004204647433,"score_spread":0.25219953454404487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128644877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22767252,0.000014823701,0.7614569,0.0011842427,0.00006303209,0.000121633326,0.000010635657,0.00010562482,0.009370612],"genre_scores_gemma":[0.98170274,0.0000047878793,0.0051646214,0.00023018141,0.00003551381,0.0000067733754,0.000014572616,0.000010239438,0.012830554],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905384,0.000046719713,0.0002048249,0.00020390724,0.00024927556,0.0002414185],"domain_scores_gemma":[0.9994252,0.00006258162,0.000054976696,0.00033574298,0.00008975759,0.0000317436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000190223,0.00007371247,0.00009525258,0.00006953577,0.000049558406,0.00006533378,0.0004784103,0.000043071374,0.00044775274],"category_scores_gemma":[0.000020127376,0.00006561094,0.00003266368,0.00033119848,0.000078957986,0.00037780148,0.00012709621,0.00005739574,0.00015155338],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003025436,0.00011019879,0.0037404506,0.000005593534,0.000004844343,9.878632e-7,0.00020883224,0.000028366494,0.91189647,0.05962529,0.009009744,0.015366204],"study_design_scores_gemma":[0.000033451306,0.000041781183,0.0027554485,0.000004332367,9.912801e-7,9.252833e-7,0.000019935902,0.025357626,0.94523036,0.0073666605,0.019080173,0.000108325],"about_ca_topic_score_codex":0.0010657397,"about_ca_topic_score_gemma":0.00004816803,"teacher_disagreement_score":0.7562923,"about_ca_system_score_codex":0.00001945893,"about_ca_system_score_gemma":0.00004011465,"threshold_uncertainty_score":0.49025786},"labels":[],"label_agreement":null},{"id":"W2129998024","doi":"10.1007/s10899-013-9417-2","title":"Erratum to: The Impact of Sound in Modern Multiline Video Slot Machine Play","year":2013,"lang":"en","type":"erratum","venue":"Journal of Gambling Studies","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Paragraph; Sound (geography); Psychology; Section (typography); Statistics; Mathematics; Acoustics; Computer science; Physics; World Wide Web","score_opus":0.08954152181806121,"score_gpt":0.40193652466873364,"score_spread":0.31239500285067245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129998024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20910472,0.2638545,0.32442078,0.019326622,0.17410654,0.0027232757,0.00010289797,0.00019111148,0.006169569],"genre_scores_gemma":[0.95550334,0.007583863,0.012761469,0.0003623845,0.005310419,0.000026232792,0.0000031543764,0.0000941739,0.018354975],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961784,0.0002079252,0.00176117,0.00038112828,0.0009487005,0.000522692],"domain_scores_gemma":[0.9951828,0.0007939015,0.0017003241,0.0007442795,0.0014489159,0.00012975588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018238532,0.00048104895,0.0013451766,0.00078779756,0.00015751705,0.00020115219,0.0024739783,0.00022675494,0.0000099598],"category_scores_gemma":[0.0023061077,0.00027279856,0.00055879547,0.00075871364,0.000194916,0.0005274341,0.00080655934,0.0017748903,0.000021460994],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080838414,0.00024191676,0.001046172,0.00009786725,0.0010194435,0.000087264336,0.022332003,0.05609482,0.00026012814,0.000119785924,0.89532584,0.023293914],"study_design_scores_gemma":[0.0013824936,0.005954022,0.017148789,0.009115807,0.00043059542,0.0005571136,0.0072108004,0.8471716,0.001654563,0.07466027,0.031989425,0.0027245372],"about_ca_topic_score_codex":0.0004795248,"about_ca_topic_score_gemma":0.00076665747,"teacher_disagreement_score":0.86333644,"about_ca_system_score_codex":0.00033284875,"about_ca_system_score_gemma":0.0004240933,"threshold_uncertainty_score":0.9999724},"labels":[],"label_agreement":null},{"id":"W2130229227","doi":"10.1109/cig.2009.5286485","title":"No-Limit Texas Hold'em Poker agents created with evolutionary neural networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Limit (mathematics); Artificial neural network; Computer science; Benchmark (surveying); Heuristics; Evolutionary algorithm; Artificial intelligence; Population; Perfect information; Imperfect; Evolutionary computation; Game theory; Space (punctuation); Quality (philosophy); Machine learning; Evolutionary game theory; Mathematical economics; Mathematics","score_opus":0.02744466193514579,"score_gpt":0.2610179099342371,"score_spread":0.23357324799909135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130229227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1126242,0.00021701817,0.825945,0.002314576,0.00075291476,0.00044252558,0.0000012627875,0.0010614517,0.056641016],"genre_scores_gemma":[0.9758437,0.000009956639,0.015417907,0.0029244847,0.00016713495,0.000004521262,0.000003978637,0.000011034085,0.005617283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998334,0.000059207156,0.00026796502,0.000488905,0.00036502111,0.00048491659],"domain_scores_gemma":[0.9988569,0.00006870321,0.00007688444,0.0006328359,0.00020515229,0.00015954622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011793889,0.00021042064,0.00017084499,0.00008478837,0.00014510933,0.00020475793,0.0009242475,0.00008876839,0.00024085463],"category_scores_gemma":[0.000030301422,0.00015745283,0.00006563367,0.00054289825,0.000073623516,0.00073160435,0.00013799079,0.00019872126,0.00055950525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033371605,0.0012886584,0.0639679,0.000011827453,0.0001855017,0.0008152004,0.0012066446,0.32609,0.00043490645,0.10683238,0.14186384,0.35696942],"study_design_scores_gemma":[0.00007800863,0.00033372504,0.054821808,0.000013605827,0.000007260522,0.00003552914,0.000021283025,0.94093174,0.0003748217,0.001204883,0.001917183,0.00026013167],"about_ca_topic_score_codex":0.00007406456,"about_ca_topic_score_gemma":0.000025031082,"teacher_disagreement_score":0.8632195,"about_ca_system_score_codex":0.00005653529,"about_ca_system_score_gemma":0.00003801979,"threshold_uncertainty_score":0.7191495},"labels":[],"label_agreement":null},{"id":"W2132037841","doi":"","title":"Investigating the Effectiveness of Applying Case-Based Reasoning to the Game of Texas Hold'em","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Case-based reasoning; Computer science; Competition (biology); Game theory; Artificial intelligence; Operations research; Management science; Mathematical economics; Engineering; Economics","score_opus":0.03735809844215872,"score_gpt":0.3043039002833444,"score_spread":0.2669458018411857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132037841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46280658,0.000023919829,0.53544027,0.00011944319,0.000087392735,0.00033677538,3.6132082e-7,0.000036537793,0.0011487313],"genre_scores_gemma":[0.97277665,2.1079165e-7,0.026851492,0.0002938562,0.000034783538,0.000019600528,1.4054315e-7,0.000008312263,0.000014923085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984953,0.00029732764,0.00036673213,0.00024553394,0.0003302709,0.0002648453],"domain_scores_gemma":[0.9950455,0.0038622336,0.00016597875,0.0006868238,0.00017335408,0.00006611463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005227512,0.000114769675,0.0001667083,0.00007917914,0.00012822375,0.00006328427,0.00097078574,0.00003972407,0.000005387767],"category_scores_gemma":[0.0010632325,0.000064300926,0.00006924775,0.0008391776,0.00017662843,0.00012942281,0.00024989864,0.0001439973,0.000013767579],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006467262,0.00013948652,0.06130548,0.00024381379,0.00007396753,0.00013939073,0.014832888,0.109333724,0.08881693,0.4108642,0.00011345163,0.314072],"study_design_scores_gemma":[0.00005267876,0.000096512405,0.008923566,0.00022691564,0.000008124822,0.00005452852,0.0013913182,0.11032702,0.8753557,0.0033034915,0.00012655888,0.00013356107],"about_ca_topic_score_codex":0.0008574923,"about_ca_topic_score_gemma":0.00032530032,"teacher_disagreement_score":0.7865388,"about_ca_system_score_codex":0.00003253998,"about_ca_system_score_gemma":0.000071966955,"threshold_uncertainty_score":0.2622116},"labels":[],"label_agreement":null},{"id":"W2132071928","doi":"10.37236/1600","title":"The Game of End-Nim","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; String (physics); Mathematics; Combinatorial game theory; Stack (abstract data type); Sequential game; Computer science; Mathematical economics; Game theory; Mathematical physics; Operating system","score_opus":0.012692526359330792,"score_gpt":0.2589302169930107,"score_spread":0.24623769063367992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132071928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33239865,0.016215442,0.63254386,0.012224689,0.0022330368,0.00020458536,2.3328367e-7,0.000041257394,0.0041382425],"genre_scores_gemma":[0.99630874,0.0030508696,0.000037078993,0.00007241068,0.00009005035,0.0000011376326,2.7163958e-8,0.000007779938,0.0004318982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980924,0.00017398674,0.00054249365,0.00009110104,0.0005863019,0.00051370217],"domain_scores_gemma":[0.99771327,0.00073345425,0.00057997083,0.0005293,0.00038978452,0.00005422656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020257395,0.000108391396,0.0001904959,0.00006496274,0.00017486043,0.00008301326,0.0026606577,0.000041177438,0.000008145776],"category_scores_gemma":[0.00022867926,0.00005813695,0.00014379156,0.00062867324,0.00016811036,0.00025740475,0.0001474945,0.00058909657,0.000013777411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001977907,0.000054634416,0.00017996047,0.0000011714637,0.000038067752,0.0000065973722,0.00047837742,0.00013968733,0.0002775662,0.9815277,0.00035640012,0.016920095],"study_design_scores_gemma":[0.00010994717,0.0004976746,0.00019180482,0.000012466803,0.0000149424195,0.00028465764,0.0001497172,0.0022387896,0.011333193,0.950024,0.035067108,0.00007570055],"about_ca_topic_score_codex":0.00001100587,"about_ca_topic_score_gemma":0.000010784803,"teacher_disagreement_score":0.6639101,"about_ca_system_score_codex":0.00016581685,"about_ca_system_score_gemma":0.00047817905,"threshold_uncertainty_score":0.49442083},"labels":[],"label_agreement":null},{"id":"W2133575460","doi":"10.1007/978-3-642-17928-0_7","title":"Computational Experiments with the RAVE Heuristic","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Heuristic; Game tree; Estimator; Algorithm; Monte Carlo method; Artificial intelligence; Game theory; Sequential game; Statistics; Mathematics; Mathematical economics","score_opus":0.03771057346889833,"score_gpt":0.2762934676243007,"score_spread":0.23858289415540235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133575460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007184148,0.00029866342,0.99044514,0.0008892911,0.00095016,0.00041829154,0.0000024466242,0.00013137708,0.0067927875],"genre_scores_gemma":[0.561012,0.000015641488,0.4347427,0.0028577694,0.00043459077,0.00002862842,0.0000040466994,0.000053973614,0.0008506338],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964296,0.000044160606,0.00043020674,0.0012956959,0.0012019105,0.0005984212],"domain_scores_gemma":[0.9972364,0.000659118,0.00030181368,0.0013216459,0.00033942028,0.00014161912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057906174,0.0005008444,0.0003783677,0.00039337634,0.00040316128,0.000535609,0.004415895,0.00017780405,0.00006633921],"category_scores_gemma":[0.000046841542,0.0003301889,0.00009094375,0.00046754922,0.0017538037,0.0004465069,0.0011432455,0.00069792947,0.00018264136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002181945,0.00006531742,0.0000830615,0.000019093255,0.000036711244,0.0002038588,0.007182381,0.17202236,0.000032914446,0.2007433,0.00016436477,0.6194248],"study_design_scores_gemma":[0.00011793907,0.0003160583,0.00011522293,0.00024204385,0.00001088253,0.00012851201,0.0000010447695,0.45775023,0.0024964188,0.5359174,0.0021179079,0.0007863518],"about_ca_topic_score_codex":0.000040171704,"about_ca_topic_score_gemma":0.00005215515,"teacher_disagreement_score":0.61863846,"about_ca_system_score_codex":0.00019629327,"about_ca_system_score_gemma":0.0005547405,"threshold_uncertainty_score":0.999915},"labels":[],"label_agreement":null},{"id":"W2134209982","doi":"10.1007/978-3-642-04428-1_3","title":"Manipulating Tournaments in Cup and Round Robin Competitions","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Throwing; Tournament; Polynomial; Time complexity","score_opus":0.0356173220076139,"score_gpt":0.2829765906785324,"score_spread":0.2473592686709185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134209982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011939843,0.0003871063,0.9914811,0.0009611187,0.0008157597,0.00034006292,0.0000017504781,0.000099216384,0.0047199046],"genre_scores_gemma":[0.5815081,0.000095928066,0.41587326,0.0016876778,0.00033721182,0.000007595139,0.000003306503,0.00003099684,0.0004559531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664843,0.000041359366,0.0006695838,0.0012847463,0.00070880534,0.00064708735],"domain_scores_gemma":[0.9982011,0.00040764644,0.00025311616,0.0008590041,0.00012634647,0.00015282576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007112198,0.00044184524,0.00046834844,0.0009285685,0.00026179117,0.00082943134,0.0020596718,0.00024337383,0.000020991358],"category_scores_gemma":[0.00008576494,0.00044250523,0.000071738345,0.00057391194,0.00053173717,0.00086977717,0.0009869785,0.0008490171,0.000033248998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025782272,0.000039319777,0.00061383256,0.000015592132,0.0000044036346,0.00016017431,0.0010801951,0.047056172,0.00014710719,0.054092295,0.000006827585,0.8967815],"study_design_scores_gemma":[0.00012072196,0.00015181366,0.0013568128,0.0007917081,0.000004147536,0.00010917097,9.137995e-7,0.6147805,0.0006772668,0.38069567,0.00065750524,0.0006537906],"about_ca_topic_score_codex":0.00009115558,"about_ca_topic_score_gemma":0.0005106678,"teacher_disagreement_score":0.8961277,"about_ca_system_score_codex":0.00040073018,"about_ca_system_score_gemma":0.0002255912,"threshold_uncertainty_score":0.99980265},"labels":[],"label_agreement":null},{"id":"W2135923283","doi":"","title":"Restricted Universes of Partizan Misere Games","year":2013,"lang":"en","type":"article","venue":"Library and Archives Canada (Government of Canada)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Universe; Quotient; Mathematics; Generalization; Natural (archaeology); Computer science; Combinatorics; Physics","score_opus":0.0059012033963350904,"score_gpt":0.1524931611237964,"score_spread":0.1465919577274613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135923283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6505507,0.00038288272,0.0052703936,0.011307717,0.00040304483,0.00039458546,0.000059953447,0.00004864722,0.33158207],"genre_scores_gemma":[0.99094296,0.00006126467,0.004972481,0.0003777613,0.000015860127,0.0000037353127,7.8854146e-7,0.0000064813876,0.0036186562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983749,0.00004806108,0.00025864627,0.00019766836,0.00090005476,0.00022067314],"domain_scores_gemma":[0.9991316,0.0002533478,0.00015174977,0.00028470004,0.0000014433116,0.00017714535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000004814173,0.00011487925,0.0001697354,0.000024287192,0.00007427101,0.000027400298,0.0005293021,0.000017541275,0.000055636632],"category_scores_gemma":[0.0000065674335,0.00010726341,0.000021250855,0.00014306938,0.00010319119,0.00071145454,0.00016937357,0.00006881441,9.353221e-9],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010668727,0.00006955991,0.04666775,0.00013671482,0.00008745267,0.000073257026,0.00059170485,0.00036426165,0.05949693,0.7906683,0.006682702,0.09505466],"study_design_scores_gemma":[0.00017278876,0.00018364326,0.09367774,0.00013489621,0.000012225397,0.000005697568,0.006066702,0.035206445,0.82996625,0.011555252,0.022625914,0.0003924721],"about_ca_topic_score_codex":0.008643319,"about_ca_topic_score_gemma":0.0086220065,"teacher_disagreement_score":0.77911305,"about_ca_system_score_codex":0.0000034486566,"about_ca_system_score_gemma":0.0009074833,"threshold_uncertainty_score":0.9979582},"labels":[],"label_agreement":null},{"id":"W2137414111","doi":"10.5220/0003063000200032","title":"ALGORITHMS FOR EVOLVING NO-LIMIT TEXAS HOLD'EM POKER PLAYING AGENTS","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Dalhousie University","funders":"","keywords":"Limit (mathematics); Benchmark (surveying); Heuristics; Computer science; Artificial neural network; Artificial intelligence; Population; Space (punctuation); State (computer science); Adversary; State space; Machine learning; Algorithm; Mathematics","score_opus":0.05861721727722263,"score_gpt":0.31796059710164554,"score_spread":0.2593433798244229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137414111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057235263,0.00002342937,0.92120016,0.00054957985,0.003308214,0.00039834625,0.000003016977,0.00040158455,0.016880434],"genre_scores_gemma":[0.59018064,0.000002660016,0.40409875,0.00085699843,0.00039419686,0.000030988504,0.0000016978588,0.000022138456,0.004411933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983317,0.00001913786,0.00031819192,0.0005189252,0.00031062134,0.00050142006],"domain_scores_gemma":[0.99848574,0.00029752098,0.000090090856,0.0006979433,0.00028073302,0.00014795533],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043818905,0.00018192237,0.00016749052,0.000104470324,0.00023587665,0.0004572807,0.0013090265,0.00011646079,0.00038337527],"category_scores_gemma":[0.00039313754,0.00015874163,0.00011795404,0.0002190129,0.000057302226,0.000852669,0.00035257815,0.00024085424,0.0012495986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021190355,0.00037967408,0.01653222,0.0000590375,0.00011979156,0.000049343278,0.0038095783,0.00029267216,0.055087652,0.14588821,0.0563334,0.7214272],"study_design_scores_gemma":[0.00010030963,0.00008001017,0.0034755666,0.000015612599,0.000007668027,0.000011127465,0.00008961119,0.9279026,0.04090026,0.0071737575,0.019863296,0.00038018342],"about_ca_topic_score_codex":0.000079757505,"about_ca_topic_score_gemma":0.00009431404,"teacher_disagreement_score":0.9276099,"about_ca_system_score_codex":0.00002877577,"about_ca_system_score_gemma":0.00005808916,"threshold_uncertainty_score":0.99952805},"labels":[],"label_agreement":null},{"id":"W2138867958","doi":"10.1109/cicc.2002.1012769","title":"An FPGA based move generator for the game of chess","year":2003,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Field-programmable gate array; Computer science; Lookup table; Generator (circuit theory); Exploit; Routing (electronic design automation); Logic block; Block (permutation group theory); Computer architecture; Table (database); Application-specific integrated circuit; Embedded system; Logic synthesis; Architecture; Programmable logic device; Computer hardware; Logic gate; Operating system; Algorithm","score_opus":0.05021918261510078,"score_gpt":0.30656529468055554,"score_spread":0.25634611206545477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138867958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018707283,0.000056120873,0.97896343,0.000432256,0.00024464895,0.00020515785,0.000001643227,0.000050048886,0.0013394306],"genre_scores_gemma":[0.9041739,0.000001245199,0.09462613,0.0008335697,0.000036226855,0.000030567906,2.6221574e-7,0.000005766662,0.00029231652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926907,0.00004693207,0.0001758501,0.00019790487,0.00014216929,0.00016804629],"domain_scores_gemma":[0.99886465,0.00028803613,0.00005489606,0.0006173208,0.00012827032,0.000046814974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036528704,0.00007384346,0.000088330526,0.000028271612,0.000058162,0.00006612419,0.0007474412,0.00003380526,0.000073204516],"category_scores_gemma":[0.000099133074,0.00004705444,0.00005634819,0.00017190148,0.00006565995,0.00018668461,0.000022023087,0.00003743072,0.000014363142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009858397,0.0002035219,0.000622427,0.000013545868,0.000021019527,0.0000012248037,0.0010770438,0.014363733,0.02820466,0.864504,0.0019007752,0.08907823],"study_design_scores_gemma":[0.000028767377,0.00004903342,0.000069480186,0.0000014918658,0.000002168353,3.3382082e-7,0.000064186475,0.38566342,0.6044945,0.004935256,0.004635155,0.000056193992],"about_ca_topic_score_codex":0.000026373315,"about_ca_topic_score_gemma":0.00002861927,"teacher_disagreement_score":0.88546664,"about_ca_system_score_codex":0.000011529366,"about_ca_system_score_gemma":0.000082457394,"threshold_uncertainty_score":0.19188243},"labels":[],"label_agreement":null},{"id":"W2139245322","doi":"10.1017/s0963548314000807","title":"Lazy Cops and Robbers on Hypercubes","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Hypercube; Computer science; Function (biology); Argument (complex analysis); Asymptotically optimal algorithm; Mathematics; Discrete mathematics; Parallel computing; Algorithm; Biology","score_opus":0.07483190199436138,"score_gpt":0.2877698644004989,"score_spread":0.21293796240613752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139245322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86968005,0.00025226237,0.11886058,0.0015027862,0.0018234605,0.00041876212,6.7749886e-7,0.000585819,0.006875602],"genre_scores_gemma":[0.9847776,0.0000037957022,0.014835824,0.00025951606,0.000057312034,0.0000043868213,7.3571596e-7,0.0000129565715,0.000047831894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785316,0.000190736,0.00039306164,0.0006857858,0.0004523208,0.00042494934],"domain_scores_gemma":[0.99799263,0.000488522,0.00011526445,0.000784237,0.00032612227,0.00029324074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001417663,0.00022251859,0.00026849008,0.00009631821,0.0002263767,0.0002630042,0.0009111346,0.00010104205,0.0000015773974],"category_scores_gemma":[0.0010014559,0.00021713403,0.000052971052,0.0005608042,0.00018454056,0.00034021956,0.0007859505,0.0003057844,0.00007006912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008447405,0.00026701324,0.015638072,0.000032617783,0.000011946956,0.000012746332,0.003192689,0.0024807649,0.000039219984,0.9264106,0.00064109283,0.051264774],"study_design_scores_gemma":[0.00022849669,0.00037449316,0.0015063784,0.000047894067,0.0000053642098,0.000021399816,0.00019560727,0.21053253,0.0022080126,0.7827958,0.0016982647,0.00038575384],"about_ca_topic_score_codex":0.000050338756,"about_ca_topic_score_gemma":0.000004240937,"teacher_disagreement_score":0.20805176,"about_ca_system_score_codex":0.00024297707,"about_ca_system_score_gemma":0.00013898381,"threshold_uncertainty_score":0.8854469},"labels":[],"label_agreement":null},{"id":"W2140249977","doi":"10.1111/cgf.12314","title":"Game level layout from design specification","year":2014,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Graph; Block (permutation group theory); Scene graph; Template; Key (lock); Maxima and minima; Theoretical computer science; Programming language; Artificial intelligence; Rendering (computer graphics)","score_opus":0.08942923153882047,"score_gpt":0.2713647923650191,"score_spread":0.1819355608261986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140249977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032515533,0.00007117541,0.99259394,0.0016218075,0.0015330056,0.00019827382,0.000005074247,0.00037500844,0.00035017083],"genre_scores_gemma":[0.7507585,0.000016565706,0.24714376,0.0015897137,0.00039008528,0.000013526488,0.000011041384,0.00001925739,0.00005751994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979161,0.00018827281,0.00040169584,0.00065674685,0.00037816653,0.00045899447],"domain_scores_gemma":[0.9978719,0.0004599365,0.000159007,0.0011978098,0.00016482551,0.00014653483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047029305,0.00022772764,0.00022466817,0.00020774775,0.00016670574,0.00035835122,0.0018398184,0.0001294963,0.000013935908],"category_scores_gemma":[0.000036744,0.00022387363,0.00012717368,0.0005113414,0.00013372663,0.0005398737,0.00041549347,0.00022849492,0.00046227995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006531014,0.00007962949,0.0024451828,0.0000032565824,0.000026737593,0.000004458013,0.00083239505,0.001074467,0.00022090292,0.76707125,0.0072081606,0.22102702],"study_design_scores_gemma":[0.00007409241,0.00009467162,0.0039337385,0.000022421056,0.000004556601,0.0000035210983,0.000011159253,0.7366499,0.0059334887,0.23696357,0.016046185,0.00026270642],"about_ca_topic_score_codex":0.00007635016,"about_ca_topic_score_gemma":0.000029227716,"teacher_disagreement_score":0.747507,"about_ca_system_score_codex":0.00002966195,"about_ca_system_score_gemma":0.000038005124,"threshold_uncertainty_score":0.9129302},"labels":[],"label_agreement":null},{"id":"W2140629606","doi":"10.1609/aiide.v6i1.12388","title":"An Automated Technique for Drafting Territories in the Board Game Risk","year":2010,"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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Function (biology); Computer science; Order (exchange); Tree (set theory); Monte Carlo method; Operations research; Machine learning; Artificial intelligence; Engineering; Business; Mathematics; Finance; Statistics","score_opus":0.02970687494586683,"score_gpt":0.31878322256547087,"score_spread":0.28907634761960405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140629606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9136075,0.000008130041,0.07396804,0.003863733,0.0011130542,0.0023717398,0.000061449246,0.00021395645,0.0047924356],"genre_scores_gemma":[0.9976893,0.000010165662,0.0016261236,0.00019870375,0.000110255576,0.00032009912,0.0000020868802,0.000015372727,0.000027859953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997887,0.000033237233,0.0006776878,0.0005899321,0.0004121123,0.0004000225],"domain_scores_gemma":[0.99819666,0.000396743,0.0004739102,0.0003842228,0.00046606804,0.000082412684],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007054702,0.0003014301,0.0002711969,0.00017072888,0.00023001638,0.0013823858,0.0020903344,0.000099706966,0.000009811599],"category_scores_gemma":[0.00082225486,0.00019400612,0.00013611103,0.00028222517,0.00051102863,0.0018285824,0.00027720275,0.0005840058,0.000008433511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026912987,0.0009286099,0.0032931305,0.00004289024,0.00004064519,0.0000014918103,0.035658076,0.000044386103,0.0953503,0.7100017,0.000063812746,0.1543058],"study_design_scores_gemma":[0.00004308813,0.0010262505,0.00050898787,0.00024746175,0.000014216405,0.000011695413,0.011351901,0.13544942,0.7190804,0.1310405,0.00085513,0.00037095422],"about_ca_topic_score_codex":0.00018385798,"about_ca_topic_score_gemma":0.00013029731,"teacher_disagreement_score":0.62373006,"about_ca_system_score_codex":0.000052879823,"about_ca_system_score_gemma":0.000049882783,"threshold_uncertainty_score":0.9996543},"labels":[],"label_agreement":null},{"id":"W2142148627","doi":"10.1109/cig.2008.5035661","title":"Improving a case-based texas hold'em poker bot","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Competitor analysis; Computer science; Reuse; Data science; Cognitive science; Artificial intelligence; Operations research; Psychology; Engineering; Marketing; Business","score_opus":0.047532600568380295,"score_gpt":0.26825516528209575,"score_spread":0.22072256471371546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142148627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22685415,0.000043106935,0.7667937,0.0004881431,0.00028828514,0.00012559432,6.4212765e-7,0.00041567755,0.0049906466],"genre_scores_gemma":[0.9225069,0.0000013956978,0.074633084,0.0012381297,0.00007837202,0.000007295543,3.2938036e-7,0.000011405594,0.0015230578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986493,0.00004201735,0.00025828325,0.00041670454,0.00026467096,0.0003690162],"domain_scores_gemma":[0.9988704,0.00014845202,0.00006815288,0.000685461,0.00010087558,0.00012669119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019353992,0.00014701509,0.00013369913,0.00010571659,0.00021645828,0.00013375834,0.000668411,0.000064983404,0.00015277999],"category_scores_gemma":[0.000095045645,0.00012543658,0.0000824201,0.00035875686,0.00009461842,0.0004491662,0.00018767898,0.0001359373,0.00077682215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044304386,0.00087471376,0.026541464,0.00006749029,0.000070820344,0.03849673,0.008149908,0.004773548,0.017687019,0.12871712,0.028107086,0.7464698],"study_design_scores_gemma":[0.00014086618,0.00017565263,0.0009155353,0.0000129630125,0.0000057738703,0.0027265202,0.0001976511,0.8247763,0.16528991,0.0015460494,0.0036808776,0.00053190853],"about_ca_topic_score_codex":0.00084246363,"about_ca_topic_score_gemma":0.00021581141,"teacher_disagreement_score":0.82000273,"about_ca_system_score_codex":0.000047919057,"about_ca_system_score_gemma":0.00014541054,"threshold_uncertainty_score":0.99847364},"labels":[],"label_agreement":null},{"id":"W2143369125","doi":"10.1109/icc.2009.50","title":"General Game Playing: An Overview and Open Problems","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Game design; Game Developer; Testbed; Premise; Video game design; Video game development; Game mechanics; Non-cooperative game; Simulations and games in economics education; Key (lock); Game art design; Multimedia; Human–computer interaction; Game theory; World Wide Web; Computer security","score_opus":0.14890658544336918,"score_gpt":0.37010843830241463,"score_spread":0.22120185285904545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143369125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34903526,0.0023865716,0.5675213,0.012685842,0.00045253593,0.0012381691,0.0000015061381,0.000683033,0.06599581],"genre_scores_gemma":[0.8685951,0.00018707529,0.124611266,0.0043826313,0.00007645782,0.000010019441,9.690975e-7,0.000006255373,0.0021301836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906397,0.000040760526,0.0001808864,0.0003593085,0.00013732136,0.00021773043],"domain_scores_gemma":[0.9993349,0.000020206195,0.000040709212,0.00044595086,0.000038218317,0.00012007015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023818783,0.00009982897,0.00013014612,0.000037964284,0.00008320468,0.0007083371,0.0013475182,0.000037735837,0.00006038631],"category_scores_gemma":[0.000014397193,0.00008141819,0.00001790847,0.0001683476,0.00003128768,0.0014151667,0.0003684227,0.000065940105,0.000056727986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018558598,0.00006796315,0.00048164162,0.0000033743836,0.0000031098018,0.00000656529,0.0012059913,0.00016080821,0.0021216974,0.6649808,0.0006569506,0.33030918],"study_design_scores_gemma":[0.00015673458,0.00076685287,0.013767272,0.00004880178,0.000005418215,0.00006257435,0.000089852314,0.53726053,0.013083084,0.40780437,0.02635038,0.0006041322],"about_ca_topic_score_codex":0.00019768895,"about_ca_topic_score_gemma":0.0000898102,"teacher_disagreement_score":0.5370997,"about_ca_system_score_codex":0.0000131935685,"about_ca_system_score_gemma":0.000032192977,"threshold_uncertainty_score":0.6830511},"labels":[],"label_agreement":null},{"id":"W2143672067","doi":"10.1109/cig.2011.6031989","title":"User-preference-based automated level generation for platform games","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Preference; Human–computer interaction; Simple (philosophy); Multimedia; Mathematics","score_opus":0.37445674868578266,"score_gpt":0.3233364528936398,"score_spread":0.051120295792142834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143672067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04491613,0.000009944325,0.9492407,0.00017730195,0.00044038016,0.0003003945,0.000005274422,0.0010825307,0.0038273442],"genre_scores_gemma":[0.66327333,0.0000012149334,0.33552244,0.0003670943,0.000050806822,0.000060689203,0.0000061604937,0.000007706134,0.00071057514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988809,0.00001703978,0.00028249825,0.00035659605,0.00017844982,0.00028450895],"domain_scores_gemma":[0.9990672,0.000092696275,0.00008135663,0.00048682978,0.00019508581,0.00007684562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022133243,0.00013772758,0.0001246172,0.00010325888,0.00012701061,0.0001288456,0.0007482388,0.00008716721,0.00016073186],"category_scores_gemma":[0.00008510604,0.00011505034,0.00006553581,0.00019384966,0.000048056172,0.00065802224,0.000077296,0.00005405554,0.000174576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040439547,0.00028565296,0.0015375279,0.0000269651,0.00004093666,0.000005336029,0.0034873125,0.0009805639,0.021389592,0.7321827,0.031793837,0.20822914],"study_design_scores_gemma":[0.000061700965,0.00009321105,0.00057758886,0.0000049452724,0.000002729764,8.213126e-7,0.00002889143,0.6640648,0.32926887,0.004865813,0.0008978124,0.00013276881],"about_ca_topic_score_codex":0.0001810707,"about_ca_topic_score_gemma":0.00024994387,"teacher_disagreement_score":0.72731686,"about_ca_system_score_codex":0.000038046575,"about_ca_system_score_gemma":0.00012183127,"threshold_uncertainty_score":0.46916166},"labels":[],"label_agreement":null},{"id":"W2144232842","doi":"10.1016/j.comgeo.2004.05.005","title":"The one-round Voronoi game replayed","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Voronoi diagram; Computer science; Computer graphics (images); Mathematics; Geometry","score_opus":0.034548568441611374,"score_gpt":0.2907720741755746,"score_spread":0.25622350573396324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144232842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07057081,0.00036995774,0.9219786,0.0046616183,0.0006820547,0.00013190077,0.0000017623186,0.0001840065,0.0014192903],"genre_scores_gemma":[0.9458516,0.000009846099,0.052936707,0.00068322185,0.00016538127,0.000012689963,0.000004689751,0.000010006843,0.0003258583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983687,0.00004473411,0.0003424011,0.0003752711,0.00055055064,0.00031834687],"domain_scores_gemma":[0.9983864,0.00067726173,0.00012132319,0.00050037913,0.00021949735,0.00009514124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042173275,0.00013061023,0.00011873982,0.00012288122,0.0003794095,0.00041633568,0.0011665187,0.000053824624,0.000021464852],"category_scores_gemma":[0.00025473314,0.00010766335,0.00008111285,0.00078604475,0.00017639353,0.00041944598,0.00027560553,0.00017734728,0.0007692456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007728339,0.00008553718,0.00019489226,0.0000037666282,0.00003342766,0.000009877804,0.00045339923,0.24688636,0.00005114146,0.67953026,0.0005048067,0.07223882],"study_design_scores_gemma":[0.0001871579,0.000106739855,0.01010408,0.000022610815,0.0000057075517,0.00003877521,0.00009024702,0.08562648,0.0021075534,0.89143735,0.0099814525,0.00029184378],"about_ca_topic_score_codex":0.000039635786,"about_ca_topic_score_gemma":0.000014233123,"teacher_disagreement_score":0.8752808,"about_ca_system_score_codex":0.00013085542,"about_ca_system_score_gemma":0.0001916259,"threshold_uncertainty_score":0.98873526},"labels":[],"label_agreement":null},{"id":"W2145901173","doi":"","title":"Variance Reduction in Monte-Carlo Tree Search","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Control variates; Variance reduction; Monte Carlo method; Variance (accounting); Computer science; Reduction (mathematics); Random number generation; Tree (set theory); Random variate; Monte Carlo integration; Mathematical optimization; Algorithm; Statistics; Hybrid Monte Carlo; Mathematics; Random variable; Markov chain Monte Carlo","score_opus":0.10718275468719476,"score_gpt":0.3007948470566222,"score_spread":0.19361209236942742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145901173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19274695,0.00005985832,0.692266,0.00079569314,0.00077593396,0.00020906406,2.1659335e-7,0.00026279897,0.11288347],"genre_scores_gemma":[0.9314036,0.0000099028985,0.066305794,0.000046051264,0.000041180967,0.000009831465,4.812929e-8,0.000004305234,0.0021793023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990564,0.000054329485,0.00018653451,0.00029894421,0.00016815324,0.00023562019],"domain_scores_gemma":[0.9994114,0.000024980662,0.000023062226,0.00043571595,0.00005417566,0.000050672166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030682547,0.0000719129,0.00007987789,0.00011126739,0.000036940888,0.00004623649,0.00067858753,0.000045784505,0.00012861936],"category_scores_gemma":[0.000028818384,0.00006573639,0.000026751912,0.00043295842,0.000052948893,0.00060832984,0.00014111829,0.00011911745,0.0003472151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023936573,0.00027509924,0.005806457,0.0000070090778,0.000009621937,0.000049546445,0.021587312,0.0006441949,0.004898019,0.476819,0.0010907137,0.48878908],"study_design_scores_gemma":[0.00016975425,0.00029410108,0.03913898,0.000047423837,0.0000033594229,0.000060761548,0.0020002383,0.47750062,0.4198084,0.05884354,0.0015133918,0.00061944855],"about_ca_topic_score_codex":0.0016740098,"about_ca_topic_score_gemma":0.00020068805,"teacher_disagreement_score":0.73865664,"about_ca_system_score_codex":0.00004205858,"about_ca_system_score_gemma":0.00003962867,"threshold_uncertainty_score":0.44628635},"labels":[],"label_agreement":null},{"id":"W2146226507","doi":"","title":"On Strategy Stitching in Large Extensive Form Multiplayer Games","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Image stitching; Computer science; Abstraction; Combinatorial game theory; Granularity; Class (philosophy); Sequential game; Tree (set theory); Competition (biology); Theoretical computer science; Game theory; Human–computer interaction; Artificial intelligence; Programming language; Mathematical economics","score_opus":0.07026642102134557,"score_gpt":0.30236779212286685,"score_spread":0.2321013711015213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146226507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46134096,0.000028031289,0.4814069,0.000109779045,0.00033819492,0.00019893362,0.0000010812277,0.00018936052,0.056386754],"genre_scores_gemma":[0.9826274,0.0000051848597,0.01621205,0.0006452965,0.000021659824,0.000010592333,3.060457e-7,0.00000760182,0.00046990364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987971,0.00003376161,0.00024851426,0.00035493044,0.00018321162,0.0003824556],"domain_scores_gemma":[0.9992333,0.00014402642,0.000053329302,0.00042859357,0.000071685434,0.00006907134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024324165,0.00013204273,0.00013353999,0.00014475425,0.000059913145,0.00007022508,0.0006349789,0.000061814775,0.00024098906],"category_scores_gemma":[0.0001142728,0.000107725995,0.000044458127,0.00021622362,0.000028143926,0.00062256784,0.00017101197,0.00017617056,0.00053057814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018532155,0.00023426647,0.0034396183,0.0000032014718,0.0000075709095,0.000102111095,0.009738885,0.00030340048,0.0004291534,0.8922066,0.0004032952,0.09311335],"study_design_scores_gemma":[0.00041995535,0.00060328946,0.048916508,0.00010946832,0.000004275447,0.000018886381,0.0040331096,0.44833255,0.12469043,0.3712913,0.0007015882,0.000878611],"about_ca_topic_score_codex":0.00043003846,"about_ca_topic_score_gemma":0.0009544859,"teacher_disagreement_score":0.5212864,"about_ca_system_score_codex":0.000036127167,"about_ca_system_score_gemma":0.00003599912,"threshold_uncertainty_score":0.68196857},"labels":[],"label_agreement":null},{"id":"W2148230159","doi":"","title":"Probabilistic state translation in extensive games with large action sets","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Probabilistic logic; Sequential game; Repeated game; Solution concept; Combinatorial game theory; Action (physics); Extensive-form game; Adversary; Game mechanics; Mathematical economics; State (computer science); Metric (unit); Theoretical computer science; Equilibrium selection; Game theory; Artificial intelligence; Mathematics; Algorithm; Computer security","score_opus":0.04756015410897643,"score_gpt":0.3133745845900638,"score_spread":0.2658144304810873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148230159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3089821,0.000030895684,0.6869696,0.0017364627,0.000070219,0.0002784298,7.304607e-7,0.00015742911,0.0017741626],"genre_scores_gemma":[0.97950685,0.000009120766,0.01994764,0.00036779256,0.00001019738,0.000007348603,0.000001175712,0.0000035916987,0.00014630654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907416,0.000043783337,0.00018200962,0.0002817195,0.00018444985,0.0002338721],"domain_scores_gemma":[0.999508,0.000076184086,0.00004678717,0.00023700876,0.0000912362,0.000040764415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016364748,0.00009534556,0.00009977355,0.00009777139,0.000040834682,0.00007995255,0.00020473459,0.00003043016,0.000017449567],"category_scores_gemma":[0.000033725308,0.000074346164,0.000018679431,0.00036131626,0.000023643297,0.00066377746,0.000011682251,0.000092062284,0.00004307602],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054569813,0.00022108991,0.00086160714,0.0000096423355,0.0000053975396,0.000042170024,0.008109781,0.009455142,0.0014120503,0.031136522,0.00014895402,0.9485431],"study_design_scores_gemma":[0.00037108676,0.00074786803,0.050671317,0.00008107915,0.00000661322,0.000032765616,0.0007828453,0.73806244,0.03128154,0.17619394,0.0012477613,0.0005207237],"about_ca_topic_score_codex":0.00004126022,"about_ca_topic_score_gemma":0.0008586622,"teacher_disagreement_score":0.94802237,"about_ca_system_score_codex":0.000041951505,"about_ca_system_score_gemma":0.000043042128,"threshold_uncertainty_score":0.30317485},"labels":[],"label_agreement":null},{"id":"W2149308876","doi":"10.1109/icinfa.2009.5205101","title":"Implementing a no-loss state in the game of Tic-Tac-Toe using a customized Decision Tree Algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Minimax; Computer science; Game tree; Adversary; State (computer science); Mathematical optimization; Tree (set theory); Decision tree; Game theory; Sequential game; Algorithm; Mathematical economics; Artificial intelligence; Mathematics","score_opus":0.0361210051492268,"score_gpt":0.3356410775052973,"score_spread":0.29952007235607053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149308876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27251607,0.000028399338,0.72596264,0.00018172665,0.00009952131,0.00021106483,0.0000010612893,0.00004131851,0.00095821795],"genre_scores_gemma":[0.7107428,0.000009603082,0.28877306,0.00036250733,0.000033635893,0.0000035235166,3.7124767e-7,0.000005006225,0.000069549424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795353,0.00010983558,0.00064417074,0.00032617437,0.00046956254,0.0004967311],"domain_scores_gemma":[0.99857116,0.0004782576,0.00018346542,0.0005762147,0.00014714993,0.000043764616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015820793,0.00014618417,0.00024497992,0.00017620719,0.000082699116,0.00016034789,0.0011598158,0.000037460453,0.00003981949],"category_scores_gemma":[0.00017715736,0.000099154335,0.0000945041,0.00067602686,0.00005278301,0.0004730754,0.00022946521,0.00013544087,0.0000453949],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021605674,0.00009572487,0.0002627267,0.0000021685344,0.0000061153346,0.000028752078,0.0035948392,0.0007389465,0.002950878,0.0029315238,0.00008192232,0.9892848],"study_design_scores_gemma":[0.0003280511,0.00011296782,0.0008258774,0.000046174762,0.0000061585556,0.000016231144,0.0003440062,0.93622255,0.017760357,0.043519035,0.0006461947,0.00017236949],"about_ca_topic_score_codex":0.0005167572,"about_ca_topic_score_gemma":0.00023658907,"teacher_disagreement_score":0.98911244,"about_ca_system_score_codex":0.000050064064,"about_ca_system_score_gemma":0.00006938132,"threshold_uncertainty_score":0.40433964},"labels":[],"label_agreement":null},{"id":"W2151083440","doi":"10.1109/nlpke.2009.5313787","title":"Automatic generation of narrative content for digital games","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Ontario Centres of Excellence","keywords":"Computer science; Natural language generation; Narrative; Template; Context (archaeology); Multimedia; Natural language; Human–computer interaction; Natural language processing; Artificial intelligence; Programming language; Linguistics","score_opus":0.10885837122642401,"score_gpt":0.3151505427535376,"score_spread":0.2062921715271136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151083440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2078164,0.000022445538,0.7895345,0.0011464786,0.000116634656,0.00019762463,0.0000012745246,0.000079072764,0.0010855413],"genre_scores_gemma":[0.94790876,9.111295e-7,0.051317383,0.0002203306,0.000039321894,0.000009301225,0.000001701425,0.000001849814,0.0005004228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937695,0.000009451188,0.00023347964,0.00015015795,0.00012034073,0.0001096435],"domain_scores_gemma":[0.9994775,0.00007013489,0.00007628811,0.00019307618,0.00015387786,0.00002913268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081268416,0.00006403059,0.00010507912,0.000041193507,0.000041352978,0.000107976084,0.00027118178,0.000023665261,0.000018415134],"category_scores_gemma":[0.000120276294,0.000050555653,0.00005294754,0.000095292635,0.000030887895,0.00058763666,0.00002174519,0.000019687384,0.0000110529645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029485682,0.0000987511,0.00008384245,0.0000051162556,0.000011108823,6.1714087e-7,0.0067998003,0.00020161684,0.017383466,0.25191975,0.0024118605,0.72108114],"study_design_scores_gemma":[0.00005119653,0.00033001212,0.00031588296,0.000009565004,0.0000017297903,0.0000017609764,0.00063473854,0.7346401,0.24480495,0.0189292,0.00019268399,0.00008816482],"about_ca_topic_score_codex":0.000004730108,"about_ca_topic_score_gemma":0.0000056192994,"teacher_disagreement_score":0.7400924,"about_ca_system_score_codex":0.00001601682,"about_ca_system_score_gemma":0.000028631835,"threshold_uncertainty_score":0.20615996},"labels":[],"label_agreement":null},{"id":"W2151123669","doi":"10.5555/1838206.1838229","title":"Using counterfactual regret minimization to create competitive multiplayer poker agents","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Perfect information; Computer science; Regret; Counterfactual thinking; Nash equilibrium; Extensive-form game; Mathematical economics; Strategy; Best response; Bayesian game; Complete information; Repeated game; Game theory; Mathematics; Machine learning","score_opus":0.0745210933639978,"score_gpt":0.34092934525440116,"score_spread":0.26640825189040335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151123669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35915038,0.0000017671426,0.6318922,0.00037998985,0.00084407785,0.00017763335,0.0000033005072,0.00012607692,0.0074245525],"genre_scores_gemma":[0.8227111,8.243334e-7,0.17537415,0.0009633487,0.0000811021,0.0000045754023,0.000001587105,0.000010259382,0.0008530537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876636,0.000036633308,0.00024299054,0.0003936512,0.0002784106,0.0002819315],"domain_scores_gemma":[0.99900913,0.00011055529,0.00006522913,0.0004530442,0.0002190815,0.00014295934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015465188,0.00014574469,0.00013006723,0.0001131102,0.00013172443,0.0002237454,0.0006251646,0.0000784629,0.000532298],"category_scores_gemma":[0.00015550526,0.0001296715,0.00004951106,0.00026146858,0.00006144551,0.0005346107,0.00026200563,0.0001475589,0.0006573902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001703526,0.00078529585,0.04273453,0.00002913692,0.000204758,0.00015007758,0.04185547,0.038946312,0.27930492,0.48936474,0.017207123,0.089247264],"study_design_scores_gemma":[0.00010214625,0.00006805787,0.00298015,0.000024032664,0.0000074264426,0.000019079202,0.0003839339,0.8059585,0.17695735,0.00065736804,0.012479174,0.00036276993],"about_ca_topic_score_codex":0.00020755059,"about_ca_topic_score_gemma":0.0002645783,"teacher_disagreement_score":0.7670122,"about_ca_system_score_codex":0.000036732858,"about_ca_system_score_gemma":0.00004758121,"threshold_uncertainty_score":0.844964},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Human–computer interaction; Video game; Emotional expression; Multimedia; Cognitive psychology; Psychology","score_opus":0.0389813789453596,"score_gpt":0.29836036523678205,"score_spread":0.2593789862914225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152070548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12774602,0.000053613003,0.78234583,0.00227671,0.0003954576,0.00011186499,4.177867e-7,0.00018718794,0.08688288],"genre_scores_gemma":[0.96470934,0.0000018579702,0.032099992,0.0003012074,0.00006522507,0.00000640434,8.211141e-7,0.0000031020697,0.0028120247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991107,0.000024288045,0.00022178535,0.00022750103,0.00022216135,0.00019357214],"domain_scores_gemma":[0.99962157,0.00004779001,0.000030584597,0.00024107656,0.00003558896,0.000023415796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016823474,0.00006544331,0.000065998036,0.00009697427,0.000031098105,0.00007855301,0.00045990606,0.00002840356,0.00017248474],"category_scores_gemma":[0.000025801255,0.000059668186,0.000026402127,0.00027031422,0.000034922377,0.00046352312,0.000119414224,0.00004989611,0.0004022111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019018604,0.00014374313,0.044840205,0.0000029419864,0.000002464027,0.000020342213,0.00015418249,0.0012985554,0.0017763022,0.89192206,0.010535629,0.049301684],"study_design_scores_gemma":[0.00017741714,0.000071349714,0.17737061,0.000049694772,0.0000014560962,0.000012864041,0.00007792229,0.15810288,0.071439594,0.57329094,0.0189567,0.00044856616],"about_ca_topic_score_codex":0.00046541952,"about_ca_topic_score_gemma":0.00034777448,"teacher_disagreement_score":0.83696336,"about_ca_system_score_codex":0.000044352437,"about_ca_system_score_gemma":0.000027873413,"threshold_uncertainty_score":0.5169744},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.044164561907309385,"score_gpt":0.309821783679691,"score_spread":0.2656572217723816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153039919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36098897,0.00021928681,0.6365866,0.00053884985,0.00029733017,0.000085347616,2.5077696e-7,0.0001777458,0.0011055847],"genre_scores_gemma":[0.9600753,0.0000073199117,0.03881128,0.00019761172,0.0001755306,0.0000058463297,0.0000024484634,0.000011338019,0.0007133055],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842966,0.00024534672,0.00024308042,0.0002762816,0.00026989548,0.00053576595],"domain_scores_gemma":[0.9992937,0.00018774909,0.000053232838,0.00031100368,0.000033642173,0.00012067407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007587237,0.00013708972,0.00016014578,0.00016209402,0.000115019524,0.00012326131,0.00069156784,0.000057220695,0.000071179835],"category_scores_gemma":[0.00007378367,0.00012450635,0.00004128942,0.00043260006,0.00004708205,0.00043499022,0.0004668406,0.0004993384,0.0005071312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026155362,0.000056968674,0.7552085,0.000006857801,0.0000030289427,0.000008824315,0.0035513598,0.0057315226,0.00032016844,0.004641677,0.00004427469,0.23042423],"study_design_scores_gemma":[0.00006787829,0.000063642634,0.09152698,0.000026544054,9.837954e-7,0.0000135203745,0.000036465717,0.9015283,0.0016696675,0.0005128399,0.0043401346,0.00021307568],"about_ca_topic_score_codex":0.00051287835,"about_ca_topic_score_gemma":0.0000757967,"teacher_disagreement_score":0.8957968,"about_ca_system_score_codex":0.00005078119,"about_ca_system_score_gemma":0.000022940223,"threshold_uncertainty_score":0.6518315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04533729866204827,"score_gpt":0.21954440418238036,"score_spread":0.17420710552033208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153678894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5363939,0.000025062998,0.46015242,0.0007508441,0.0003878939,0.00017737177,0.000050368428,0.00009374675,0.0019684504],"genre_scores_gemma":[0.9598719,0.00003297429,0.024145357,0.00042340733,0.000085596876,8.761947e-7,0.000004655938,0.000014405945,0.015420842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980921,0.0001408173,0.00023973339,0.00063943386,0.00037688884,0.00051100616],"domain_scores_gemma":[0.998848,0.000199206,0.00010850764,0.0006505796,0.00006611044,0.00012754931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017403926,0.00023986923,0.00030875157,0.00043349547,0.00038671147,0.00008570038,0.0015051764,0.00012098096,0.000060793063],"category_scores_gemma":[0.000019179446,0.00027555926,0.00014706056,0.0010807916,0.00020519299,0.0036969162,0.0009646707,0.0002942311,0.0004523251],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006174897,0.0017392121,0.25725225,0.000110634566,0.00024315562,0.01804529,0.029797053,0.02263407,0.0025167326,0.5732692,0.05438588,0.039389025],"study_design_scores_gemma":[0.0031410581,0.0006813351,0.5097382,0.00037195225,0.00004350151,0.0006983053,0.0028502343,0.43191,0.003083459,0.002875734,0.041538075,0.0030680965],"about_ca_topic_score_codex":0.00025826853,"about_ca_topic_score_gemma":0.0005926926,"teacher_disagreement_score":0.5703935,"about_ca_system_score_codex":0.00025880453,"about_ca_system_score_gemma":0.0001834337,"threshold_uncertainty_score":0.99996966},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0451494206295277,"score_gpt":0.30704159537458625,"score_spread":0.26189217474505855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153816030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0182887,0.000028037086,0.86105716,0.0002615403,0.00043886958,0.000049192742,8.751875e-8,0.0003442381,0.11953219],"genre_scores_gemma":[0.86613363,0.0000013743455,0.13293432,0.000413187,0.00010050602,3.2890378e-7,2.1482666e-7,0.0000044431295,0.00041197357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989454,0.000013824484,0.00024659804,0.00024815355,0.00021172345,0.00033427347],"domain_scores_gemma":[0.9992772,0.00017780777,0.000050982217,0.0003356522,0.00009039275,0.00006799965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058295665,0.00009406594,0.00008825913,0.00007091883,0.000111477086,0.00032260077,0.0007620375,0.000042430125,0.000054539578],"category_scores_gemma":[0.000025946802,0.00008218558,0.000037559676,0.00027247978,0.000068443245,0.0006037923,0.00019032016,0.000097458316,0.00033897298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023911161,0.00003525822,0.0013219129,0.0000044583567,0.0000069006587,0.000039982988,0.0014702068,0.0040787226,0.00063646905,0.8445216,0.0014016669,0.14648047],"study_design_scores_gemma":[0.00011469916,0.00016901238,0.005682737,0.00004844258,0.000004892632,0.000073473566,0.0067320545,0.8356274,0.0735376,0.04826831,0.02894763,0.00079378916],"about_ca_topic_score_codex":0.000108660446,"about_ca_topic_score_gemma":0.00015910018,"teacher_disagreement_score":0.84784496,"about_ca_system_score_codex":0.000030553492,"about_ca_system_score_gemma":0.00004674703,"threshold_uncertainty_score":0.4356925},"labels":[],"label_agreement":null},{"id":"W2155727572","doi":"10.1613/jair.3076","title":"Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding","year":2010,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Domain (mathematical analysis); Pathfinding; Constant (computer programming); Property (philosophy); Incremental heuristic search; Video game; Scale (ratio)","score_opus":0.19857307610173033,"score_gpt":0.4394584863231504,"score_spread":0.24088541022142004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155727572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5722265,0.00004217172,0.42524245,0.000955035,0.00078272296,0.00050122215,0.000004759437,0.000040470182,0.00020466441],"genre_scores_gemma":[0.94650203,0.00003094559,0.052618895,0.000042385833,0.00068587344,0.000029999683,8.851671e-7,0.00004079173,0.00004819825],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99357796,0.00069240225,0.0019042904,0.0006473136,0.0017331541,0.0014449052],"domain_scores_gemma":[0.9893911,0.0062007,0.0004106553,0.00084692804,0.002651289,0.00049933745],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.017696084,0.0002862281,0.00057040405,0.002149302,0.00044374441,0.0008329203,0.002474732,0.00025888867,0.00015728838],"category_scores_gemma":[0.0047114193,0.00026696725,0.00030722347,0.002368261,0.0005846428,0.00093250035,0.00032104776,0.0024662474,0.00023348193],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006753804,0.0010545867,0.0014426233,0.00015704361,0.00005334549,0.010186955,0.0075927963,0.021709118,0.4716811,0.118210614,0.00033646447,0.3669],"study_design_scores_gemma":[0.000061952844,0.00069975347,0.000032300526,0.0001504088,0.0000069398775,0.001052848,0.00097574777,0.4944609,0.44487533,0.05709512,0.0002953697,0.00029331737],"about_ca_topic_score_codex":0.000494745,"about_ca_topic_score_gemma":0.0005064945,"teacher_disagreement_score":0.4727518,"about_ca_system_score_codex":0.00029929634,"about_ca_system_score_gemma":0.0013271936,"threshold_uncertainty_score":0.99997824},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09375477713319037,"score_gpt":0.37999727258353266,"score_spread":0.2862424954503423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156078757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018554676,0.000019448156,0.9179109,0.00008271966,0.00044265194,0.000062355444,1.0088072e-7,0.00021085696,0.06271632],"genre_scores_gemma":[0.9515848,4.359309e-7,0.047671154,0.00022977842,0.00017721554,5.4611854e-7,5.061717e-7,0.000003640415,0.00033190261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991583,0.000013887087,0.00020064085,0.00020479292,0.00019267539,0.0002296524],"domain_scores_gemma":[0.99938637,0.00024057218,0.000045588786,0.00023400977,0.000054076976,0.000039409162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028371878,0.00007178032,0.00006403093,0.000039511397,0.000084864834,0.000092874376,0.0003787527,0.000052830117,0.000066871246],"category_scores_gemma":[0.000049552284,0.00006481503,0.000029412413,0.00021387315,0.00002887754,0.0007919177,0.000079743746,0.0000746794,0.00017797489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015384581,0.000030289944,0.0010181598,0.0000018876344,0.0000076034307,0.000031105756,0.0028368474,0.52363384,0.00066158664,0.36122763,0.00034284088,0.110192806],"study_design_scores_gemma":[0.00007165406,0.00008579602,0.0014910421,0.000008190985,0.0000022154532,0.0000032469097,0.00053292426,0.901992,0.032911457,0.055485457,0.0072131655,0.0002028181],"about_ca_topic_score_codex":0.000080763086,"about_ca_topic_score_gemma":0.000017691256,"teacher_disagreement_score":0.9330301,"about_ca_system_score_codex":0.00002694203,"about_ca_system_score_gemma":0.000026235479,"threshold_uncertainty_score":0.264308},"labels":[],"label_agreement":null},{"id":"W2156494678","doi":"","title":"Learning from multiple heuristics","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Computer science; Mathematical optimization; Hyper-heuristic; Reduction (mathematics); Domain (mathematical analysis); Artificial intelligence; Mathematics; Robot","score_opus":0.06345731997758398,"score_gpt":0.26598524783891175,"score_spread":0.20252792786132778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156494678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16244698,0.00002971831,0.82972866,0.00019561942,0.0002435243,0.000031788506,2.483813e-7,0.00030104155,0.0070224516],"genre_scores_gemma":[0.8958021,0.000018898187,0.10191977,0.0001794044,0.00007555969,0.0000019709287,9.2733035e-7,0.0000044963354,0.0019968853],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928755,0.000030960742,0.00013989808,0.0002166082,0.0001623358,0.00016264532],"domain_scores_gemma":[0.9992838,0.0002958307,0.000033082863,0.00027792348,0.00005108053,0.00005829983],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000054197215,0.000067964604,0.00007637386,0.00002964355,0.0001661344,0.00004238675,0.0005102996,0.000033179313,0.00010733229],"category_scores_gemma":[0.00028197173,0.00006142315,0.000031577172,0.0001334758,0.000056187087,0.00020354796,0.00017011036,0.00012050391,0.0010863165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001585628,0.00030053774,0.5263932,0.0000053216418,0.000055207667,0.0005330863,0.021482538,0.02172773,0.010210829,0.08652993,0.022283021,0.3104628],"study_design_scores_gemma":[0.00005123545,0.000060213857,0.008462387,0.0000047376416,0.0000014575622,0.000013604287,0.0001528984,0.9135821,0.04768892,0.0072932164,0.022472687,0.00021655703],"about_ca_topic_score_codex":0.0004215875,"about_ca_topic_score_gemma":0.00003234491,"teacher_disagreement_score":0.89185435,"about_ca_system_score_codex":0.00001364644,"about_ca_system_score_gemma":0.000025392434,"threshold_uncertainty_score":0.9996914},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08309830794725798,"score_gpt":0.3423465536720401,"score_spread":0.2592482457247821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156523042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025388211,0.000087964916,0.95347345,0.0026756385,0.0003098803,0.00055109005,6.080671e-7,0.00026216698,0.017250985],"genre_scores_gemma":[0.65960276,0.000004224974,0.3371922,0.0026607944,0.00010903488,0.00007083466,5.803017e-7,0.000013595407,0.0003459338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979529,0.000123235,0.00033208058,0.0005484761,0.0005857062,0.00045760506],"domain_scores_gemma":[0.9983668,0.0002181688,0.00007397876,0.0009523162,0.00024796557,0.00014082035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052916375,0.00019584899,0.00018118219,0.000084889085,0.00022059452,0.00030787307,0.0017818377,0.000054221167,0.000029349883],"category_scores_gemma":[0.00016736427,0.00012766111,0.00009115877,0.00069874333,0.00018980511,0.0002469373,0.00054936757,0.00019987772,0.0007612644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005068857,0.00010596231,0.000018573654,0.0000076023853,0.000017863196,0.000004351509,0.011203169,0.061154284,0.0010040672,0.831224,0.00023368721,0.09502133],"study_design_scores_gemma":[0.00017795323,0.00031762721,0.00030199933,0.000039129183,0.000014254393,0.000064044616,0.0028729136,0.70562714,0.020686947,0.26756346,0.0018589128,0.00047562795],"about_ca_topic_score_codex":0.00014491081,"about_ca_topic_score_gemma":0.000009941457,"teacher_disagreement_score":0.64447284,"about_ca_system_score_codex":0.00008921513,"about_ca_system_score_gemma":0.00010996295,"threshold_uncertainty_score":0.97847676},"labels":[],"label_agreement":null},{"id":"W2156947632","doi":"10.1145/1920778.1920782","title":"A flexible multi-model approach to psychosocial integration in non player characters in modern video games","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Flexibility (engineering); Computer science; Multitude; Strengths and weaknesses; Video game; Human–computer interaction; Forcing (mathematics); Character (mathematics); Multimedia; Game design; Artificial intelligence; Psychology","score_opus":0.0484231943131269,"score_gpt":0.3212004834281321,"score_spread":0.2727772891150052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156947632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31946194,0.0000021024794,0.6757574,0.00068929547,0.00027529,0.00032239573,6.509293e-7,0.00008617239,0.0034047866],"genre_scores_gemma":[0.8024734,0.0000017867667,0.19609289,0.0006995311,0.00004895261,0.00011281886,0.0000017248403,0.000011383623,0.000557487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982986,0.000035772788,0.00040976587,0.0006010603,0.00025943422,0.0003953833],"domain_scores_gemma":[0.99923605,0.000049255766,0.00006319698,0.00047725235,0.00006683108,0.00010744476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046569854,0.00018587832,0.00020824894,0.0004015856,0.00004594608,0.00018696715,0.000911811,0.00016291281,0.000007822909],"category_scores_gemma":[0.000096776006,0.00017018423,0.000053891137,0.0006171056,0.000043463482,0.000884134,0.00015942608,0.0004547396,0.00010115137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008818212,0.0014230652,0.005952241,0.000015394631,0.000008348407,0.000006049018,0.06897464,0.04411856,0.21563338,0.07084031,0.0007943456,0.5921455],"study_design_scores_gemma":[0.00012788773,0.000021415135,0.005566497,0.000017746786,6.924087e-7,0.0000012555041,0.00026879294,0.96316797,0.02516928,0.005414615,0.000029805504,0.0002140488],"about_ca_topic_score_codex":0.0005253014,"about_ca_topic_score_gemma":0.003591404,"teacher_disagreement_score":0.9190494,"about_ca_system_score_codex":0.000073396295,"about_ca_system_score_gemma":0.000071524424,"threshold_uncertainty_score":0.6939911},"labels":[],"label_agreement":null},{"id":"W2157280870","doi":"10.1109/icdar.1995.599042","title":"The Delta LogNormal theory for the generation and modeling of cursive characters","year":2002,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cursive; Log-normal distribution; Computer science; Delta; Mathematics; Statistical physics; Artificial intelligence; Statistics; Physics","score_opus":0.09365625717749096,"score_gpt":0.2846646788326974,"score_spread":0.19100842165520646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157280870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021103052,0.00047273107,0.9754563,0.0023510149,0.00019250385,0.0001693401,6.95198e-7,0.000016338772,0.0002380516],"genre_scores_gemma":[0.99463403,0.00017958297,0.004590238,0.00027004073,0.00007958621,0.000018556048,2.5200504e-7,0.000002826961,0.00022487575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950516,0.000033771135,0.00014309029,0.000113209106,0.000087851695,0.000116908705],"domain_scores_gemma":[0.999111,0.00051086774,0.000047678288,0.00022424918,0.0000897626,0.000016445429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034699214,0.00004941221,0.00004563268,0.00001446613,0.00026926567,0.00009171008,0.00038444714,0.000019979701,0.000006338201],"category_scores_gemma":[0.00009096488,0.000024975618,0.00002828032,0.000055407163,0.00008459714,0.00023664779,0.00007213984,0.000039487768,0.0000027190001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004971995,0.000010525609,0.000026045462,0.000001766386,0.000013954326,1.3061356e-7,0.002567282,0.0151196765,0.0010188248,0.7227734,0.0003271433,0.25813627],"study_design_scores_gemma":[0.000016430236,0.000023610966,0.0000086121145,0.0000017872502,0.000003736875,0.0000014541279,0.0002986082,0.9747252,0.0075749373,0.017139407,0.00017029828,0.000035914454],"about_ca_topic_score_codex":0.00001562511,"about_ca_topic_score_gemma":0.000026492262,"teacher_disagreement_score":0.973531,"about_ca_system_score_codex":0.000005458991,"about_ca_system_score_gemma":0.0000063858906,"threshold_uncertainty_score":0.20710011},"labels":[],"label_agreement":null},{"id":"W2158973351","doi":"10.5555/2484920.2484963","title":"Online implicit agent modelling","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Portfolio; Adversary; Limit (mathematics); Variance (accounting); Domain (mathematical analysis); Artificial intelligence; Machine learning; Mathematics","score_opus":0.07010303536755902,"score_gpt":0.2988001139326174,"score_spread":0.2286970785650584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158973351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08054344,0.000027743607,0.9109336,0.0015374174,0.00018115506,0.00011376668,3.0330213e-7,0.000225852,0.006436716],"genre_scores_gemma":[0.74077946,0.000011137451,0.2561918,0.0009788743,0.00006617456,0.000011643251,5.904879e-7,0.0000054972916,0.0019548046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991559,0.000013745351,0.0001925205,0.00024358305,0.00015533509,0.00023892733],"domain_scores_gemma":[0.9993046,0.0000483529,0.000028276949,0.00044299022,0.0000887873,0.00008699234],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006579075,0.000083379506,0.00008028059,0.0000479235,0.000059040158,0.0001642121,0.00072337734,0.00003254393,0.00035098044],"category_scores_gemma":[0.0000100929365,0.0000671449,0.000041813,0.00016532009,0.00002242697,0.0005063237,0.00020647954,0.00007272175,0.0022830851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.7077294e-7,0.00026769153,0.00051197014,0.0000061993264,0.000017838642,0.0000073523825,0.0012593971,0.103321455,0.004302585,0.46340743,0.010237154,0.41666016],"study_design_scores_gemma":[0.000009748283,0.000016842916,0.00010338765,0.0000030741953,6.556251e-7,0.000002700334,0.00005988169,0.9461904,0.007283858,0.044057846,0.0021753532,0.000096241136],"about_ca_topic_score_codex":0.00070042466,"about_ca_topic_score_gemma":0.000020118116,"teacher_disagreement_score":0.842869,"about_ca_system_score_codex":0.000021012487,"about_ca_system_score_gemma":0.000017930372,"threshold_uncertainty_score":0.99849373},"labels":[],"label_agreement":null},{"id":"W2159142062","doi":"10.1109/cig.2011.6031984","title":"Incorporating required structure into tiles","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Tile; Computer science; Computation; Fitness function; Evolutionary computation; Function (biology); Pairwise comparison; Decomposition; Artificial intelligence; Genetic algorithm; Algorithm; Machine learning","score_opus":0.05764542802992658,"score_gpt":0.2770169674383787,"score_spread":0.21937153940845214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159142062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10123675,0.000029306557,0.8602468,0.00024807596,0.00050522364,0.00009856369,3.811775e-7,0.00040793006,0.037226975],"genre_scores_gemma":[0.7150273,5.338116e-7,0.28454554,0.00020086045,0.000040478477,0.000001979773,3.102059e-7,0.0000042228926,0.00017882141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991874,0.000029126913,0.00020508436,0.00026140493,0.00015252527,0.0001644484],"domain_scores_gemma":[0.99929726,0.000033204622,0.0000756909,0.00045858193,0.000071199254,0.0000640388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010935804,0.0000942789,0.00008822858,0.000058636393,0.00009918425,0.00007722435,0.0008812033,0.000053870743,0.00020935388],"category_scores_gemma":[0.000062473286,0.000075938624,0.000028928818,0.00024143429,0.00007837658,0.0006259372,0.00028602517,0.0000792843,0.00018346509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025422203,0.000018278233,0.0028807921,0.000004512831,0.0000068038566,0.0000140031825,0.008269404,0.000014842776,0.01231382,0.8479542,0.0005212712,0.12799951],"study_design_scores_gemma":[0.00001864052,0.00005504481,0.00066856906,0.000008481742,0.0000015767034,0.000007580189,0.00033241164,0.022539044,0.39389262,0.5819776,0.0003214632,0.0001769558],"about_ca_topic_score_codex":0.00031612607,"about_ca_topic_score_gemma":0.00024587582,"teacher_disagreement_score":0.6137905,"about_ca_system_score_codex":0.000018803843,"about_ca_system_score_gemma":0.000042482938,"threshold_uncertainty_score":0.30966872},"labels":[],"label_agreement":null},{"id":"W2161232659","doi":"10.1109/cig.2008.5035658","title":"Learning and knowledge generation in General Games","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Variety (cybernetics); Reinforcement learning; Artificial intelligence; Heuristic; Representation (politics); Tree (set theory); Machine learning; Mathematics","score_opus":0.05657304517002479,"score_gpt":0.30601673804395874,"score_spread":0.24944369287393395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161232659","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8490373,0.00027268167,0.14169465,0.00020959158,0.00011281666,0.000048462043,2.658388e-8,0.000078249795,0.008546217],"genre_scores_gemma":[0.9690211,0.00012073528,0.026160369,0.00006704164,0.00009709316,0.0000051840934,4.4317076e-7,0.0000032693747,0.0045247907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999404,0.000052619398,0.00013349864,0.00020530442,0.00006940418,0.0001351566],"domain_scores_gemma":[0.9997818,0.000033098866,0.00001958061,0.00009922296,0.000030905845,0.000035396137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012930004,0.000059970385,0.00006939199,0.00008370242,0.00008995973,0.00004514013,0.00014511916,0.00003171763,0.000023363466],"category_scores_gemma":[0.000042882693,0.000054626915,0.0000129017035,0.00018078064,0.00004793695,0.0002992347,0.00010740985,0.0000832551,0.00006752152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034577258,0.00013146957,0.12664555,0.000007460049,0.000007697503,0.000067542176,0.022485454,0.0048478516,0.027342755,0.15792127,0.0042069196,0.65633255],"study_design_scores_gemma":[0.000043746837,0.000051420204,0.0054341713,0.000002899478,4.2080043e-7,0.00003158595,0.000067745925,0.9504381,0.035908855,0.0008318337,0.0070633283,0.00012593737],"about_ca_topic_score_codex":0.00008081423,"about_ca_topic_score_gemma":0.00018379785,"teacher_disagreement_score":0.9455902,"about_ca_system_score_codex":0.00001776701,"about_ca_system_score_gemma":0.000034042914,"threshold_uncertainty_score":0.2227621},"labels":[],"label_agreement":null},{"id":"W2162727384","doi":"10.1609/aiide.v7i1.12421","title":"A Demonstration of ScriptEase II","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Game programming; Programming language; Video game; Video game development; Code (set theory); Game engine; Multimedia; Game art design; Game development tool; Human–computer interaction; Game design; Computer graphics (images); World Wide Web; Game Developer; Game design document","score_opus":0.07470981908872601,"score_gpt":0.2775847553731942,"score_spread":0.2028749362844682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162727384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8644694,0.000025477626,0.048635524,0.001025996,0.000516402,0.00067832303,0.000021577389,0.000064807035,0.08456249],"genre_scores_gemma":[0.9987295,0.00002383226,0.00082263636,0.00012283573,0.000019640076,0.00002481675,6.058388e-7,0.00000916455,0.0002469362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998151,0.000013713293,0.00071245903,0.00044542368,0.00040906362,0.0002683077],"domain_scores_gemma":[0.9984793,0.00006570989,0.00052726344,0.0002541053,0.0005741783,0.00009946447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020437085,0.00024134843,0.00027389737,0.00015718657,0.00011850237,0.00017901383,0.0011058201,0.00006449758,0.00005576911],"category_scores_gemma":[0.00023601536,0.00017898553,0.00014723578,0.00029429188,0.00045370904,0.0015655342,0.00060220534,0.00020309075,0.000021926464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000209397,0.00068517524,0.0011503045,0.000026405554,0.00004710006,7.7812825e-7,0.009941109,0.0000035908067,0.02347839,0.8068899,0.00005458884,0.15751325],"study_design_scores_gemma":[0.000022605393,0.000926121,0.00030260428,0.00029351906,0.000012509364,0.000006806389,0.0042739054,0.009315387,0.8778518,0.10673159,0.00007155919,0.0001916054],"about_ca_topic_score_codex":0.000053011896,"about_ca_topic_score_gemma":0.000005643346,"teacher_disagreement_score":0.8543734,"about_ca_system_score_codex":0.000047657526,"about_ca_system_score_gemma":0.000050989547,"threshold_uncertainty_score":0.7298818},"labels":[],"label_agreement":null},{"id":"W2162955610","doi":"10.1109/cec.2011.5949707","title":"Decomposing the level generation problem with tiles","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Tile; Computer science; Evolutionary computation; Computation; Evolutionary algorithm; Quality (philosophy); Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.17427642308718508,"score_gpt":0.28340821739377703,"score_spread":0.10913179430659195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162955610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02860774,0.000015678934,0.9475002,0.0005066602,0.00008912672,0.00011164122,1.3034287e-7,0.000098743454,0.023070037],"genre_scores_gemma":[0.6811467,0.0000014473503,0.3181553,0.0002428275,0.00003822704,0.00000862245,1.7937593e-7,0.0000032422506,0.00040351215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994362,0.000027722073,0.000111081776,0.00016735231,0.00012667103,0.00013100146],"domain_scores_gemma":[0.9995402,0.000028010843,0.00003801511,0.00030444167,0.000064037566,0.000025293555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014823783,0.000064008804,0.00004438206,0.000023305183,0.00015273844,0.00012096949,0.0005174381,0.000018048138,0.000051127772],"category_scores_gemma":[0.0000052766304,0.000033341163,0.0000150142305,0.00013304855,0.00005665955,0.0003642446,0.00008257294,0.000049168073,0.000097351214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005133218,0.00006872329,0.0020887684,0.0000027566966,0.000017513097,0.0000061860997,0.0129743535,0.0004841982,0.0077904915,0.73397595,0.0019022428,0.2406837],"study_design_scores_gemma":[0.000043517754,0.00016680622,0.0023007416,0.000016296288,0.000006634121,0.00004085856,0.00035468323,0.3170648,0.655245,0.022255931,0.0022394955,0.00026521622],"about_ca_topic_score_codex":0.00019043572,"about_ca_topic_score_gemma":0.0004245056,"teacher_disagreement_score":0.71172,"about_ca_system_score_codex":0.000011092435,"about_ca_system_score_gemma":0.000031582505,"threshold_uncertainty_score":0.13596131},"labels":[],"label_agreement":null},{"id":"W2162969509","doi":"10.3233/icg-2012-35212","title":"MOHEX Wins Hex Tournament","year":2012,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tournament; Computer science; Mathematics; Combinatorics","score_opus":0.04265204296386952,"score_gpt":0.3028977791696757,"score_spread":0.26024573620580616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162969509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14999837,0.0011241823,0.8310871,0.0040675593,0.0038507236,0.00007537836,5.4375766e-7,0.00009090372,0.009705217],"genre_scores_gemma":[0.970789,0.00006493645,0.026464246,0.00074131315,0.001304759,0.0000022981067,9.734443e-8,0.000009204996,0.0006241564],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850255,0.00007743499,0.00032525358,0.00012722907,0.00042821505,0.00053932716],"domain_scores_gemma":[0.99900603,0.00006218462,0.00015534768,0.0003226765,0.00009467168,0.00035908085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007030964,0.00011815219,0.00012467442,0.00010301587,0.00025064222,0.0003554664,0.00093913113,0.00007194484,0.00022604897],"category_scores_gemma":[0.00005764144,0.000096484815,0.000103297796,0.00018767297,0.000043620817,0.0013726514,0.00017452176,0.00050724845,0.00069870986],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018648057,0.0006700009,0.043527838,0.00000924471,0.000119373704,0.00017970803,0.013759605,0.0008793234,0.008370255,0.16786273,0.053655125,0.71094817],"study_design_scores_gemma":[0.00056629407,0.000616127,0.045112982,0.00021502931,0.000054591997,0.009215995,0.0022385071,0.027574563,0.13715754,0.06862524,0.7069577,0.0016654081],"about_ca_topic_score_codex":0.00000899401,"about_ca_topic_score_gemma":0.0000027749338,"teacher_disagreement_score":0.82079065,"about_ca_system_score_codex":0.00011881154,"about_ca_system_score_gemma":0.00006823354,"threshold_uncertainty_score":0.8980735},"labels":[],"label_agreement":null},{"id":"W2163495392","doi":"10.1007/978-3-540-87608-3_21","title":"Probing the 4-3-2 Edge Template in Hex","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Algorithm; Theoretical computer science; Computer graphics (images); Artificial intelligence","score_opus":0.04070927090552214,"score_gpt":0.27140185748464785,"score_spread":0.2306925865791257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163495392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034116465,0.0007279943,0.98882174,0.0018758029,0.001972192,0.00059215666,0.0000013870774,0.00015173863,0.005515821],"genre_scores_gemma":[0.71622866,0.0004253266,0.27577662,0.0047303136,0.0012577362,0.000056865378,0.0000029906296,0.00010141087,0.0014200477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957226,0.00006273738,0.00074856594,0.001560002,0.0010193749,0.00088673],"domain_scores_gemma":[0.9967815,0.00083054625,0.00029472174,0.0017900636,0.00018180856,0.00012132193],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011892838,0.00053772517,0.00049664074,0.000811823,0.00041111634,0.0005406253,0.0060377014,0.00031321702,0.00001886746],"category_scores_gemma":[0.0001517973,0.00040158734,0.00013698693,0.0010722278,0.0014449356,0.0007334813,0.0019036158,0.0013498112,0.00016185366],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004971853,0.000033538337,0.00017303455,0.000020352072,0.000006980134,0.00032637906,0.0069606137,0.062037304,0.00014004068,0.01250562,0.00014908433,0.91764206],"study_design_scores_gemma":[0.0001468364,0.00018366052,0.00028321304,0.00083886046,0.0000051675574,0.00038488355,0.0000013050277,0.7444961,0.008093403,0.2321276,0.01213435,0.0013045977],"about_ca_topic_score_codex":0.00009926189,"about_ca_topic_score_gemma":0.00043277806,"teacher_disagreement_score":0.9163375,"about_ca_system_score_codex":0.00037812477,"about_ca_system_score_gemma":0.0006763241,"threshold_uncertainty_score":0.9998436},"labels":[],"label_agreement":null},{"id":"W2163823146","doi":"10.7939/r3gh9bg82","title":"TDS+: Improving Temperature Discovery Search","year":2015,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Game theory; Algorithm; Mathematical optimization; Mathematics; Theoretical computer science; Mathematical economics","score_opus":0.054321640674657536,"score_gpt":0.3042735190652889,"score_spread":0.24995187839063135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163823146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20952429,0.00015568484,0.76512444,0.0027980902,0.0009866498,0.00016049226,9.7769e-7,0.00039266725,0.020856712],"genre_scores_gemma":[0.9647892,0.0000019110146,0.02658283,0.0004868947,0.00015096761,0.000004574222,5.8088335e-7,0.000006827143,0.007976212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887496,0.000044880744,0.00014636133,0.0003072916,0.0003451223,0.00028135476],"domain_scores_gemma":[0.9991243,0.00005729948,0.000021034522,0.0005192504,0.0001338623,0.00014425522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037989998,0.0000939546,0.0000891183,0.000062569474,0.00006870905,0.0006162563,0.00089312706,0.000057308975,0.000014504257],"category_scores_gemma":[0.00010831269,0.000071802104,0.000037654863,0.00030699704,0.000051847128,0.0015108782,0.0004315061,0.00016337835,0.00039610715],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017945415,0.00015934242,0.0047320533,0.000020648573,0.000022998844,0.00009949558,0.0070251347,0.0017718509,0.054238684,0.6622479,0.023474054,0.24618988],"study_design_scores_gemma":[0.00018126729,0.00034393914,0.00074718724,0.000028059052,0.0000050361414,0.000055151188,0.0027808084,0.21164846,0.74483883,0.031109933,0.0074943323,0.0007669927],"about_ca_topic_score_codex":0.00023887109,"about_ca_topic_score_gemma":0.00004014381,"teacher_disagreement_score":0.75526494,"about_ca_system_score_codex":0.000049969072,"about_ca_system_score_gemma":0.00018950623,"threshold_uncertainty_score":0.5942574},"labels":[],"label_agreement":null},{"id":"W2164052165","doi":"10.1007/978-3-642-12993-3_9","title":"Hex, Braids, the Crossing Rule, and XH-Search","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Braid; Computer science; Connection (principal bundle); Algorithm; Mathematics; Geometry; Materials science","score_opus":0.030826282254413074,"score_gpt":0.2931463569686589,"score_spread":0.26232007471424584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164052165","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001388886,0.00071411964,0.98973763,0.003104902,0.0021112568,0.00035952477,0.0000025887266,0.00013985185,0.0024412558],"genre_scores_gemma":[0.3819602,0.000098088814,0.61126125,0.003991704,0.0013893087,0.000012384051,0.0000017840422,0.0000681449,0.001217138],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590015,0.00005412496,0.0005142243,0.0015453241,0.0011645234,0.0008216275],"domain_scores_gemma":[0.9962762,0.001252353,0.00019265914,0.0018001671,0.0002809412,0.00019766102],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017983274,0.00048933865,0.00041635233,0.000514466,0.0012052748,0.0033476558,0.0049378606,0.00039628436,0.00003266989],"category_scores_gemma":[0.00022772029,0.0003525064,0.00010616553,0.0005968583,0.004923795,0.0007475961,0.0028368235,0.0019488473,0.00007969264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027163164,0.0000113876295,0.00011164877,0.000014589593,0.000005663021,0.000042628268,0.0023849101,0.0019433693,0.0011621015,0.024028553,0.000009971827,0.97028244],"study_design_scores_gemma":[0.00009158787,0.00014069995,0.00047651172,0.00031017527,0.000008337176,0.00023936134,0.0000011588194,0.35238886,0.030689249,0.6073146,0.0073995297,0.0009399125],"about_ca_topic_score_codex":0.00010226707,"about_ca_topic_score_gemma":0.0002457813,"teacher_disagreement_score":0.9693425,"about_ca_system_score_codex":0.00011466504,"about_ca_system_score_gemma":0.0007264064,"threshold_uncertainty_score":0.9998927},"labels":[],"label_agreement":null},{"id":"W2164579897","doi":"","title":"CASPER: DESIGN AND DEVELOPMENT OF A CASE-BASED POKER PLAYER","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.07674165858052845,"score_gpt":0.3043897820056427,"score_spread":0.22764812342511426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164579897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10323415,0.000042497646,0.8956639,0.000072914474,0.000062073465,0.00010760548,8.764953e-8,0.000050148083,0.00076659844],"genre_scores_gemma":[0.5191809,2.7978615e-7,0.48064655,0.0001095574,0.00000488653,0.0000015183895,4.9984585e-8,0.0000022803542,0.00005396281],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991785,0.000021778484,0.00026081206,0.00019397167,0.00015333598,0.00019156346],"domain_scores_gemma":[0.99933493,0.0002668309,0.000046466324,0.00020662922,0.00007110463,0.00007402092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006820413,0.00007936995,0.0000901947,0.00008859472,0.0000708859,0.000031918542,0.00020406807,0.00003912297,0.000043660508],"category_scores_gemma":[0.000027496797,0.00006546007,0.000014156751,0.00014687184,0.0000536697,0.00012408735,0.00007784679,0.000043191805,0.00003302078],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005361214,0.00024636716,0.0037707014,0.000031692212,0.000045107958,0.0019533716,0.013004143,0.0018098627,0.016357921,0.028845565,0.0010730411,0.93280864],"study_design_scores_gemma":[0.000067171626,0.000055421086,0.00050415983,0.0000102542635,0.0000021210617,0.00023144101,0.00027381294,0.057909854,0.9385807,0.00040348398,0.0018034652,0.00015815368],"about_ca_topic_score_codex":0.000063896245,"about_ca_topic_score_gemma":0.0001419797,"teacher_disagreement_score":0.93265045,"about_ca_system_score_codex":0.000024318915,"about_ca_system_score_gemma":0.000118317286,"threshold_uncertainty_score":0.26693842},"labels":[],"label_agreement":null},{"id":"W2164764197","doi":"10.1007/11590323_4","title":"Generating Ambient Behaviors in Computer Role-Playing Games","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Computer game; Human–computer interaction; Code (set theory); Programming language; Multimedia","score_opus":0.024243061859419032,"score_gpt":0.2738307188121801,"score_spread":0.24958765695276103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164764197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063749035,0.00062975666,0.98804754,0.000522165,0.0026121235,0.00057778304,0.0000039956863,0.00026095603,0.0009707883],"genre_scores_gemma":[0.3230792,0.000050898,0.67326015,0.001943978,0.0013745514,0.000025089226,0.000005099165,0.000065214976,0.00019580862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931384,0.000087267945,0.0013284886,0.0025779046,0.0015152488,0.0013527154],"domain_scores_gemma":[0.99657667,0.0005505485,0.000496456,0.0018200495,0.0002797969,0.00027650569],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013800521,0.0009023596,0.00086309673,0.0016153394,0.00038985087,0.0011780404,0.0048568468,0.00052678573,0.000055880908],"category_scores_gemma":[0.00008220207,0.0008979689,0.00022440124,0.000983063,0.0008561975,0.0011780586,0.0024298886,0.0015559944,0.00014555902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026448163,0.000046508027,0.0005136395,0.000011343913,0.000004733434,0.00013551307,0.0020178263,0.28512022,0.0007628945,0.0039641694,0.000010297356,0.7074102],"study_design_scores_gemma":[0.00012412507,0.00015548427,0.00024595033,0.0005292741,0.000007162165,0.00008581637,9.665505e-7,0.9744741,0.0054030563,0.017138174,0.0008035593,0.0010323751],"about_ca_topic_score_codex":0.00020367188,"about_ca_topic_score_gemma":0.00088252954,"teacher_disagreement_score":0.70637786,"about_ca_system_score_codex":0.0008540396,"about_ca_system_score_gemma":0.0005590595,"threshold_uncertainty_score":0.99985886},"labels":[],"label_agreement":null},{"id":"W2165290874","doi":"10.1016/j.ins.2004.04.012","title":"A solution to the GHI problem for depth-first proof-number search","year":2004,"lang":"en","type":"article","venue":"Information Sciences","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Computer science; Graph; Overhead (engineering); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.0752782254553735,"score_gpt":0.34666800441411133,"score_spread":0.27138977895873784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165290874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086197,0.0000070200044,0.95563114,0.027457526,0.00034471854,0.0008537747,0.0000021434412,0.00008916177,0.006994826],"genre_scores_gemma":[0.8973266,0.0000018893487,0.10101856,0.0013432924,0.00006661919,0.00018873482,0.0000011280976,0.000001976252,0.000051234394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850786,0.000018610586,0.00033158818,0.00017671005,0.0006071384,0.00035807455],"domain_scores_gemma":[0.9991804,0.00011134119,0.00009344448,0.00026295712,0.00027666913,0.00007524077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015099971,0.00008758104,0.00007031689,0.0001224375,0.0009253377,0.0008242933,0.0014281613,0.000035253568,0.000008227753],"category_scores_gemma":[0.0001822446,0.000057129528,0.000043743774,0.0012085551,0.00019064614,0.0039268243,0.00020624553,0.00006784721,0.0008894949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009794565,0.0000405696,0.0008915764,0.000029077239,0.0000057700063,2.5235283e-7,0.043610558,0.1748632,0.00006188124,0.33740205,0.0040951553,0.43899012],"study_design_scores_gemma":[0.00034918604,0.0007296257,0.0029987155,0.0001536712,0.000005534229,0.00005786909,0.0053048674,0.5400139,0.0777914,0.10688616,0.26500627,0.0007028013],"about_ca_topic_score_codex":0.00023481192,"about_ca_topic_score_gemma":0.00046565273,"teacher_disagreement_score":0.88870686,"about_ca_system_score_codex":0.00008294764,"about_ca_system_score_gemma":0.00029111523,"threshold_uncertainty_score":0.9998884},"labels":[],"label_agreement":null},{"id":"W2165739367","doi":"10.1109/cec.2004.1330971","title":"Ayo, the Awari player, or how better representation trumps deeper search","year":2004,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Representation (politics); Computer science; Minimax; Domain (mathematical analysis); Artificial intelligence; Feature (linguistics); Function (biology); Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.08653278053684682,"score_gpt":0.3368927861811123,"score_spread":0.25036000564426547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165739367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14933965,0.000015404288,0.79878885,0.049342953,0.00030250743,0.0002010733,3.4883897e-7,0.00015464771,0.0018545785],"genre_scores_gemma":[0.9546016,0.000011664364,0.039602824,0.0027403487,0.00017157456,0.000022303047,8.450677e-7,0.000009795874,0.0028390356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99862003,0.00008220312,0.0001684375,0.00037463135,0.00043601292,0.00031868936],"domain_scores_gemma":[0.9987997,0.00023910256,0.00003735925,0.00076094206,0.000095678566,0.00006724894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003132566,0.00011200688,0.00009520939,0.000063454805,0.00022369329,0.00045348378,0.001120311,0.000056943943,0.00017615753],"category_scores_gemma":[0.00010829144,0.00006267539,0.000059025384,0.0004461987,0.00012316043,0.00066059636,0.00028122173,0.00017930634,0.00053075963],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007553241,0.00023710186,0.011544016,0.000017903618,0.0000973077,0.00019201597,0.031424753,0.020589737,0.0063285953,0.5319222,0.019512637,0.37805817],"study_design_scores_gemma":[0.00041535372,0.00033924947,0.007995384,0.00003661412,0.000015792588,0.00014426807,0.0040758396,0.0842234,0.75891083,0.13120346,0.011933724,0.0007060785],"about_ca_topic_score_codex":0.0007200364,"about_ca_topic_score_gemma":0.0003991772,"teacher_disagreement_score":0.80526197,"about_ca_system_score_codex":0.00005488329,"about_ca_system_score_gemma":0.00009810057,"threshold_uncertainty_score":0.6822018},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1747774249227732,"score_gpt":0.21595339186949236,"score_spread":0.041175966946719156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168356773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21542266,0.0001552278,0.77995926,0.00013363485,0.0009234475,0.0002398835,0.0000036389465,0.00018218158,0.0029800485],"genre_scores_gemma":[0.9914989,0.0002195664,0.007108184,0.00009497366,0.0001248714,0.000001612946,0.0000048586953,0.000023061993,0.0009239821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749047,0.00017174547,0.00035719294,0.0011824293,0.0001443363,0.00065381173],"domain_scores_gemma":[0.99780273,0.0001402719,0.0002344944,0.0014637922,0.00012316364,0.000235518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050525676,0.00036773385,0.0003805545,0.00042694475,0.00009938222,0.00014145956,0.00251866,0.0003844648,0.0000696698],"category_scores_gemma":[0.00002580271,0.00043761806,0.00020931193,0.00059628254,0.00011848477,0.0006884379,0.0027459476,0.00086306763,0.0004813795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010952569,0.00011157806,0.002683467,0.000024638995,0.000022020167,0.00015961844,0.00082232594,0.8072248,0.000020708076,0.18769231,0.00006116094,0.0011663786],"study_design_scores_gemma":[0.000069766495,0.000011948501,0.00018962931,0.00009123042,0.000018992863,0.000002531488,0.00010023283,0.9152979,0.00050535833,0.08272331,0.00053545454,0.0004536277],"about_ca_topic_score_codex":0.0007505069,"about_ca_topic_score_gemma":0.0001111134,"teacher_disagreement_score":0.7760762,"about_ca_system_score_codex":0.00036942144,"about_ca_system_score_gemma":0.00017793407,"threshold_uncertainty_score":0.99980754},"labels":[],"label_agreement":null},{"id":"W2168635355","doi":"10.1007/s00224-010-9254-y","title":"On the Complexity of Computing Winning Strategies for Finite Poset Games","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Partially ordered set; Infimum and supremum; Combinatorial game theory; PSPACE; Argument (complex analysis); Mathematics; Combinatorics; Game theory; Simple (philosophy); Theoretical computer science; Computer science; Discrete mathematics; Computational complexity theory; Mathematical economics; Sequential game; Algorithm; Epistemology","score_opus":0.08009168828994542,"score_gpt":0.31178092937789276,"score_spread":0.23168924108794733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168635355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42888418,0.000035017507,0.568016,0.00014726247,0.0010409697,0.0003410451,0.0000066148577,0.00010451417,0.0014244074],"genre_scores_gemma":[0.9878174,3.7616994e-7,0.011837106,0.00008839512,0.00020445554,0.0000039822994,0.0000018318079,0.000018176173,0.000028261677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759066,0.0004291073,0.0008425465,0.0003663342,0.0003846214,0.0003867207],"domain_scores_gemma":[0.99080086,0.0071042166,0.000802862,0.000883725,0.00035492983,0.000053430613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039954074,0.00022928716,0.000483417,0.00013449839,0.00032225583,0.00019900176,0.0017760998,0.00009192723,0.000006437869],"category_scores_gemma":[0.0006242791,0.00017019939,0.00016320487,0.00030226653,0.0009254852,0.00017526197,0.00029714245,0.00032636494,0.000009621539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001968976,0.00004476697,0.00008636283,0.000109322726,0.00003503162,7.7870425e-7,0.0072503346,0.02819847,0.0044739284,0.9557217,0.000114182876,0.00394545],"study_design_scores_gemma":[0.000095998475,0.00019136701,0.00036564798,0.00036834655,0.000009323182,0.000010174599,0.0033118061,0.6517985,0.010565123,0.3330075,0.00007958615,0.00019661731],"about_ca_topic_score_codex":0.00007568489,"about_ca_topic_score_gemma":0.0000073681144,"teacher_disagreement_score":0.62360007,"about_ca_system_score_codex":0.000016188656,"about_ca_system_score_gemma":0.00010961323,"threshold_uncertainty_score":0.694053},"labels":[],"label_agreement":null},{"id":"W2169862230","doi":"10.5555/2615731.2615813","title":"Asymmetric abstractions for adversarial settings","year":2014,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Abstraction; Computer science; Adversarial system; State space; Action (physics); Domain (mathematical analysis); Space (punctuation); Theoretical computer science; Face (sociological concept); Mathematical economics; Artificial intelligence; Mathematics","score_opus":0.023465152533142273,"score_gpt":0.2881737838502149,"score_spread":0.2647086313170726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169862230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059650483,0.000005337917,0.9564819,0.00233102,0.00092573557,0.00012725865,7.139553e-7,0.00021138634,0.03932018],"genre_scores_gemma":[0.7382863,0.0000013498055,0.25884354,0.00081121916,0.00032643392,0.000023496917,9.3909347e-7,0.0000060730745,0.0017006182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926984,0.000015548183,0.00016369142,0.00022846031,0.00012689354,0.00019555597],"domain_scores_gemma":[0.99897605,0.00052760827,0.000053416075,0.0002945744,0.00009102472,0.000057322122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032830297,0.00006610456,0.00007453576,0.00011542447,0.0001328852,0.00011383477,0.0004902258,0.00004311548,0.000036706966],"category_scores_gemma":[0.00042147533,0.000059613965,0.00006371681,0.00025745315,0.000024325716,0.00036084637,0.00006963349,0.000058276448,0.00042839223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002952367,0.000035201323,0.00007159385,0.00000417854,0.0000070806973,2.4823592e-7,0.00013395747,0.0003209895,0.0003778735,0.5598486,0.025039608,0.4141577],"study_design_scores_gemma":[0.000114176255,0.00013305094,0.00047900304,0.0000040484665,0.000006564176,0.000004824893,0.000060314884,0.3758527,0.038857564,0.07447958,0.5097893,0.00021888736],"about_ca_topic_score_codex":0.000046226203,"about_ca_topic_score_gemma":0.0000146891425,"teacher_disagreement_score":0.73768985,"about_ca_system_score_codex":0.000020559404,"about_ca_system_score_gemma":0.000024257564,"threshold_uncertainty_score":0.55062586},"labels":[],"label_agreement":null},{"id":"W2172801629","doi":"","title":"Procedural generation of a city quarter","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Programmer; Quarter (Canadian coin); Computer science; Work (physics); Engineering; Geography; Programming language","score_opus":0.08202030620648854,"score_gpt":0.34312457843250344,"score_spread":0.2611042722260149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172801629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6045477,0.00030178833,0.2741264,0.0006770929,0.004613734,0.0007881027,0.000005021471,0.00036281944,0.114577375],"genre_scores_gemma":[0.97173274,0.0000045704787,0.016301088,0.00009701594,0.00020668033,0.000026846803,0.00009471705,0.00000983025,0.011526505],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989335,0.000023687488,0.00031679714,0.0002661689,0.0003379775,0.0001218936],"domain_scores_gemma":[0.9989196,0.000015463242,0.0001865657,0.00032964192,0.0005016432,0.00004706032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016050256,0.00012451492,0.00016896003,0.00009622521,0.000028060103,0.00006803124,0.00054043886,0.00014223845,0.000062232255],"category_scores_gemma":[0.00006978428,0.00010740754,0.000056817214,0.00017633509,0.000015429829,0.00031056235,0.000024748373,0.00009732681,0.00007264058],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000642954,0.00042937504,0.00061843265,0.00035382927,0.00011889266,0.000010958214,0.048228014,0.00028228425,0.049950495,0.18185356,0.3747712,0.34331864],"study_design_scores_gemma":[0.000099407756,0.00037727779,0.000775042,0.00011534632,0.000030138437,0.0000068672107,0.002514006,0.22890791,0.70903224,0.05459465,0.0027329058,0.000814182],"about_ca_topic_score_codex":0.00011443536,"about_ca_topic_score_gemma":0.0009285902,"teacher_disagreement_score":0.65908176,"about_ca_system_score_codex":0.000031470914,"about_ca_system_score_gemma":0.0002580165,"threshold_uncertainty_score":0.43799523},"labels":[],"label_agreement":null},{"id":"W2173567424","doi":"","title":"Learning to play strong poker","year":2001,"lang":"en","type":"book","venue":"Nova Science Publishers, Inc. eBooks","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adversary; Exploit; Computer science; Deception; Fictitious play; Artificial intelligence; Imperfect; Class (philosophy); Perfect information; Game theory; Computer security; Psychology; Social psychology; Mathematical economics","score_opus":0.04819950523744373,"score_gpt":0.2973794035458498,"score_spread":0.24917989830840606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173567424","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049960153,0.000040974555,0.053391702,0.0008560331,0.0042356956,0.000757073,0.000006575609,0.0007950378,0.9394173],"genre_scores_gemma":[0.01445655,0.0000024497658,0.020274706,0.001843082,0.0009886463,0.00006208985,0.000016224461,0.00010297414,0.9622533],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99099404,0.00010439893,0.0010339613,0.0025987946,0.0032013531,0.0020674272],"domain_scores_gemma":[0.99452096,0.0002938773,0.0005793222,0.002310065,0.0012865125,0.001009241],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032740259,0.00081874296,0.00071499747,0.0020033445,0.0010996701,0.008968273,0.010893757,0.0005439507,0.00048692993],"category_scores_gemma":[0.0011001994,0.00081521494,0.00021636848,0.0013682494,0.0016460204,0.0052374126,0.0035329445,0.0019598464,0.001909831],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001545304,0.000057660054,0.00020441345,0.000029719036,0.000046471887,0.00018582429,0.007705458,0.0012592282,0.00064265804,0.09927188,0.2756201,0.61496115],"study_design_scores_gemma":[0.00009756167,0.00033364107,0.00007283824,0.00019709877,0.00001762148,0.000066220724,0.00047362468,0.0054095928,0.0011976986,0.010532318,0.9801983,0.0014034666],"about_ca_topic_score_codex":0.00028548756,"about_ca_topic_score_gemma":0.00020378624,"teacher_disagreement_score":0.7045782,"about_ca_system_score_codex":0.0014074967,"about_ca_system_score_gemma":0.0048088925,"threshold_uncertainty_score":0.9994299},"labels":[],"label_agreement":null},{"id":"W2180554656","doi":"10.1609/aiide.v10i3.12744","title":"I Can Jump! Exploring Search Algorithms for Simulating Platformer Players","year":2014,"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":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jump; Task (project management); Computer science; Workflow; Context (archaeology); Domain (mathematical analysis); Algorithm; Search algorithm; Theoretical computer science; Mathematics","score_opus":0.13694443155211408,"score_gpt":0.3245683836803044,"score_spread":0.1876239521281903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180554656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65417403,0.00001085372,0.3336669,0.0028712128,0.00081423146,0.001134955,0.000029176825,0.00010730278,0.0071913637],"genre_scores_gemma":[0.99773186,0.000017812945,0.0015071188,0.00026015425,0.000105913074,0.00012345778,0.0000020044038,0.000022609249,0.00022907603],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974847,0.000014654993,0.0007083362,0.00069996266,0.0005421309,0.0005502598],"domain_scores_gemma":[0.9981095,0.0005123404,0.0003392721,0.00027595588,0.0006039014,0.00015903139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043944074,0.00034407942,0.00035193464,0.00019178921,0.00029982958,0.0008491629,0.0012500695,0.00007296743,0.00001671435],"category_scores_gemma":[0.0006391406,0.00026326443,0.00019579478,0.00028545244,0.00028823188,0.0017982712,0.000566538,0.0003071023,0.000023236742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015277552,0.00018809825,0.00046603987,0.000046506957,0.000052927666,2.9042073e-7,0.0064322334,0.00046903334,0.0050828373,0.39814228,0.000027389542,0.5889396],"study_design_scores_gemma":[0.000049501377,0.00076133315,0.00006929523,0.00035328517,0.000010891031,0.000003941303,0.006556046,0.39509234,0.53531647,0.061161805,0.00030485578,0.00032021748],"about_ca_topic_score_codex":0.000045572888,"about_ca_topic_score_gemma":0.0000076071174,"teacher_disagreement_score":0.5886194,"about_ca_system_score_codex":0.00012483084,"about_ca_system_score_gemma":0.000046874782,"threshold_uncertainty_score":0.99998194},"labels":[],"label_agreement":null},{"id":"W2181761604","doi":"","title":"Map Abstraction with Adjustable Time Bounds","year":2014,"lang":"en","type":"article","venue":"Advances in computer science : an international journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Path (computing); Abstraction; Overhead (engineering); Limit (mathematics); Centroid; Time limit; Grid; Time complexity; Plan (archaeology); Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Operating system; Geography; Engineering","score_opus":0.01088014433691777,"score_gpt":0.3026423512659734,"score_spread":0.29176220692905563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181761604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045876663,0.000059802805,0.94781405,0.0008142714,0.003745522,0.000063095285,5.8821246e-7,0.000080214384,0.0015458191],"genre_scores_gemma":[0.7330639,0.000053934076,0.26543528,0.0004713417,0.00088536326,0.0000044057156,0.0000010300665,0.000008698494,0.00007609154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971842,0.000074226715,0.0004220585,0.00055992306,0.0012951456,0.0004644586],"domain_scores_gemma":[0.99830705,0.00012887758,0.00027329253,0.00042772666,0.000653916,0.0002091125],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014529133,0.00017038178,0.00015608939,0.00054926553,0.0003260505,0.0016105362,0.003750993,0.000038219703,0.00006163588],"category_scores_gemma":[0.000054364667,0.00014201626,0.00004127306,0.00051028637,0.00042490123,0.013624116,0.00030096722,0.0003447087,0.0001782018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029641753,0.00015483821,0.0048422557,0.0000025047755,0.000008008417,0.00006707043,0.0007147053,0.10607976,0.0005585063,0.02637756,0.00006946557,0.86109567],"study_design_scores_gemma":[0.00024053837,0.00045373215,0.0049263127,0.000089840025,0.0000019211957,0.0006560909,0.000030721334,0.93667305,0.0031444267,0.03589933,0.017572293,0.00031174862],"about_ca_topic_score_codex":0.00002014551,"about_ca_topic_score_gemma":0.000054237684,"teacher_disagreement_score":0.86078393,"about_ca_system_score_codex":0.000279301,"about_ca_system_score_gemma":0.00026224784,"threshold_uncertainty_score":0.9994259},"labels":[],"label_agreement":null},{"id":"W2182734678","doi":"","title":"A Game AI Approach to Autonomous Control of Virtual Characters","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Multimedia; Consistency (knowledge bases); Control (management); Human–computer interaction; Artificial intelligence","score_opus":0.04256669916984782,"score_gpt":0.2543601812322805,"score_spread":0.21179348206243268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182734678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032801583,0.000005393771,0.94189066,0.00024946497,0.00021139522,0.00021789025,0.0000013645786,0.00014123373,0.02448104],"genre_scores_gemma":[0.97416127,5.147075e-7,0.023224859,0.0019189504,0.000029812993,0.000023093644,2.9802447e-7,0.0000067807377,0.0006344003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989065,0.00003918015,0.00029874573,0.0003143653,0.00018534398,0.0002558773],"domain_scores_gemma":[0.9991323,0.000046491416,0.000071751216,0.00052178797,0.00009957414,0.0001280999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017809014,0.000112557784,0.00019176383,0.000114397866,0.000024190616,0.000037872756,0.0010200101,0.000048884107,0.000050330833],"category_scores_gemma":[0.00003811627,0.000095685304,0.000067210334,0.0002339796,0.00007244787,0.00035142893,0.00015047069,0.00008371034,0.00031829072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039001523,0.00042218066,0.0010580905,0.000007650312,0.000039931787,0.00000529888,0.016894547,0.00037409316,0.005165957,0.8909252,0.00033055432,0.08473745],"study_design_scores_gemma":[0.0004431089,0.0015004474,0.016764069,0.000036753027,0.000025672472,0.000034579545,0.0010915736,0.6504282,0.30978248,0.014802799,0.004070939,0.0010193978],"about_ca_topic_score_codex":0.00016336444,"about_ca_topic_score_gemma":0.0000047830094,"teacher_disagreement_score":0.9413597,"about_ca_system_score_codex":0.000022701224,"about_ca_system_score_gemma":0.00005819233,"threshold_uncertainty_score":0.40910897},"labels":[],"label_agreement":null},{"id":"W2183083906","doi":"10.1609/aiide.v8i2.12535","title":"Procedural Game Adaptation: Framing Experience Management as Changing an MDP","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":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Markov decision process; Framing (construction); Simultaneous game; Adaptation (eye); Game design; Frame problem; Human–computer interaction; Sequential game; Non-cooperative game; Video game; Frame (networking); Game theory; Artificial intelligence; Markov process; Multimedia; Psychology; Mathematical economics; Mathematics","score_opus":0.0596985905053941,"score_gpt":0.31099067920089873,"score_spread":0.2512920886955046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183083906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9095136,0.000050273542,0.06566958,0.0012278487,0.00086813193,0.0009230995,0.0000061849028,0.0001343226,0.021606945],"genre_scores_gemma":[0.99759054,0.000040114082,0.0010588067,0.00053685415,0.00010735217,0.00012200895,0.0000015972736,0.00001930657,0.0005233936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973531,0.000019943775,0.0006486567,0.0006222007,0.0006624318,0.00069371087],"domain_scores_gemma":[0.998579,0.0000865685,0.00041548358,0.0003209625,0.0003636285,0.00023431894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029396603,0.0003660381,0.00028021738,0.00025850497,0.00024925658,0.0008446799,0.001357486,0.000073168754,0.000058299043],"category_scores_gemma":[0.00018439077,0.00028543128,0.00012565216,0.0005000619,0.0003177653,0.0047841864,0.0007819634,0.0002714779,0.00010126844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012770084,0.0005541384,0.00063888414,0.000043753036,0.00004801773,0.0000015125487,0.061742794,0.000048126618,0.0028941943,0.63380325,0.000015810554,0.30008182],"study_design_scores_gemma":[0.000070110524,0.0010788861,0.00053706206,0.00092941173,0.000032758086,0.000056026507,0.15454835,0.10872641,0.66083217,0.07118909,0.0011069955,0.0008927144],"about_ca_topic_score_codex":0.00002436411,"about_ca_topic_score_gemma":0.000002469446,"teacher_disagreement_score":0.657938,"about_ca_system_score_codex":0.00012765724,"about_ca_system_score_gemma":0.000030583986,"threshold_uncertainty_score":0.99995977},"labels":[],"label_agreement":null},{"id":"W2184201647","doi":"10.1609/aiide.v8i3.12548","title":"Incorporating Search Algorithms into RTS Game Agents","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":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Divide and conquer algorithms; Task (project management); Heuristic; Artificial intelligence; Architecture; Automation; Algorithm; Engineering","score_opus":0.07509923995874075,"score_gpt":0.32390811321850094,"score_spread":0.2488088732597602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184201647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9021506,0.00006037387,0.074001,0.0028263144,0.0011612796,0.0009174151,0.00001313779,0.000122042184,0.018747885],"genre_scores_gemma":[0.99806046,0.000029700579,0.0011275618,0.000339368,0.00013011938,0.000046578254,0.0000017722474,0.000021060094,0.00024337607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99716246,0.000031989945,0.00079816027,0.000604941,0.0007720576,0.0006303882],"domain_scores_gemma":[0.9982151,0.00018326077,0.0004552639,0.0003339393,0.0005497002,0.00026275936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050846115,0.00038309774,0.00035242416,0.00016989508,0.00023158197,0.0008406814,0.0015164654,0.000097675584,0.00005784223],"category_scores_gemma":[0.00037814412,0.0002878621,0.0001725898,0.00046374998,0.0004716674,0.0032127395,0.0012081019,0.00043189368,0.00015972984],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012664683,0.0008477541,0.0065080537,0.0000544588,0.000086562715,0.0000016268907,0.019314067,0.00007071692,0.008751375,0.50556594,0.00011366659,0.45855913],"study_design_scores_gemma":[0.00005146045,0.0006976655,0.0011082531,0.0005539912,0.000018962475,0.000023395747,0.013080257,0.10373834,0.79694223,0.08268317,0.00050085207,0.00060139614],"about_ca_topic_score_codex":0.00006373031,"about_ca_topic_score_gemma":0.0000037500458,"teacher_disagreement_score":0.7881909,"about_ca_system_score_codex":0.00017573741,"about_ca_system_score_gemma":0.00006314539,"threshold_uncertainty_score":0.9999573},"labels":[],"label_agreement":null},{"id":"W2184341947","doi":"10.1080/00150517.2003.12428581","title":"Dynamic One-Pile Nim","year":2003,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Pile; Combinatorics; Combinatorial game theory; Mathematics; Function (biology); Pickup; Class (philosophy); Position (finance); Discrete mathematics; Sequential game; Computer science; Algorithm; Game theory; Mathematical economics; Artificial intelligence","score_opus":0.019818119115059277,"score_gpt":0.26449713567707334,"score_spread":0.24467901656201407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184341947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10262168,0.00046468194,0.8640839,0.0022176502,0.0019591022,0.000556765,0.000004668178,0.00061906414,0.027472511],"genre_scores_gemma":[0.9857618,0.000005092045,0.011098224,0.00063334376,0.000053491363,0.000042122996,0.0000014014969,0.000022592694,0.0023818982],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978308,0.00022212483,0.000413743,0.00053049595,0.00043666345,0.00056619354],"domain_scores_gemma":[0.99805766,0.00024536063,0.00013265372,0.0013308848,0.0001058516,0.00012756075],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005355597,0.00022884658,0.00020961203,0.0000946454,0.00031475048,0.00035352242,0.0016545387,0.0000951054,0.0001594169],"category_scores_gemma":[0.0000227711,0.00018424931,0.00013676775,0.00049621967,0.00013119643,0.0005135832,0.000055394186,0.0002677702,0.0024684735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016532364,0.0003779879,0.0007670391,0.000018498333,0.000080094986,0.000049159844,0.013072803,0.00015553583,0.0050387527,0.46971485,0.0051523247,0.5055564],"study_design_scores_gemma":[0.00053701433,0.002210577,0.005911948,0.00008370781,0.000056341367,0.00023681019,0.004082659,0.16449353,0.007050536,0.6121965,0.20117225,0.0019681465],"about_ca_topic_score_codex":0.000083461375,"about_ca_topic_score_gemma":0.00046637052,"teacher_disagreement_score":0.88314015,"about_ca_system_score_codex":0.000077487515,"about_ca_system_score_gemma":0.00010583994,"threshold_uncertainty_score":0.99830824},"labels":[],"label_agreement":null},{"id":"W2184547673","doi":"10.82308/11760","title":"Dataflow analysis on game narratives","year":2009,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Narrative; Dataflow; Computer science; Adventure; Narrative network; Narrative inquiry; Graph; Human–computer interaction; Artificial intelligence; Theoretical computer science; Programming language; Narrative criticism; Linguistics","score_opus":0.03152467906984167,"score_gpt":0.2780126983473095,"score_spread":0.24648801927746786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184547673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.919152,0.00011364984,0.0018861727,0.0009174051,0.00078325253,0.00048686116,0.00020441614,0.0010603357,0.07539589],"genre_scores_gemma":[0.98349446,0.000033001754,0.013323965,0.0021310805,0.000047030837,0.000019563142,0.000020794303,0.000027998485,0.00090210006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558526,0.00041783645,0.0007532411,0.0014372641,0.0009581825,0.0008482231],"domain_scores_gemma":[0.9966037,0.00031061433,0.00029779086,0.0021243906,0.00026140726,0.00040207882],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009666148,0.00051919516,0.00060876936,0.00074756297,0.00081239926,0.0003241189,0.002678657,0.00022813065,0.00020608594],"category_scores_gemma":[0.0005491361,0.0004981187,0.00042681626,0.003042155,0.00012592912,0.0022885888,0.00036478028,0.0007680417,0.001308734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030543448,0.00030325356,0.00006472301,0.0000044861285,0.00022243116,0.00008792047,0.000051027135,0.0016809318,0.013859619,0.64661324,0.00001479085,0.337067],"study_design_scores_gemma":[0.00043376346,0.0012883318,0.005529341,0.00011274165,0.0002528317,0.000037706515,0.0003256677,0.014242841,0.34302998,0.5269034,0.10565236,0.0021910332],"about_ca_topic_score_codex":0.000059283157,"about_ca_topic_score_gemma":0.0001462317,"teacher_disagreement_score":0.33487597,"about_ca_system_score_codex":0.00031110444,"about_ca_system_score_gemma":0.000029518471,"threshold_uncertainty_score":0.99974704},"labels":[],"label_agreement":null},{"id":"W2184714326","doi":"10.1609/aaai.v29i1.9660","title":"Improving Exploration in UCT Using Local Manifolds","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; Western Canada Research Grid; Compute Canada","keywords":"Manifold (fluid mechanics); Metric (unit); Sample (material); Mathematical optimization; Computer science; Graph; Nonlinear dimensionality reduction; Monte Carlo method; Space (punctuation); State space; Sample space; Artificial intelligence; Mathematics; Algorithm; Machine learning; Theoretical computer science; Engineering; Statistics","score_opus":0.1935523347288295,"score_gpt":0.3302897479169594,"score_spread":0.13673741318812993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184714326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19088772,0.000039678398,0.8002309,0.0020843938,0.0010066158,0.0005882612,0.0000019005801,0.00014299268,0.005017528],"genre_scores_gemma":[0.99027807,0.000009849705,0.009355692,0.00014535694,0.00009300633,0.000024476136,2.743563e-7,0.000019011208,0.00007424545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970621,0.00004317966,0.0009188542,0.00066261843,0.0007926513,0.00052058726],"domain_scores_gemma":[0.99790096,0.00008587842,0.0005104299,0.00043339626,0.00090702204,0.00016233533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162123,0.0002979068,0.000333003,0.0003042611,0.00014011162,0.0003534197,0.0024047457,0.00015055518,0.0000199262],"category_scores_gemma":[0.0007222349,0.00024507704,0.00011018904,0.0012921346,0.0003809798,0.0017232035,0.0006356497,0.00039378062,0.00011741332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006954346,0.00017332807,0.0004492437,0.000026682703,0.0000068116647,0.0000028046327,0.004128037,0.0047456273,0.027419237,0.7922452,0.000048425733,0.17068507],"study_design_scores_gemma":[0.0000160388,0.00011634981,0.00001896707,0.00011406905,0.0000044562544,0.0000053284234,0.0024931633,0.43792477,0.385402,0.17370096,0.00002056308,0.00018334023],"about_ca_topic_score_codex":0.00057901646,"about_ca_topic_score_gemma":0.00012814823,"teacher_disagreement_score":0.7993904,"about_ca_system_score_codex":0.00024760282,"about_ca_system_score_gemma":0.00030580146,"threshold_uncertainty_score":0.9993952},"labels":[],"label_agreement":null},{"id":"W2186639280","doi":"10.1609/aiide.v10i1.12711","title":"Generative Methods for Guard and Camera Placement in Stealth Games","year":2014,"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":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Guard (computer science); Computer science; Adversary; Representation (politics); Constructive; Artificial intelligence; Generative grammar; Context (archaeology); Drone; Process (computing); Human–computer interaction; Computer vision; Programming language; Computer security","score_opus":0.059038306927969915,"score_gpt":0.3558285979772083,"score_spread":0.2967902910492384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186639280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27049232,0.00006872706,0.71424025,0.005836977,0.00050157914,0.0014922158,0.000018542318,0.00004968778,0.0072996947],"genre_scores_gemma":[0.9887315,0.00007112019,0.0102472175,0.000521778,0.000043847223,0.00014487859,0.0000011647213,0.000013838857,0.00022464556],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978838,0.000052369516,0.00070955866,0.00068818027,0.00026888307,0.00039720067],"domain_scores_gemma":[0.99836254,0.00053912855,0.0003986522,0.00021864209,0.00036398575,0.0001170256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070308195,0.00030988918,0.00039752098,0.00019200501,0.00014104575,0.0005868666,0.0007608204,0.00007087969,0.00001236302],"category_scores_gemma":[0.00071686576,0.00023138717,0.00010273153,0.00022531941,0.00032332135,0.001002983,0.00049573276,0.0002419756,0.0000066233465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018879854,0.00021463259,0.00048525425,0.000040506646,0.000031308857,1.565448e-7,0.0059280964,0.000049181104,0.006917446,0.43586838,0.000052269897,0.55022395],"study_design_scores_gemma":[0.00010204544,0.0015651296,0.0002476299,0.0004530281,0.00001389981,0.000006238634,0.008176204,0.23635036,0.55137235,0.19989352,0.0014061874,0.00041341723],"about_ca_topic_score_codex":0.00003829672,"about_ca_topic_score_gemma":0.00001749009,"teacher_disagreement_score":0.7182392,"about_ca_system_score_codex":0.00011132246,"about_ca_system_score_gemma":0.00004448292,"threshold_uncertainty_score":0.9435695},"labels":[],"label_agreement":null},{"id":"W2187761635","doi":"","title":"Opponent behaviour recognition for real-time strategy games","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Université de Sherbrooke","funders":"","keywords":"Adversary; Computer science; Context (archaeology); Video game; Domain (mathematical analysis); Order (exchange); Key (lock); Human–computer interaction; Computer security; Game mechanics; Turns, rounds and time-keeping systems in games; Video game design; Control (management); Artificial intelligence; Multimedia","score_opus":0.05596798783488969,"score_gpt":0.31117906357068087,"score_spread":0.25521107573579116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187761635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6501247,0.0000047066683,0.32804736,0.0011080822,0.0008723646,0.00049646274,0.000009442981,0.00052616786,0.018810682],"genre_scores_gemma":[0.82771856,0.000011771072,0.16788827,0.00015473261,0.0001993822,0.000097769596,0.000014497951,0.000015226815,0.0038998185],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99896497,0.000020661142,0.00023981319,0.00034393615,0.00015914509,0.00027150178],"domain_scores_gemma":[0.99908185,0.00015431903,0.00006880468,0.0004159618,0.00017615464,0.00010291607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003008325,0.00011396229,0.00011183337,0.00007067592,0.00009624703,0.00020036167,0.0005655601,0.00009078675,0.00047525996],"category_scores_gemma":[0.00007360202,0.0001016641,0.00007428171,0.00011720532,0.000053009702,0.00047000637,0.00008490422,0.00011621989,0.00073295704],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014153146,0.00020151715,0.0005846369,0.000007928039,0.00001218985,0.0000075202993,0.0005181615,0.000022170962,0.16478305,0.07198444,0.0084790075,0.75338525],"study_design_scores_gemma":[0.0001806766,0.00043717408,0.0036715083,0.000018674824,0.000021015652,0.00003552659,0.00023834986,0.1121167,0.7202203,0.15903132,0.0033487391,0.00067999016],"about_ca_topic_score_codex":0.00018571819,"about_ca_topic_score_gemma":0.00012856182,"teacher_disagreement_score":0.7527052,"about_ca_system_score_codex":0.0000105095,"about_ca_system_score_gemma":0.00006095686,"threshold_uncertainty_score":0.9420924},"labels":[],"label_agreement":null},{"id":"W2188529601","doi":"","title":"Data Biased Robust Counter Strategies","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Exploit; Computer science; Adversary; Perfect information; Fictitious play; Nash equilibrium; Complete information; Imperfect; Game theory; Mathematical optimization; Computer security; Mathematical economics; Mathematics","score_opus":0.15656548469558756,"score_gpt":0.34273343857725685,"score_spread":0.1861679538816693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188529601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020166088,0.00004225161,0.9372965,0.0031269537,0.00021738028,0.00006440692,0.0000043601185,0.0002972337,0.056934323],"genre_scores_gemma":[0.91221,0.000009209963,0.08485802,0.0020096314,0.00008995719,9.876073e-7,0.000007884568,0.0000034055838,0.0008109224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990198,0.000021307438,0.00017458196,0.0003664414,0.0002050602,0.00021279379],"domain_scores_gemma":[0.9983782,0.00005943607,0.00003457402,0.0014185138,0.000056572862,0.00005266903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020639805,0.00009033397,0.00008482423,0.000047100766,0.000063815554,0.00051408407,0.0024422298,0.00003517716,0.00015315006],"category_scores_gemma":[0.000037545513,0.00007287271,0.000018652574,0.0002081334,0.00004118861,0.0018762033,0.0002480701,0.00007453931,0.00042559294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005443769,0.00012712745,0.0001308611,0.0000028971788,0.0000103676875,0.000040423027,0.00053872657,0.0032113604,0.0010632265,0.69387907,0.07030805,0.23068242],"study_design_scores_gemma":[0.000060374736,0.00013923226,0.0009772839,0.000015924612,0.000004142537,0.000011205614,0.00058626133,0.88821757,0.005806394,0.055912137,0.047923792,0.0003456757],"about_ca_topic_score_codex":0.000047545385,"about_ca_topic_score_gemma":0.00009837928,"teacher_disagreement_score":0.9101934,"about_ca_system_score_codex":0.000012479935,"about_ca_system_score_gemma":0.000078552504,"threshold_uncertainty_score":0.5470278},"labels":[],"label_agreement":null},{"id":"W2193259386","doi":"10.1609/aaai.v26i1.8401","title":"Using Sliding Windows to Generate Action Abstractions 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":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; Compute Canada","keywords":"Abstraction; Limit (mathematics); Computer science; Action (physics); Flexibility (engineering); A priori and a posteriori; Range (aeronautics); Value (mathematics); Theoretical computer science; Algorithm; Mathematics; Machine learning; Statistics","score_opus":0.22213307891942874,"score_gpt":0.3698435559604664,"score_spread":0.14771047704103768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193259386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88078517,0.00004087159,0.10621024,0.0060078446,0.0015530252,0.000585229,0.0000052341506,0.00012865118,0.004683766],"genre_scores_gemma":[0.9826248,0.000053100608,0.016297437,0.00055683905,0.0001410299,0.000033628563,4.2594755e-7,0.000020974025,0.00027170603],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970038,0.00003831157,0.00092518196,0.0008265159,0.00062021613,0.0005859761],"domain_scores_gemma":[0.99733937,0.00015239678,0.00041274866,0.0004906084,0.001444747,0.00016013716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005881136,0.0003138276,0.00037882436,0.00034925016,0.00031435644,0.00048989244,0.0015173331,0.00014466494,0.00010802398],"category_scores_gemma":[0.0009541262,0.0002796542,0.00016465559,0.0017187906,0.00014192006,0.00128799,0.0005609612,0.0004966641,0.00019181838],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036294325,0.00017197077,0.00037710372,0.000024362316,0.000014034258,0.0000075847665,0.0018976732,0.0045229476,0.4634737,0.45737788,0.00006572511,0.07203072],"study_design_scores_gemma":[0.000013593804,0.00006194392,0.00041727166,0.00024119686,0.000009278196,0.00002873941,0.0023545586,0.11674926,0.8189426,0.0607497,0.00015935392,0.00027251802],"about_ca_topic_score_codex":0.00017032582,"about_ca_topic_score_gemma":0.00018596178,"teacher_disagreement_score":0.39662817,"about_ca_system_score_codex":0.00022241595,"about_ca_system_score_gemma":0.00030749562,"threshold_uncertainty_score":0.99996555},"labels":[],"label_agreement":null},{"id":"W2201201022","doi":"10.1609/aiide.v8i1.12529","title":"The Gold Standard: Automatically Generating Puzzle Game Levels","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":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Genetic algorithm; Perspective (graphical); Artificial intelligence; Machine learning","score_opus":0.054419935213792216,"score_gpt":0.30231319735876466,"score_spread":0.24789326214497245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201201022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7443032,0.00026196497,0.18649049,0.014805386,0.0027466344,0.0019622187,0.00006353941,0.00028721482,0.049079333],"genre_scores_gemma":[0.9979533,0.00004120683,0.0009106825,0.00032041033,0.00012623712,0.00006027453,5.999344e-7,0.000018313858,0.0005689723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972066,0.00003428233,0.00085713156,0.00047335026,0.0007407311,0.00068787794],"domain_scores_gemma":[0.99793917,0.0004221859,0.00050509715,0.00037360354,0.0005594966,0.00020044112],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006467683,0.00035311855,0.0003179884,0.000092969996,0.00039328236,0.0015527926,0.0016432243,0.00008015729,0.000035694473],"category_scores_gemma":[0.00091075647,0.00021491233,0.00017805008,0.0003126219,0.00064128375,0.002265342,0.0008791044,0.0003837421,0.00008858083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009376526,0.00021669563,0.00046816748,0.000017577333,0.00005811605,4.2415022e-7,0.0046573645,0.000024769031,0.0091528185,0.68337923,0.00018773714,0.30174336],"study_design_scores_gemma":[0.00005695197,0.00079154776,0.0005299501,0.0005234202,0.000028087521,0.00002816621,0.009878317,0.10421964,0.76986575,0.10948237,0.0039500785,0.000645738],"about_ca_topic_score_codex":0.000012549091,"about_ca_topic_score_gemma":0.000006324642,"teacher_disagreement_score":0.7607129,"about_ca_system_score_codex":0.00015098772,"about_ca_system_score_gemma":0.000057033434,"threshold_uncertainty_score":0.9994837},"labels":[],"label_agreement":null},{"id":"W2203132035","doi":"10.1609/aiide.v10i1.12714","title":"Hierarchical Adversarial Search Applied to Real-Time Strategy Games","year":2014,"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":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Hierarchy; Artificial intelligence; Portfolio; Implementation; Adversarial system; State (computer science); Action (physics); Layer (electronics); Machine learning; Theoretical computer science; Algorithm; Programming language","score_opus":0.03755485590432722,"score_gpt":0.290060875819406,"score_spread":0.25250601991507876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203132035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7724476,0.000003994758,0.07441936,0.0061834175,0.00051867065,0.0012903106,0.000019217396,0.00017019654,0.14494723],"genre_scores_gemma":[0.99803525,0.000017097054,0.0007844722,0.00035134965,0.00011765094,0.000053895354,0.0000018012038,0.000020431436,0.0006180539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99705577,0.000034054952,0.00073351245,0.00086536293,0.000744221,0.0005670638],"domain_scores_gemma":[0.9983103,0.0003181096,0.00025678473,0.00038494848,0.00045366006,0.00027617064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044653716,0.00038248135,0.00042546622,0.00023351349,0.00019917067,0.0009761671,0.0017753822,0.00010165654,0.00008182662],"category_scores_gemma":[0.000376357,0.00028931262,0.00015872139,0.00043207503,0.00040593185,0.0009459598,0.0010036507,0.0003915366,0.00034137565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037394185,0.0003030593,0.00011651961,0.000018520275,0.00004144245,6.0669885e-7,0.003875349,0.00021326696,0.041018836,0.65169257,0.00015969206,0.30218616],"study_design_scores_gemma":[0.00008155937,0.001936949,0.00037653945,0.00036454372,0.00001817632,0.000009234074,0.0040327357,0.09059962,0.7385074,0.16274951,0.00066871307,0.0006550158],"about_ca_topic_score_codex":0.000054313212,"about_ca_topic_score_gemma":0.000004485785,"teacher_disagreement_score":0.69748855,"about_ca_system_score_codex":0.000115407056,"about_ca_system_score_gemma":0.00007235236,"threshold_uncertainty_score":0.9999559},"labels":[],"label_agreement":null},{"id":"W2205577390","doi":"10.1609/aiide.v7i1.12456","title":"A Generative Computational Model for Human Hide and Seek Behavior","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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Turing test; Computer science; Construct (python library); Turing; Artificial intelligence; Generative grammar; Video game; Generative model; Test (biology); Cognition; Human intelligence; Machine learning; Psychology; Multimedia","score_opus":0.12369751701486346,"score_gpt":0.3206493275007584,"score_spread":0.19695181048589494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205577390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53331405,0.000014312777,0.45954078,0.00077314983,0.00018054614,0.0010473708,0.000047184898,0.000053654607,0.005028982],"genre_scores_gemma":[0.9912241,0.000009624043,0.008027638,0.0002467305,0.000020695648,0.00017314995,0.0000024786664,0.000014165802,0.00028142415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982618,0.000010046476,0.0005571334,0.0005729706,0.00030160442,0.00029645982],"domain_scores_gemma":[0.99872166,0.00010669801,0.0003412817,0.00015781248,0.0005587143,0.00011383574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016596331,0.000275675,0.00026542897,0.00012713154,0.0002457316,0.0004351738,0.0007200756,0.00006358611,0.00001693686],"category_scores_gemma":[0.00012961845,0.00021302272,0.000116900286,0.00013202752,0.00041619365,0.0012284605,0.00044027893,0.00017975728,0.000007969222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014541358,0.0004958093,0.0007584808,0.000023699029,0.00004872518,7.187617e-7,0.013176725,0.00013177414,0.0070046075,0.9064274,0.0000465687,0.071740106],"study_design_scores_gemma":[0.00003849116,0.0005673185,0.00026383542,0.00011890185,0.000018390803,0.00000731274,0.0022250412,0.43726066,0.16667199,0.3925792,0.000014548408,0.00023430286],"about_ca_topic_score_codex":0.000024372799,"about_ca_topic_score_gemma":0.000009152111,"teacher_disagreement_score":0.5138482,"about_ca_system_score_codex":0.00006128529,"about_ca_system_score_gemma":0.00004486697,"threshold_uncertainty_score":0.86868143},"labels":[],"label_agreement":null},{"id":"W2205823580","doi":"10.1609/aiide.v9i1.12672","title":"ScriptEase II: Platform Independent Story Creation Using High-Level Patterns","year":2013,"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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Scripting language; Computer science; Game programming; Bottleneck; Game engine; Interface (matter); Software; Game Developer; Game design; Game development tool; Multimedia; Process (computing); Programming language; Video game; Video game development; Game design document; Component (thermodynamics); Human–computer interaction; Operating system; Embedded system","score_opus":0.07744838912627501,"score_gpt":0.2898096679577174,"score_spread":0.2123612788314424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205823580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9379186,0.000013568279,0.056120213,0.0023100537,0.00057169504,0.00075511343,0.00002763199,0.000059617665,0.0022235159],"genre_scores_gemma":[0.9983927,0.00002973637,0.0006244037,0.0003728659,0.000064646316,0.000068848734,0.000002913906,0.00001958033,0.00042430393],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975101,0.000019831998,0.00071094127,0.0006871457,0.0006121231,0.00045990865],"domain_scores_gemma":[0.99807006,0.00011921038,0.00055234344,0.00032800031,0.00074851786,0.00018187583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023809115,0.00038591976,0.00033881227,0.00023199207,0.00038484373,0.0010154548,0.0012955206,0.00010589062,0.00016367444],"category_scores_gemma":[0.0002583642,0.000293339,0.00015653635,0.0002599527,0.00030229552,0.003627484,0.0010009198,0.0004293935,0.00009630336],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020206798,0.0011310583,0.003298153,0.00006837734,0.00014769059,0.000002588994,0.010150753,0.00018626041,0.04927717,0.46540534,0.0003116958,0.46981883],"study_design_scores_gemma":[0.00008681146,0.0011004837,0.002323252,0.0007898778,0.00003146855,0.000022883272,0.012679088,0.13016805,0.71374005,0.13814256,0.00020255998,0.00071293564],"about_ca_topic_score_codex":0.000539752,"about_ca_topic_score_gemma":0.000024082683,"teacher_disagreement_score":0.66446286,"about_ca_system_score_codex":0.00024470477,"about_ca_system_score_gemma":0.000069358626,"threshold_uncertainty_score":0.9999519},"labels":[],"label_agreement":null},{"id":"W2208663791","doi":"10.1609/aiide.v9i4.12633","title":"A Call for Emotion Modeling in Interactive Storytelling","year":2013,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Narrative; Interactive storytelling; Computer science; Plot (graphics); Agency (philosophy); Storytelling; Consistency (knowledge bases); Face (sociological concept); Human–computer interaction; Artificial intelligence; Multimedia; Linguistics; Sociology","score_opus":0.06412901896040146,"score_gpt":0.2922731345590599,"score_spread":0.22814411559865844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208663791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67200166,0.000021393509,0.31876072,0.0025092403,0.00049563614,0.0015747854,0.000010337293,0.000058398386,0.00456785],"genre_scores_gemma":[0.9981048,0.000029684827,0.0011497575,0.00023335151,0.00004831979,0.0002223367,0.0000015855006,0.00001857506,0.00019156281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763536,0.000019142408,0.0008293487,0.0006884178,0.00037398023,0.0004537535],"domain_scores_gemma":[0.9982567,0.00026652444,0.00038174482,0.00023393448,0.00074968924,0.0001114525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027089383,0.0003295623,0.0003536783,0.00027320193,0.0001350242,0.00080107176,0.0010712205,0.00009205251,0.000028995764],"category_scores_gemma":[0.0004868689,0.00025736945,0.00017391365,0.00030755755,0.000183889,0.002790907,0.0004249469,0.00035284428,0.000052637988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043438334,0.0010442913,0.0008691188,0.000102701175,0.00009436327,0.0000011189424,0.019999608,0.0023466868,0.021262495,0.30862668,0.000120258665,0.64509827],"study_design_scores_gemma":[0.00004470203,0.00041747218,0.000058923237,0.000500035,0.0000063639072,0.0000037584634,0.006893173,0.75584584,0.12285803,0.1130666,0.000044888424,0.00026022355],"about_ca_topic_score_codex":0.0001417034,"about_ca_topic_score_gemma":0.000016306654,"teacher_disagreement_score":0.75349915,"about_ca_system_score_codex":0.0002108372,"about_ca_system_score_gemma":0.000048423986,"threshold_uncertainty_score":0.99998784},"labels":[],"label_agreement":null},{"id":"W2214774486","doi":"10.1609/aiide.v6i1.12408","title":"Quest Patterns for Story-Based Computer Games","year":2010,"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":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Focus (optics); Plot (graphics); Generative grammar; Code (set theory); Object (grammar); Programming language; Human–computer interaction; Artificial intelligence; Mathematics","score_opus":0.036478938527435334,"score_gpt":0.2897427079901178,"score_spread":0.2532637694626825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214774486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5788351,0.000007946571,0.40862677,0.0065083886,0.0017762257,0.0011804418,0.00006706172,0.00012070369,0.0028773502],"genre_scores_gemma":[0.99631673,0.000008445271,0.0026192402,0.00059427717,0.00014337356,0.00011280906,0.000003073687,0.000020562813,0.00018149157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99783427,0.00001547073,0.000579515,0.00071029604,0.00043189575,0.00042855454],"domain_scores_gemma":[0.9979907,0.00036838435,0.00043669535,0.00035370662,0.0007030592,0.0001474309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032676558,0.0003541671,0.00033160637,0.00017241745,0.00022570878,0.00089558796,0.0015169395,0.00010562043,0.00003142787],"category_scores_gemma":[0.00033917153,0.00026446307,0.00022618468,0.00018846286,0.00038069906,0.0011922348,0.00042156535,0.00048740255,0.000032197964],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021343713,0.000587444,0.0018275564,0.000057993006,0.00005287675,8.633826e-7,0.0021266786,0.000047556696,0.018815527,0.53667635,0.00028453564,0.43930918],"study_design_scores_gemma":[0.00007775037,0.0011876649,0.00054788723,0.00038977305,0.000018456301,0.000008135315,0.0014365233,0.18583943,0.759303,0.04805036,0.0026306508,0.00051042624],"about_ca_topic_score_codex":0.000018575001,"about_ca_topic_score_gemma":0.000019495214,"teacher_disagreement_score":0.7404874,"about_ca_system_score_codex":0.000060828857,"about_ca_system_score_gemma":0.000074863114,"threshold_uncertainty_score":0.99998075},"labels":[],"label_agreement":null},{"id":"W2220663073","doi":"10.1609/aiide.v10i1.12718","title":"Playable Experiences at AIIDE 2014","year":2014,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Track (disk drive); Event (particle physics); Computer science; Multimedia; Operating system","score_opus":0.03353136774501229,"score_gpt":0.2745312239967024,"score_spread":0.2409998562516901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220663073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8772088,0.000032169162,0.05462878,0.003225757,0.0009285197,0.0006094939,0.000009030874,0.00011873786,0.06323868],"genre_scores_gemma":[0.997987,0.000035617126,0.00044935007,0.0004573057,0.00006632495,0.00008515956,0.0000010000877,0.000015016266,0.0009032757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99744046,0.00002550679,0.00070177496,0.000750109,0.00060760963,0.0004745545],"domain_scores_gemma":[0.99833906,0.0002656404,0.00046951167,0.00036669572,0.00039433304,0.0001647699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032807994,0.00035404947,0.00035377522,0.00014905885,0.00029688596,0.00077562634,0.0016860422,0.00008382485,0.00014870508],"category_scores_gemma":[0.00047463813,0.00025383683,0.00016949365,0.0002646619,0.00053507654,0.0016558032,0.0010802185,0.00025493113,0.00025153183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024221129,0.00042293948,0.0012613168,0.000035729838,0.000055409022,0.0000010049217,0.017348576,0.0000544727,0.015248749,0.785728,0.0009938225,0.17860779],"study_design_scores_gemma":[0.000037309637,0.00080699177,0.00011896557,0.00029340078,0.00001026089,0.0000150552,0.0111519825,0.035979953,0.8473109,0.101856686,0.001996539,0.00042198098],"about_ca_topic_score_codex":0.000035409146,"about_ca_topic_score_gemma":0.000010010596,"teacher_disagreement_score":0.8320621,"about_ca_system_score_codex":0.00012975009,"about_ca_system_score_gemma":0.000033648837,"threshold_uncertainty_score":0.99999136},"labels":[],"label_agreement":null},{"id":"W2225093001","doi":"10.1609/aiide.v9i1.12684","title":"Evaluating Planning-Based Experience Managers for Agency and Fun in Text-Based Interactive Narrative","year":2013,"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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Plot (graphics); Narrative; Agency (philosophy); Interactive storytelling; Storytelling; Computer science; Domain (mathematical analysis); Implementation; Affect (linguistics); Human–computer interaction; Multimedia; Psychology; Sociology; Art; Communication; Mathematics; Software engineering","score_opus":0.08974250539901135,"score_gpt":0.3601059142988683,"score_spread":0.27036340889985694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2225093001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9388898,0.000027373113,0.054396056,0.0025169272,0.0002828906,0.0016992786,0.000012642845,0.000046946705,0.0021280858],"genre_scores_gemma":[0.9970032,0.000005726685,0.0017899285,0.0005153578,0.000025120005,0.0005372489,0.0000023809685,0.000019077115,0.00010193634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732184,0.000037106314,0.00081540825,0.0008671178,0.00046676252,0.00049176434],"domain_scores_gemma":[0.99773127,0.00067291263,0.0005552689,0.0002548064,0.00064817973,0.00013753977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032818253,0.00040447703,0.0003967687,0.00030444525,0.00022065529,0.0009372452,0.0010040686,0.00008824739,0.00006785786],"category_scores_gemma":[0.00090806326,0.00031642785,0.00013777403,0.00037458498,0.00048996386,0.002193835,0.0003627327,0.00032734202,0.000016457856],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001325856,0.0013259206,0.0070544956,0.00021369614,0.00011398735,0.000004324374,0.10298824,0.0022887052,0.04007683,0.09392798,0.00013064074,0.7505493],"study_design_scores_gemma":[0.00013168853,0.001354423,0.0011163662,0.0010024228,0.000010521805,0.0000027320664,0.030511174,0.60978484,0.31111,0.04449317,0.00004731778,0.00043535623],"about_ca_topic_score_codex":0.00011155298,"about_ca_topic_score_gemma":0.000011320219,"teacher_disagreement_score":0.75011396,"about_ca_system_score_codex":0.0001636851,"about_ca_system_score_gemma":0.000080827216,"threshold_uncertainty_score":0.9999288},"labels":[],"label_agreement":null},{"id":"W2226121807","doi":"10.7939/r30w2k","title":"Using behaviour patterns to generate scripts for computer role-playing games","year":2009,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Code (set theory); Human–computer interaction; Reinforcement learning; Character (mathematics); Computer game; Artificial intelligence; Multimedia; Programming language","score_opus":0.03321201273581672,"score_gpt":0.23939849655598325,"score_spread":0.20618648382016652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226121807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52835137,0.000017179047,0.46984455,0.0010111767,0.000142272,0.00013881785,0.0000034625796,0.00005048915,0.00044070042],"genre_scores_gemma":[0.6893121,0.000003436247,0.3092236,0.0007805322,0.00007005183,9.9980376e-8,0.000005454976,0.000007170898,0.0005975405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999091,0.00003353345,0.00014601338,0.00034497134,0.00012609542,0.0002583496],"domain_scores_gemma":[0.9993232,0.00007211376,0.00008581575,0.0003418218,0.000043613465,0.00013341794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004446126,0.00012820536,0.00017560947,0.00016799949,0.00017037833,0.00009473879,0.0009616678,0.000062446634,0.000048432583],"category_scores_gemma":[0.000006351138,0.0001529204,0.00010012006,0.00020636454,0.000030623447,0.0014293533,0.0002849969,0.00006490913,0.000018059452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041405248,0.0010667336,0.2543596,0.0001098063,0.00021974373,0.00023800618,0.0991305,0.028416473,0.045132853,0.1351187,0.033244677,0.40254888],"study_design_scores_gemma":[0.00047183584,0.0008164163,0.031042917,0.0002543929,0.000057605204,0.000022746892,0.0014706097,0.81889474,0.13321303,0.0038882196,0.008851278,0.0010161776],"about_ca_topic_score_codex":0.0005871061,"about_ca_topic_score_gemma":0.000054194596,"teacher_disagreement_score":0.7904783,"about_ca_system_score_codex":0.000020817464,"about_ca_system_score_gemma":0.000058789497,"threshold_uncertainty_score":0.6235913},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2196141500131067,"score_gpt":0.3844458776644416,"score_spread":0.16483172765133491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230033167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033231203,0.0000197209,0.94003385,0.0067575667,0.0038439054,0.0006365278,0.000043281245,0.00048851303,0.044853523],"genre_scores_gemma":[0.9125475,0.000030359268,0.08324226,0.0009664151,0.001946631,0.00014924543,0.00007346783,0.000042847412,0.0010012187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584144,0.00018390887,0.0010389887,0.0010597318,0.001058321,0.0008175834],"domain_scores_gemma":[0.99654025,0.0007817853,0.00036354383,0.0007657153,0.0011186273,0.00043005095],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011225794,0.00043520305,0.0004443931,0.00028764913,0.00028233477,0.00077719364,0.0030008985,0.00019979136,0.00037697848],"category_scores_gemma":[0.0009957586,0.00043688374,0.00021891705,0.00046974703,0.00035718264,0.0007294715,0.0004633765,0.0003843583,0.0014728224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003970435,0.00016651969,0.000060699414,0.0000046992814,0.00006120111,0.000027135346,0.0017357765,0.025775723,0.0039594965,0.8764124,0.008610667,0.08278864],"study_design_scores_gemma":[0.00005760931,0.0003553838,0.000034679724,0.00007741375,0.000007981005,0.000009313992,0.00028968547,0.5718582,0.006375813,0.41198173,0.008559006,0.00039316545],"about_ca_topic_score_codex":0.000113541115,"about_ca_topic_score_gemma":0.000039648017,"teacher_disagreement_score":0.90922445,"about_ca_system_score_codex":0.0002374428,"about_ca_system_score_gemma":0.00042359796,"threshold_uncertainty_score":0.9998083},"labels":[],"label_agreement":null},{"id":"W2230989868","doi":"10.1609/aiide.v6i1.12392","title":"Learning Companion Behaviors Using Reinforcement Learning in Games","year":2010,"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":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Reinforcement; Computer science; Natural (archaeology); Human–computer interaction; Quality (philosophy); Artificial intelligence; Psychology; Social psychology; Biology","score_opus":0.04254371563316466,"score_gpt":0.3028056031164624,"score_spread":0.2602618874832977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230989868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803939,0.0000060210937,0.012920583,0.00051526085,0.0004511353,0.00041494513,0.0000011544804,0.00006219898,0.005234808],"genre_scores_gemma":[0.999171,0.000018477718,0.00040829164,0.00009623701,0.000039926483,0.000026844516,0.0000011152987,0.000016448119,0.0002216282],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99765104,0.000024993682,0.0007781709,0.0005934188,0.000509842,0.00044255258],"domain_scores_gemma":[0.998674,0.00014797728,0.00050442445,0.00020529896,0.0003623511,0.000105955216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037307202,0.00032119025,0.0003282707,0.00027200632,0.00021281507,0.0007182755,0.0010248855,0.0001002234,0.000047460882],"category_scores_gemma":[0.00048449144,0.00025816448,0.00013268196,0.0003927941,0.0003346372,0.0016336659,0.0006863786,0.0010074894,0.000028119679],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000237036,0.00073338154,0.039361022,0.000052338244,0.00005295645,0.0000049860805,0.016328478,0.0053863972,0.25116736,0.33157253,0.000012763148,0.35509077],"study_design_scores_gemma":[0.000055257788,0.00069698883,0.0010311644,0.0004893224,0.000012232598,0.000017600563,0.009461134,0.41142955,0.5619793,0.014129966,0.00026635866,0.00043115576],"about_ca_topic_score_codex":0.000111320616,"about_ca_topic_score_gemma":0.000022083086,"teacher_disagreement_score":0.40604314,"about_ca_system_score_codex":0.0001147234,"about_ca_system_score_gemma":0.000058548438,"threshold_uncertainty_score":0.99998707},"labels":[],"label_agreement":null},{"id":"W2235120461","doi":"10.37236/5417","title":"Guaranteed Scoring Games","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação para a Ciência e a Tecnologia; Ministério da Ciência, Tecnologia e Ensino Superior; Killam Trusts","keywords":"Monoid; Congruence (geometry); Quotient; Mathematics; Combinatorial game theory; Class (philosophy); Property (philosophy); Combinatorics; Order (exchange); Characterization (materials science); Inverse; Discrete mathematics; Computer science; Mathematical economics; Game theory; Sequential game; Artificial intelligence","score_opus":0.019575124930690267,"score_gpt":0.2739163162272167,"score_spread":0.25434119129652644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235120461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04462467,0.012461594,0.92946446,0.005141897,0.006178419,0.00023491081,0.0000010261269,0.000086175285,0.0018068643],"genre_scores_gemma":[0.99704075,0.0017919621,0.00014069179,0.0001369265,0.00047345512,0.0000054257325,1.18254086e-7,0.000028002192,0.00038267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996682,0.00028288018,0.00093531265,0.00031265692,0.0008997871,0.00088736037],"domain_scores_gemma":[0.99620044,0.0005209719,0.001400215,0.0011885923,0.0005897086,0.000100086894],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0024654043,0.00033392097,0.0005498096,0.0002476664,0.0001640417,0.00028415478,0.0057846806,0.00020370165,0.0000092306545],"category_scores_gemma":[0.00031750798,0.00019899652,0.0003892738,0.00035664043,0.00014542585,0.0003176434,0.0013660553,0.0022698233,0.00004056543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018503584,0.00006118261,0.00011236971,0.000017092563,0.00013841421,0.000022032818,0.00066631666,0.00021629273,0.00021169001,0.98885083,0.0006311564,0.009054097],"study_design_scores_gemma":[0.00013719332,0.00025651566,0.000037353715,0.00027024155,0.000042068103,0.00020230634,0.000049209168,0.0013374815,0.009584923,0.9826143,0.0052242097,0.00024423102],"about_ca_topic_score_codex":0.000008536292,"about_ca_topic_score_gemma":0.0000027701199,"teacher_disagreement_score":0.95241606,"about_ca_system_score_codex":0.00070550037,"about_ca_system_score_gemma":0.0017209706,"threshold_uncertainty_score":0.9995945},"labels":[],"label_agreement":null},{"id":"W2237184653","doi":"10.1609/aiide.v8i1.12519","title":"On Case Base Formation in Real-Time Heuristic Search","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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Base (topology); Heuristic; Set (abstract data type); Mathematical optimization; Consistent heuristic; Constant (computer programming); Limit (mathematics); Pathfinding; Time limit; State (computer science); Incremental heuristic search; Search problem; Artificial intelligence; Search algorithm; Algorithm; Theoretical computer science; Beam search; Mathematics","score_opus":0.06337354550808914,"score_gpt":0.31257554275943017,"score_spread":0.249201997251341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237184653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9732951,0.000009499495,0.008302458,0.0009856137,0.00026540348,0.00056693476,0.000013672876,0.000048127516,0.016513217],"genre_scores_gemma":[0.9992974,0.00003110461,0.00021344001,0.00016732086,0.000043619893,0.000041636693,0.0000015796855,0.000013490313,0.00019045251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99785805,0.000035931273,0.00067229505,0.00043144234,0.00048459813,0.00051770767],"domain_scores_gemma":[0.9986488,0.00035347664,0.00027526918,0.00026358693,0.00029437055,0.00016450282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043015604,0.0002877427,0.00027760398,0.00027472153,0.00014232656,0.00047317406,0.00073300063,0.00007267062,0.00006568682],"category_scores_gemma":[0.00044305276,0.0002173083,0.000107631415,0.00038279753,0.00022068221,0.002596763,0.00043958658,0.00033333636,0.00022175128],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045112966,0.0015412832,0.0009733217,0.000069647416,0.00003655379,0.000034095752,0.01716014,0.00014958261,0.0258903,0.7413265,0.00015879035,0.21220861],"study_design_scores_gemma":[0.00006943196,0.0010394837,0.0003014879,0.000730107,0.000012259438,0.00024928674,0.008989887,0.14752667,0.7908526,0.049690373,0.00004465448,0.0004937522],"about_ca_topic_score_codex":0.00008327094,"about_ca_topic_score_gemma":0.000006695313,"teacher_disagreement_score":0.7649623,"about_ca_system_score_codex":0.00020598862,"about_ca_system_score_gemma":0.00002688408,"threshold_uncertainty_score":0.8861576},"labels":[],"label_agreement":null},{"id":"W2238816925","doi":"10.1609/aiide.v8i1.12521","title":"Telling Interactive Player-specific Stories and Planning for It: ASD + PaSSAGE = PAST","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":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Thriving; Computer science; Artificial intelligence; Line (geometry); Human–computer interaction; Contingency; Video game; Multimedia; Data science; Psychology","score_opus":0.0830172310416701,"score_gpt":0.3207943074184313,"score_spread":0.2377770763767612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238816925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7044543,0.00035895986,0.27059776,0.0052909045,0.0025880986,0.001990984,0.000073061594,0.00014978078,0.014496113],"genre_scores_gemma":[0.99784297,0.00008870088,0.0011214408,0.00034058024,0.00025119502,0.00011176767,0.0000024576766,0.000025568761,0.00021533044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974528,0.000022618982,0.000761926,0.0006703643,0.00045355287,0.00063874264],"domain_scores_gemma":[0.9977464,0.00065462047,0.0005533342,0.00025525235,0.00057899114,0.0002113919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042538007,0.00043510273,0.00042240543,0.00020368033,0.0003297633,0.000983254,0.00092628447,0.00010628917,0.000020619946],"category_scores_gemma":[0.0004501047,0.00033541615,0.00016309894,0.00025912214,0.00041420184,0.0032453306,0.00065725384,0.0003896469,0.000023249684],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010327813,0.0009916836,0.006613547,0.00012622162,0.00022190249,0.0000018887986,0.07118176,0.00006892956,0.017379383,0.5470709,0.0011454154,0.35416558],"study_design_scores_gemma":[0.000107808184,0.0011476543,0.0005394408,0.0012586999,0.00003678888,0.000023890738,0.063830815,0.022861544,0.8316394,0.07201249,0.0056826132,0.00085881626],"about_ca_topic_score_codex":0.000011064018,"about_ca_topic_score_gemma":0.0000019831305,"teacher_disagreement_score":0.81426007,"about_ca_system_score_codex":0.00014004357,"about_ca_system_score_gemma":0.00002908627,"threshold_uncertainty_score":0.99990976},"labels":[],"label_agreement":null},{"id":"W2240625969","doi":"10.1609/aaai.v26i1.8148","title":"Alpha-Beta Pruning for Games with Simultaneous Moves","year":2021,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pruning; Minimax; BETA (programming language); Computation; Class (philosophy); Computer science; Alpha (finance); Action (physics); Mathematics; Mathematical optimization; Matrix (chemical analysis); Algorithm; Combinatorics; Artificial intelligence; Statistics","score_opus":0.026801658431758125,"score_gpt":0.28186403663753207,"score_spread":0.25506237820577393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240625969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014465404,0.00017713245,0.9756039,0.0017922611,0.00017879253,0.00015583297,0.0000012491037,0.00023918806,0.0073862355],"genre_scores_gemma":[0.6998036,0.000008669989,0.29245764,0.0007033527,0.00006270485,0.00001952759,0.0000014117428,0.000011418737,0.006931713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891376,0.00002396357,0.00017552698,0.00040133856,0.00019289195,0.0002924908],"domain_scores_gemma":[0.99846905,0.00066444994,0.000049912556,0.00048702033,0.00025616225,0.000073422576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010549375,0.0001197629,0.0001414441,0.000037233032,0.00011368017,0.00024245463,0.0005176347,0.0000392197,0.000055731423],"category_scores_gemma":[0.00017541669,0.000093143506,0.000050036175,0.0002638702,0.0000584044,0.00033013106,0.0001544252,0.00006604097,0.000047533733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002742016,0.00016361914,0.00082124036,0.000039947026,0.00008535544,0.00031396266,0.0032887592,0.018653536,0.008558916,0.48743063,0.0018939006,0.47872272],"study_design_scores_gemma":[0.00009743926,0.00018021268,0.000048248734,0.000035507466,0.000009281445,0.00006305239,0.0007758916,0.5118943,0.44590366,0.0096075395,0.031075595,0.00030930195],"about_ca_topic_score_codex":0.00001985176,"about_ca_topic_score_gemma":0.00010548684,"teacher_disagreement_score":0.6853382,"about_ca_system_score_codex":0.00001949454,"about_ca_system_score_gemma":0.00012013808,"threshold_uncertainty_score":0.3798282},"labels":[],"label_agreement":null},{"id":"W2242991606","doi":"10.1109/gem.2015.7377236","title":"Artificial society generation for modern video games","year":2015,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Social connectedness; Context (archaeology); Isolation (microbiology); Human–computer interaction; Video game; Function (biology); Artificial intelligence; Multimedia","score_opus":0.16206830815449066,"score_gpt":0.3333701943169012,"score_spread":0.17130188616241052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242991606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123013845,0.000060633454,0.9824334,0.0023643242,0.00069361256,0.00022106305,0.0000014248623,0.00023349428,0.0016906552],"genre_scores_gemma":[0.7003018,0.0000030980411,0.29676095,0.001020507,0.0006103232,0.00006002664,0.000004057355,0.000009820273,0.0012294033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889755,0.000023148768,0.00024547157,0.00034979722,0.00024069319,0.00024331998],"domain_scores_gemma":[0.99914324,0.000069127505,0.00005363587,0.00037654504,0.00024662213,0.00011080957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045146796,0.000102785794,0.00010550533,0.000027971952,0.00010391232,0.00023659944,0.00047111418,0.0000691253,0.000010953024],"category_scores_gemma":[0.000120584205,0.0000908633,0.00010772611,0.00014239697,0.000046193923,0.00058025017,0.00010913903,0.000052009775,0.00011374859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096078975,0.000098173834,0.000103087696,0.000005678165,0.000022990054,0.0000010119725,0.008761432,0.0073967883,0.030772066,0.32297307,0.12398846,0.50586766],"study_design_scores_gemma":[0.000023311366,0.000049899976,0.0000028984095,0.0000012166009,0.0000023462135,0.000001299211,0.00009381767,0.7802785,0.12183129,0.09051052,0.007098252,0.000106619445],"about_ca_topic_score_codex":0.00003216417,"about_ca_topic_score_gemma":0.00006607196,"teacher_disagreement_score":0.77288175,"about_ca_system_score_codex":0.00005561447,"about_ca_system_score_gemma":0.00012529353,"threshold_uncertainty_score":0.3705298},"labels":[],"label_agreement":null},{"id":"W2244309350","doi":"10.1017/cbo9780511807251.018","title":"On the geometry of combinatorial games: A renormalization approach","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Renormalization; Theoretical physics; Mathematics; Geometry; Physics; Computer science; Mathematical physics","score_opus":0.03507576909373997,"score_gpt":0.25143674793260284,"score_spread":0.21636097883886288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244309350","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013599436,0.00006870027,0.25197175,0.00020391983,0.0005312526,0.00024623075,0.0000018287939,0.00008654478,0.7468762],"genre_scores_gemma":[0.107147045,0.00025177622,0.020376174,0.0022695041,0.00087315735,0.000027911788,0.000035484227,0.000095454496,0.8689235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835664,0.00003277502,0.00043883148,0.00039295733,0.0006020522,0.00017671697],"domain_scores_gemma":[0.9981708,0.00028869617,0.00031608512,0.0009995138,0.00018123626,0.000043676475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038094076,0.00024128307,0.00028576728,0.00021059421,0.00007456144,0.00008925287,0.0014309456,0.00025906094,0.00021152233],"category_scores_gemma":[0.000103333914,0.00016093218,0.00014121752,0.00013394938,0.00013216531,0.00013902831,0.00018425345,0.00029362144,0.00012985262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051023767,0.000034270415,5.8300645e-7,0.000007649925,0.000015926547,0.0000012427785,0.00016832609,0.00012640342,0.0000041310764,0.9725321,0.004178103,0.022926146],"study_design_scores_gemma":[0.000043228676,0.00025414326,0.0000031007407,0.00008309785,0.000012710816,0.000003851729,0.00001806077,0.010888011,0.0015925772,0.95568997,0.031141875,0.00026935316],"about_ca_topic_score_codex":0.000014912641,"about_ca_topic_score_gemma":0.0000011428185,"teacher_disagreement_score":0.23159558,"about_ca_system_score_codex":0.000047179627,"about_ca_system_score_gemma":0.000075248565,"threshold_uncertainty_score":0.65626234},"labels":[],"label_agreement":null},{"id":"W2244643514","doi":"10.25071/1708-6701.35773","title":"The Gentlest of Gentlemen","year":2012,"lang":"fr","type":"article","venue":"CAML Review / Revue de l ACBM","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"History","score_opus":0.08021591051652135,"score_gpt":0.338925502745355,"score_spread":0.2587095922288336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244643514","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001207159,0.9248704,0.033431694,0.027017506,0.0042731236,0.00070501654,0.00001408812,0.000034245924,0.008446803],"genre_scores_gemma":[0.053354625,0.89668715,0.013776729,0.00461992,0.0028596853,0.00014438895,0.0000062293084,0.000060213246,0.028491033],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99702686,0.0004670172,0.00094069814,0.00031151902,0.00031025274,0.000943641],"domain_scores_gemma":[0.9970009,0.0005351373,0.0005079723,0.0013548529,0.00029905175,0.00030212497],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027852622,0.00025422356,0.00048411902,0.000034444554,0.00021230325,0.00010537395,0.0017432555,0.00011645005,0.00034120967],"category_scores_gemma":[0.0011613274,0.00020257302,0.00031710972,0.0005827739,0.00039824145,0.00055532606,0.00050368364,0.00031659522,0.0015806765],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020853427,0.000121676014,0.0033799044,0.0034371428,0.00004932792,0.00001068684,0.0015451255,0.000009155776,0.00024177974,0.33746457,0.050859787,0.60287875],"study_design_scores_gemma":[0.000022764383,0.000045515106,0.000816018,0.0039749546,0.00010960073,0.00013945682,0.000050746516,0.0010928352,0.002968769,0.0018373907,0.98872006,0.00022185995],"about_ca_topic_score_codex":0.00008637217,"about_ca_topic_score_gemma":0.000031952797,"teacher_disagreement_score":0.9378603,"about_ca_system_score_codex":0.00015470668,"about_ca_system_score_gemma":0.00016397994,"threshold_uncertainty_score":0.9991967},"labels":[],"label_agreement":null},{"id":"W2246462267","doi":"10.1017/cbo9780511807251.017","title":"The game of End-Wythoff","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.03627005079448161,"score_gpt":0.2702844350041936,"score_spread":0.23401438420971196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246462267","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016507325,0.00054872123,0.07884579,0.001149384,0.00043642413,0.0001271662,0.0000013530861,0.00009810029,0.9187914],"genre_scores_gemma":[0.0037473033,0.0003368429,0.0065292907,0.000339946,0.00016758475,0.0000020872242,7.134132e-7,0.000014633956,0.9888616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986707,0.000012946491,0.00040649198,0.0003058629,0.00039976987,0.00020422382],"domain_scores_gemma":[0.9982258,0.00031237534,0.00021840667,0.0010481393,0.00014394207,0.000051338382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002535846,0.00019089198,0.0002183292,0.000064945045,0.00006758725,0.00009780531,0.0017910169,0.00015822976,0.0002624738],"category_scores_gemma":[0.00003533105,0.00012271774,0.00015856304,0.000034394656,0.00020970384,0.000110292756,0.00026057038,0.00022638304,0.00049681094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.895656e-7,0.0000023827074,2.876101e-7,0.0000011707699,0.000006909366,0.0000032200041,0.00006122459,0.000004900305,0.000012336586,0.62760556,0.002135226,0.370166],"study_design_scores_gemma":[0.0000066166895,0.000052051175,0.000004522125,0.000026451622,0.0000040384816,0.0000049119876,0.0000041224002,0.0009526003,0.0021625129,0.44479966,0.55185753,0.00012499264],"about_ca_topic_score_codex":0.000018422474,"about_ca_topic_score_gemma":0.000047623016,"teacher_disagreement_score":0.5497223,"about_ca_system_score_codex":0.000026266003,"about_ca_system_score_gemma":0.00009255951,"threshold_uncertainty_score":0.6385665},"labels":[],"label_agreement":null},{"id":"W2246744812","doi":"10.1145/1558109.1558236","title":"Optimal solutions for moving target search","year":2009,"lang":"en","type":"article","venue":"Infoscience (Ecole Polytechnique Fédérale de Lausanne)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimax; Graph; Computer science; Mathematical optimization; Iterative deepening depth-first search; Local search (optimization); Search algorithm; Algorithm; Theoretical computer science; Mathematics; Beam search; Best-first search","score_opus":0.03615498199459593,"score_gpt":0.30666310745355424,"score_spread":0.2705081254589583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246744812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012681205,0.00011584942,0.9776086,0.0044020703,0.00030301834,0.00087484217,0.00001722928,0.00092188123,0.0030752574],"genre_scores_gemma":[0.4810995,0.00001949561,0.51641643,0.0015464561,0.0001301792,0.00016293947,0.000002659124,0.000012785615,0.0006095865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963953,0.00009072562,0.0005383967,0.0007709034,0.0005235915,0.0016811012],"domain_scores_gemma":[0.99796194,0.00027594733,0.00015002332,0.0009853736,0.00028387283,0.00034283625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019351123,0.00028391377,0.00028128203,0.00040488425,0.0008939924,0.00052294455,0.0028627273,0.00021239441,0.000040164385],"category_scores_gemma":[0.00046188815,0.00030488716,0.00018652443,0.0012539807,0.00033768956,0.0017579937,0.00046048706,0.00037022564,0.00007438288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044129476,0.0005051214,0.0011500599,0.00003470542,0.000015569862,0.00005032585,0.0034303959,0.060262926,0.119410306,0.64703727,0.01196023,0.15609895],"study_design_scores_gemma":[0.000104941726,0.0006102012,0.0009860098,0.00007057185,0.0000053685267,0.00005236442,0.00016381951,0.6505909,0.30573973,0.033690143,0.0074146055,0.0005713355],"about_ca_topic_score_codex":0.00011049684,"about_ca_topic_score_gemma":0.00001964392,"teacher_disagreement_score":0.6133471,"about_ca_system_score_codex":0.00024627475,"about_ca_system_score_gemma":0.0005426405,"threshold_uncertainty_score":0.99994034},"labels":[],"label_agreement":null},{"id":"W2247630165","doi":"10.1017/cbo9780511807251.008","title":"Tigers and Goats is a draw","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Geography","score_opus":0.03363433402652625,"score_gpt":0.26603323838234955,"score_spread":0.2323989043558233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2247630165","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009819747,0.00034082594,0.047238417,0.0019347772,0.00020568652,0.00012190419,0.0000014499963,0.00017837722,0.94996876],"genre_scores_gemma":[0.0015984415,0.00025746773,0.014368341,0.0034718777,0.00010668392,0.0000014637761,7.809515e-7,0.000015844733,0.9801791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881065,0.0000050353005,0.00023167684,0.0005026382,0.00025149045,0.00019853658],"domain_scores_gemma":[0.99911106,0.00005721207,0.00008685839,0.000575799,0.00006254408,0.000106509164],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008743927,0.0002283167,0.00021750703,0.00010993498,0.00006912808,0.00020304196,0.00064549904,0.00020833228,0.0005348047],"category_scores_gemma":[0.000008549137,0.00020412098,0.000076540084,0.000027102345,0.000118657066,0.00020561148,0.00021322326,0.00019679785,0.0010443548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8135544e-7,0.0000026988964,0.0000016173963,0.000002858603,0.000008813293,0.000017763648,0.00040748806,5.9232616e-7,0.000008624972,0.6032375,0.011036646,0.3852748],"study_design_scores_gemma":[0.000015473144,0.00007338372,0.000009800295,0.000055817236,0.0000074045493,0.00001702393,0.0000071913555,0.0016381894,0.0012258982,0.46029735,0.53629535,0.0003571081],"about_ca_topic_score_codex":0.000021981792,"about_ca_topic_score_gemma":0.00001842785,"teacher_disagreement_score":0.5252587,"about_ca_system_score_codex":0.000027698907,"about_ca_system_score_gemma":0.000052375504,"threshold_uncertainty_score":0.99973345},"labels":[],"label_agreement":null},{"id":"W2248834076","doi":"","title":"How to Make Fast Easy Gold in World of Warcraft Cataclysm WoW","year":2012,"lang":"en","type":"book","venue":"CreateSpace Independent Publishing Platform eBooks","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"EPIC; Reputation; Competition (biology); Gold standard (test); Quarter (Canadian coin); Advertising; Business; Art; History; Literature; Political science; Mathematics; Archaeology; Law","score_opus":0.0432212761037923,"score_gpt":0.2584136102571312,"score_spread":0.21519233415333894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248834076","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024440207,0.0005624587,0.025614722,0.002345276,0.0031774058,0.0023309854,0.0001437484,0.00068746787,0.9626939],"genre_scores_gemma":[0.10876954,0.0000075479256,0.004840497,0.00044727843,0.00069606694,0.00015102277,0.00006827011,0.00016825755,0.8848515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9923767,0.00009831,0.001434687,0.001725527,0.0023999654,0.0019648322],"domain_scores_gemma":[0.99358726,0.00077259407,0.001174293,0.0028682551,0.0006495808,0.00094799796],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00243957,0.0011801213,0.0014933912,0.003239968,0.00016131312,0.0069807726,0.006948269,0.0012247792,0.000048714992],"category_scores_gemma":[0.00082819135,0.0011813082,0.00043974482,0.0007389008,0.00027654125,0.0062031876,0.0031121145,0.0028235212,0.00015424813],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025016937,0.00048333156,0.008444018,0.0008589495,0.0005530519,0.0006990792,0.025134392,0.00059756136,0.00073433405,0.48230076,0.12425718,0.35568717],"study_design_scores_gemma":[0.00089620793,0.00047581946,0.0011984798,0.0035558168,0.00017003693,0.00015323926,0.0018178908,0.0013047747,0.021011703,0.04838257,0.91664076,0.0043927175],"about_ca_topic_score_codex":0.00073296,"about_ca_topic_score_gemma":0.015464767,"teacher_disagreement_score":0.79238355,"about_ca_system_score_codex":0.0014380945,"about_ca_system_score_gemma":0.001382355,"threshold_uncertainty_score":0.999477},"labels":[],"label_agreement":null},{"id":"W2254719512","doi":"10.14288/1.0079748","title":"Can you win at TETRIS?","year":2008,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.018196693891358667,"score_gpt":0.18760035795087707,"score_spread":0.1694036640595184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254719512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98661095,0.00011544189,0.009461805,0.0003911386,0.00023689032,0.00012498656,0.000026502777,0.00016037286,0.002871893],"genre_scores_gemma":[0.9915199,0.00011340175,0.0035144405,0.00007817108,0.000026309248,2.1702327e-7,0.000002867593,0.0000074744285,0.004737199],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987744,0.000037537702,0.0001274728,0.00043766576,0.00032808006,0.0002948201],"domain_scores_gemma":[0.9990228,0.00004879265,0.000108566026,0.00050556904,0.00016688964,0.00014742477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011681028,0.000042129814,0.00019770318,0.00005244806,0.0004724622,0.000070294765,0.0011143158,0.00008564973,0.00011809737],"category_scores_gemma":[0.000037319693,0.00016553896,0.00011302557,0.0004924461,0.00042398012,0.00046117415,0.00051937683,0.00011151406,0.00015443403],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005317438,0.0001718805,0.085683025,0.000022001659,0.00003603819,0.0014459763,0.0025880851,0.000054359964,0.0005891919,0.000047634585,0.027705204,0.8816513],"study_design_scores_gemma":[0.00017873153,0.00007408856,0.9935096,0.000036941823,0.0000068428926,0.00029139678,0.0005056001,0.0018700833,0.000053015432,0.00091815396,0.0023238678,0.00023171664],"about_ca_topic_score_codex":0.11288296,"about_ca_topic_score_gemma":0.28286618,"teacher_disagreement_score":0.90782654,"about_ca_system_score_codex":0.00013638295,"about_ca_system_score_gemma":0.0001041078,"threshold_uncertainty_score":0.89302444},"labels":[],"label_agreement":null},{"id":"W2263352300","doi":"10.5591/978-1-57735-516-8/ijcai11-110","title":"Real-time opponent modelling in trick-taking card games","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adversary; Computer science; Exploit; Adversarial system; Context (archaeology); Fictitious play; Combinatorial game theory; Simple (philosophy); Game play; Game theory; Artificial intelligence; Repeated game; Human–computer interaction; Computer security; Mathematical economics; Mathematics","score_opus":0.2449692563154638,"score_gpt":0.3325261987870742,"score_spread":0.08755694247161039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263352300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062075824,0.000021692433,0.83459467,0.0015133353,0.0019527435,0.00047908735,0.0000113064825,0.00040110495,0.09895021],"genre_scores_gemma":[0.96146435,0.00023687613,0.03727798,0.00022822077,0.00019377348,0.000081761136,0.0000072771254,0.000033988374,0.0004757582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952331,0.00020329661,0.0015454288,0.0012087623,0.0010408878,0.000768533],"domain_scores_gemma":[0.9973853,0.00025337882,0.0006200561,0.00091072393,0.0005908036,0.00023970188],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009852044,0.00048039193,0.00049776444,0.00093666965,0.00014791293,0.00045804432,0.002619029,0.00020216838,0.0012077948],"category_scores_gemma":[0.00038863163,0.00048641663,0.00023408575,0.0007198203,0.000255443,0.0010206419,0.00047552018,0.00055509625,0.002619682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104335166,0.00042665075,0.0001659504,0.0000061642027,0.000036742553,0.0001645787,0.0049273977,0.01202999,0.007298515,0.7953526,0.000051998515,0.17943512],"study_design_scores_gemma":[0.000030282883,0.00015156876,0.0002867973,0.00018715358,0.000005422013,0.000016177244,0.0005324904,0.6917168,0.11344566,0.19300601,0.00013296025,0.0004887123],"about_ca_topic_score_codex":0.0018594611,"about_ca_topic_score_gemma":0.00016006695,"teacher_disagreement_score":0.89938855,"about_ca_system_score_codex":0.0003519108,"about_ca_system_score_gemma":0.00024947,"threshold_uncertainty_score":0.9997587},"labels":[],"label_agreement":null},{"id":"W2283475735","doi":"10.1609/aiide.v10i6.12693","title":"Leveraging Parallel Architectures in AI Search Algorithms for Games","year":2014,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Search algorithm; Theoretical computer science; Algorithm","score_opus":0.06135099923389329,"score_gpt":0.3190296354895689,"score_spread":0.2576786362556756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283475735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47505468,0.000026002546,0.50883526,0.008056367,0.00045163903,0.0011865465,0.00001270219,0.000072248695,0.006304521],"genre_scores_gemma":[0.99707097,0.000016047314,0.0019335469,0.0006160124,0.00006410383,0.00010131649,0.0000012146851,0.000016575874,0.00018023119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976547,0.00002776688,0.0006682263,0.0006976192,0.0004495945,0.0005020987],"domain_scores_gemma":[0.99859035,0.0003920406,0.00024211893,0.00026024607,0.00040496132,0.000110267894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046858098,0.0003136903,0.00035623673,0.000259072,0.00014463736,0.00071884895,0.0013096589,0.00007378208,0.000013872884],"category_scores_gemma":[0.00051851553,0.00023496604,0.00016420867,0.00029514934,0.0003216077,0.00075910025,0.0005213754,0.0003717114,0.000017598124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002658239,0.0003602527,0.0014895613,0.000055470293,0.00003723675,6.0371883e-7,0.008472139,0.00083490164,0.0036420105,0.36575043,0.000057196994,0.61903435],"study_design_scores_gemma":[0.000080593934,0.0007849352,0.0005244661,0.0004974274,0.0000072977364,0.000007654423,0.0039034286,0.4206176,0.30969897,0.2630571,0.0004455459,0.00037494962],"about_ca_topic_score_codex":0.000052861913,"about_ca_topic_score_gemma":0.000011500259,"teacher_disagreement_score":0.61865944,"about_ca_system_score_codex":0.00009560393,"about_ca_system_score_gemma":0.000047360383,"threshold_uncertainty_score":0.9581637},"labels":[],"label_agreement":null},{"id":"W2286652700","doi":"10.7939/r3m61bp9b","title":"Generalized Sampling and Variance in Counterfactual Regret Minimization","year":2012,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Mathematics; Tree traversal; Regret; Bias of an estimator; Counterfactual thinking; Mathematical optimization; Variance (accounting); Minimum-variance unbiased estimator; Sampling (signal processing); Importance sampling; Consistent estimator; Computer science; Statistics; Algorithm; Monte Carlo method","score_opus":0.026980061509392514,"score_gpt":0.22465972133693526,"score_spread":0.19767965982754276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286652700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8776003,0.00019796038,0.11657599,0.0009881853,0.00014316267,0.00007928269,9.852116e-7,0.000034751618,0.0043793987],"genre_scores_gemma":[0.92344695,0.000068773006,0.07508774,0.0001099635,0.000021546719,5.2723617e-8,0.0000036141453,0.0000040339705,0.0012572967],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995158,0.000045773148,0.00008894677,0.00013687149,0.000070950686,0.00014169666],"domain_scores_gemma":[0.99952036,0.00019086333,0.000058887916,0.00016439629,0.000009820004,0.0000557004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005424892,0.000059720518,0.000095782685,0.00008404463,0.000043671327,0.0000234711,0.00031826564,0.000051977804,0.000098299264],"category_scores_gemma":[0.000023828017,0.00007011916,0.000020732059,0.00017596243,0.00006572973,0.00230583,0.00021119809,0.00005498574,0.000011848375],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001305565,0.00021368121,0.49647874,0.000047434114,0.000042781638,0.000010467028,0.09718807,0.0013572205,0.00062965066,0.38545957,0.0032235729,0.015218283],"study_design_scores_gemma":[0.0021811577,0.00033438715,0.3495107,0.0005075465,0.00006361334,0.000054746677,0.011025555,0.39548892,0.030307233,0.01695862,0.1915838,0.0019837327],"about_ca_topic_score_codex":0.0007245387,"about_ca_topic_score_gemma":0.00007800716,"teacher_disagreement_score":0.3941317,"about_ca_system_score_codex":0.000009534184,"about_ca_system_score_gemma":0.000028620063,"threshold_uncertainty_score":0.28593764},"labels":[],"label_agreement":null},{"id":"W2287141407","doi":"10.1609/aiide.v10i2.12735","title":"Building Placement Optimization in Real-Time Strategy Games","year":2014,"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":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Battle; Base (topology); Genetic algorithm; Similarity (geometry); Quality (philosophy); Artificial intelligence; Simulation; Machine learning; Mathematics","score_opus":0.03622573483506239,"score_gpt":0.2931820666227597,"score_spread":0.2569563317876973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287141407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6666419,0.000013413098,0.28629622,0.0021319413,0.00040272917,0.0009740158,0.000008322494,0.00012221241,0.04340922],"genre_scores_gemma":[0.99747455,0.000051863128,0.0020339023,0.00012620995,0.00003795777,0.000042968164,0.0000012216051,0.000014727291,0.00021659488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977164,0.00003170395,0.00075167144,0.00063504156,0.00046602645,0.00039914207],"domain_scores_gemma":[0.9986813,0.0002143287,0.0004173889,0.00025579834,0.00032794353,0.00010322373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039817445,0.00030734402,0.00033007652,0.00023374848,0.00011014097,0.00073288556,0.0010800803,0.00007790093,0.000058264977],"category_scores_gemma":[0.0003713573,0.00024037712,0.00010488816,0.0003765543,0.00023654642,0.0015319936,0.00050242146,0.00024789883,0.000041541633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022336442,0.0005409391,0.00066173647,0.00003662498,0.000038524526,0.000001030649,0.0028557351,0.017969366,0.019931402,0.7014178,0.000055491702,0.25626796],"study_design_scores_gemma":[0.000048211554,0.00067887537,0.00015709946,0.00047004767,0.000007235601,0.0000045352976,0.0019312596,0.6734891,0.26766992,0.05515155,0.0000794582,0.00031269767],"about_ca_topic_score_codex":0.000047227546,"about_ca_topic_score_gemma":0.000005251951,"teacher_disagreement_score":0.6555197,"about_ca_system_score_codex":0.00014542753,"about_ca_system_score_gemma":0.000041289164,"threshold_uncertainty_score":0.98022944},"labels":[],"label_agreement":null},{"id":"W2288334502","doi":"10.5555/2888619.2888829","title":"Imitation challenges: from uniform random variables to complex systems","year":2015,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Univariate; Stochastic process; Stochastic simulation; Stochastic modelling; Random variable; Imitation; Probability distribution; Stochastic optimization; Random variate; Theoretical computer science; Algorithm; Multivariate statistics; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.24188678223633575,"score_gpt":0.3422889927966627,"score_spread":0.10040221056032694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288334502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067354515,0.00009996176,0.9828641,0.0018583887,0.0011024113,0.00039140237,0.000010343164,0.0002484131,0.006689568],"genre_scores_gemma":[0.9859155,0.000006543196,0.01337791,0.0002602944,0.00017993269,0.000029548104,0.000017121101,0.000011020443,0.00020213341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982334,0.00015788578,0.00045639192,0.00047699318,0.0004243528,0.00025098567],"domain_scores_gemma":[0.9977281,0.00054617116,0.00014493043,0.0006097777,0.00074319006,0.00022784322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043820578,0.00018327236,0.0002493322,0.0001405827,0.000071887145,0.00043374725,0.0008544425,0.00008282698,0.000053704905],"category_scores_gemma":[0.00036888482,0.00017361138,0.000043619326,0.0002229383,0.000039135663,0.0008532523,0.00021227972,0.000094560724,0.0005371112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102075915,0.000065645676,0.0002501497,0.000013045916,0.00003786712,0.000005823774,0.02107673,0.75964737,0.0003756017,0.16771048,0.00094090414,0.049774308],"study_design_scores_gemma":[0.00031370056,0.0000852025,0.00050383585,0.00006981998,0.000005719586,0.0000010630275,0.0011377383,0.9670026,0.00030401212,0.018270558,0.0120885745,0.00021723553],"about_ca_topic_score_codex":0.00031254123,"about_ca_topic_score_gemma":0.00010426413,"teacher_disagreement_score":0.97918004,"about_ca_system_score_codex":0.000100835976,"about_ca_system_score_gemma":0.00011236457,"threshold_uncertainty_score":0.7079666},"labels":[],"label_agreement":null},{"id":"W2290133885","doi":"10.7939/r3bb8f","title":"Fuegito: an Educational Software Package for Game Tree Search","year":2013,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Monte Carlo tree search; Tree (set theory); Game programming; Software; Simple (philosophy); Game tree; Theoretical computer science; Software engineering; Artificial intelligence; Machine learning; Sequential game; Programming language; Game design; Game theory; Game Developer; Monte Carlo method; Game design document; Mathematics","score_opus":0.021827954579643708,"score_gpt":0.23309467869679942,"score_spread":0.21126672411715572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290133885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6530425,0.00005000398,0.31127623,0.01880175,0.00035258915,0.0006329579,0.0000102220165,0.00016660939,0.015667181],"genre_scores_gemma":[0.7691162,0.000012317657,0.199843,0.00034113266,0.00012717929,0.0000014649974,0.000053954715,0.000016146965,0.030488549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992441,0.000041285857,0.00009842665,0.0002750286,0.00014042488,0.00020071214],"domain_scores_gemma":[0.9987602,0.00053454447,0.00005235136,0.0004410334,0.00007423456,0.00013760843],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000036630478,0.000085224565,0.000108355576,0.00010729908,0.00010786192,0.000084893065,0.0012493636,0.00005924953,0.0012459769],"category_scores_gemma":[0.000039730898,0.00009686145,0.00007469073,0.00018942349,0.00013424359,0.003566144,0.00027471085,0.0000681966,0.00027488123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009423151,0.0009967646,0.067034855,0.00013843284,0.000120496356,0.00000889734,0.059848864,0.00026383207,0.0016847462,0.43896487,0.19637167,0.23447233],"study_design_scores_gemma":[0.0014292432,0.0020577584,0.21161902,0.0002503853,0.00006626351,0.000030489397,0.017442888,0.14213422,0.08756803,0.3761928,0.15869938,0.0025095076],"about_ca_topic_score_codex":0.0011084856,"about_ca_topic_score_gemma":0.0001365968,"teacher_disagreement_score":0.23196283,"about_ca_system_score_codex":0.000013604318,"about_ca_system_score_gemma":0.00020894498,"threshold_uncertainty_score":0.99966705},"labels":[],"label_agreement":null},{"id":"W2291805099","doi":"10.18438/b8ps5s","title":"Riding Into the Sunset","year":2016,"lang":"en","type":"article","venue":"Evidence Based Library and Information Practice","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Sunset; Computer science; Astronomy; Physics","score_opus":0.02262247559244892,"score_gpt":0.2758814776506828,"score_spread":0.25325900205823393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291805099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002054229,0.000322917,0.57622486,0.41802305,0.0002458604,0.00014409133,9.140196e-7,0.00018594705,0.002798147],"genre_scores_gemma":[0.82034844,0.0020463557,0.047982983,0.12913097,0.00012653795,0.000037646703,0.0000018619259,0.0000067313244,0.0003184671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989783,0.00020456658,0.00029361158,0.00013152121,0.00024299802,0.00014900384],"domain_scores_gemma":[0.99451303,0.004716381,0.00022444522,0.00042312357,0.0000534697,0.00006956078],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007287532,0.0000897113,0.00006229456,0.00008704142,0.0002708452,0.00075317814,0.00068406825,0.000039222596,0.00009672983],"category_scores_gemma":[0.002633287,0.00004837576,0.000025151032,0.00036329258,0.00009949394,0.36829057,0.00023691326,0.00010161156,0.00035465925],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033865148,0.0000061836186,0.00019999116,0.000009412183,0.0000037215948,0.000001517579,0.00088293984,0.000031973435,0.0001563865,0.7304302,0.002691447,0.2655524],"study_design_scores_gemma":[0.000060190025,0.00008196699,0.0007615115,0.00020023632,0.0000058140054,0.000018380095,0.00041166594,0.016576743,0.03168178,0.0046874126,0.94536763,0.00014665829],"about_ca_topic_score_codex":0.000007118359,"about_ca_topic_score_gemma":4.445041e-8,"teacher_disagreement_score":0.9426762,"about_ca_system_score_codex":0.000008954948,"about_ca_system_score_gemma":0.0001260595,"threshold_uncertainty_score":0.7262914},"labels":[],"label_agreement":null},{"id":"W2292038563","doi":"10.1609/aaai.v27i1.8528","title":"Trading Space for Time in Grid-Based Path Finding","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Grid; Path (computing); Computer science; Space (punctuation); Spacetime; Mathematical optimization; Algorithm; Mathematics; Geography; Cartography","score_opus":0.07627115331290309,"score_gpt":0.2979713380072939,"score_spread":0.22170018469439084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292038563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6673876,0.000058019246,0.27991825,0.027724883,0.0025837019,0.0048868707,0.00002378192,0.00048295633,0.016933944],"genre_scores_gemma":[0.9820925,0.00000621755,0.016857734,0.00031706417,0.00015006556,0.00023083843,7.821885e-7,0.000026336103,0.000318474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970254,0.000030339395,0.00090826914,0.00076325797,0.00055629696,0.000716465],"domain_scores_gemma":[0.9977096,0.0005109839,0.0005053597,0.0004423242,0.0006951626,0.00013660842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087507395,0.00035523655,0.0004301274,0.00033708932,0.00023891682,0.0004988392,0.0028931547,0.0001600284,0.00020530436],"category_scores_gemma":[0.0010478742,0.00028638457,0.00021795444,0.0011046412,0.00031449445,0.0008992278,0.00027119904,0.00037388783,0.0003280713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060258033,0.00029138377,0.0007683773,0.00008493216,0.000014087692,7.9410387e-7,0.0021517153,0.00064764894,0.14134806,0.79015094,0.001710994,0.06277083],"study_design_scores_gemma":[0.000021804333,0.000154426,0.00012506457,0.00024514543,0.0000046453183,0.0000011832835,0.00030476955,0.42956138,0.43583825,0.13342936,0.0000857057,0.00022825283],"about_ca_topic_score_codex":0.00013589027,"about_ca_topic_score_gemma":0.000016802976,"teacher_disagreement_score":0.65672153,"about_ca_system_score_codex":0.00013233491,"about_ca_system_score_gemma":0.00017172257,"threshold_uncertainty_score":0.9999588},"labels":[],"label_agreement":null},{"id":"W2293790107","doi":"10.1109/ms.2008.5","title":"Emotional Requirements","year":2008,"lang":"en","type":"article","venue":"IEEE Software","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Happiness; Laughter; Psychology; Game design; Social psychology; Personality; Emotional intelligence; Affect (linguistics); Cognitive psychology; Computer science; Human–computer interaction; Communication","score_opus":0.07922943416817232,"score_gpt":0.30135042706012793,"score_spread":0.2221209928919556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293790107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12743813,0.00004590616,0.8699571,0.00027787694,0.0011434692,0.00006810379,0.0000020174648,0.0003792093,0.0006881827],"genre_scores_gemma":[0.89997816,0.000014031885,0.09778388,0.0005947912,0.00018372641,0.000009151526,0.0000014820732,0.000008861047,0.0014258965],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99896777,0.000024780764,0.00017289628,0.00026698157,0.0003426357,0.00022491792],"domain_scores_gemma":[0.9993107,0.000066197914,0.000047260466,0.00039972176,0.00010126811,0.00007485396],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008509041,0.00009000719,0.00008307087,0.000056711662,0.00036158043,0.000025931484,0.00068830047,0.0000432377,0.000081300524],"category_scores_gemma":[0.00009999401,0.000088309775,0.0000540304,0.00021667698,0.00008591653,0.00045209704,0.00014129106,0.000082260456,0.0008943588],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029181023,0.000921416,0.24008805,0.00006235078,0.00015126476,0.0012128379,0.02076464,0.0052620126,0.005780997,0.059630506,0.19645602,0.46964073],"study_design_scores_gemma":[0.0010240986,0.00090367283,0.14611726,0.00035622815,0.000026386644,0.0014450526,0.00018980638,0.050327916,0.3476144,0.24634536,0.20195375,0.0036960675],"about_ca_topic_score_codex":0.000017467226,"about_ca_topic_score_gemma":0.0000037398254,"teacher_disagreement_score":0.77254003,"about_ca_system_score_codex":0.000040629184,"about_ca_system_score_gemma":0.00007413636,"threshold_uncertainty_score":0.99988353},"labels":[],"label_agreement":null},{"id":"W2294431252","doi":"10.1007/978-3-319-24069-5_21","title":"Enhancing History-Based Move Ordering in Game Playing Using Adaptive Data Structures","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Heuristics; Heuristic; Variety (cybernetics); Field (mathematics); Ranking (information retrieval); Adversary; Perspective (graphical); Combinatorial game theory; Video game design; Artificial intelligence; Sequential game; Game theory; Game mechanics; Mathematical economics; Computer security; Mathematics","score_opus":0.12144958667199106,"score_gpt":0.3116613849646072,"score_spread":0.19021179829261614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294431252","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063467224,0.0016613612,0.99333256,0.00011349829,0.0029275005,0.00042671143,0.0000094545885,0.00015962735,0.0007346342],"genre_scores_gemma":[0.33029693,0.000008010351,0.6685585,0.0006187509,0.00040593115,0.00000414673,0.000007250616,0.0000548381,0.000045664525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99403054,0.00008243893,0.000922186,0.0025210832,0.0014536883,0.0009900784],"domain_scores_gemma":[0.995265,0.00070649426,0.00052818784,0.0029088096,0.00036064794,0.00023086501],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001729123,0.000720973,0.00076151174,0.0014402599,0.00016306176,0.00040635013,0.0074943826,0.0004136379,0.00003444631],"category_scores_gemma":[0.00046253751,0.0007310404,0.000084512016,0.0007123366,0.000906113,0.0015543549,0.0036225005,0.0013285432,0.000020178953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018743534,0.000024155015,0.000102743885,0.000041998097,0.000010997112,0.0002692265,0.002902783,0.7425273,0.0013978826,0.008842007,0.000018513494,0.24384362],"study_design_scores_gemma":[0.00011308701,0.00007204571,0.000028228724,0.00060218084,0.00000678356,0.000029505034,0.000001681791,0.9255974,0.0028848182,0.06924251,0.000667307,0.0007544085],"about_ca_topic_score_codex":0.0005531819,"about_ca_topic_score_gemma":0.0014200194,"teacher_disagreement_score":0.32966226,"about_ca_system_score_codex":0.0026786178,"about_ca_system_score_gemma":0.0029231121,"threshold_uncertainty_score":0.99951404},"labels":[],"label_agreement":null},{"id":"W2295179707","doi":"10.1609/aaai.v28i1.8830","title":"Using Response Functions to Measure Strategy Strength","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":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; University of Alberta; Compute Canada","keywords":"Computer science; Measure (data warehouse); Nash equilibrium; Variety (cybernetics); Monte Carlo tree search; Best response; Regret; Class (philosophy); Mathematical optimization; Epsilon-equilibrium; Computation; Mathematical economics; Monte Carlo method; Mathematics; Artificial intelligence; Machine learning; Algorithm","score_opus":0.16479258411519682,"score_gpt":0.33551433261073044,"score_spread":0.17072174849553362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295179707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4823725,0.000014426749,0.4982082,0.0061339466,0.0011106457,0.0007535176,0.000011320759,0.00027208426,0.011123352],"genre_scores_gemma":[0.98947537,0.000003111574,0.009526094,0.0003623551,0.00013850899,0.000029223133,2.5194572e-7,0.000024115569,0.00044097618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99673593,0.00011229088,0.00083724817,0.00081993156,0.0008834335,0.0006111724],"domain_scores_gemma":[0.99696624,0.00035546892,0.00041526495,0.00071852526,0.0012900366,0.0002544661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017071516,0.0003640439,0.00037220292,0.00032142902,0.00044701927,0.00049758755,0.003115389,0.00015083648,0.00009780172],"category_scores_gemma":[0.0023616888,0.00029003833,0.00018636842,0.0015479778,0.00032825183,0.00061781355,0.0005820639,0.0004358337,0.00050401373],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029450888,0.0001726308,0.00014329348,0.000015111422,0.000018642431,4.4332032e-7,0.0013287679,0.0025180492,0.16663426,0.68541306,0.00028633422,0.14317489],"study_design_scores_gemma":[0.00002006552,0.0006010137,0.00023055475,0.00026176192,0.000020387346,0.000008942772,0.0012422751,0.22380613,0.67748624,0.095133595,0.0007369466,0.00045207486],"about_ca_topic_score_codex":0.00009060251,"about_ca_topic_score_gemma":0.00003597403,"teacher_disagreement_score":0.59027946,"about_ca_system_score_codex":0.00011582892,"about_ca_system_score_gemma":0.0002363013,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W2295297222","doi":"","title":"A brief tutorial on reinforcement learning: The game of Chung Toi.","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Artificial neural network; Temporal difference learning; Adversary; Variation (astronomy); Reinforcement; Simple (philosophy); Machine learning; Operations research; Engineering; Computer security","score_opus":0.05772120827441918,"score_gpt":0.27127722779850305,"score_spread":0.21355601952408387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295297222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036317386,0.00001938385,0.66384244,0.00054281147,0.001736448,0.00029294012,1.13532565e-7,0.00019681033,0.2970517],"genre_scores_gemma":[0.9940013,0.000005714884,0.0017979181,0.00025435706,0.00013675315,0.000007975309,1.4337726e-7,0.000004451233,0.0037913665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990184,0.000050523762,0.00025241374,0.00019078821,0.00029748885,0.00019040759],"domain_scores_gemma":[0.99924576,0.00011811337,0.00010303533,0.0004178165,0.000074929194,0.000040313065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003222907,0.00008677717,0.000099118784,0.00003964804,0.000065681816,0.000041223055,0.0007932279,0.0000362185,0.0003044895],"category_scores_gemma":[0.00013085945,0.00005475921,0.00006238411,0.00017062963,0.00009090873,0.00017094232,0.0002087622,0.0001329479,0.0001739154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035552534,0.00006160084,0.00038744565,0.000003650397,0.000019720546,0.000003970134,0.01009553,0.0020294774,0.00096437585,0.9411911,0.0012719802,0.043935604],"study_design_scores_gemma":[0.00022510297,0.0018542139,0.001985852,0.00005078017,0.000013703912,0.000007695134,0.0008144633,0.18963909,0.6957425,0.02222915,0.08698705,0.00045038856],"about_ca_topic_score_codex":0.0003813125,"about_ca_topic_score_gemma":0.000012778394,"teacher_disagreement_score":0.9576839,"about_ca_system_score_codex":0.00002051172,"about_ca_system_score_gemma":0.000040564122,"threshold_uncertainty_score":0.33339468},"labels":[],"label_agreement":null},{"id":"W2336565903","doi":"10.1007/978-981-10-0251-9_1","title":"The Game of Wall Cops and Robbers","year":2015,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Cartesian coordinate system; Graph; Cartesian product; Mathematics; Computer science; Geometry","score_opus":0.037685200031135714,"score_gpt":0.29459645000856155,"score_spread":0.2569112499774258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336565903","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088719744,0.42281872,0.40600884,0.00027131703,0.00453905,0.0012595165,0.000006770204,0.00015841021,0.16405019],"genre_scores_gemma":[0.9053831,0.0398257,0.004185739,0.00010602355,0.0005122141,0.000021843558,0.0000043497444,0.00009883882,0.049862206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977047,0.00006027644,0.0009591485,0.00054806087,0.00040191333,0.0003258887],"domain_scores_gemma":[0.99774957,0.0008016164,0.00061491743,0.0005157148,0.00021315162,0.00010503655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009818244,0.00032179503,0.0005333837,0.00013792487,0.0001256601,0.0001874717,0.00078378076,0.00016139467,0.0000019403435],"category_scores_gemma":[0.00007626114,0.000243364,0.00006248834,0.00007704163,0.00037020372,0.00025763726,0.00054536905,0.00034435364,0.000010872216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064005058,0.000006154057,0.00015788255,0.000115744784,0.000022696619,0.000010204213,0.001220162,0.0052687265,0.000002124796,0.7377901,0.00008524521,0.2553146],"study_design_scores_gemma":[0.000086499414,0.00021629516,0.000011700626,0.0022782814,0.000017506109,0.00008837029,0.00081317837,0.23736964,0.000120827644,0.14406735,0.614308,0.00062238664],"about_ca_topic_score_codex":0.00013183993,"about_ca_topic_score_gemma":0.000107208325,"teacher_disagreement_score":0.9044959,"about_ca_system_score_codex":0.00008343968,"about_ca_system_score_gemma":0.000062356645,"threshold_uncertainty_score":0.9924096},"labels":[],"label_agreement":null},{"id":"W2343238238","doi":"10.3233/icg-2015-38404","title":"A Classification of Semeai with Approach Moves","year":2015,"lang":"en","type":"preprint","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Principal (computer security); Civil liberties; Class (philosophy); Order (exchange); Mathematics; Law; Computer science; Mathematical economics; Political science; Artificial intelligence; Computer security; Economics; Politics","score_opus":0.1068398532275444,"score_gpt":0.3185083508828652,"score_spread":0.2116684976553208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343238238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054854017,0.00050625077,0.9355903,0.0005581316,0.00061409746,0.00016557699,0.0000031151765,0.000053891636,0.007654598],"genre_scores_gemma":[0.8491855,0.000051263458,0.15015885,0.000035055964,0.00033649127,0.000012123537,0.0000025426734,0.000015210239,0.00020295667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810827,0.00012690663,0.0005055503,0.00034729936,0.0006863009,0.00022566486],"domain_scores_gemma":[0.9975385,0.000042626478,0.0008063682,0.0007404689,0.0007143146,0.00015773303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008571537,0.00019308657,0.00030243487,0.00020245694,0.000072052106,0.00032960615,0.0017798055,0.00017054683,0.000010371084],"category_scores_gemma":[0.00006732465,0.00014521713,0.000097482705,0.00020709762,0.00013440973,0.0003298743,0.00051958795,0.00086475414,0.000016031307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034049858,0.002366383,0.020341618,0.0007798842,0.0011942638,0.00021218481,0.055863842,0.19290993,0.0073923673,0.19722156,0.03513227,0.48624521],"study_design_scores_gemma":[0.0003127115,0.00047215426,0.009592279,0.0007290379,0.00008772956,0.001157063,0.002185427,0.78284353,0.008661251,0.18919107,0.0037339511,0.0010337888],"about_ca_topic_score_codex":0.000024423933,"about_ca_topic_score_gemma":0.00000550038,"teacher_disagreement_score":0.7943315,"about_ca_system_score_codex":0.0001142566,"about_ca_system_score_gemma":0.00070425594,"threshold_uncertainty_score":0.5921783},"labels":[],"label_agreement":null},{"id":"W2344649489","doi":"10.3233/icg-2012-35302","title":"Game-Tree Search Using Proof Numbers: The First Twenty Years","year":2012,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Tree (set theory); Computer science; Mathematics; Combinatorics","score_opus":0.07804452724571852,"score_gpt":0.3331379310410891,"score_spread":0.25509340379537054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344649489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5722077,0.000768551,0.4192711,0.0023070576,0.0023658331,0.00018419507,8.073951e-7,0.000060099173,0.0028346775],"genre_scores_gemma":[0.9901617,0.000018223976,0.008368186,0.00030278353,0.0009877026,0.0000019560816,8.6035016e-8,0.00001197345,0.00014737439],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983385,0.00011433686,0.00027293645,0.00014606566,0.0005528653,0.0005752487],"domain_scores_gemma":[0.99905264,0.0001236265,0.00012168084,0.00040644454,0.000111060996,0.00018456722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011731898,0.0001092903,0.0001095894,0.00007705839,0.00033522575,0.00047712907,0.001264963,0.000052055406,0.000099300756],"category_scores_gemma":[0.000051322026,0.00007678912,0.00010036723,0.0003217591,0.00012728352,0.0010868008,0.00030234526,0.0004874519,0.00025546283],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003158894,0.00048015668,0.1645514,0.000026736252,0.00015533381,0.00017216985,0.04933746,0.0070775542,0.0010113474,0.016432496,0.008999361,0.75172436],"study_design_scores_gemma":[0.0007711146,0.00045924127,0.108461045,0.0006899675,0.00011535613,0.010292293,0.006936599,0.3802082,0.0730408,0.0312159,0.38571316,0.0020963273],"about_ca_topic_score_codex":0.000058810027,"about_ca_topic_score_gemma":0.000032053846,"teacher_disagreement_score":0.74962807,"about_ca_system_score_codex":0.000117292424,"about_ca_system_score_gemma":0.00010504333,"threshold_uncertainty_score":0.46009666},"labels":[],"label_agreement":null},{"id":"W2351345168","doi":"","title":"Talk About Java 2 More Sequences Turns the NonSerializable and Final Objects","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Serialization; Computer science; Java; Object (grammar); Programming language; Method; Object-oriented programming; Artificial intelligence","score_opus":0.022661804868152693,"score_gpt":0.2915708671204753,"score_spread":0.26890906225232264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2351345168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02025605,0.0005755939,0.97515905,0.0020248531,0.00007784488,0.00058501767,0.0000044164162,0.00018312586,0.0011340734],"genre_scores_gemma":[0.4462168,0.000065039756,0.55036616,0.0020393888,0.0005177033,0.0002233073,0.000006986003,0.000018892013,0.0005457575],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986053,0.00003144273,0.00032603266,0.00047482245,0.0001812089,0.00038116667],"domain_scores_gemma":[0.99883866,0.00023898143,0.00011135885,0.00059140654,0.00011476272,0.00010480456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041564376,0.00017076299,0.00013630762,0.00008688926,0.00040324533,0.00038846955,0.0012568602,0.000072055875,0.000012688155],"category_scores_gemma":[0.0000025793404,0.00013099195,0.00005413207,0.0005209257,0.00028652875,0.00029104116,0.00039669205,0.00016209435,0.000103536455],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012677247,0.00028305544,0.0008961481,0.000057210305,0.00006584815,0.000031895186,0.014035594,0.0006678059,0.038404644,0.1997961,0.0067985617,0.73895043],"study_design_scores_gemma":[0.00015242305,0.00007495604,0.0063411836,0.000039150524,0.000019933199,0.00039003143,0.0005354623,0.011570556,0.08200787,0.039972056,0.8583312,0.0005651863],"about_ca_topic_score_codex":0.0001682377,"about_ca_topic_score_gemma":0.00015069185,"teacher_disagreement_score":0.85153264,"about_ca_system_score_codex":0.00003631154,"about_ca_system_score_gemma":0.00006960355,"threshold_uncertainty_score":0.5341696},"labels":[],"label_agreement":null},{"id":"W2377255867","doi":"","title":"A New Frustum Culling Algorithm","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Frustum; Octree; Computer science; Intersection (aeronautics); Midpoint; Algorithm; Equilateral triangle; Culling; Bounding overwatch; Cube (algebra); Node (physics); Computation; Process (computing); Computer graphics (images); Artificial intelligence; Mathematics; Geometry","score_opus":0.014347557719945976,"score_gpt":0.27348504806936974,"score_spread":0.25913749034942374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2377255867","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008537945,0.00019916003,0.9942946,0.0030376224,0.00004276258,0.00039538875,0.0000013471155,0.00048679727,0.0014569672],"genre_scores_gemma":[0.0052815815,0.000012438254,0.9919304,0.0016914081,0.00045370273,0.000047185113,0.0000039915394,0.00000823591,0.00057105825],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871045,0.000017939154,0.00029200522,0.0004984146,0.00016192603,0.00031926797],"domain_scores_gemma":[0.9990024,0.00004630278,0.0000767837,0.0006228902,0.00008464983,0.00016698342],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000095618234,0.00015886084,0.0001397512,0.000114383845,0.0002021717,0.00028019116,0.0014155471,0.0000647108,0.000021391897],"category_scores_gemma":[5.3403147e-7,0.00016465146,0.000085185995,0.0005851138,0.00002319358,0.00032089875,0.00016280444,0.00015134829,0.0008515794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3795707e-7,0.000043864435,0.000010494177,8.302371e-7,0.0000045482043,0.0000015326231,0.00032369938,0.00010187026,0.001781271,0.043845657,0.006823637,0.9470624],"study_design_scores_gemma":[0.00008310603,0.00005051253,0.00043193946,0.000012731193,0.000006551615,0.000039045255,0.000016906999,0.074538805,0.028666059,0.10756451,0.7882401,0.0003497668],"about_ca_topic_score_codex":0.00003065171,"about_ca_topic_score_gemma":0.00000214004,"teacher_disagreement_score":0.9467126,"about_ca_system_score_codex":0.000045408204,"about_ca_system_score_gemma":0.00008359722,"threshold_uncertainty_score":0.9999264},"labels":[],"label_agreement":null},{"id":"W2394492371","doi":"","title":"Solving nonogram puzzles by reinforcement learning","year":2012,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Solver; Connectionism; Computer science; Heuristic; Constraint satisfaction problem; Artificial intelligence; Temporal difference learning; Artificial neural network; Programming language","score_opus":0.02060443729135078,"score_gpt":0.23822992844761715,"score_spread":0.21762549115626637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394492371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21534568,0.0022831056,0.6341684,0.002355636,0.0013147341,0.0007973991,0.00014944132,0.0038795448,0.13970606],"genre_scores_gemma":[0.9886801,0.000027326794,0.0067030066,0.0006784399,0.00023611479,0.00002884147,0.0001287807,0.00005593445,0.003461414],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727315,0.00009289962,0.0005732091,0.0004680266,0.00054826646,0.0010444608],"domain_scores_gemma":[0.99838954,0.00024048395,0.0001982744,0.00059303734,0.000040583658,0.00053805497],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00036285268,0.0003437103,0.00025083075,0.00016014425,0.00033341695,0.0031533653,0.0014606226,0.00014695569,0.00032871243],"category_scores_gemma":[0.00036558922,0.0003250139,0.00017324928,0.00059221743,0.000112156806,0.016170362,0.0009656033,0.00060466176,0.006417928],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050841136,0.0006472607,0.58657974,0.000082182276,0.00012647425,0.000029420458,0.001040987,0.001045051,0.001666725,0.06567168,0.04421363,0.298846],"study_design_scores_gemma":[0.00012952961,0.00010786866,0.0006927354,0.00007612227,0.000008499716,0.000018002156,0.00012372629,0.009646732,0.03678362,0.005463095,0.9461424,0.00080769643],"about_ca_topic_score_codex":0.000003914814,"about_ca_topic_score_gemma":2.367212e-7,"teacher_disagreement_score":0.9019287,"about_ca_system_score_codex":0.000052921194,"about_ca_system_score_gemma":0.000060321134,"threshold_uncertainty_score":0.9999202},"labels":[],"label_agreement":null},{"id":"W2394792037","doi":"10.1609/aiide.v6i1.12410","title":"On the Complexity of Two-Player Attrition Games Played on Graphs","year":2010,"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":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Attrition; Heuristics; Computer science; Mathematical proof; Graph; Core (optical fiber); Variety (cybernetics); Time complexity; Game theory; Theoretical computer science; Mathematical economics; Mathematics; Artificial intelligence; Algorithm","score_opus":0.0837733008916107,"score_gpt":0.3072169081646831,"score_spread":0.22344360727307241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394792037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97179896,0.0000044948956,0.0041411156,0.005739725,0.00064421765,0.00069400325,0.00003740841,0.000045413868,0.016894653],"genre_scores_gemma":[0.9989911,0.000014106811,0.0001807047,0.00059990195,0.000041755477,0.00005023176,0.0000017162697,0.000014442163,0.000106040534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975711,0.000031708136,0.00072376,0.0006076299,0.0007040757,0.0003617094],"domain_scores_gemma":[0.99770427,0.00059260346,0.00059271476,0.00044694226,0.00055873155,0.00010476348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038035717,0.00035470797,0.00034966852,0.00019395632,0.00022858576,0.0004977267,0.0016120403,0.00008363457,0.00011649491],"category_scores_gemma":[0.0006832928,0.00021877389,0.00022384897,0.00035538632,0.0012676129,0.00081491173,0.0004094733,0.0006495347,0.000069709946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003013795,0.00057836744,0.00025249046,0.000014295374,0.000043825796,5.678809e-7,0.0017351515,0.00002289689,0.037782095,0.92463917,0.00014085828,0.034488898],"study_design_scores_gemma":[0.0000344552,0.0007611829,0.0002246601,0.00026728233,0.000007797644,0.0000041795415,0.0013367416,0.010791543,0.59531033,0.39102367,0.00006126612,0.00017688361],"about_ca_topic_score_codex":0.000051085022,"about_ca_topic_score_gemma":0.000024485507,"teacher_disagreement_score":0.55752826,"about_ca_system_score_codex":0.000050177605,"about_ca_system_score_gemma":0.00004040636,"threshold_uncertainty_score":0.892134},"labels":[],"label_agreement":null},{"id":"W2396453985","doi":"","title":"MCRNR: fast computing of restricted Nash responses by means of sampling","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Best response; Nash equilibrium; Game tree; Tree traversal; Regret; Perfect information; Monte Carlo tree search; Mathematical optimization; Tree (set theory); Sampling (signal processing); Counterfactual thinking; Estimator; Minimax; Algorithm; Game theory; Monte Carlo method; Machine learning; Mathematics; Repeated game; Mathematical economics","score_opus":0.04221663454677622,"score_gpt":0.3175659271330701,"score_spread":0.27534929258629387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396453985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45570895,0.000014954722,0.5421121,0.00015941005,0.0002852717,0.00006303099,0.0000038176645,0.00008147967,0.001570964],"genre_scores_gemma":[0.8387659,0.0000026323191,0.1608983,0.000046896563,0.000027660471,7.341729e-7,7.9161737e-7,0.0000063338766,0.0002507454],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986137,0.000065926266,0.0005097463,0.0002731633,0.00030767632,0.00022976422],"domain_scores_gemma":[0.99803114,0.0008499638,0.0002246346,0.00057845295,0.00025096608,0.00006486423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039391714,0.000108593915,0.00020476348,0.00013909607,0.00007168562,0.000042095362,0.001022267,0.00007923419,0.000043692493],"category_scores_gemma":[0.0006199864,0.00009834258,0.000063745465,0.00053702184,0.00017369473,0.00020239346,0.0003015906,0.00019632354,0.000014196266],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021682217,0.000111185145,0.00584511,0.000016750011,0.000016477752,0.0000017849592,0.0017583333,0.00034582632,0.8475246,0.061073456,0.0010566241,0.082228184],"study_design_scores_gemma":[0.00006602367,0.0001126662,0.0032694598,0.0000358776,0.0000047612184,0.000006898871,0.0003075451,0.09705883,0.89391375,0.003602536,0.0014336105,0.0001880638],"about_ca_topic_score_codex":0.00029940825,"about_ca_topic_score_gemma":0.00008588856,"teacher_disagreement_score":0.38305697,"about_ca_system_score_codex":0.000008950892,"about_ca_system_score_gemma":0.00007635858,"threshold_uncertainty_score":0.4010294},"labels":[],"label_agreement":null},{"id":"W2398204659","doi":"","title":"Adaptive companions in FPS games.","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.042226917924720365,"score_gpt":0.2731607000176488,"score_spread":0.23093378209292845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398204659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049577948,0.000046907437,0.86690253,0.0031837602,0.00029486342,0.00028780912,3.1260055e-7,0.00024266094,0.079463236],"genre_scores_gemma":[0.95183957,0.0000035072676,0.04630545,0.0005352303,0.000021462425,0.000030329787,1.7031556e-7,0.0000036447932,0.0012606231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991762,0.000036116915,0.00018690704,0.00023102218,0.00013429762,0.00023543491],"domain_scores_gemma":[0.99938065,0.00011216773,0.00002814174,0.00034774854,0.0000645175,0.000066802175],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009385823,0.00007829931,0.000097469776,0.00009346848,0.000034764285,0.000107525426,0.00067030534,0.00003384427,0.00048183894],"category_scores_gemma":[0.000031270774,0.00006633666,0.00002928213,0.00034195138,0.000057227076,0.00062186475,0.00019447246,0.00010274402,0.0033192127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011289692,0.00012216555,0.004063432,0.000001482941,0.0000058789706,0.000009058151,0.0022090103,0.0007344475,0.00061879185,0.79514223,0.013661861,0.18343054],"study_design_scores_gemma":[0.00006780023,0.00008523637,0.031732734,0.000020052785,9.810921e-7,0.00000748378,0.0010477345,0.8142355,0.011041271,0.13793722,0.0035117164,0.00031227298],"about_ca_topic_score_codex":0.0014245056,"about_ca_topic_score_gemma":0.00033302093,"teacher_disagreement_score":0.9022616,"about_ca_system_score_codex":0.000034352237,"about_ca_system_score_gemma":0.000031132462,"threshold_uncertainty_score":0.9974568},"labels":[],"label_agreement":null},{"id":"W2399952684","doi":"10.1609/aaai.v25i1.8060","title":"Extending the Applications of Recent Real-Time Heuristic Search","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pathfinding; Incremental heuristic search; Computer science; Heuristic; Property (philosophy); Search algorithm; Beam search; Space (punctuation); Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.14950089952854162,"score_gpt":0.33305114734217656,"score_spread":0.18355024781363494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399952684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2265878,0.00020762056,0.43988582,0.010017466,0.0015669885,0.005430339,0.000038580194,0.00069444685,0.31557092],"genre_scores_gemma":[0.9922445,0.0003989407,0.006745455,0.000078343604,0.00006965331,0.0000975686,3.57786e-7,0.000019106785,0.00034607612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971619,0.000056002606,0.0009455652,0.0005864042,0.0007703482,0.0004797534],"domain_scores_gemma":[0.9967962,0.00031136745,0.0005919606,0.00080414367,0.0013853476,0.00011100127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012258895,0.00026490106,0.0003308285,0.00018356534,0.00035081457,0.00014173346,0.0046350528,0.000103635764,0.00045520952],"category_scores_gemma":[0.00047001345,0.00017333159,0.00016194364,0.0014571667,0.00095008715,0.00036499492,0.0007707053,0.0003849118,0.00032675138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037433274,0.00018974526,0.00017215947,0.0000262773,0.000017407774,3.0149332e-7,0.0035179576,0.000022884573,0.037770826,0.79375535,0.000074669326,0.164415],"study_design_scores_gemma":[0.000008374635,0.00015904498,0.00026856142,0.00010345271,0.000017142449,0.0000049513933,0.0010396907,0.021777306,0.7303827,0.24585634,0.00019457535,0.00018789014],"about_ca_topic_score_codex":0.00023376974,"about_ca_topic_score_gemma":0.000010798685,"teacher_disagreement_score":0.7656567,"about_ca_system_score_codex":0.00006028342,"about_ca_system_score_gemma":0.00016874539,"threshold_uncertainty_score":0.86131585},"labels":[],"label_agreement":null},{"id":"W2400015350","doi":"","title":"On strict-double-bound numbers of spiders and ladders.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.022371630106685934,"score_gpt":0.26389148852914546,"score_spread":0.24151985842245952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400015350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.986168,0.00009211085,0.0011659272,0.00083360635,0.0012995638,0.00026954905,5.103587e-7,0.00009308035,0.010077654],"genre_scores_gemma":[0.9985261,0.000019121213,0.0010424897,0.00020493651,0.0000047632648,0.000015672776,4.799328e-7,0.000009879923,0.00017654296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881464,0.000050646115,0.00026670718,0.0003175365,0.00028607744,0.00026437963],"domain_scores_gemma":[0.9988102,0.00034009037,0.00011861288,0.0004981161,0.000120049,0.00011298911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020874826,0.00013968519,0.00018336142,0.00010028176,0.00008588086,0.0001424642,0.0005896694,0.00007208836,0.000076374294],"category_scores_gemma":[0.00008961322,0.00013326918,0.000045929864,0.00032865282,0.00016306361,0.0005163239,0.00017576056,0.00013425283,0.00022952707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007952602,0.00006908821,0.0015111982,0.00000790664,0.000016480108,0.0000031011534,0.0006229186,0.000025995887,0.00030915329,0.98403215,0.00470256,0.008691487],"study_design_scores_gemma":[0.0003580179,0.0002361427,0.0022687851,0.0000276073,0.000005661574,0.0000038012065,0.00026124244,0.0033033649,0.022011088,0.97082883,0.0004754988,0.00021998708],"about_ca_topic_score_codex":0.000692313,"about_ca_topic_score_gemma":0.0000109246075,"teacher_disagreement_score":0.021701934,"about_ca_system_score_codex":0.000031603915,"about_ca_system_score_gemma":0.000043023407,"threshold_uncertainty_score":0.5434559},"labels":[],"label_agreement":null},{"id":"W2400651513","doi":"10.3233/978-1-61499-419-0-1099","title":"Introducing Hierarchical Adversarial Search, a Scalable Search Procedure for Real-Time Strategy Games","year":2014,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adversarial system; Scalability; Computer science; Theoretical computer science; Artificial intelligence; Database","score_opus":0.036998727755815905,"score_gpt":0.295092727836535,"score_spread":0.2580940000807191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400651513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008132269,0.00033921434,0.97241837,0.0011945465,0.00037846877,0.002407452,0.000052569405,0.000200605,0.02292743],"genre_scores_gemma":[0.055398334,0.0058771563,0.6740039,0.0007903626,0.009943874,0.0040551736,0.0005607343,0.0005882056,0.24878226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572265,0.000078600126,0.0011168161,0.0016797927,0.00055252685,0.00084962853],"domain_scores_gemma":[0.99754363,0.00044745067,0.00022451248,0.0011127539,0.00036340576,0.00030821838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001086261,0.00054661225,0.00076494063,0.0006551677,0.0004740925,0.00047896637,0.001585667,0.0005764707,0.0000787155],"category_scores_gemma":[0.00011200163,0.00058133306,0.00020561022,0.00036182592,0.00082519127,0.00031373283,0.00041438435,0.00087791396,0.00024640208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048264526,0.000049944578,0.000012663791,0.00007834356,0.000032735228,0.0000024101341,0.0005572853,0.0036041075,0.00018680231,0.5874513,0.0023386893,0.40563747],"study_design_scores_gemma":[0.00004222158,0.00023979919,0.000004327037,0.0001795215,0.00003774019,0.000008286606,0.00035160637,0.31641045,0.0047631063,0.644601,0.032624967,0.00073702075],"about_ca_topic_score_codex":0.00010436871,"about_ca_topic_score_gemma":0.00007331521,"teacher_disagreement_score":0.40490046,"about_ca_system_score_codex":0.00020518492,"about_ca_system_score_gemma":0.000502248,"threshold_uncertainty_score":0.99966383},"labels":[],"label_agreement":null},{"id":"W2403232810","doi":"","title":"Playing Texas Hold'em Poker Online Using Case-Based Reasoning","year":2008,"lang":"en","type":"article","venue":"IJIGS. International journal of intelligent games & simulation","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Competitor analysis; Computer science; Case-based reasoning; World Wide Web; Operations research; Data science; Artificial intelligence; Marketing; Business; Engineering","score_opus":0.08411194215756689,"score_gpt":0.3566630654179932,"score_spread":0.2725511232604263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403232810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48245734,0.00019549565,0.5156264,0.00021741186,0.0012749926,0.000091445094,0.0000065823147,0.000047935828,0.0000824376],"genre_scores_gemma":[0.9268351,0.00005514142,0.07165225,0.0005579083,0.0007907553,0.00000114046,0.0000088475645,0.000031263997,0.00006755885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625033,0.00017411017,0.0014576383,0.0003895388,0.0013596866,0.00036871465],"domain_scores_gemma":[0.9952669,0.0007879132,0.00121505,0.0003763958,0.0021573305,0.00019642554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006812997,0.00031421438,0.00037035043,0.0007704219,0.00023006096,0.00032021623,0.0013598041,0.00014166767,0.00013316509],"category_scores_gemma":[0.0010279223,0.00029196494,0.00034983698,0.0004472036,0.00011834804,0.0015372251,0.00020680859,0.0004731882,0.000047774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010061635,0.00029349726,0.010484936,0.0000064209075,0.00014722823,0.0030610352,0.0019011438,0.94439363,0.00092854386,0.0011057394,0.00008959473,0.037487593],"study_design_scores_gemma":[0.00025324774,0.0001412243,0.001846093,0.00026567958,0.000027212656,0.004306328,0.0002791456,0.9777356,0.012752843,0.00065325235,0.0014304555,0.0003089474],"about_ca_topic_score_codex":0.000095923824,"about_ca_topic_score_gemma":0.000029495997,"teacher_disagreement_score":0.4443778,"about_ca_system_score_codex":0.00054469827,"about_ca_system_score_gemma":0.00034305494,"threshold_uncertainty_score":0.99995327},"labels":[],"label_agreement":null},{"id":"W2403345031","doi":"10.1609/aiide.v7i1.12440","title":"Behavior Learning-Based Testing of Starcraft Competition Entries","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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Macro; Competition (biology); Computer science; Margin (machine learning); Action (physics); Strengths and weaknesses; Artificial intelligence; Test (biology); Machine learning; Psychology; Social psychology; Programming language","score_opus":0.08308497060880611,"score_gpt":0.2814262492827505,"score_spread":0.1983412786739444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403345031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93633425,0.000014821092,0.049489863,0.0003825852,0.0003017432,0.0006220178,0.000016194126,0.00008309317,0.01275545],"genre_scores_gemma":[0.99847424,0.000009275962,0.0012710274,0.00007683346,0.000018477507,0.00004693388,0.0000011409435,0.000012723484,0.00008937202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99801534,0.000023584471,0.00072445854,0.00046487493,0.00046261327,0.00030915323],"domain_scores_gemma":[0.99801004,0.0002255533,0.0006317536,0.0002107175,0.0008290366,0.000092890696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023100474,0.0002683027,0.0003076912,0.0001791698,0.0001437037,0.00025238626,0.0009950645,0.00006512602,0.00007684211],"category_scores_gemma":[0.0006005889,0.0002081454,0.0001357448,0.00035333275,0.000542701,0.0010825498,0.00040662728,0.0002979649,0.000023994138],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061168126,0.0023262866,0.042454377,0.00014010558,0.00009495186,0.0000048929087,0.01478774,0.00015582534,0.044317737,0.5942903,0.000021217507,0.3007949],"study_design_scores_gemma":[0.000035571386,0.0014069872,0.0018471142,0.00051187305,0.00002136426,0.000005336119,0.0043133404,0.028681997,0.9359871,0.02686948,0.00006463768,0.0002551662],"about_ca_topic_score_codex":0.000073491916,"about_ca_topic_score_gemma":0.0000051950374,"teacher_disagreement_score":0.8916694,"about_ca_system_score_codex":0.00006471384,"about_ca_system_score_gemma":0.000065823915,"threshold_uncertainty_score":0.84879225},"labels":[],"label_agreement":null},{"id":"W2406120758","doi":"","title":"A Note on Upper Generalized Exponents of Tournaments.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics; Mathematical economics","score_opus":0.022841130286643162,"score_gpt":0.2829236461014747,"score_spread":0.26008251581483155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406120758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9700473,0.000032680295,0.020451723,0.0006113269,0.0034028047,0.00014987667,8.2942427e-7,0.00010598117,0.0051974636],"genre_scores_gemma":[0.993282,0.000010182358,0.0060401214,0.00041235232,0.000013695562,0.000010751188,7.8306476e-7,0.000011807429,0.00021826276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998552,0.00012477135,0.00033190637,0.00030869697,0.00041389596,0.0002687095],"domain_scores_gemma":[0.99874294,0.00016418724,0.00015635935,0.00073624105,0.0001037539,0.000096494994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003442327,0.0001417523,0.00021771474,0.00010793581,0.000075658296,0.000057824527,0.0009839379,0.000067896406,0.000035506895],"category_scores_gemma":[0.00017359415,0.00013058777,0.00009128817,0.00023950683,0.00005802704,0.00022785175,0.00020518804,0.00012082908,0.0002516419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012271502,0.0001544122,0.0012124339,0.000004456822,0.000011565807,0.0000026456885,0.00055361394,0.000073291434,0.0039247856,0.95812887,0.0008653776,0.035056304],"study_design_scores_gemma":[0.0004794476,0.000403075,0.0023070106,0.0000594787,0.0000069495545,0.000002840588,0.00001605651,0.027263556,0.20173676,0.7598346,0.0076127904,0.0002774737],"about_ca_topic_score_codex":0.000054278426,"about_ca_topic_score_gemma":0.0000017741189,"teacher_disagreement_score":0.19829428,"about_ca_system_score_codex":0.00004977677,"about_ca_system_score_gemma":0.000028212871,"threshold_uncertainty_score":0.5325215},"labels":[],"label_agreement":null},{"id":"W2412311009","doi":"10.4230/lipics.fun.2016.13","title":"Super Mario Bros. is Harder/Easier Than We Thought","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"PSPACE; Constant (computer programming); Mathematical proof; Video game; Time complexity; Combinatorics; Mathematics; Computational complexity theory; Computer science; State (computer science); Discrete mathematics; Algorithm; Multimedia","score_opus":0.02679281900818871,"score_gpt":0.27077906729970047,"score_spread":0.24398624829151178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412311009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06457034,0.00018121889,0.90373254,0.011784548,0.0035022155,0.0016281185,0.0005684614,0.00076419377,0.013268372],"genre_scores_gemma":[0.88600147,0.0004606317,0.082893245,0.0078031,0.0008730493,0.00034950968,0.0000851496,0.00017626098,0.02135759],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99563694,0.00006001857,0.0014561833,0.00058163004,0.00090690743,0.0013583004],"domain_scores_gemma":[0.99647194,0.0003932581,0.00043041466,0.0018273181,0.00048333354,0.00039372663],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006983098,0.0006063064,0.0005733111,0.00033715222,0.00045735668,0.0008104723,0.002873564,0.00035472636,0.00034461872],"category_scores_gemma":[0.00022772058,0.00042863385,0.00046137997,0.00048215795,0.00032132055,0.004005616,0.0010567532,0.00037256876,0.0029350764],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027768657,0.0009629468,0.03805952,0.0006619191,0.0006281566,0.00003903599,0.06592705,0.00003565825,0.0016919362,0.16696313,0.21204968,0.5127033],"study_design_scores_gemma":[0.0014719372,0.0003595089,0.000981272,0.00045775308,0.000044578577,0.00010702573,0.0012050288,0.016656484,0.041764837,0.014094353,0.92143446,0.0014227612],"about_ca_topic_score_codex":0.000036115005,"about_ca_topic_score_gemma":0.00005810256,"teacher_disagreement_score":0.8214311,"about_ca_system_score_codex":0.00022673016,"about_ca_system_score_gemma":0.00017513403,"threshold_uncertainty_score":0.99981654},"labels":[],"label_agreement":null},{"id":"W2433491670","doi":"10.5539/cis.v9n3p1","title":"A Synthetic Player for Ayὸ Board Game Using Alpha-Beta Search and Learning Vector Quantization","year":2016,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Alpha (finance); Artificial intelligence; Game tree; BETA (programming language); Java; MATLAB; Machine learning; Multimedia; Sequential game; Operating system; Game theory; Programming language; Mathematics; Statistics","score_opus":0.047542616894836735,"score_gpt":0.3094044033313961,"score_spread":0.2618617864365594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2433491670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21362725,0.000018859962,0.78538126,0.0004330434,0.00023851296,0.00016250217,9.975811e-7,0.00006030034,0.000077274955],"genre_scores_gemma":[0.9306516,0.000029856277,0.0690269,0.0002243907,0.000044589804,0.0000053770927,4.030392e-7,0.0000029730131,0.000013904385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988051,0.000036459583,0.00027896021,0.00025908576,0.00033446215,0.0002859491],"domain_scores_gemma":[0.9990526,0.00023340945,0.000085847874,0.00020776244,0.00030807927,0.000112316855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009758864,0.00009994982,0.00010790652,0.00027817817,0.00042757223,0.0007258101,0.00044671245,0.000034488647,0.0000033686526],"category_scores_gemma":[0.00013762727,0.00007220226,0.000021292886,0.00043236773,0.00035102764,0.008328256,0.00033920523,0.0000639629,0.000021618016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011723168,0.0000113384895,0.0014003393,0.00004209721,0.0000048559527,3.9249497e-7,0.0078065735,0.003686296,0.00815438,0.114539444,0.000045142904,0.8642974],"study_design_scores_gemma":[0.000105512634,0.0001014865,0.0028375743,0.0000576436,0.00000194883,0.000016116099,0.00006576658,0.98276126,0.01119729,0.00040889118,0.0023128176,0.00013371673],"about_ca_topic_score_codex":0.000013715227,"about_ca_topic_score_gemma":7.3359416e-7,"teacher_disagreement_score":0.97907495,"about_ca_system_score_codex":0.000041647658,"about_ca_system_score_gemma":0.00010197235,"threshold_uncertainty_score":0.6999004},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Personality; Fuzzy logic; Psychology; Representation (politics); Cognitive psychology; Artificial intelligence; Social psychology; Computer science","score_opus":0.05617438159950045,"score_gpt":0.39130614552320364,"score_spread":0.3351317639237032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24557711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33529755,0.00004485237,0.6624406,0.00068416854,0.00079541345,0.00011182688,0.0000029459313,0.000014823367,0.000607789],"genre_scores_gemma":[0.96841717,0.0000026895857,0.031280715,0.00017104486,0.0000490523,0.000009619192,0.0000017811792,0.000007919465,0.000060035833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987061,0.00007120437,0.00047114608,0.00016779361,0.00042101243,0.00016271583],"domain_scores_gemma":[0.9982928,0.0001564649,0.00043116912,0.00014560389,0.0009104955,0.0000634686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003654043,0.0001058659,0.00020005275,0.00017609105,0.00006863177,0.000075841665,0.00078608055,0.000062317056,0.00006629748],"category_scores_gemma":[0.00019449902,0.00008699332,0.000113616145,0.00008094269,0.00007608355,0.00039002427,0.000041716445,0.00012475827,0.0000081788985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017588885,0.0008222582,0.029778365,0.000023536306,0.00039911072,0.0005886313,0.002298366,0.009154467,0.0014896939,0.9167861,0.00048194875,0.03800168],"study_design_scores_gemma":[0.0047092815,0.0036743789,0.046393532,0.0004061469,0.00028586184,0.015395183,0.0013186164,0.22194593,0.08376783,0.59517413,0.025312562,0.0016165302],"about_ca_topic_score_codex":0.000010912255,"about_ca_topic_score_gemma":0.000030651718,"teacher_disagreement_score":0.6331196,"about_ca_system_score_codex":0.00011368901,"about_ca_system_score_gemma":0.00012612263,"threshold_uncertainty_score":0.35474846},"labels":[],"label_agreement":null},{"id":"W2472694993","doi":"10.1016/j.tcs.2016.06.027","title":"Conspiracy number search with relative sibling scores","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Heuristic; Null-move heuristic; Champion; Computer science; Tree (set theory); Node (physics); Iterative deepening depth-first search; Search tree; Game tree; Search algorithm; Bidirectional search; Mathematics; Algorithm; Theoretical computer science; Best-first search; Beam search; Monte Carlo method; Artificial intelligence; Statistics; Combinatorics; Game theory; Sequential game","score_opus":0.029266208269517896,"score_gpt":0.3119599208179767,"score_spread":0.28269371254845876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472694993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10882609,0.000008063701,0.88016325,0.0029274384,0.0002700979,0.00016400944,9.1975477e-7,0.00025636377,0.007383774],"genre_scores_gemma":[0.7948104,0.0000035785881,0.20465049,0.0003761947,0.0000943008,0.0000058876562,6.3036886e-8,0.000009268907,0.00004981369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966615,0.00015267263,0.00030598897,0.00095573306,0.0010936502,0.0008304998],"domain_scores_gemma":[0.9968775,0.0012041588,0.000071008384,0.0010049515,0.0004923282,0.00035008517],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015539519,0.00021693563,0.00021163982,0.00019601587,0.000496826,0.0005106791,0.0029407712,0.000054215325,0.00018394933],"category_scores_gemma":[0.00023214023,0.00011991299,0.000052759253,0.0016854844,0.00837663,0.0022058685,0.0012228596,0.00021083097,0.0010691525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013252325,0.000031874024,0.0020125087,0.0000020583411,0.0000045499046,0.000026293632,0.0006243741,0.000060716342,0.0009138804,0.92366713,0.000020426882,0.0726229],"study_design_scores_gemma":[0.0002858754,0.00056922634,0.0018003603,0.0002769871,0.0000071514464,0.00015942709,0.000030027162,0.19864976,0.12376868,0.67360085,0.00021434105,0.000637327],"about_ca_topic_score_codex":0.000008931934,"about_ca_topic_score_gemma":0.0000015080248,"teacher_disagreement_score":0.6859843,"about_ca_system_score_codex":0.00009568018,"about_ca_system_score_gemma":0.00029402258,"threshold_uncertainty_score":0.99970865},"labels":[],"label_agreement":null},{"id":"W2473583080","doi":"","title":"More Than Words® Workshop - Winnipeg - MB - CA Space available","year":2015,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Space (punctuation); Computer science; Geography; Linguistics; Philosophy","score_opus":0.07154640725820577,"score_gpt":0.30455638364037113,"score_spread":0.23300997638216536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473583080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02370386,0.000621037,0.718525,0.014649039,0.001916339,0.0003252353,0.0000017314937,0.0009351619,0.2393226],"genre_scores_gemma":[0.6309883,0.000022775128,0.12184591,0.0017145291,0.00039568808,0.00002874824,0.000004014717,0.000033631284,0.24496637],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814314,0.0000537878,0.00026246833,0.00052677584,0.00049972115,0.000514081],"domain_scores_gemma":[0.99821407,0.0001307956,0.00007494856,0.0010811047,0.00017262722,0.00032645074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044861052,0.00019690984,0.0001924198,0.000107286105,0.000104974875,0.00035543178,0.0014642456,0.00010277968,0.000573433],"category_scores_gemma":[0.00023479539,0.00016762849,0.000067533925,0.00070503744,0.0001382228,0.00094804284,0.00054237054,0.00019423896,0.0050405916],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020653062,0.00015771156,0.005178564,0.0000078909425,0.00003088407,0.00009956056,0.009257803,0.0011720282,0.00031933637,0.09955714,0.8564653,0.027733166],"study_design_scores_gemma":[0.00020352172,0.00017344477,0.00021076712,0.00006772478,0.0000131413235,0.0000543454,0.0049139485,0.24966794,0.039822638,0.02752138,0.6763491,0.0010020585],"about_ca_topic_score_codex":0.00057680614,"about_ca_topic_score_gemma":0.00028527813,"teacher_disagreement_score":0.6072845,"about_ca_system_score_codex":0.00008664379,"about_ca_system_score_gemma":0.00020039729,"threshold_uncertainty_score":0.9957341},"labels":[],"label_agreement":null},{"id":"W2473893176","doi":"10.1017/s0025557200001340","title":"Ordering 15 marbles with a three-way scale","year":2014,"lang":"en","type":"article","venue":"The Mathematical Gazette","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"sort; Computer science; Scale (ratio); Set (abstract data type); Section (typography); Algorithm; Theoretical computer science; Information retrieval; Programming language; Physics","score_opus":0.02222345402081299,"score_gpt":0.24575813221525813,"score_spread":0.22353467819444514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473893176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053009853,0.000020002679,0.92144114,0.0046804696,0.000068393536,0.00017611236,2.2989546e-7,0.00022618685,0.020377636],"genre_scores_gemma":[0.8813538,0.000001473036,0.11709063,0.00077980355,0.00012638993,0.000037589896,1.6464953e-7,0.000021836395,0.0005883506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986588,0.0000692309,0.00024763096,0.00027990065,0.0003845879,0.0003598492],"domain_scores_gemma":[0.99831045,0.00052867125,0.00007166555,0.0009486147,0.000053131986,0.000087446075],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066642807,0.00016217087,0.00020535303,0.000035274836,0.00016998616,0.00021478343,0.0012666485,0.00004202522,0.00011102045],"category_scores_gemma":[0.00014032131,0.00008762899,0.00005333941,0.00026456692,0.0002460262,0.00019158778,0.00032119636,0.00017249212,0.0011442138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012853491,0.00010555653,0.00026059657,0.00006586583,0.00003053963,0.0000074312015,0.0025646014,0.00048167125,0.0009267429,0.91580737,0.0008976533,0.07883914],"study_design_scores_gemma":[0.00006786047,0.00010617906,0.00027172556,0.00011064523,0.000015217876,0.000051853716,0.00007472093,0.35750246,0.008148077,0.63075316,0.0026519892,0.00024607533],"about_ca_topic_score_codex":0.000010559274,"about_ca_topic_score_gemma":0.0000526426,"teacher_disagreement_score":0.8283439,"about_ca_system_score_codex":0.000015220655,"about_ca_system_score_gemma":0.00001503766,"threshold_uncertainty_score":0.9996335},"labels":[],"label_agreement":null},{"id":"W2474732749","doi":"10.1007/978-3-662-49619-0_2","title":"On Achieving History-Based Move Ordering in Adversarial Board Games Using Adaptive Data Structures","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Heuristics; Heuristic; A priori and a posteriori; Context (archaeology); Pruning; Adversarial system; Tree (set theory); Search tree; Monte Carlo tree search; Ranking (information retrieval); Game tree; Theoretical computer science; Artificial intelligence; Sequential game; Algorithm; Game theory; Search algorithm; Mathematical economics; Mathematics","score_opus":0.06677026653193777,"score_gpt":0.28752999270134294,"score_spread":0.22075972616940517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474732749","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000637623,0.0004270683,0.9919973,0.00033695556,0.004465299,0.00045874374,0.000017574926,0.00015080917,0.0015086171],"genre_scores_gemma":[0.43804637,0.00001637806,0.55911124,0.0016998781,0.0009216034,0.0000064372507,0.0000054345555,0.00008022933,0.000112461625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415815,0.00010022356,0.0007883796,0.0026825117,0.0013272353,0.0009434836],"domain_scores_gemma":[0.99465513,0.0013925037,0.00050847995,0.0030748406,0.00019225631,0.00017678403],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001033994,0.0007575253,0.00072608626,0.001430777,0.00019938214,0.00033690318,0.007469474,0.0004252969,0.000059713406],"category_scores_gemma":[0.0004960383,0.0006545091,0.0001205605,0.00046187555,0.0011458386,0.0012758457,0.0029300656,0.0011114362,0.000030033949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006548577,0.000033298533,0.00009899909,0.000024159153,0.00001551912,0.00019418877,0.001059601,0.33010513,0.00053078664,0.051890854,0.000034074143,0.6159479],"study_design_scores_gemma":[0.00021088513,0.00016174585,0.00007596419,0.0009939482,0.000008103497,0.000011026204,5.720559e-7,0.8782282,0.001414463,0.11706769,0.0009865136,0.00084087887],"about_ca_topic_score_codex":0.00021396203,"about_ca_topic_score_gemma":0.00042156555,"teacher_disagreement_score":0.615107,"about_ca_system_score_codex":0.0020756435,"about_ca_system_score_gemma":0.0016474325,"threshold_uncertainty_score":0.99959064},"labels":[],"label_agreement":null},{"id":"W2478918239","doi":"10.4018/978-1-60566-898-7.ch011","title":"The AGILE Design of Reality Game AI","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Agile software development; Exploit; Bridge (graph theory); Land bridge; Computer science; Class (philosophy); Geography; Environmental resource management; Engineering; Artificial intelligence; Software engineering; Environmental science; Sociology; Computer security","score_opus":0.0517008845665692,"score_gpt":0.2987879723808175,"score_spread":0.24708708781424832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478918239","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000613673,0.00016376497,0.31225038,0.0003485796,0.00094248145,0.00033231985,0.000024768493,0.0001246798,0.6858069],"genre_scores_gemma":[0.5869709,0.00009966825,0.043624748,0.0036688838,0.001742269,0.0001096143,0.0000038016317,0.00018396553,0.36359614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978746,0.000059990325,0.000594185,0.0005220869,0.0005761958,0.00037289818],"domain_scores_gemma":[0.99715734,0.00028892243,0.00041355682,0.0016882662,0.00032564072,0.00012629779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005403963,0.00033213984,0.0003705312,0.000034453482,0.00016512557,0.00019900435,0.0024413082,0.00043940797,0.000018871591],"category_scores_gemma":[0.00009827948,0.00025012426,0.00021200361,0.000026846757,0.0005786549,0.00008540521,0.00054532103,0.00055545196,0.00024253255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011314302,0.0000051343372,0.0000016620675,0.0000060162,0.000028206243,0.0000139492295,0.000093924034,0.00003321466,0.00015045784,0.9610305,0.0017690521,0.036856603],"study_design_scores_gemma":[0.000024327404,0.00007235403,0.0000054252037,0.00005510179,0.00001560231,0.00001729835,0.0000033996437,0.0011828315,0.0045119026,0.9128455,0.08102329,0.00024295828],"about_ca_topic_score_codex":0.00018995652,"about_ca_topic_score_gemma":0.00019917678,"teacher_disagreement_score":0.5869648,"about_ca_system_score_codex":0.00009966725,"about_ca_system_score_gemma":0.00037367927,"threshold_uncertainty_score":0.9999951},"labels":[],"label_agreement":null},{"id":"W2493063923","doi":"10.1609/aaai.v30i1.10051","title":"Counterfactual Regret Minimization in Sequential Security Games","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; Compute Canada","keywords":"Counterfactual thinking; Computer science; Regret; Nash equilibrium; Mathematical optimization; Repeated game; Class (philosophy); Computation; Mathematical economics; Game theory; Mathematics; Algorithm; Artificial intelligence; Machine learning","score_opus":0.07097387569925362,"score_gpt":0.30342123310477553,"score_spread":0.23244735740552191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493063923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85264885,0.000056472112,0.112879924,0.016620409,0.0018414397,0.0011192494,0.000025107734,0.00030515873,0.014503412],"genre_scores_gemma":[0.9979913,0.000077473655,0.0013161589,0.00019191798,0.00009292572,0.00003441671,3.147197e-7,0.00001761824,0.00027782194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969249,0.000051735457,0.00095860416,0.00076564786,0.00074771006,0.0005514365],"domain_scores_gemma":[0.99789155,0.00025311898,0.00052394276,0.000498144,0.00072381756,0.00010944799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007104711,0.00032312024,0.0003596664,0.00027109202,0.00013676952,0.0002526426,0.0027797853,0.00017300023,0.0002103666],"category_scores_gemma":[0.0010389428,0.00020740535,0.000172407,0.0009013716,0.0005991509,0.0010802558,0.0005548243,0.0002890858,0.00021607151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106868385,0.0001919407,0.0018869457,0.000023587172,0.000014557911,0.0000016868013,0.003276812,0.00004454564,0.039644364,0.8576077,0.0003234873,0.09687746],"study_design_scores_gemma":[0.000033249475,0.00015895783,0.00029389234,0.00039610692,0.000006734084,0.0000056688514,0.00050648145,0.020568207,0.6761466,0.30137733,0.00022488085,0.0002818599],"about_ca_topic_score_codex":0.000085560554,"about_ca_topic_score_gemma":0.00009380904,"teacher_disagreement_score":0.63650227,"about_ca_system_score_codex":0.00015506525,"about_ca_system_score_gemma":0.00017393101,"threshold_uncertainty_score":0.8457745},"labels":[],"label_agreement":null},{"id":"W2503495475","doi":"10.1007/978-3-319-42007-3_73","title":"Challenging Established Move Ordering Strategies with Adaptive Data Structures","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Pruning; Heuristic; Context (archaeology); Domain (mathematical analysis); Tree (set theory); Game tree; Monte Carlo tree search; Field (mathematics); Range (aeronautics); Artificial intelligence; Theoretical computer science; Sequential game; Game theory; Mathematical economics; Mathematics","score_opus":0.046593887625138435,"score_gpt":0.27767731494692743,"score_spread":0.231083427321789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503495475","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063478605,0.000661298,0.9880593,0.0005984012,0.0012501542,0.0004095691,0.000017880755,0.00029476563,0.008645182],"genre_scores_gemma":[0.47406653,0.00009781307,0.5243565,0.0003991487,0.0007500687,0.000009390866,0.0000064423475,0.0000745812,0.00023956239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944213,0.00004068521,0.0005830429,0.002640111,0.0013279865,0.0009868551],"domain_scores_gemma":[0.9946363,0.0007434905,0.00040350377,0.0036388608,0.00037973686,0.00019813947],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007456575,0.0007666862,0.0006381473,0.00080375996,0.00037523385,0.0015656403,0.009231553,0.00031151375,0.00004741222],"category_scores_gemma":[0.00011798558,0.0005495004,0.00006538226,0.00058520085,0.0013780621,0.0036651439,0.004113651,0.0008892491,0.000044308905],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015477013,0.000011656238,0.000017251798,0.000024287196,0.000027444215,0.00016130209,0.0012765446,0.059276488,0.00008756816,0.20007,0.000010685467,0.7390213],"study_design_scores_gemma":[0.00013072808,0.00023983975,0.000058076243,0.0007894856,0.000011427924,0.00009414565,0.000007254257,0.5070322,0.0017878254,0.48780438,0.0009407092,0.0011039004],"about_ca_topic_score_codex":0.000069427275,"about_ca_topic_score_gemma":0.00032580615,"teacher_disagreement_score":0.7379174,"about_ca_system_score_codex":0.00026201282,"about_ca_system_score_gemma":0.0011025361,"threshold_uncertainty_score":0.99969566},"labels":[],"label_agreement":null},{"id":"W2514085586","doi":"10.37236/6958","title":"Simplicial Complexes are Game Complexes","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Darmstadt; Killam Trusts","keywords":"Simplicial complex; Mathematics; Flag (linear algebra); Abstract simplicial complex; Invariant (physics); Combinatorics; Simplicial approximation theorem; Class (philosophy); Combinatorial game theory; Simplicial homology; h-vector; Pure mathematics; Sequential game; Game theory; Computer science; Simplicial set; Algebra over a field; Mathematical economics; Artificial intelligence; Homotopy","score_opus":0.0278143150206662,"score_gpt":0.2876050605225206,"score_spread":0.2597907455018544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514085586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17559691,0.01016207,0.7984273,0.0067537124,0.007266649,0.0006840233,0.000009055231,0.0001451418,0.000955139],"genre_scores_gemma":[0.9976364,0.0009914715,0.00014844269,0.0003481769,0.0005689632,0.00000618273,0.0000019551783,0.000044942317,0.00025346287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954225,0.0004573524,0.0012694002,0.00045240964,0.0012596294,0.0011387015],"domain_scores_gemma":[0.9939898,0.00077175617,0.0025598384,0.0015705375,0.0009622832,0.0001457404],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019079027,0.0005141272,0.001041874,0.00030004946,0.00021049511,0.00050146127,0.007323454,0.00030522697,0.000020148616],"category_scores_gemma":[0.00025472092,0.0003780209,0.0005577424,0.0005346208,0.00022819692,0.00035230414,0.0020730316,0.0036855864,0.00009596937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003976497,0.00020230531,0.00047117658,0.00005328378,0.00023744853,0.000022517224,0.0009867131,0.008539226,0.00024679984,0.9838799,0.0034660622,0.00185476],"study_design_scores_gemma":[0.00020810735,0.00045916846,0.00056028384,0.00016949761,0.00007611103,0.00019096366,0.00017275398,0.010305977,0.0033383234,0.9735239,0.0105665205,0.00042838216],"about_ca_topic_score_codex":0.000045741286,"about_ca_topic_score_gemma":0.000027611315,"teacher_disagreement_score":0.8220395,"about_ca_system_score_codex":0.0008330546,"about_ca_system_score_gemma":0.0017486869,"threshold_uncertainty_score":0.9998672},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06494872172888295,"score_gpt":0.2916616737695535,"score_spread":0.22671295204067055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20471324,0.000035685156,0.75124615,0.0007324896,0.00057868194,0.0006908078,0.000010285469,0.000102320446,0.041890346],"genre_scores_gemma":[0.9957804,0.000039948303,0.0033059868,0.00028612348,0.000095352814,0.00003347848,0.0000018181881,0.000027118824,0.0004297816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965943,0.000020975489,0.0010229647,0.0009409947,0.00076274184,0.0006580154],"domain_scores_gemma":[0.99762714,0.00036503247,0.000657046,0.0003909396,0.00074130116,0.00021852338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006485964,0.00048087884,0.0004453462,0.0003271338,0.00025842825,0.0008410901,0.0017588203,0.00013361832,0.000029940018],"category_scores_gemma":[0.0002689384,0.00036517408,0.0002517493,0.00050169596,0.000465394,0.0023020536,0.00077568716,0.00063769025,0.000066078646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007900197,0.0012735999,0.0005943469,0.000061286,0.00016722531,0.0000045827437,0.017591273,0.0013101329,0.008732251,0.7218464,0.00009841735,0.24753045],"study_design_scores_gemma":[0.000058679187,0.0006691277,0.00006748503,0.00045188473,0.000023228762,0.000028982126,0.015249365,0.37635398,0.5301121,0.0757405,0.00064484583,0.000599826],"about_ca_topic_score_codex":0.000039826555,"about_ca_topic_score_gemma":0.0000048330767,"teacher_disagreement_score":0.7910671,"about_ca_system_score_codex":0.00021672204,"about_ca_system_score_gemma":0.000060611754,"threshold_uncertainty_score":0.99988},"labels":[],"label_agreement":null},{"id":"W2526893957","doi":"10.1609/aaai.v30i1.9856","title":"BeeMo, a Monte Carlo Simulation Agent for Playing Parameterized Poker Squares","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Parameterized complexity; Monte Carlo method; Monte Carlo tree search; Computer science; Heuristic; Dimension (graph theory); Mathematical optimization; Representation (politics); Greedy algorithm; Algorithm; Artificial intelligence; Mathematics; Statistics; Combinatorics","score_opus":0.12419114301632209,"score_gpt":0.3347293487670524,"score_spread":0.21053820575073032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526893957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43042028,0.000035788406,0.55948085,0.0060537877,0.0010968128,0.0015058495,0.0000248762,0.00025038744,0.0011313743],"genre_scores_gemma":[0.98843443,0.000027370907,0.010564873,0.00029182518,0.00012374646,0.00015388358,2.0626983e-7,0.000028584345,0.0003751011],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967978,0.00003632219,0.0010017077,0.00084157614,0.0006854634,0.0006371058],"domain_scores_gemma":[0.9966174,0.0008479226,0.00067823665,0.0005584087,0.0011709032,0.00012714422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007554198,0.0003775292,0.00042957952,0.00021022573,0.00036638457,0.00035474703,0.0025252514,0.0001627419,0.00006034215],"category_scores_gemma":[0.0018831415,0.00023959891,0.00030758666,0.0005635166,0.00039739552,0.00088801805,0.00045285505,0.00018924358,0.00011307483],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033521923,0.00019835673,0.00042604844,0.00006167339,0.00004746514,8.0170736e-7,0.0026773908,0.0023401892,0.160584,0.41564623,0.00018511366,0.4174975],"study_design_scores_gemma":[0.000050694252,0.00032828635,0.00012728125,0.0003886841,0.000020242063,0.0000020551606,0.0003235725,0.37834993,0.5162484,0.10339798,0.00040437738,0.00035851594],"about_ca_topic_score_codex":0.000056709305,"about_ca_topic_score_gemma":0.00001794675,"teacher_disagreement_score":0.55801415,"about_ca_system_score_codex":0.0001234171,"about_ca_system_score_gemma":0.00011454087,"threshold_uncertainty_score":0.97705597},"labels":[],"label_agreement":null},{"id":"W2532467560","doi":"10.1007/978-3-319-42716-4_9","title":"Representations for search-based methods","year":2016,"lang":"en","type":"book-chapter","venue":"Computational synthesis and creative systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Locality; Key (lock); Computer science; Representation (politics); Theoretical computer science; Artificial intelligence; Computer security; Linguistics; Political science; Philosophy","score_opus":0.1080673763555122,"score_gpt":0.3846218910398895,"score_spread":0.2765545146843773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532467560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029131886,0.00055145944,0.8414113,0.00057279767,0.0002445054,0.00063059287,0.00014021003,0.000083733685,0.15636249],"genre_scores_gemma":[0.034602955,0.00008080059,0.59075016,0.00019391034,0.0008440884,0.0009582307,0.00005564954,0.00013543978,0.3723788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802136,0.00020269415,0.0005029808,0.0006859532,0.0003699365,0.00021709064],"domain_scores_gemma":[0.99176145,0.00683229,0.0002917182,0.00036761328,0.0006215418,0.00012537795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007525016,0.0002894782,0.00046414003,0.00022782543,0.00029650584,0.00026056223,0.0004668189,0.00017093548,0.00009776781],"category_scores_gemma":[0.000294027,0.00023169148,0.00018158906,0.00004617062,0.00027645653,0.00018781608,0.00011363318,0.000098634744,0.00006260818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008108645,0.000010693271,0.000008973278,0.000057705365,0.00010341466,0.0000024961246,0.00013454312,0.0028334744,0.000019661707,0.9163925,0.00093018456,0.07949822],"study_design_scores_gemma":[0.00017460751,0.00015849946,0.00013420283,0.0012331828,0.0001048359,0.000021284664,0.00014088525,0.4655411,0.0019167311,0.45986474,0.069834605,0.0008753296],"about_ca_topic_score_codex":0.000024673414,"about_ca_topic_score_gemma":0.0000015961202,"teacher_disagreement_score":0.46270764,"about_ca_system_score_codex":0.00009956961,"about_ca_system_score_gemma":0.000210355,"threshold_uncertainty_score":0.94481045},"labels":[],"label_agreement":null},{"id":"W2539847976","doi":"10.4212/cjhp.v69i5.1586","title":"Accepting the Torch","year":2016,"lang":"en","type":"editorial","venue":"The Canadian Journal of Hospital Pharmacy","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Providence Health Care","funders":"","keywords":"Torch; Metallurgy; Materials science","score_opus":0.024722208054867394,"score_gpt":0.3229164778068165,"score_spread":0.29819426975194907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539847976","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004365314,0.0016822866,0.0026455799,0.021510845,0.97153205,0.00020287686,0.00003413604,0.000016290136,0.0019394315],"genre_scores_gemma":[0.09936093,0.00017635485,0.00023778439,0.00036387192,0.89868677,0.000005627396,0.0000013039244,0.000040568746,0.0011267998],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99723744,0.00022937743,0.0006796777,0.0002406016,0.00096634094,0.000646562],"domain_scores_gemma":[0.9954465,0.0014930164,0.00086186384,0.0007235176,0.0009673209,0.0005077967],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0017965813,0.00028825118,0.00031145333,0.00018026448,0.00077406317,0.0010218287,0.007602725,0.00014671397,0.00024201273],"category_scores_gemma":[0.0015915172,0.0001387056,0.0003000622,0.0002787909,0.00043188955,0.0007570866,0.00020521505,0.0016885205,0.00022560733],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003492857,0.0000051934594,0.000032766085,0.000003645433,0.00006540801,0.0001197589,0.0016666307,0.000014225944,0.0000067910596,0.00075718533,0.9576056,0.039719295],"study_design_scores_gemma":[0.000094807474,0.00011184162,0.00000815165,0.000103929146,0.000034676206,0.000021106103,0.00007432034,0.00010259409,0.00040785226,0.0045065186,0.9943146,0.00021957057],"about_ca_topic_score_codex":0.011657419,"about_ca_topic_score_gemma":0.014253169,"teacher_disagreement_score":0.0989244,"about_ca_system_score_codex":0.0004783924,"about_ca_system_score_gemma":0.0058376263,"threshold_uncertainty_score":0.99979836},"labels":[],"label_agreement":null},{"id":"W2559929582","doi":"10.1007/978-3-319-50935-8_13","title":"A Reverse Hex Solver","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Solver; Joins; Scalability; Pruning; Depth-first search; State space; Algorithm; Parallel computing; State (computer science); Programming language; Search algorithm; Operating system; Mathematics","score_opus":0.028342135846258956,"score_gpt":0.26857964472808193,"score_spread":0.240237508881823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559929582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021865078,0.0002671242,0.97534406,0.002296999,0.003125883,0.0003394151,0.000004698757,0.00025894548,0.018341018],"genre_scores_gemma":[0.10643125,0.00020680277,0.870421,0.008966008,0.0025360382,0.00002934543,0.0000025907132,0.00013394558,0.011273046],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526966,0.000035452253,0.0006441635,0.001913833,0.0012160485,0.0009208591],"domain_scores_gemma":[0.9962729,0.0006412757,0.0003182895,0.0021964132,0.00032615897,0.00024494706],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009229459,0.0005993255,0.0005447084,0.0008202013,0.00026266888,0.0005335064,0.0053598345,0.0004006931,0.00015547335],"category_scores_gemma":[0.00019248758,0.00047517434,0.00019958655,0.0005251034,0.0013255894,0.0010297479,0.0021290625,0.00072044093,0.0009361067],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004319151,0.000017123568,0.000031148367,0.000013728262,0.000008483841,0.00014735352,0.0006045056,0.0015508813,0.0003117884,0.078460895,0.00020205273,0.9186477],"study_design_scores_gemma":[0.0001350393,0.00018622901,0.00002799516,0.0007822792,0.000008411599,0.00010283283,2.0920012e-7,0.12333588,0.01022719,0.83933926,0.024615891,0.0012387598],"about_ca_topic_score_codex":0.000020652977,"about_ca_topic_score_gemma":0.00007580031,"teacher_disagreement_score":0.91740894,"about_ca_system_score_codex":0.00042492486,"about_ca_system_score_gemma":0.000681,"threshold_uncertainty_score":0.9998418},"labels":[],"label_agreement":null},{"id":"W2562174057","doi":"10.1609/aaai.v32i1.11481","title":"AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Variance reduction; Variance (accounting); Perfect information; Computer science; Estimator; Imperfect; Heuristic; Limit (mathematics); Value (mathematics); Victory; Mathematical optimization; Artificial intelligence; Statistics; Machine learning; Mathematics; Monte Carlo method; Mathematical economics; Economics","score_opus":0.09062847487418954,"score_gpt":0.3394626692515252,"score_spread":0.24883419437733564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562174057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052715372,0.000026015054,0.9309703,0.0049928864,0.0015511092,0.0036130236,0.000005715631,0.00014902472,0.00597654],"genre_scores_gemma":[0.9783582,0.000022006609,0.02074696,0.0001591899,0.00023172075,0.00036495933,0.000001278266,0.000012055687,0.00010360561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973369,0.00004171338,0.0009614051,0.00052002165,0.00070475915,0.00043517293],"domain_scores_gemma":[0.99697256,0.000107940614,0.0006292965,0.0004348203,0.0017625208,0.00009287131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001985988,0.00026550965,0.00027552512,0.00035923102,0.00021488623,0.00033479003,0.0017878521,0.00016477605,0.00007120514],"category_scores_gemma":[0.0016280038,0.00022155998,0.00012914572,0.0012533251,0.0003177236,0.0018435927,0.00025672597,0.0002634795,0.00011445848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012505139,0.000087811946,0.000055838853,0.000033505585,0.000009238966,5.6542902e-8,0.0042681033,0.00017827234,0.104088604,0.57494885,0.0005209068,0.31568375],"study_design_scores_gemma":[0.000026030511,0.00030623874,0.00007513958,0.00019754624,0.000008967183,0.000004768973,0.00041387024,0.11004433,0.6350054,0.25340188,0.00034498598,0.00017083628],"about_ca_topic_score_codex":0.00018523447,"about_ca_topic_score_gemma":0.000029502908,"teacher_disagreement_score":0.92564285,"about_ca_system_score_codex":0.00022075443,"about_ca_system_score_gemma":0.00041334316,"threshold_uncertainty_score":0.9034954},"labels":[],"label_agreement":null},{"id":"W2563424741","doi":"10.1109/tciaig.2016.2642158","title":"Creating AI Characters for Fighting Games Using Genetic Programming","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Trent University; Nottingham Trent University","keywords":"Computer science; Genetic programming; Code (set theory); Character (mathematics); Process (computing); Point (geometry); Artificial intelligence; Tournament; Selection (genetic algorithm); Human–computer interaction; Programming language","score_opus":0.04723508883444439,"score_gpt":0.3226099156286452,"score_spread":0.27537482679420083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563424741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06447701,0.00008890879,0.9328286,0.0016342422,0.0004150806,0.00041495336,0.000007936437,0.00011966307,0.000013574351],"genre_scores_gemma":[0.86682534,0.00004702089,0.13220048,0.000663585,0.000072214345,0.00009960894,8.5507685e-7,0.000020435806,0.00007043788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978608,0.00007382208,0.0006356176,0.00065558293,0.00030969363,0.00046448671],"domain_scores_gemma":[0.9979864,0.0012819819,0.00015129193,0.00023120559,0.00023644959,0.00011268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028970875,0.0002664707,0.00025850558,0.00038643746,0.00032418058,0.00027822607,0.0004267601,0.00010029961,0.000018485143],"category_scores_gemma":[0.000050567356,0.00022077556,0.00012229943,0.00043405773,0.0001954424,0.0008589964,0.000009235188,0.00019914506,0.000020061805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022285396,0.00010378486,0.00020273999,0.00002535056,0.000023398476,0.0000061832447,0.001277811,0.23553884,0.0007782662,0.0031489811,0.000005663817,0.75886667],"study_design_scores_gemma":[0.00014856146,0.00024306365,0.0005764098,0.00055115356,0.00001720732,0.000045354962,0.00038981577,0.9139838,0.04907896,0.034232747,0.00026415905,0.0004687595],"about_ca_topic_score_codex":0.000056472465,"about_ca_topic_score_gemma":0.000027479517,"teacher_disagreement_score":0.8023483,"about_ca_system_score_codex":0.000111770656,"about_ca_system_score_gemma":0.00012288001,"threshold_uncertainty_score":0.9002966},"labels":[],"label_agreement":null},{"id":"W2568347355","doi":"10.1007/978-3-319-07890-8_29","title":"Lemmings Is PSPACE-Complete","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Creatures; Computer science; Operations research; Mathematical economics; Artificial intelligence; Mathematics; Biology","score_opus":0.034058821263938006,"score_gpt":0.26978956811702565,"score_spread":0.23573074685308765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568347355","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047763126,0.00027564366,0.9832373,0.0040752105,0.0026304713,0.00036209347,0.0000053285103,0.0002944582,0.009071685],"genre_scores_gemma":[0.1509896,0.00008628868,0.82235426,0.018899089,0.0020054223,0.000022315806,0.0000051641664,0.00013132855,0.005506548],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99433625,0.00004343232,0.00076918904,0.0022987707,0.0014909696,0.001061392],"domain_scores_gemma":[0.99564344,0.000735504,0.0004389414,0.0025210425,0.0003781308,0.00028291612],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011549245,0.0007501127,0.000746634,0.0009945605,0.0003748583,0.0009785638,0.0066813696,0.00043571915,0.00012726328],"category_scores_gemma":[0.00017004412,0.000708322,0.00023917138,0.00071845483,0.0013675162,0.00060367765,0.0022261052,0.0010675681,0.0008821154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034605973,0.000015246645,0.00005526206,0.000030386886,0.000011764562,0.00006101448,0.0020629081,0.0056191757,0.00027205577,0.082502395,0.0005294225,0.9088369],"study_design_scores_gemma":[0.000077845114,0.00018293985,0.000026443708,0.00033803825,0.000007801771,0.0000493965,2.2862076e-7,0.46739256,0.006201406,0.4805788,0.044130135,0.0010144028],"about_ca_topic_score_codex":0.0000710362,"about_ca_topic_score_gemma":0.000099627134,"teacher_disagreement_score":0.9078225,"about_ca_system_score_codex":0.00032897,"about_ca_system_score_gemma":0.00046377126,"threshold_uncertainty_score":0.9998958},"labels":[],"label_agreement":null},{"id":"W2574181272","doi":"","title":"Influence maps For Facilitating Tactical Engagement Decisions In Real-Time Strategy Games","year":2010,"lang":"en","type":"article","venue":"IJIGS. International journal of intelligent games & simulation","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Computer science; Adversary; Dimension (graph theory); Process (computing); Power (physics); Operations research; Human–computer interaction; Artificial intelligence; Engineering; Computer security; Mathematics","score_opus":0.05834453630015033,"score_gpt":0.3840286384473636,"score_spread":0.3256841021472133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574181272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57417804,0.000037638423,0.42355952,0.0005591765,0.0010024838,0.00028767152,0.000012981576,0.00003998182,0.00032254006],"genre_scores_gemma":[0.94532955,0.000111108064,0.053901497,0.00014280945,0.00032819356,0.000017995822,0.000011294798,0.000018807805,0.00013872192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962417,0.00017077714,0.001670876,0.0004189643,0.0011124255,0.00038526047],"domain_scores_gemma":[0.9920541,0.004477868,0.0008000434,0.0003781817,0.0021092575,0.00018054205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019204249,0.00026929224,0.00035023584,0.00069817336,0.0001015691,0.00045276215,0.0017571002,0.00015726742,0.00012257003],"category_scores_gemma":[0.005913927,0.0002459572,0.00025947866,0.0003385357,0.00011635915,0.0017414626,0.00023206063,0.00065504597,0.000092850685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014195933,0.00029930667,0.0017109144,0.0000058060928,0.00008112911,0.000041023908,0.0027141504,0.70529777,0.01526939,0.020254005,0.00018998796,0.25399455],"study_design_scores_gemma":[0.00047031033,0.00043731762,0.0059451004,0.00025406267,0.000023033144,0.00006478999,0.0008780812,0.8992972,0.029756853,0.05221432,0.01021718,0.00044178977],"about_ca_topic_score_codex":0.00005683231,"about_ca_topic_score_gemma":0.000060967115,"teacher_disagreement_score":0.37115154,"about_ca_system_score_codex":0.0002490482,"about_ca_system_score_gemma":0.00026069646,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W2574227367","doi":"","title":"Monte Carlo tree search in continuous action spaces with execution uncertainty","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Set (abstract data type); Fidelity; Machine learning; Tree (set theory); Action (physics); Artificial intelligence; Monte Carlo method; Kernel (algebra); Domain (mathematical analysis); Mathematics","score_opus":0.1274409482000282,"score_gpt":0.3388143823562566,"score_spread":0.21137343415622842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574227367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3718368,0.0000178476,0.601288,0.017891854,0.0014635195,0.00054804585,0.000019009842,0.00029780157,0.006637093],"genre_scores_gemma":[0.9956497,0.00012334857,0.0029300272,0.00021790431,0.00020631216,0.00008645521,0.00000243487,0.000023482513,0.0007603215],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960181,0.0002190041,0.0008817129,0.0010667698,0.0011495725,0.00066482887],"domain_scores_gemma":[0.99759185,0.00038198516,0.00028360565,0.0007176228,0.0008311545,0.00019377311],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007291627,0.000401137,0.00038125992,0.0006601332,0.00014001846,0.0005470954,0.0015783858,0.00016500337,0.00032415416],"category_scores_gemma":[0.00036307742,0.00028600477,0.00012204343,0.0006064886,0.00042074744,0.0012310094,0.00025155456,0.0003949125,0.00083562447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002853809,0.00025823564,0.0007406359,0.00000517758,0.000032745975,0.000092534225,0.0010630996,0.0062762513,0.021385461,0.39940143,0.00006966415,0.5703894],"study_design_scores_gemma":[0.00025301625,0.0013431924,0.003553318,0.0011427678,0.000013847953,0.00008605075,0.003920529,0.39757094,0.49160445,0.09766763,0.0014981624,0.0013460903],"about_ca_topic_score_codex":0.0012228381,"about_ca_topic_score_gemma":0.003800967,"teacher_disagreement_score":0.6238129,"about_ca_system_score_codex":0.0005361977,"about_ca_system_score_gemma":0.0002856308,"threshold_uncertainty_score":0.99995923},"labels":[],"label_agreement":null},{"id":"W2574573809","doi":"","title":"Measuring risk in stealth games.","year":2014,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Judgement; Computer science; Measure (data warehouse); Perception; Simple (philosophy); Human–computer interaction; Risk analysis (engineering); Path (computing); Data science; Machine learning; Data mining; Psychology","score_opus":0.0575382542790946,"score_gpt":0.2786054097759401,"score_spread":0.22106715549684552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574573809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104512736,0.000030109497,0.8588051,0.00045065169,0.00024228162,0.000068708505,1.1992528e-7,0.00015969577,0.03573058],"genre_scores_gemma":[0.9701261,0.000014684504,0.029157432,0.0002757763,0.000044890632,0.000004876533,5.4727142e-8,0.000004326431,0.00037184113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989776,0.000114784416,0.00020793325,0.0002615482,0.00019086376,0.00024724077],"domain_scores_gemma":[0.9992428,0.00015294018,0.000054158954,0.000452442,0.000032583674,0.00006511828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008371397,0.00007254232,0.00010065629,0.0000985689,0.000046420097,0.00007793128,0.00066223036,0.000032541186,0.000027908061],"category_scores_gemma":[0.00023907123,0.00006316319,0.000027007434,0.00026112044,0.000027129963,0.0002876824,0.00015281016,0.00013252017,0.00041389867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018052184,0.000041365485,0.044993542,0.0000052156884,0.0000026390446,0.0000028277227,0.0014095067,0.0016520282,0.00014030914,0.18925822,0.0003955856,0.76209694],"study_design_scores_gemma":[0.000132508,0.00010745769,0.04376814,0.000039587212,0.0000020178788,0.0000051721004,0.00019359252,0.80830777,0.031375837,0.1004652,0.015210754,0.00039194818],"about_ca_topic_score_codex":0.0008293689,"about_ca_topic_score_gemma":0.00093559356,"teacher_disagreement_score":0.8656134,"about_ca_system_score_codex":0.000038225648,"about_ca_system_score_gemma":0.000027936827,"threshold_uncertainty_score":0.5319968},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.14405224953346576,"score_gpt":0.3769481268805651,"score_spread":0.23289587734709935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574978968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10471642,0.00030237497,0.8698126,0.0054322793,0.008064444,0.00053181895,0.0000057920192,0.0002746401,0.010859624],"genre_scores_gemma":[0.9519285,0.00005180505,0.046607323,0.0005910317,0.00021197954,0.000030696956,3.1008517e-7,0.000012963004,0.00056541595],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99592113,0.00006543237,0.00060854416,0.0012326434,0.0010765353,0.0010957045],"domain_scores_gemma":[0.9963117,0.00015575488,0.00026842253,0.0025472136,0.00042215848,0.00029473784],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002091809,0.0002755064,0.00027624756,0.00038261528,0.0013667808,0.0018698064,0.008221063,0.00010171275,0.000101468875],"category_scores_gemma":[0.0022517159,0.00025784914,0.00008862824,0.00090452505,0.0021808282,0.0038228473,0.0016991434,0.00033097994,0.0020637666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002068916,0.00016004732,0.002223207,0.000007796121,0.0000036378453,0.000070031405,0.005296258,0.00027603155,0.02444206,0.19251236,0.00035135474,0.7746365],"study_design_scores_gemma":[0.00008071725,0.00022137558,0.02350614,0.00015755021,0.000003287843,0.00003432187,0.0008877677,0.3457765,0.46168378,0.15960982,0.0068415413,0.00119722],"about_ca_topic_score_codex":0.00047803493,"about_ca_topic_score_gemma":0.00065024773,"teacher_disagreement_score":0.8472121,"about_ca_system_score_codex":0.00020428863,"about_ca_system_score_gemma":0.0005533952,"threshold_uncertainty_score":0.99998736},"labels":[],"label_agreement":null},{"id":"W2575674151","doi":"","title":"A framework for coherent emergent stories.","year":2014,"lang":"en","type":"article","venue":"Foundations of Digital Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.05723274422070461,"score_gpt":0.3373196367376378,"score_spread":0.2800868925169332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575674151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086312005,0.000037501566,0.9851759,0.0010018798,0.0007235586,0.00022263444,0.000014961324,0.00010381766,0.004088551],"genre_scores_gemma":[0.89062333,0.0000039254887,0.10857547,0.000051235547,0.00010726058,0.000059660568,0.000010964515,0.000009134819,0.0005590181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990282,0.000013148026,0.0003169896,0.00024300322,0.00020800962,0.0001906171],"domain_scores_gemma":[0.9985875,0.0004394324,0.00014300797,0.0005200176,0.00024460893,0.00006545259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120506775,0.00010577609,0.00014877731,0.00007859838,0.000088746194,0.00027488937,0.00066162116,0.000047014953,0.000036610196],"category_scores_gemma":[0.0010887478,0.00010111286,0.0001069508,0.00024689772,0.00011404357,0.00072710094,0.00013638256,0.000055359124,0.0000774129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003303352,0.00008087898,0.0006719284,0.000011022872,0.000017033097,5.749316e-8,0.00057238975,0.00016223377,0.00003417484,0.82842255,0.0009943494,0.16903006],"study_design_scores_gemma":[0.0000657913,0.00027167518,0.00037398833,0.00004073103,0.000008941666,0.0000011128174,0.00021766355,0.016961467,0.005652047,0.78584933,0.19033761,0.00021961435],"about_ca_topic_score_codex":0.0000074315226,"about_ca_topic_score_gemma":0.000008491535,"teacher_disagreement_score":0.8819921,"about_ca_system_score_codex":0.000029283048,"about_ca_system_score_gemma":0.000054880576,"threshold_uncertainty_score":0.41232628},"labels":[],"label_agreement":null},{"id":"W2576022584","doi":"","title":"The Evolution of Fun: Automatic Level Design Through Challenge Modeling.","year":2010,"lang":"en","type":"article","venue":"ICCC","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Video game; Game design; Process (computing); Human–computer interaction; Simple (philosophy); Video game design; Generative grammar; Generative Design; Multimedia; Artificial intelligence; Engineering; Programming language; Operations management","score_opus":0.12793063929754198,"score_gpt":0.3149441089132781,"score_spread":0.18701346961573614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576022584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012051952,0.00037229873,0.98360395,0.0012573616,0.0007520003,0.0001524564,7.020707e-7,0.00011736652,0.001691928],"genre_scores_gemma":[0.889598,0.000021803797,0.110163726,0.000025224006,0.000067863126,0.0000144589,9.054941e-8,0.0000062441686,0.0001025665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989801,0.00006246827,0.00027224724,0.0001997284,0.0002646859,0.000220779],"domain_scores_gemma":[0.9987779,0.00027139677,0.00009740942,0.0006918447,0.00012947907,0.000031937692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052443024,0.0000909153,0.000102011596,0.000029127916,0.00018055283,0.00006469482,0.0010529559,0.00006938853,0.000012541281],"category_scores_gemma":[0.0001816268,0.000064391425,0.00005091656,0.00017764387,0.000114497474,0.0003712015,0.00014458525,0.00017295932,0.00011981766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004814642,0.00008225938,0.000031386102,0.000012814357,0.000016762486,0.000002248132,0.004890457,0.008284075,0.0048322114,0.7608297,0.00032286116,0.22069044],"study_design_scores_gemma":[0.000018695288,0.00003786231,0.00004088745,0.000009463884,0.0000024263093,0.0000028023896,0.00015151061,0.81936395,0.0068615344,0.17314291,0.00030058218,0.00006739942],"about_ca_topic_score_codex":0.00021102412,"about_ca_topic_score_gemma":0.00014592198,"teacher_disagreement_score":0.8775461,"about_ca_system_score_codex":0.000033841465,"about_ca_system_score_gemma":0.000115117604,"threshold_uncertainty_score":0.26258063},"labels":[],"label_agreement":null},{"id":"W2578023615","doi":"","title":"Automatic Classification of Poetry by Meter and Rhyme.","year":2016,"lang":"en","type":"article","venue":"Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B))","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Rhyme; Metre; Poetry; Computer science; Artificial intelligence; Art; Literature; Physics; Astronomy","score_opus":0.01488251947883608,"score_gpt":0.22022903636341168,"score_spread":0.2053465168845756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578023615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81383556,0.0006636961,0.13310063,0.016307201,0.00018205486,0.00088709866,0.00024396859,0.0004952985,0.03428449],"genre_scores_gemma":[0.98698837,0.0004307786,0.0022942803,0.0007246954,0.00004462611,0.0000051742163,0.000027566539,0.000052940166,0.009431595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99669063,0.0003349304,0.0004569746,0.0010433805,0.0005646052,0.00090946443],"domain_scores_gemma":[0.9963887,0.0010851073,0.0005174238,0.00106306,0.0003012812,0.0006444394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004978516,0.0005935676,0.00070566864,0.0008445384,0.00094581035,0.0009316792,0.0031652378,0.0003707047,0.00016073715],"category_scores_gemma":[0.00022543452,0.0005062933,0.00027493556,0.0014638018,0.0013650549,0.0027150952,0.0035266748,0.00033043363,0.000049668433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017485677,0.00024397564,0.011074893,0.0001682654,0.0004777722,0.00038585468,0.07312402,0.00004839202,0.00579498,0.7179972,0.0067123845,0.1822237],"study_design_scores_gemma":[0.012080493,0.0017403807,0.068901874,0.0013194196,0.0010297688,0.0011562248,0.016563082,0.053684518,0.054385494,0.078307405,0.7051381,0.005693222],"about_ca_topic_score_codex":0.0003872079,"about_ca_topic_score_gemma":0.00004160126,"teacher_disagreement_score":0.6984257,"about_ca_system_score_codex":0.00090495,"about_ca_system_score_gemma":0.00027281904,"threshold_uncertainty_score":0.9997389},"labels":[],"label_agreement":null},{"id":"W2578782245","doi":"","title":"Target selection for AI companions in FPS games.","year":2014,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Adversary; Selection (genetic algorithm); Artificial intelligence; Variety (cybernetics); Context (archaeology); Heuristic; Simple (philosophy); Human–computer interaction; Machine learning; Computer security","score_opus":0.02543468938297468,"score_gpt":0.299437439075721,"score_spread":0.27400274969274635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578782245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005875314,0.000007244578,0.98673564,0.0024404863,0.00029973956,0.00016817494,3.8539284e-7,0.00016094332,0.004312098],"genre_scores_gemma":[0.85238427,9.479886e-7,0.1457953,0.0010345852,0.000074304175,0.000032894415,9.779902e-7,0.000005107739,0.0006716279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920654,0.000036096615,0.00018787084,0.00024350498,0.00010029643,0.00022570422],"domain_scores_gemma":[0.99949795,0.00014384574,0.000031841984,0.00020264352,0.000078442936,0.00004526877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030549456,0.00007350577,0.00010366853,0.00009973399,0.00006701382,0.00008584332,0.00039644726,0.000042176023,0.00004579248],"category_scores_gemma":[0.00011231673,0.00006769262,0.000038568858,0.00030400313,0.000025674644,0.000318681,0.00006095353,0.00007995422,0.000108734384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049427663,0.00009398633,0.007589585,0.000006956281,0.0000041698745,2.1133549e-7,0.0005918808,0.0057887547,0.0013187701,0.90550363,0.013856983,0.06524012],"study_design_scores_gemma":[0.000045744164,0.000063042084,0.0010021108,0.0000047496646,6.6427447e-7,0.0000017417912,0.000021437143,0.8534071,0.023744233,0.07556437,0.046047967,0.0000968429],"about_ca_topic_score_codex":0.00014941569,"about_ca_topic_score_gemma":0.00044920453,"teacher_disagreement_score":0.84761834,"about_ca_system_score_codex":0.00003559387,"about_ca_system_score_gemma":0.000030836298,"threshold_uncertainty_score":0.2760425},"labels":[],"label_agreement":null},{"id":"W2578877138","doi":"","title":"Virtual Character Behavior Architecture using Cyclic Scheduling","year":2014,"lang":"en","type":"article","venue":"Foundations of Digital Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bottleneck; Scripting language; Architecture; Scheduling (production processes); Virtual actor; Video game; Character (mathematics); Human–computer interaction; Artificial intelligence; Virtual reality; Multimedia; Programming language","score_opus":0.03738546907577138,"score_gpt":0.30139238293365384,"score_spread":0.26400691385788244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578877138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45866925,0.0000075172084,0.5397588,0.00015195055,0.00021729652,0.00008098127,0.0000049555656,0.00007481891,0.0010344452],"genre_scores_gemma":[0.96089095,9.855605e-7,0.038705926,0.00005303731,0.0001205023,0.00001044126,0.0000102416025,0.000012345171,0.0001956003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885,0.000026974936,0.0003460677,0.0002922471,0.00025894298,0.00022577369],"domain_scores_gemma":[0.99893934,0.00017489791,0.00016200906,0.0005178622,0.00013304618,0.00007287112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011431632,0.00013870615,0.00016839546,0.00018602666,0.000110397574,0.00048388116,0.00069582905,0.000055298533,0.000023993305],"category_scores_gemma":[0.00031816974,0.00013335397,0.00010110694,0.0003090388,0.00017656197,0.0013243959,0.00022250076,0.00012191245,0.00010923586],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064610063,0.00031099186,0.008825327,0.000012758801,0.000033839653,0.0000025191505,0.001635135,0.009144725,0.010755065,0.11299209,0.000019187733,0.8562619],"study_design_scores_gemma":[0.0007363488,0.0014595089,0.034076553,0.00051101093,0.00017616776,0.00021591631,0.0012723267,0.637716,0.14360714,0.1321605,0.045132067,0.0029364775],"about_ca_topic_score_codex":0.000010365403,"about_ca_topic_score_gemma":0.000004596819,"teacher_disagreement_score":0.8533254,"about_ca_system_score_codex":0.000027400396,"about_ca_system_score_gemma":0.00005871762,"threshold_uncertainty_score":0.54380167},"labels":[],"label_agreement":null},{"id":"W2579302619","doi":"","title":"Clustering Player Paths.","year":2015,"lang":"en","type":"article","venue":"Foundations of Digital Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; McGill University","funders":"","keywords":"Cluster analysis; Computer science; TRACE (psycholinguistics); Metric (unit); Similarity (geometry); Data mining; Artificial intelligence; Engineering","score_opus":0.07635976804665116,"score_gpt":0.311503309368244,"score_spread":0.23514354132159282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579302619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04035082,0.000060609225,0.90672636,0.0006541383,0.0005080371,0.0001052596,0.000008107652,0.00016616189,0.051420525],"genre_scores_gemma":[0.97918004,0.0000019506251,0.019738823,0.000038456743,0.00004598051,0.00000744211,0.000005258191,0.0000066403686,0.00097539637],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991337,0.000011288005,0.00025970725,0.00019057332,0.00024823056,0.00015650489],"domain_scores_gemma":[0.9991083,0.00008520559,0.00009089087,0.00042054523,0.00020293496,0.000092090035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010729148,0.00008649082,0.000109578825,0.00010238145,0.000038162845,0.0003750318,0.0006284672,0.000030792497,0.000013252098],"category_scores_gemma":[0.0003348718,0.0000830309,0.000051150913,0.00027299632,0.00009804673,0.0017666001,0.00028759503,0.000050044975,0.0003186149],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015936175,0.00034670232,0.01292394,0.0000235571,0.000060639417,0.000012411625,0.0072385557,0.005653469,0.0003601143,0.15892275,0.0062262984,0.8082156],"study_design_scores_gemma":[0.0006351312,0.00096484035,0.0038608513,0.00018004682,0.00002836084,0.00009609878,0.0040158234,0.36311683,0.03254931,0.38279742,0.21025732,0.0014979617],"about_ca_topic_score_codex":0.000014043417,"about_ca_topic_score_gemma":0.000011762792,"teacher_disagreement_score":0.93882924,"about_ca_system_score_codex":0.00003409269,"about_ca_system_score_gemma":0.00010529563,"threshold_uncertainty_score":0.40952563},"labels":[],"label_agreement":null},{"id":"W2585152439","doi":"10.4018/978-1-5225-0454-2.ch005","title":"Personality-Based Cognitive Design of Characters in Virtual Environments","year":2016,"lang":"en","type":"book-chapter","venue":"Advances in computational intelligence and robotics book series","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Personality; Cognition; Cognitive architecture; Psychology; Cognitive psychology; Gesture; Affect (linguistics); Architecture; Human–computer interaction; Computer science; Social psychology; Artificial intelligence; Communication","score_opus":0.03818129736752056,"score_gpt":0.284671388611345,"score_spread":0.24649009124382443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585152439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001246122,0.0036630256,0.9907649,0.0004013836,0.00024635543,0.0003845311,0.000027790538,0.00002219362,0.004477332],"genre_scores_gemma":[0.40992215,0.07653077,0.38418293,0.0037573155,0.00049672864,0.0002320061,0.00019734449,0.0003220917,0.12435868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976264,0.00007689106,0.0008392045,0.0006599161,0.0005021957,0.0002953652],"domain_scores_gemma":[0.99755555,0.0016087807,0.00042905431,0.00021803474,0.00011269475,0.000075897464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003055491,0.00039346388,0.00050540146,0.0003793454,0.000071212045,0.000046003777,0.00053731364,0.00020160606,0.000047726462],"category_scores_gemma":[0.00007523119,0.0003697316,0.000079889665,0.00008731211,0.0009731821,0.0015697511,0.00018863182,0.00030921047,0.00004328555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006117041,0.00003496237,0.00010201588,0.000028121043,0.000014319156,0.000026856374,0.00039478327,0.47801253,0.000005496117,0.49369544,0.000001284993,0.027623013],"study_design_scores_gemma":[0.0002150333,0.0008400955,0.00019398886,0.0028199158,0.000026449454,0.000023112721,0.0002325235,0.15444368,0.0021245943,0.8336664,0.00429825,0.0011159643],"about_ca_topic_score_codex":0.0000036934453,"about_ca_topic_score_gemma":0.000018771629,"teacher_disagreement_score":0.606582,"about_ca_system_score_codex":0.00011780432,"about_ca_system_score_gemma":0.00019342963,"threshold_uncertainty_score":0.9998755},"labels":[],"label_agreement":null},{"id":"W2585850052","doi":"10.4018/978-1-5225-0454-2.ch004","title":"Learned Behavior","year":2016,"lang":"en","type":"book-chapter","venue":"Advances in computational intelligence and robotics book series","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Action (physics); Character (mathematics); Reinforcement learning; Computer science; Selection (genetic algorithm); Narrative; Reinforcement; Human–computer interaction; Key (lock); Artificial intelligence; Psychology; Social psychology; Computer security; Mathematics","score_opus":0.04199529447120846,"score_gpt":0.31389686185534754,"score_spread":0.27190156738413906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585850052","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014810385,0.01780857,0.85058784,0.0017266489,0.00083987805,0.00035980303,0.0000148606005,0.0001474747,0.12851344],"genre_scores_gemma":[0.007643499,0.10415916,0.30985096,0.0014776414,0.0005854497,0.00011568573,0.00004153573,0.00016657144,0.5759595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974704,0.000028914821,0.0007838023,0.0008381356,0.0004985097,0.00038028843],"domain_scores_gemma":[0.99825776,0.00057972205,0.00032026554,0.00044296897,0.0002746822,0.00012462417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018476835,0.00047020995,0.0004709847,0.00031314496,0.00018330579,0.00017129141,0.00088766235,0.00026871945,0.00012669625],"category_scores_gemma":[0.000054018717,0.000416559,0.000108032975,0.00008541236,0.0007370799,0.0026849185,0.0004526403,0.00040780834,0.00027201965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000946598,0.000016228469,0.000038351995,0.000022734142,0.0000101637415,0.00005840282,0.00014310642,0.08860489,0.0000012239568,0.75472885,0.000026438884,0.15634012],"study_design_scores_gemma":[0.000030499128,0.00016191968,0.0000155582,0.00036241778,0.000014089404,0.000077170145,0.000028202572,0.007911621,0.00015785998,0.89456475,0.09610111,0.00057482865],"about_ca_topic_score_codex":0.0000023953116,"about_ca_topic_score_gemma":0.000046837544,"teacher_disagreement_score":0.5407369,"about_ca_system_score_codex":0.00010479034,"about_ca_system_score_gemma":0.00016304314,"threshold_uncertainty_score":0.99982864},"labels":[],"label_agreement":null},{"id":"W2588165796","doi":"10.3233/icg-170011","title":"Seki with 2 Liberties per Chain in the Game of Go","year":2017,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science","score_opus":0.03914726271646671,"score_gpt":0.2924982306279562,"score_spread":0.2533509679114895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588165796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9095764,0.00029450966,0.0768066,0.0079307575,0.00036589082,0.0000874545,4.5124384e-7,0.0000132938185,0.0049246214],"genre_scores_gemma":[0.9957993,0.000029600204,0.003524134,0.00018394006,0.00013252792,0.0000021692815,2.334714e-8,0.0000042894917,0.00032401356],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990936,0.000077034856,0.00021213957,0.00010694423,0.00031890612,0.00019138376],"domain_scores_gemma":[0.9989892,0.00008387874,0.0002457413,0.00056033133,0.00008207057,0.000038772472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066605076,0.00007523154,0.00011207991,0.00006363646,0.00020780312,0.0004658486,0.001944397,0.000028878429,0.00003012826],"category_scores_gemma":[0.00007786238,0.000041862088,0.000042738004,0.00005841176,0.00018935796,0.00062097446,0.00011763433,0.0002687425,0.00003220732],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017635862,0.0005537966,0.19400762,0.000042407864,0.00011928744,0.00080214435,0.20506117,0.0037844845,0.0048736245,0.11490322,0.004880606,0.47079527],"study_design_scores_gemma":[0.0011586723,0.0019763971,0.6129638,0.000996542,0.000043994754,0.0047246073,0.009176404,0.06965808,0.06280504,0.18300183,0.05222794,0.0012666683],"about_ca_topic_score_codex":0.000057849036,"about_ca_topic_score_gemma":0.00013485529,"teacher_disagreement_score":0.46952862,"about_ca_system_score_codex":0.00001691626,"about_ca_system_score_gemma":0.00007436956,"threshold_uncertainty_score":0.44921887},"labels":[],"label_agreement":null},{"id":"W2588422147","doi":"10.1109/ssci.2016.7849968","title":"On novelty driven evolution in Poker","year":2016,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Novelty; Computer science; Task (project management); Ambiguity; Benchmark (surveying); Benchmarking; Bluff; Artificial intelligence; Genetic programming; Machine learning; Mathematical economics; Psychology; Engineering; Economics","score_opus":0.025279443755554767,"score_gpt":0.2769352167941623,"score_spread":0.25165577303860753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588422147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10368319,0.0000040082227,0.8795308,0.0028270404,0.00023264652,0.000059420952,2.922642e-7,0.0000950011,0.013567618],"genre_scores_gemma":[0.9909543,0.0000014834566,0.0071700877,0.00026543936,0.000023675462,0.0000048310944,4.143389e-8,0.0000027023036,0.0015774766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932814,0.000023297669,0.00012573574,0.00021423628,0.00014221725,0.00016635063],"domain_scores_gemma":[0.99947697,0.00013468998,0.000022518645,0.00030368133,0.00002906496,0.000033103024],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011372099,0.000056271423,0.000054597724,0.00008600938,0.00002144496,0.000023636176,0.00040110206,0.000034173845,0.00011160199],"category_scores_gemma":[0.00009825613,0.000034118482,0.000021628657,0.00018000782,0.00003192315,0.00031617598,0.000091923735,0.000037564223,0.0015002544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031290608,0.000041436168,0.0057082865,4.2559446e-7,0.0000010810633,0.0000034737773,0.000115983334,0.00008606759,0.005176411,0.9346993,0.0008803843,0.05328401],"study_design_scores_gemma":[0.00033166792,0.0003320384,0.13234654,0.00014893666,0.0000015194834,0.0000073722467,0.00006691041,0.0941526,0.11103161,0.6570486,0.00396246,0.00056979054],"about_ca_topic_score_codex":0.00008599729,"about_ca_topic_score_gemma":0.00017995933,"teacher_disagreement_score":0.88727105,"about_ca_system_score_codex":0.00010857635,"about_ca_system_score_gemma":0.000026360332,"threshold_uncertainty_score":0.9992772},"labels":[],"label_agreement":null},{"id":"W2589422499","doi":"10.1109/cig.2016.7860439","title":"Evaluating real-time strategy game states using convolutional neural networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Convolutional neural network; Action (physics); State (computer science); Artificial intelligence; Focus (optics); Machine learning; Algorithm","score_opus":0.11376615494514845,"score_gpt":0.37200550698816187,"score_spread":0.2582393520430134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589422499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28708863,0.00003274307,0.7110185,0.00037034674,0.00023235347,0.00009797623,0.0000013911587,0.00021683484,0.00094120525],"genre_scores_gemma":[0.9636674,0.000014403024,0.034916632,0.00013269507,0.00018534702,0.0000051038296,0.0000012910515,0.000011476969,0.0010656719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982829,0.00013769034,0.00035679495,0.00040884336,0.00035711477,0.0004566256],"domain_scores_gemma":[0.99869233,0.0004935128,0.000117033866,0.0003812822,0.00020691678,0.000108932465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000518231,0.00014982639,0.00014638453,0.000060524126,0.00012308714,0.00016589893,0.0006113604,0.00006136481,0.0005689469],"category_scores_gemma":[0.00008283886,0.000101197,0.000059286118,0.00022172974,0.00014429408,0.00078517105,0.00022952432,0.000075155804,0.00020579514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018878312,0.000052433003,0.0016703763,0.000003568001,0.00002925401,0.000017217095,0.00026944146,0.5584486,0.06404257,0.066906646,0.00073522073,0.30780578],"study_design_scores_gemma":[0.000058707872,0.000089849826,0.0004591923,0.00001798232,0.0000035518565,0.000014456923,0.000024098414,0.98372316,0.0027708057,0.012644459,0.000023676479,0.00017008212],"about_ca_topic_score_codex":0.00022582483,"about_ca_topic_score_gemma":0.000013953658,"teacher_disagreement_score":0.67657876,"about_ca_system_score_codex":0.00009277341,"about_ca_system_score_gemma":0.00010351491,"threshold_uncertainty_score":0.62295693},"labels":[],"label_agreement":null},{"id":"W2590579111","doi":"10.1109/cig.2016.7860401","title":"Heuristics for sleep and heal in combat","year":2016,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Adversary; Heuristics; Computer science; Process (computing); Computer security; Risk analysis (engineering); Work (physics); Sleep (system call); Management science; Human–computer interaction; Operations research; Engineering; Business","score_opus":0.03694287726729875,"score_gpt":0.2972698671462719,"score_spread":0.2603269898789732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590579111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029810717,0.000028065033,0.9651596,0.0037443424,0.00017431143,0.000105083556,0.0000010516897,0.00004719612,0.0009296239],"genre_scores_gemma":[0.94401217,0.00001123293,0.055084113,0.00030929266,0.000027340138,0.000009402056,7.0041146e-8,0.0000029183796,0.00054346194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949837,0.00001167082,0.00012211034,0.00016118563,0.000058718266,0.00014795572],"domain_scores_gemma":[0.99943185,0.00031791208,0.000017310555,0.00016372751,0.00002934472,0.000039877676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013794254,0.000046464385,0.00006569708,0.000037484944,0.00002583529,0.000034168504,0.00022692354,0.000024213206,0.000009808001],"category_scores_gemma":[0.00010029607,0.000029480118,0.0000119729275,0.00006287245,0.000046639045,0.00015261683,0.00009371124,0.00001908892,0.000026506155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004940539,0.000023524748,0.0061669624,0.000004279996,0.0000016178197,0.0000024274063,0.00023730514,0.000004805887,0.0007328779,0.51524407,0.0013114685,0.4762657],"study_design_scores_gemma":[0.0005315595,0.00045387435,0.012487445,0.00006165688,0.0000032436012,0.000015815609,0.000120791105,0.2926115,0.066995084,0.59238064,0.033833552,0.00050482544],"about_ca_topic_score_codex":0.00002687282,"about_ca_topic_score_gemma":0.00011577103,"teacher_disagreement_score":0.91420144,"about_ca_system_score_codex":0.000014679879,"about_ca_system_score_gemma":0.000011161342,"threshold_uncertainty_score":0.12021643},"labels":[],"label_agreement":null},{"id":"W2590954383","doi":"10.1109/icci-cc.2016.7862065","title":"Development of a cognitive vehicle system for simulation of driving behavior","year":2016,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Video game; Computer science; Video game development; Video game design; Human–computer interaction; Artificial intelligence; Multimedia; Simulation; Game mechanics; Game design","score_opus":0.0607883116465381,"score_gpt":0.32798947586754235,"score_spread":0.26720116422100426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590954383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41626698,0.0000017213129,0.58337855,0.000009595061,0.000048886654,0.00015138285,8.417108e-7,0.000025192327,0.00011685975],"genre_scores_gemma":[0.91954994,1.0044517e-7,0.080335975,0.0000031901593,0.000007588591,0.00003250753,1.780532e-7,0.000003065634,0.00006744935],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932426,0.000012742787,0.0003023411,0.00013208415,0.00013188877,0.000096701944],"domain_scores_gemma":[0.99893934,0.00053402275,0.0001268519,0.000116052055,0.00026112577,0.000022639313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018438353,0.000047920497,0.000096555756,0.000037089532,0.000032328604,0.000007698887,0.00019680156,0.000025017911,0.000006845805],"category_scores_gemma":[0.00011404444,0.000032629607,0.000030662675,0.00008454512,0.000029575362,0.00018556495,0.00007122132,0.000009257723,0.000009810548],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010069306,0.00009075871,0.008063936,0.000040900017,0.000015309537,4.7995064e-7,0.0033478264,0.00021833536,0.106925026,0.017338714,0.0000034579573,0.8639452],"study_design_scores_gemma":[0.00008171269,0.00004131949,0.0040256856,0.00022699367,0.000005536051,2.604792e-7,0.00042287027,0.079048514,0.91593903,0.00011944458,0.0000262285,0.00006242507],"about_ca_topic_score_codex":0.0000036922372,"about_ca_topic_score_gemma":0.0000134569555,"teacher_disagreement_score":0.8638828,"about_ca_system_score_codex":0.000032454267,"about_ca_system_score_gemma":0.000054995682,"threshold_uncertainty_score":0.13305967},"labels":[],"label_agreement":null},{"id":"W2592835817","doi":"10.1090/stml/080/04","title":"Hackenbush and partizan games","year":2016,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.026035705311201415,"score_gpt":0.26814998203652934,"score_spread":0.24211427672532793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592835817","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060337177,0.0007083195,0.05517401,0.0029932829,0.00024234923,0.00037302065,0.00001338346,0.0004959819,0.9399393],"genre_scores_gemma":[0.003978956,0.00045520047,0.018956041,0.0008016657,0.0003851608,0.00003473423,0.0000034670882,0.00009828054,0.9752865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784976,0.000025942667,0.0005688994,0.00065090426,0.00055652467,0.00034797785],"domain_scores_gemma":[0.99819577,0.00047269952,0.0001782212,0.0008897266,0.000025580282,0.00023800557],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013464001,0.00039373458,0.00050588313,0.00011896566,0.00006800255,0.00044652054,0.0013692538,0.00023418745,0.00113125],"category_scores_gemma":[0.000034482448,0.000277471,0.0001445719,0.00003401718,0.00032901595,0.0008553022,0.0017413193,0.00025188303,0.002762329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019610402,0.00003078964,0.000034584515,0.000054492728,0.00004509545,0.000048433838,0.00038794763,6.8572405e-8,0.000005326004,0.9708204,0.005494048,0.023076816],"study_design_scores_gemma":[0.000040526247,0.000060812035,0.000016609045,0.00044242255,0.000018132243,0.000017244078,0.000013260832,0.00015444797,0.00026106377,0.9162206,0.082398236,0.00035663918],"about_ca_topic_score_codex":9.416409e-8,"about_ca_topic_score_gemma":1.8822857e-7,"teacher_disagreement_score":0.07690419,"about_ca_system_score_codex":0.00001432882,"about_ca_system_score_gemma":0.000054366687,"threshold_uncertainty_score":0.99996775},"labels":[],"label_agreement":null},{"id":"W2605637976","doi":"10.1609/aiide.v9i4.12635","title":"Improving Goal Recognition in Interactive Narratives with Models of Narrative Discovery Events","year":2013,"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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; William and Flora Hewlett Foundation; Bill and Melinda Gates Foundation; National Science Foundation","keywords":"Narrative; Computer science; Hidden Markov model; Representation (politics); Artificial intelligence; Data science; Machine learning; Linguistics","score_opus":0.03818146492486029,"score_gpt":0.26905282856274104,"score_spread":0.23087136363788074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605637976","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9471797,0.000010965825,0.04640064,0.00097149273,0.00016921999,0.000947575,0.0000159548,0.000023581506,0.004280899],"genre_scores_gemma":[0.9987003,0.000018527826,0.00088497467,0.00008899896,0.000019835017,0.00014472124,0.0000022679267,0.000015568325,0.00012480328],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99764365,0.000036984824,0.00082105526,0.00064428383,0.0004921024,0.00036193136],"domain_scores_gemma":[0.9979012,0.00020536587,0.0007756834,0.00022104538,0.00081031147,0.00008639562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018775447,0.0003539845,0.0004195274,0.0002618274,0.000101371275,0.00048340228,0.0008990927,0.00007420221,0.00003443859],"category_scores_gemma":[0.00021438122,0.00024341035,0.00011991989,0.0004157947,0.00040491275,0.00729568,0.0004743754,0.0003719206,0.000017521179],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018464532,0.002536655,0.004007597,0.00017576918,0.0002755605,0.0000035088096,0.1706186,0.00051635003,0.083730556,0.20457044,0.000036754158,0.5316818],"study_design_scores_gemma":[0.000097932076,0.0015204865,0.00058812933,0.0014799942,0.000009930843,0.000009034942,0.09591009,0.067974426,0.56303763,0.26895875,0.0000031338573,0.0004104362],"about_ca_topic_score_codex":0.00023677813,"about_ca_topic_score_gemma":0.000038123697,"teacher_disagreement_score":0.53127134,"about_ca_system_score_codex":0.00014911238,"about_ca_system_score_gemma":0.000075373144,"threshold_uncertainty_score":0.9925986},"labels":[],"label_agreement":null},{"id":"W2608504691","doi":"10.1007/978-3-319-57969-6_3","title":"Integrating Factorization Ranked Features in MCTS: An Experimental Study","year":2017,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ranking (information retrieval); Factorization; Computer science; Tree (set theory); Feature (linguistics); Artificial intelligence; Factor (programming language); Monte Carlo method; Machine learning; Monte Carlo tree search; Statistics; Algorithm; Mathematics","score_opus":0.08026925698930258,"score_gpt":0.37100993813022587,"score_spread":0.2907406811409233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608504691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009427168,0.0008816309,0.6604391,0.0009060073,0.0019981165,0.0032219675,0.000017145969,0.00038483416,0.32272407],"genre_scores_gemma":[0.95546067,0.00019318389,0.04367478,0.00019419164,0.000036025314,0.00004223099,0.000025921921,0.000008351712,0.00036467283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806345,0.000071519215,0.00076516985,0.00037273575,0.0004997646,0.00022737675],"domain_scores_gemma":[0.9962202,0.00014974829,0.0004547459,0.0027880387,0.00029860044,0.000088678025],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.001149455,0.00024319915,0.00026759907,0.0010168754,0.0007100203,0.0016846111,0.00533153,0.00012138139,0.0000056517865],"category_scores_gemma":[0.0001073657,0.0002382878,0.000030012203,0.00022376559,0.0007009718,0.014622723,0.0022787713,0.00051219674,0.00002141784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000642901,0.00023188535,0.0012869396,0.000010993323,0.0000064966266,0.0000019254112,0.05997856,0.00044085106,0.00003319706,0.62634957,0.00004931845,0.3116038],"study_design_scores_gemma":[0.0007751269,0.0008608783,0.015837438,0.00065741845,0.0000087931785,0.000031877884,0.003359761,0.9350763,0.00057931565,0.024216529,0.017232552,0.001363989],"about_ca_topic_score_codex":0.00012793651,"about_ca_topic_score_gemma":0.00027929025,"teacher_disagreement_score":0.9460335,"about_ca_system_score_codex":0.0002226254,"about_ca_system_score_gemma":0.00022690483,"threshold_uncertainty_score":0.99935174},"labels":[],"label_agreement":null},{"id":"W2610119122","doi":"","title":"Chaos, order and uncertainty when writing narrative for animation","year":2017,"lang":"en","type":"dissertation","venue":"Minerva Access (University of Melbourne)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Melbourne; McGill University","keywords":"Narrative; Animation; Order (exchange); Computer science; CHAOS (operating system); Computer graphics (images); Art; Literature; Computer security; Economics","score_opus":0.052136868527863714,"score_gpt":0.31857870419669015,"score_spread":0.26644183566882645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610119122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67605513,0.00075571105,0.30436677,0.003517676,0.0012445974,0.0012869638,0.000051255203,0.00015872254,0.012563162],"genre_scores_gemma":[0.88083816,0.0003231689,0.06517565,0.000085489075,0.00030140718,0.00000813397,0.00038454143,0.00004801159,0.05283543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987119,0.000051218605,0.00022166531,0.0004954297,0.00027751498,0.00024227638],"domain_scores_gemma":[0.9977004,0.00016298497,0.00078563485,0.00044060205,0.0008296743,0.00008070964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003365652,0.00021939835,0.00039098447,0.00022450298,0.0007987885,0.0003322326,0.001912117,0.00023833809,0.00007031505],"category_scores_gemma":[0.00020409757,0.00026169233,0.00010353624,0.00013594404,0.00012513634,0.002048871,0.0002125297,0.00017782745,0.000004180409],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027173772,0.00013903317,0.00078312366,0.0010607716,0.00026692657,0.00003261556,0.16174388,0.00036600645,0.0026208619,0.02590862,0.007925107,0.7988813],"study_design_scores_gemma":[0.0023878668,0.00086294254,0.02784011,0.003839955,0.00056796917,0.0000285393,0.19073476,0.6058273,0.0141242165,0.109103486,0.04109084,0.0035920688],"about_ca_topic_score_codex":0.0019702765,"about_ca_topic_score_gemma":0.007227623,"teacher_disagreement_score":0.7952893,"about_ca_system_score_codex":0.000058858914,"about_ca_system_score_gemma":0.00018094025,"threshold_uncertainty_score":0.99998355},"labels":[],"label_agreement":null},{"id":"W2611278197","doi":"10.1007/s00371-017-1396-3","title":"Marbling-based creative modelling","year":2017,"lang":"en","type":"article","venue":"The Visual Computer","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Computer graphics; Process (computing); Suite; Algorithm; Computer graphics (images); Simple (philosophy); Graphics; Artificial intelligence","score_opus":0.08434145341124545,"score_gpt":0.35390677194486636,"score_spread":0.2695653185336209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611278197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042582072,0.000024399827,0.95260143,0.0020697906,0.000670687,0.00014008726,5.758199e-7,0.00015763898,0.0017533367],"genre_scores_gemma":[0.9336829,0.000002572472,0.06485731,0.0008217486,0.00040218947,0.000008690511,5.0832705e-7,0.000011530963,0.00021254858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876803,0.00008991795,0.00020681771,0.00035030805,0.0002817787,0.00030313083],"domain_scores_gemma":[0.9982032,0.0002123094,0.00017463237,0.001216824,0.00012440643,0.000068631205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004453421,0.00015665956,0.00015137209,0.000057556306,0.0009790659,0.00097382534,0.0027292592,0.000050107785,0.00002245246],"category_scores_gemma":[0.000028838977,0.00010660894,0.000092299975,0.00008449584,0.00023114987,0.00047678797,0.00065999426,0.00018658402,0.00032325892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050524977,0.00025147377,0.0009463691,0.000016531492,0.00007283266,0.000053285727,0.0035994924,0.5300956,0.00022001828,0.13155194,0.0024688705,0.33067313],"study_design_scores_gemma":[0.00005843264,0.00009531228,0.00037670135,0.000024983978,0.000004173178,0.0000021190203,0.000009797003,0.98276263,0.005437782,0.009777962,0.0013005991,0.0001494853],"about_ca_topic_score_codex":0.00016966795,"about_ca_topic_score_gemma":0.000008625454,"teacher_disagreement_score":0.8911008,"about_ca_system_score_codex":0.000026888003,"about_ca_system_score_gemma":0.000055123648,"threshold_uncertainty_score":0.939062},"labels":[],"label_agreement":null},{"id":"W2611642384","doi":"10.1145/3027063.3048414","title":"Phantasm","year":2017,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Hacker; Interactivity; Computer science; Human–computer interaction; Internet privacy; Multimedia; Computer security","score_opus":0.06549318958418006,"score_gpt":0.34256885071993637,"score_spread":0.2770756611357563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611642384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007532431,0.000009755343,0.76342726,0.0026546312,0.00047262863,0.000029445375,8.808851e-8,0.00012304967,0.22575071],"genre_scores_gemma":[0.9622552,0.000004099185,0.033394635,0.00025746253,0.00005087099,0.0000018820707,2.8423498e-8,0.0000016974078,0.004034145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960214,0.000005167061,0.000061711275,0.00013273774,0.00008689894,0.00011135019],"domain_scores_gemma":[0.9989786,0.000017446973,0.000037671878,0.00090650347,0.000024514744,0.000035260957],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008810545,0.000036394496,0.000038822698,0.0000146033935,0.00027237978,0.0004118188,0.0016254528,0.000015612313,0.00008742534],"category_scores_gemma":[0.000069449445,0.000029289942,0.000020725836,0.0000158072,0.00005351704,0.00061402074,0.0003139341,0.000030280898,0.001169797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.44627e-7,0.000010898941,0.0015264864,5.329435e-7,0.0000021436053,0.0000091505635,0.00013787702,0.0000025716135,0.00077129185,0.68727714,0.0030801718,0.3071814],"study_design_scores_gemma":[0.00006929664,0.000060850532,0.013718625,0.000011471624,0.0000021799005,0.000017991904,0.00005016895,0.11599891,0.5291611,0.2546718,0.085883595,0.00035403116],"about_ca_topic_score_codex":0.00007654829,"about_ca_topic_score_gemma":0.00002639902,"teacher_disagreement_score":0.95472276,"about_ca_system_score_codex":0.0000052587307,"about_ca_system_score_gemma":0.000012415649,"threshold_uncertainty_score":0.9996079},"labels":[],"label_agreement":null},{"id":"W2612065536","doi":"","title":"The Importance of Mixing Virtual and Real Information in Games","year":2014,"lang":"en","type":"article","venue":"2014 AGU Fall Meeting","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mixing (physics); Computer science; Internet privacy; Physics","score_opus":0.012928839754415326,"score_gpt":0.25171623371015867,"score_spread":0.23878739395574333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612065536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9624861,0.000083115694,0.03177655,0.00036304776,0.00016115709,0.00007895988,2.35874e-7,0.00003756446,0.0050133076],"genre_scores_gemma":[0.9948986,0.000077346805,0.004860534,0.00009741238,0.000035472433,0.000005188436,3.5597245e-7,0.0000029647401,0.000022135993],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905425,0.000076683915,0.00038403083,0.00012457013,0.00017464513,0.0001858155],"domain_scores_gemma":[0.9989012,0.00053851766,0.00021159156,0.00025948518,0.000059111346,0.000030128915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012898402,0.00007223522,0.00010253547,0.000056293706,0.00009767105,0.000107994616,0.0004002748,0.000037269714,4.1164841e-7],"category_scores_gemma":[0.00058070547,0.000054884353,0.00001949675,0.000117186006,0.00008032014,0.0006164622,0.00017461689,0.00008414598,0.0000134272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009244582,0.000010748437,0.5085389,0.000020475034,0.0000052852033,7.933806e-7,0.008165257,0.0011852398,0.0009285908,0.13012794,0.00040016996,0.35060737],"study_design_scores_gemma":[0.00022056609,0.00020125191,0.1123996,0.0002481611,0.0000052098567,0.000008354422,0.0029838458,0.84514457,0.011985591,0.01959605,0.006800368,0.00040643124],"about_ca_topic_score_codex":0.0011036117,"about_ca_topic_score_gemma":0.002380425,"teacher_disagreement_score":0.84395933,"about_ca_system_score_codex":0.000015433627,"about_ca_system_score_gemma":0.000018728726,"threshold_uncertainty_score":0.2238119},"labels":[],"label_agreement":null},{"id":"W2617552719","doi":"10.1609/aiide.v9i3.12591","title":"An Exploration Tool for Predicting Stealthy Behaviour","year":2013,"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":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adversary; Structuring; Computer science; Probabilistic logic; Human–computer interaction; Path (computing); Space (punctuation); Movement (music); Variation (astronomy); Virtual reality; Motion (physics); Artificial intelligence; Computer security; Aesthetics","score_opus":0.06893035615868796,"score_gpt":0.3175217812839098,"score_spread":0.2485914251252218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617552719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79168284,0.000007744713,0.2013267,0.0028171923,0.0004702032,0.00165977,0.000020536592,0.0000977428,0.001917249],"genre_scores_gemma":[0.9976795,0.000015252213,0.0014095486,0.0002901531,0.00007662616,0.00035384228,0.000003488084,0.000017477938,0.00015413605],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978232,0.000017936862,0.0007288337,0.00062481826,0.000413418,0.00039180313],"domain_scores_gemma":[0.99805087,0.00017606864,0.00046894723,0.00029010727,0.0008846001,0.00012939515],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00026750506,0.00028518907,0.00026361746,0.00013653921,0.00023983375,0.0013450584,0.0011563632,0.00007918267,0.000038069964],"category_scores_gemma":[0.00035074106,0.00021573389,0.00013177723,0.0002114088,0.00020331469,0.0065312125,0.00029700127,0.00021742907,0.000047057638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001684541,0.0007086065,0.00393476,0.000044269673,0.000042829633,2.801988e-7,0.0074522723,0.00006341447,0.019107722,0.40946782,0.0001291129,0.55888045],"study_design_scores_gemma":[0.0000558119,0.002052252,0.0007406647,0.00034224507,0.000017641401,0.000005169651,0.013832284,0.22705744,0.54673785,0.20863216,0.00009247106,0.00043403276],"about_ca_topic_score_codex":0.000058912632,"about_ca_topic_score_gemma":0.0000056503345,"teacher_disagreement_score":0.5584464,"about_ca_system_score_codex":0.00009319476,"about_ca_system_score_gemma":0.00004680346,"threshold_uncertainty_score":0.99969167},"labels":[],"label_agreement":null},{"id":"W2619823956","doi":"10.1007/978-3-319-71147-8_14","title":"The Cop Number of the One-Cop-Moves Game on Planar Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Vertex (graph theory); Planar graph; Combinatorics; Graph; Computer science; Planar; Combinatorial game theory; Mathematics; Discrete mathematics; Game theory; Mathematical economics; Sequential game; Computer graphics (images)","score_opus":0.03279651819903657,"score_gpt":0.2876047472265531,"score_spread":0.25480822902751654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619823956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006868012,0.00035114342,0.9659595,0.0039891168,0.005377667,0.0006488744,0.0000105584695,0.00010526519,0.022871085],"genre_scores_gemma":[0.93497837,0.00028314465,0.057074998,0.0033119945,0.0007850476,0.000025136344,0.0000016104689,0.00007675911,0.0034629458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957304,0.000079463636,0.00065206,0.0012171953,0.001614838,0.0007060612],"domain_scores_gemma":[0.99324155,0.0016243828,0.00077626645,0.003929892,0.00030977526,0.00011816455],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011509709,0.0005113005,0.0005048222,0.00022746899,0.0009299146,0.0008701497,0.011690451,0.00030567744,0.000020449968],"category_scores_gemma":[0.00040712245,0.00030846635,0.00027219963,0.00032204913,0.0035543805,0.0004191893,0.0016115081,0.0010697611,0.00012530475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001625142,0.00004355557,0.0003612734,0.000021498006,0.000028290344,0.000021536693,0.0016778037,0.004094382,0.00014496973,0.39978647,0.00017951558,0.5936245],"study_design_scores_gemma":[0.00008591941,0.00014139501,0.00073341996,0.00076852116,0.000011669611,0.00004016644,7.182012e-7,0.047900584,0.012799302,0.92882794,0.008102572,0.0005878089],"about_ca_topic_score_codex":0.00009719452,"about_ca_topic_score_gemma":0.00033836428,"teacher_disagreement_score":0.93429154,"about_ca_system_score_codex":0.00015108121,"about_ca_system_score_gemma":0.00052236824,"threshold_uncertainty_score":0.99993676},"labels":[],"label_agreement":null},{"id":"W2620234624","doi":"","title":"On the Minimization of Regulatory Margin Requirements for Portfolios of Financial Securities","year":2011,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Margin (machine learning); Business; Actuarial science; Computer science; Machine learning","score_opus":0.010040279173947612,"score_gpt":0.180298832194349,"score_spread":0.17025855302040138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620234624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70213526,0.0010389702,0.0042777224,0.0011405123,0.002650327,0.0018278304,0.0008691186,0.000024743,0.2860355],"genre_scores_gemma":[0.9899226,0.00008878014,0.0014732123,0.00026501794,0.00003207899,0.000023546558,0.000023227547,0.000015473952,0.0081560975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980091,0.00004149806,0.00045305848,0.00020996906,0.0011242966,0.00016206503],"domain_scores_gemma":[0.99876255,0.00031158666,0.000567949,0.00029807075,0.000003649386,0.00005617931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000020642432,0.00015945187,0.00025355973,0.00003851143,0.00008792737,0.000010096876,0.00055114494,0.000045782686,0.000018125515],"category_scores_gemma":[0.000019264326,0.0001363152,0.000046310375,0.0000721358,0.000074035546,0.00023574116,0.000064408356,0.00007694662,7.4779377e-10],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042349249,0.000030313608,0.0004093587,0.0003866824,0.00003925816,0.0000032238156,0.00064858556,0.00002951619,0.0018614866,0.9795037,0.0026631742,0.014001197],"study_design_scores_gemma":[0.00012363525,0.00025529918,0.016081695,0.0007579387,0.000030471887,6.7814574e-7,0.0027830403,0.0030163955,0.91014946,0.06414758,0.002362096,0.0002917238],"about_ca_topic_score_codex":0.0011279548,"about_ca_topic_score_gemma":0.0088859815,"teacher_disagreement_score":0.91535616,"about_ca_system_score_codex":0.0000046187165,"about_ca_system_score_gemma":0.00182784,"threshold_uncertainty_score":0.55587727},"labels":[],"label_agreement":null},{"id":"W26274488","doi":"10.1111/vcp.12275","title":"Lambda depth-first proof number search and its application to go","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Depth-first search; Computer science; Search algorithm; Proof of concept; Search tree; Iterative deepening depth-first search; Theoretical computer science; Space (punctuation); Beam stack search; Combinatorial search; Breadth-first search; Algorithm; Search problem; Mathematics; Beam search; Best-first search","score_opus":0.11102970326903157,"score_gpt":0.3652190956948882,"score_spread":0.25418939242585664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26274488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04967362,0.000016114745,0.9158943,0.010919791,0.0010276198,0.0007564267,0.000009008111,0.00021623178,0.021486877],"genre_scores_gemma":[0.98851585,0.000035586043,0.009386129,0.00096037716,0.0003257241,0.00008466064,0.0000065516347,0.000025849251,0.00065924233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961627,0.00006645239,0.0009479497,0.0010866993,0.0010651045,0.00067107007],"domain_scores_gemma":[0.9974682,0.00030887505,0.0001632652,0.0006307667,0.0010155706,0.00041335588],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012616994,0.00035366364,0.0002840591,0.00040971942,0.0002580044,0.0005230651,0.0017110816,0.00016015781,0.00029027966],"category_scores_gemma":[0.00047455073,0.00035815733,0.00009554522,0.0006659995,0.00016463848,0.00065703865,0.00058143964,0.0004230823,0.005968035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057426747,0.00015228605,0.00029912413,0.000007527186,0.000017313461,0.000021406953,0.0011385606,0.0009981468,0.0073424582,0.68525994,0.000076064,0.30462974],"study_design_scores_gemma":[0.00002929858,0.00019821465,0.0014526435,0.00013240552,0.0000056196463,0.00004603138,0.0004473856,0.25262094,0.65978,0.08104368,0.0036737858,0.0005699739],"about_ca_topic_score_codex":0.00017713537,"about_ca_topic_score_gemma":0.0014861148,"teacher_disagreement_score":0.93884224,"about_ca_system_score_codex":0.0001839906,"about_ca_system_score_gemma":0.00012803245,"threshold_uncertainty_score":0.99988705},"labels":[],"label_agreement":null},{"id":"W26296001","doi":"10.1097/01.mpg.0000471451.55494.e4","title":"Leaf-value tables for pruning non-zero-sum games","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Zero-sum game; Zero (linguistics); Heuristics; Constant (computer programming); Tree (set theory); Computer science; Monotonic function; Mathematics; Game tree; Node (physics); Value (mathematics); Algorithm; Combinatorics; Discrete mathematics; Game theory; Mathematical optimization; Sequential game; Nash equilibrium; Machine learning; Mathematical economics","score_opus":0.10886125189251629,"score_gpt":0.3444431392907666,"score_spread":0.2355818873982503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26296001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069310907,0.00004212965,0.9593497,0.016401831,0.0025710792,0.00070460525,0.000046799738,0.0003270782,0.01362571],"genre_scores_gemma":[0.9111679,0.00006551291,0.08451652,0.0016258215,0.00081707386,0.0002173856,0.0000281841,0.000041453994,0.001520124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995522,0.00009114131,0.0013129098,0.0012366563,0.0009898064,0.0008474855],"domain_scores_gemma":[0.99680424,0.00048517334,0.00046077272,0.00094496226,0.0010378554,0.00026697246],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00088947965,0.0005194788,0.00046368816,0.0005283408,0.00036472944,0.0010412155,0.0028812243,0.00020960068,0.0006431601],"category_scores_gemma":[0.0008613036,0.00051781704,0.0003059766,0.00044451482,0.00032952303,0.0013964724,0.00045356294,0.00046042615,0.0018408059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051361374,0.00020559321,0.000025802756,0.000008900915,0.000034992187,0.0000072697853,0.0008777478,0.010382137,0.009374597,0.65284616,0.0008981826,0.32528725],"study_design_scores_gemma":[0.000037793234,0.0001989359,0.000035519406,0.00012872387,0.0000085926595,0.000012803225,0.00030146408,0.53437465,0.2756962,0.17474307,0.014001412,0.00046085025],"about_ca_topic_score_codex":0.00016904021,"about_ca_topic_score_gemma":0.00020451554,"teacher_disagreement_score":0.90423685,"about_ca_system_score_codex":0.0003018043,"about_ca_system_score_gemma":0.00031620008,"threshold_uncertainty_score":0.9999958},"labels":[],"label_agreement":null},{"id":"W27158770","doi":"10.1002/mus.25180","title":"Lookahead Pathology in Real-Time Path-Finding.","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Computer science; Heuristic; Path (computing); Artificial intelligence; Machine learning; Limit (mathematics); Minimax; Iterative deepening depth-first search; Search algorithm; Mathematical optimization; Beam search; Algorithm; Mathematics","score_opus":0.10429304688397582,"score_gpt":0.34982573794473376,"score_spread":0.24553269106075792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27158770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17022362,0.00007646389,0.5812294,0.008655443,0.0016017494,0.0010523711,0.000046233934,0.0008813078,0.23623341],"genre_scores_gemma":[0.9893902,0.000035189718,0.0091066,0.00035446833,0.0002472441,0.00006894255,0.000018937566,0.000020819885,0.000757602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995916,0.00024868717,0.0010567199,0.0009975324,0.0010822488,0.00069878495],"domain_scores_gemma":[0.99775505,0.0006211197,0.0002653379,0.00054528343,0.0006948423,0.00011834517],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001171769,0.0003542688,0.00037376056,0.0006530509,0.00020642746,0.00033561845,0.0015326599,0.00025387525,0.00048929645],"category_scores_gemma":[0.0005046328,0.0003699083,0.00011581034,0.0011394316,0.00032264626,0.00060121156,0.00020331828,0.00044849885,0.0040880684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028633542,0.00029278576,0.00023085468,0.0000037687776,0.0000034438388,0.00007796364,0.00025242366,0.0031656602,0.013657422,0.9317919,0.00036635136,0.050128803],"study_design_scores_gemma":[0.000027085984,0.00016270937,0.001872595,0.000058567974,0.000002256238,0.000017893299,0.000089488734,0.2109129,0.058973167,0.7271907,0.00026790728,0.00042476348],"about_ca_topic_score_codex":0.00043041186,"about_ca_topic_score_gemma":0.00048892526,"teacher_disagreement_score":0.81916654,"about_ca_system_score_codex":0.00031138666,"about_ca_system_score_gemma":0.00045056903,"threshold_uncertainty_score":0.9998753},"labels":[],"label_agreement":null},{"id":"W2724415416","doi":"10.1609/aiide.v12i1.12854","title":"Staying Hidden: An Analysis of Hiding Strategies in a 2D Level with Occlusions","year":2016,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristic; Adversary; Character (mathematics); Simple (philosophy); Path (computing); Artificial intelligence; Feature (linguistics); Observer (physics); Machine learning; Computer security; Mathematics","score_opus":0.07290076523713084,"score_gpt":0.31123659252878466,"score_spread":0.2383358272916538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724415416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92001677,0.0000077893465,0.075922474,0.0008227,0.0000853549,0.0003076902,0.000030313618,0.000027763994,0.002779158],"genre_scores_gemma":[0.999121,0.000021551345,0.00067295827,0.00007310288,0.000012529026,0.000026538539,8.75539e-7,0.0000109236025,0.000060502665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99775684,0.000025230174,0.00074201165,0.00060889707,0.0005144051,0.0003526371],"domain_scores_gemma":[0.9982843,0.00026718416,0.00052995834,0.00031019113,0.0005043361,0.000104042534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028198838,0.00028046343,0.00044597444,0.0005321328,0.00010319101,0.00043735365,0.0011538921,0.000054061362,0.000039688726],"category_scores_gemma":[0.00022391537,0.0001629403,0.00013962657,0.0009092874,0.00042243116,0.0029680734,0.000474804,0.00017222749,0.000006018451],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004525263,0.00073572097,0.015425811,0.000028092692,0.00028621836,0.000003821712,0.012852841,0.00021892448,0.056882698,0.6790854,0.000004326708,0.23402363],"study_design_scores_gemma":[0.00010378368,0.0018259061,0.0064717676,0.001533594,0.00012572522,0.000009014914,0.05545254,0.07792698,0.77581257,0.080092415,0.000029239076,0.0006164408],"about_ca_topic_score_codex":0.0001330416,"about_ca_topic_score_gemma":0.00017247004,"teacher_disagreement_score":0.7189299,"about_ca_system_score_codex":0.00012910948,"about_ca_system_score_gemma":0.00009582084,"threshold_uncertainty_score":0.66445124},"labels":[],"label_agreement":null},{"id":"W2725410461","doi":"10.1609/aiide.v12i1.12872","title":"Analyzing Stealth Games with Distractions","year":2016,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Guard (computer science); Distraction; Computer science; Heuristic; Key (lock); Focus (optics); Human–computer interaction; Artificial intelligence; Computer security; Psychology; Cognitive psychology","score_opus":0.04031683277748597,"score_gpt":0.28723007555004487,"score_spread":0.2469132427725589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725410461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68340445,0.000027169268,0.28005725,0.013452863,0.00046401605,0.0007841037,0.00004515806,0.00014521822,0.021619743],"genre_scores_gemma":[0.99866325,0.00006470285,0.00042113676,0.0001291696,0.00004090332,0.000040649855,4.8411965e-7,0.000014215566,0.0006255028],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99795693,0.000015903735,0.0005668594,0.0006218031,0.0004425498,0.0003959734],"domain_scores_gemma":[0.998337,0.0002562399,0.00046498916,0.00030631205,0.0004902351,0.00014524038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018723005,0.0002995009,0.00028435115,0.00016011055,0.0001950564,0.0005942642,0.001055469,0.00005587236,0.000049298902],"category_scores_gemma":[0.0002701433,0.00015958174,0.00012104127,0.00033983373,0.00048385785,0.002144021,0.00038888192,0.00021307933,0.000061509934],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022169412,0.00035786693,0.0034513476,0.000020283176,0.000078157405,0.0000016163083,0.001548429,0.000009173469,0.01345325,0.48844984,0.000073409785,0.49233493],"study_design_scores_gemma":[0.00008807789,0.001684713,0.00165751,0.0015563604,0.00003270626,0.00003913984,0.0062004607,0.004872771,0.8804325,0.101842284,0.0009510042,0.0006424724],"about_ca_topic_score_codex":0.000028681687,"about_ca_topic_score_gemma":0.000016549,"teacher_disagreement_score":0.86697924,"about_ca_system_score_codex":0.00013121193,"about_ca_system_score_gemma":0.0000668148,"threshold_uncertainty_score":0.65075547},"labels":[],"label_agreement":null},{"id":"W2727066796","doi":"10.1609/aiide.v11i1.12783","title":"Keeping the Player on an Emotional Trajectory in Interactive Storytelling","year":2015,"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":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Narrative; Storytelling; Interactive storytelling; Pace; Computer science; Event (particle physics); Human–computer interaction; Multimedia; Video game; Artificial intelligence; Cognitive psychology; Psychology; Art","score_opus":0.08123450664948727,"score_gpt":0.309418893194236,"score_spread":0.2281843865447487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727066796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579709,0.00002799247,0.018069208,0.0032599927,0.0010040235,0.0008166837,0.0000136685485,0.00006988189,0.018767612],"genre_scores_gemma":[0.99879724,0.000017522398,0.00020095134,0.00068261544,0.00009470842,0.000053125656,0.0000016028474,0.000018287577,0.00013392355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973072,0.00006564669,0.00073226634,0.0007260539,0.0007355768,0.00043325184],"domain_scores_gemma":[0.99813324,0.0003822481,0.0004335327,0.0003468317,0.0005279533,0.0001761966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006128435,0.00036346645,0.0003236831,0.00025637832,0.00017658512,0.0007545751,0.0016223332,0.000086543274,0.000026252623],"category_scores_gemma":[0.00059208146,0.00024226228,0.00013766438,0.0003872699,0.00040486897,0.002310769,0.00045081534,0.00064019504,0.00006909774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013269171,0.0019599353,0.0022550034,0.000030663046,0.000110284185,0.000007708681,0.05269315,0.0028804874,0.005664925,0.60776085,0.00016977845,0.32514033],"study_design_scores_gemma":[0.00018857898,0.0033506872,0.001679393,0.0016937521,0.000022255916,0.00003641673,0.06384192,0.29590994,0.45815548,0.17338207,0.0007611998,0.000978301],"about_ca_topic_score_codex":0.00006785117,"about_ca_topic_score_gemma":0.000035549267,"teacher_disagreement_score":0.45249057,"about_ca_system_score_codex":0.0003113684,"about_ca_system_score_gemma":0.000110254856,"threshold_uncertainty_score":0.9879169},"labels":[],"label_agreement":null},{"id":"W2727436414","doi":"10.1609/aiide.v11i1.12787","title":"Hierarchical Portfolio Search: Prismata's Robust AI Architecture for Games with Large Search Spaces","year":2015,"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":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Portfolio; Video game; Action (physics); Monte Carlo tree search; Artificial intelligence; Field (mathematics); Sequential game; Architecture; Human–computer interaction; Machine learning; Game theory; Multimedia; Mathematics","score_opus":0.07500689002344808,"score_gpt":0.30988727373418695,"score_spread":0.23488038371073888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727436414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46578074,0.000049770617,0.5059241,0.015794853,0.0004190044,0.0019597195,0.00009039673,0.00014009263,0.0098413015],"genre_scores_gemma":[0.9963913,0.000019727502,0.0023591,0.0005160358,0.00009068894,0.000095285126,0.000005150856,0.000028294518,0.0004944239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968264,0.00003442169,0.0006292587,0.0008574099,0.00093085587,0.00072163815],"domain_scores_gemma":[0.9975831,0.00026502548,0.00027692234,0.00036916303,0.0011720652,0.0003337531],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058603106,0.0004232376,0.00043673723,0.00026511593,0.00021725518,0.0012939414,0.0015927046,0.00010554322,0.000026313854],"category_scores_gemma":[0.0004068203,0.00027909118,0.00016942466,0.00043583746,0.0005912219,0.001516927,0.00084449793,0.00059314375,0.000029054445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020928038,0.0012931193,0.002668977,0.0001300272,0.00020359203,0.000007591045,0.022202928,0.0012999807,0.002853697,0.7333655,0.0009148838,0.2329669],"study_design_scores_gemma":[0.0002867279,0.005109324,0.00023189848,0.0011066312,0.000045336943,0.000075337004,0.028295338,0.19711702,0.6218654,0.14087348,0.003979883,0.0010136528],"about_ca_topic_score_codex":0.00003810483,"about_ca_topic_score_gemma":0.000016846028,"teacher_disagreement_score":0.6190117,"about_ca_system_score_codex":0.00012882457,"about_ca_system_score_gemma":0.00021097244,"threshold_uncertainty_score":0.99996614},"labels":[],"label_agreement":null},{"id":"W2729651202","doi":"10.1609/aiide.v11i1.12780","title":"Using Lanchester Attrition Laws for Combat Prediction in StarCraft","year":2015,"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":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Tournament; Attrition; Artificial intelligence; Domain (mathematical analysis); Operations research; Machine learning; Engineering","score_opus":0.17666477763171687,"score_gpt":0.3379196311318249,"score_spread":0.16125485350010801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729651202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8093169,0.000030407222,0.18263201,0.0022014587,0.0007042881,0.0012091064,0.000051001396,0.000059638147,0.003795213],"genre_scores_gemma":[0.99827385,0.000009337738,0.0013019196,0.00015646109,0.000055257457,0.000063584994,0.0000028935344,0.0000122525735,0.00012442273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981817,0.00001762311,0.00061842316,0.0004810828,0.00038055837,0.00032060707],"domain_scores_gemma":[0.99873,0.00013439106,0.00029200868,0.0001801104,0.00055112434,0.00011238322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035137698,0.0002313327,0.00026822955,0.00017799821,0.000082424274,0.00047449596,0.00067531393,0.00007643986,0.000007968559],"category_scores_gemma":[0.00037695188,0.00018308299,0.00010270666,0.00026896584,0.00020197828,0.0017780002,0.0003189804,0.0002013341,0.000014609724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00178526,0.0020936632,0.017745683,0.00018168475,0.00012065628,0.0000034663033,0.020908803,0.00097102043,0.046070185,0.66008365,0.00060961116,0.24942632],"study_design_scores_gemma":[0.00015711815,0.0012339223,0.000418552,0.0007470374,0.000015788235,0.000013196774,0.00895791,0.40706116,0.38417232,0.19636224,0.00049313775,0.00036761473],"about_ca_topic_score_codex":0.000042195963,"about_ca_topic_score_gemma":0.000015040415,"teacher_disagreement_score":0.4637214,"about_ca_system_score_codex":0.0002142345,"about_ca_system_score_gemma":0.00006449008,"threshold_uncertainty_score":0.74659073},"labels":[],"label_agreement":null},{"id":"W2729668291","doi":"10.1609/aiide.v11i1.12779","title":"Puppet Search: Enhancing Scripted Behavior by Look-Ahead Search with Applications to Real-Time Strategy Games","year":2015,"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":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scripting language; Adversarial system; Tree (set theory); State (computer science); Search algorithm; Artificial intelligence; Principal (computer security); Video game; Representation (politics); Machine learning; Algorithm; Programming language; Multimedia; Computer security","score_opus":0.08348723986697494,"score_gpt":0.32818565271756467,"score_spread":0.24469841285058974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729668291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8797346,0.00002305476,0.09298908,0.0033417398,0.00015700434,0.0022302535,0.00006400248,0.00015279515,0.021307502],"genre_scores_gemma":[0.9973263,0.00002400649,0.0009448918,0.00018737954,0.00004353071,0.0002602411,0.0000059158683,0.000025820696,0.0011818833],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99692273,0.000031860716,0.0006798194,0.0008642151,0.00091117015,0.00059018744],"domain_scores_gemma":[0.9976087,0.00013161256,0.00024371457,0.00040176904,0.001195766,0.00041842044],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040907276,0.0003866889,0.00037667685,0.00022663962,0.000188468,0.0011927857,0.0015467806,0.000081730796,0.000043656113],"category_scores_gemma":[0.00013635303,0.00028513125,0.000095285446,0.000609534,0.00042941968,0.0015981368,0.00069912686,0.0003611949,0.00024740398],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010670909,0.002247063,0.002380408,0.00007610872,0.00016684106,0.0000077873565,0.02124165,0.00038641653,0.26422742,0.24209602,0.0013215984,0.46478158],"study_design_scores_gemma":[0.00005888376,0.0020632695,0.00011004445,0.00037286308,0.000021847589,0.000018507564,0.017885316,0.012080436,0.9590676,0.0074759447,0.00037317292,0.00047212845],"about_ca_topic_score_codex":0.00021125819,"about_ca_topic_score_gemma":0.000022242559,"teacher_disagreement_score":0.69484013,"about_ca_system_score_codex":0.0002228761,"about_ca_system_score_gemma":0.00018220478,"threshold_uncertainty_score":0.99996006},"labels":[],"label_agreement":null},{"id":"W2730689032","doi":"10.1609/aiide.v12i1.12882","title":"Per-Map Algorithm Selection in Real-Time Heuristic Search","year":2016,"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":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pathfinding; Computer science; Heuristic; Task (project management); Selection (genetic algorithm); Incremental heuristic search; Plan (archaeology); Artificial intelligence; Search algorithm; Algorithm; Beam search; Machine learning; Theoretical computer science","score_opus":0.03854800904189996,"score_gpt":0.29579602514959896,"score_spread":0.257248016107699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730689032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8159338,0.000022062495,0.15575486,0.00873244,0.0006358239,0.0013628014,0.000040533814,0.0001873457,0.017330289],"genre_scores_gemma":[0.99781764,0.00007809978,0.00090762816,0.000083729,0.000055204502,0.00004431163,6.0151257e-7,0.00001619523,0.0009965947],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99753004,0.000033035325,0.00069731136,0.00070698845,0.000548191,0.00048442508],"domain_scores_gemma":[0.99861676,0.00029836193,0.0002714628,0.00019612313,0.000492078,0.00012521895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034860335,0.00030821227,0.00032237623,0.0002649773,0.000111316745,0.0004925345,0.0011075522,0.00008611559,0.00011716875],"category_scores_gemma":[0.0002793327,0.00019739258,0.00012443554,0.00036332395,0.00036686944,0.0016915447,0.00055195566,0.0002531454,0.00029409767],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018398328,0.0005040973,0.0014595627,0.000024573756,0.00003781865,0.0000022411414,0.0028273517,0.000016124872,0.09949814,0.14810182,0.00009401484,0.74725026],"study_design_scores_gemma":[0.00007749713,0.0010477045,0.0008251699,0.00096007617,0.000009781708,0.000017251974,0.0022307169,0.07809425,0.8361042,0.07988742,0.00026414747,0.00048174223],"about_ca_topic_score_codex":0.00008699732,"about_ca_topic_score_gemma":0.000009874301,"teacher_disagreement_score":0.74676853,"about_ca_system_score_codex":0.00024775762,"about_ca_system_score_gemma":0.000073279756,"threshold_uncertainty_score":0.80494356},"labels":[],"label_agreement":null},{"id":"W2734616033","doi":"10.1609/aimag.v37i2.2660","title":"The AIIDE 2015 Workshop Program","year":2016,"lang":"en","type":"article","venue":"AI Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Entertainment; Computer science; Narrative; Joint (building); Multimedia; Artificial intelligence; Engineering; Visual arts; Architectural engineering; Art","score_opus":0.025898157674376223,"score_gpt":0.3257900689318565,"score_spread":0.2998919112574803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734616033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003576711,0.0007088752,0.76211405,0.2171699,0.0017047769,0.0005594426,0.0000014297335,0.000989644,0.013175171],"genre_scores_gemma":[0.9023452,0.00029511272,0.035477098,0.0031696605,0.00064448814,0.00021104884,7.423389e-7,0.00003447976,0.05782217],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883366,0.000049428676,0.00021342647,0.0002784791,0.0002464695,0.000378511],"domain_scores_gemma":[0.9984853,0.000416859,0.000059141334,0.00082307827,0.00012926657,0.000086310436],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035427805,0.00011023312,0.00008736278,0.000031623244,0.00016414703,0.0002332877,0.0012574856,0.000043872922,0.000046595065],"category_scores_gemma":[0.0002755227,0.000053286323,0.00005387294,0.00029058635,0.00018586585,0.00042849357,0.0003198148,0.00009328196,0.0040373993],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035590228,0.0000272518,0.00022523117,6.81349e-7,0.0000057297966,0.0000069259854,0.00007196286,0.0000031182371,0.0006238837,0.039351888,0.10187668,0.8578031],"study_design_scores_gemma":[0.000056239838,0.000081025646,0.0009058849,0.000025715322,0.000002614702,0.000010225392,0.000012314376,0.0035661268,0.005065846,0.035990123,0.95413303,0.00015088085],"about_ca_topic_score_codex":0.00000455452,"about_ca_topic_score_gemma":0.00007817876,"teacher_disagreement_score":0.8987685,"about_ca_system_score_codex":0.000029751876,"about_ca_system_score_gemma":0.00004636827,"threshold_uncertainty_score":0.9967381},"labels":[],"label_agreement":null},{"id":"W2735993717","doi":"10.1609/aimag.v36i1.2576","title":"Reports of the Workshops Held at the Tenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE)","year":2015,"lang":"en","type":"article","venue":"AI Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Alberta","funders":"","keywords":"Entertainment; Computer science; Library science; Multimedia; Visual arts; Artificial intelligence; Engineering; Art","score_opus":0.05602108078505768,"score_gpt":0.2983076689628847,"score_spread":0.242286588177827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735993717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5739084,0.00036649994,0.35730466,0.049004238,0.0035878215,0.0014337663,0.0000196397,0.00017320579,0.014201795],"genre_scores_gemma":[0.9973729,0.000015746538,0.00025986743,0.000861086,0.00006768995,0.000019829298,0.0000015039877,0.000009909775,0.001391455],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980578,0.00009401843,0.0005432578,0.00047543287,0.0005476534,0.00028187232],"domain_scores_gemma":[0.9980304,0.00030565678,0.0003186716,0.0009767045,0.00025183058,0.00011671249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004369104,0.00020420928,0.00020312254,0.00005400826,0.00012980695,0.00028857836,0.0008150942,0.000056391826,0.000039771017],"category_scores_gemma":[0.00054057234,0.00011720022,0.00008357733,0.00030940937,0.00045427482,0.0004890313,0.0011236756,0.00026719607,0.00013357203],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030535067,0.0006480653,0.010123099,0.000021793196,0.00011597105,0.00016713575,0.017995343,0.002587193,0.0031059668,0.078382716,0.0107655665,0.8757818],"study_design_scores_gemma":[0.00021387218,0.0019596352,0.009334039,0.0010888058,0.00008501341,0.00081565464,0.007316423,0.14500353,0.4718247,0.3302721,0.030567765,0.0015184596],"about_ca_topic_score_codex":0.000033149787,"about_ca_topic_score_gemma":0.00016361159,"teacher_disagreement_score":0.87426335,"about_ca_system_score_codex":0.00010655673,"about_ca_system_score_gemma":0.00008873465,"threshold_uncertainty_score":0.47792864},"labels":[],"label_agreement":null},{"id":"W2736458122","doi":"10.1007/s40869-017-0040-9","title":"Behavior Trees for Modelling Artificial Intelligence in Games: A Tutorial","year":2017,"lang":"en","type":"article","venue":"The Computer Games Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Tree traversal; Tree (set theory); Maintainability; Scalability; Artificial intelligence; Reusability; Structuring; Extensibility; Machine learning; Component (thermodynamics); Node (physics); Human–computer interaction; Software engineering; Software; Programming language; Database","score_opus":0.11168812594352784,"score_gpt":0.34651727133098126,"score_spread":0.23482914538745342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736458122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05524167,0.00015578626,0.93570775,0.0023023863,0.0059772,0.00045577416,0.000002796762,0.000072531686,0.000084092615],"genre_scores_gemma":[0.83570576,0.00008185148,0.15961364,0.00019175473,0.004224403,0.00006800034,6.020177e-7,0.000027497883,0.000086472006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971822,0.00016031296,0.00091368833,0.00051865843,0.0005030451,0.0007221118],"domain_scores_gemma":[0.99712044,0.00046815854,0.0005999898,0.0013668973,0.00027434176,0.00017017176],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017407918,0.0003100434,0.00038963673,0.00022152097,0.001186645,0.002917391,0.0051851384,0.00012596465,0.000016231825],"category_scores_gemma":[0.00015647829,0.00022866829,0.00029017156,0.00015830825,0.0003324414,0.0012931349,0.00070089544,0.00058036414,0.000040338487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012858296,0.00018584759,0.00025451675,0.000006362161,0.000028405926,0.00008329404,0.004327891,0.06845831,0.00014224276,0.052389666,0.00053854304,0.87345636],"study_design_scores_gemma":[0.00009994607,0.00019628661,0.00050945755,0.00008939295,0.00001837666,0.00017081121,0.0001198992,0.8714444,0.0018786425,0.122943,0.0022343586,0.00029541692],"about_ca_topic_score_codex":0.000052293697,"about_ca_topic_score_gemma":0.00011469495,"teacher_disagreement_score":0.8731609,"about_ca_system_score_codex":0.00012211245,"about_ca_system_score_gemma":0.00018216071,"threshold_uncertainty_score":0.9981177},"labels":[],"label_agreement":null},{"id":"W2737372623","doi":"10.1609/aimag.v31i4.2312","title":"Computational Pool: A New Challenge for Game Theory Pragmatics","year":2010,"lang":"en","type":"article","venue":"AI Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Tournament; Computer science; Adversarial system; Action (physics); Pragmatics; Work (physics); Game theory; State (computer science); Computational model; Operations research; Artificial intelligence; Management science; Data science; Mathematical economics; Programming language; Engineering; Mathematics; Linguistics","score_opus":0.02556085818414389,"score_gpt":0.3041684774500252,"score_spread":0.2786076192658813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737372623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021208986,0.000053194763,0.9802487,0.013388185,0.0007863686,0.00029005684,0.0000040761297,0.00019519242,0.0029133472],"genre_scores_gemma":[0.6505343,0.0000062944805,0.3430589,0.0026117307,0.0005362144,0.000034743847,0.000008969589,0.000023500817,0.003185323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989204,0.000030075227,0.0002656841,0.00029104194,0.00022536512,0.0002674822],"domain_scores_gemma":[0.99861664,0.00054799294,0.000090098794,0.00043683898,0.00018300314,0.00012540059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039601602,0.00013248272,0.00014271897,0.00007535423,0.00007140776,0.00013171067,0.00074395456,0.0000766663,0.0001061605],"category_scores_gemma":[0.0003194396,0.00012228187,0.00007200111,0.00016227305,0.00008060725,0.00037429217,0.000151589,0.00020537274,0.0006650774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007812739,0.00006249588,0.000018664132,0.000010022897,0.000011555935,0.0000029908301,0.000999881,0.0009679002,0.00037425887,0.8204884,0.010670194,0.16638586],"study_design_scores_gemma":[0.00010828184,0.00009233669,0.00024953322,0.0000076062283,0.0000053535973,0.000011759786,0.000011980036,0.26444817,0.0007885766,0.67199475,0.06213889,0.0001427384],"about_ca_topic_score_codex":0.00000459317,"about_ca_topic_score_gemma":0.000046009718,"teacher_disagreement_score":0.6484134,"about_ca_system_score_codex":0.000012020639,"about_ca_system_score_gemma":0.00015064656,"threshold_uncertainty_score":0.8548446},"labels":[],"label_agreement":null},{"id":"W2739543091","doi":"10.5948/9781614441199.007","title":"Linear Diophantine Equations","year":2015,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Diophantine equation; Mathematics; Applied mathematics; Pure mathematics","score_opus":0.07068961052020784,"score_gpt":0.31364959158910444,"score_spread":0.2429599810688966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739543091","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048125717,0.000053596697,0.5225478,0.00047344287,0.000091879345,0.00021837951,0.000007589208,0.00029071778,0.4763118],"genre_scores_gemma":[0.0031959938,0.00002246822,0.28449285,0.0011262167,0.0005022262,0.00004682902,0.000009616981,0.000115272785,0.71048856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727446,0.000027516166,0.00069700764,0.0006521542,0.00088122865,0.0004676185],"domain_scores_gemma":[0.99708426,0.000604512,0.00048646194,0.0011852373,0.00031703012,0.00032251386],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047262278,0.0004627046,0.0007477637,0.000051884897,0.00016250307,0.00013415223,0.0014044076,0.0002200747,0.00021454111],"category_scores_gemma":[0.00019800087,0.00041399692,0.0005867203,0.00006669804,0.0011816246,0.00010470954,0.0006560288,0.00056456117,0.002501285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011565535,0.000022543778,2.275091e-7,0.000026927957,0.000086754284,0.000007464548,0.0013309965,0.000009674223,0.000025934645,0.95049506,0.005283465,0.042709783],"study_design_scores_gemma":[0.00004765946,0.00014192083,1.7702561e-7,0.00012479132,0.000057524743,0.000011644326,0.00012456095,0.04941981,0.0001748457,0.8465515,0.10277094,0.000574645],"about_ca_topic_score_codex":0.000015715732,"about_ca_topic_score_gemma":0.000002685168,"teacher_disagreement_score":0.23805493,"about_ca_system_score_codex":0.00014473923,"about_ca_system_score_gemma":0.00026273032,"threshold_uncertainty_score":0.9998312},"labels":[],"label_agreement":null},{"id":"W2739728626","doi":"","title":"Seepage in directed acyclic graphs.","year":2009,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; Dalhousie University; St. Francis Xavier University; Acadia University","funders":"","keywords":"Cartesian product; Directed acyclic graph; Combinatorics; Directed graph; Vertex (graph theory); Sink (geography); Graph; Mathematics; Cartesian coordinate system; Computer science; Discrete mathematics; Geography; Geometry; Cartography","score_opus":0.027793257691119722,"score_gpt":0.2917460034780117,"score_spread":0.263952745786892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739728626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9742477,0.000105883315,0.0092054615,0.004268303,0.00059752195,0.00030390144,0.0000015238298,0.00089413364,0.010375567],"genre_scores_gemma":[0.99285024,0.000024412218,0.0058129746,0.0005792743,0.000033292825,0.0000077624145,0.000001885075,0.0000072551325,0.00068291585],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983674,0.000080125574,0.00035866495,0.00043594692,0.0002649076,0.00049291365],"domain_scores_gemma":[0.99899065,0.00010747383,0.00007498525,0.00065895665,0.00004800601,0.000119946555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021630037,0.00018262517,0.00021200911,0.00023055257,0.00007070114,0.00014321704,0.0011370498,0.000102471466,0.000059757367],"category_scores_gemma":[0.000078081284,0.0001807244,0.00008103653,0.0010399066,0.000068742236,0.00055721076,0.000099290184,0.0002752433,0.00030581586],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000325466,0.0010871624,0.064988144,0.000016481377,0.000037703438,0.0005760957,0.0046534985,0.0009301897,0.016797872,0.36757982,0.019293575,0.5240069],"study_design_scores_gemma":[0.0004284066,0.00047535697,0.6076493,0.00011006142,0.00001136114,0.00004868868,0.00012410972,0.03016542,0.06836322,0.28093505,0.010634729,0.0010542753],"about_ca_topic_score_codex":0.00012398588,"about_ca_topic_score_gemma":0.00011068241,"teacher_disagreement_score":0.5426612,"about_ca_system_score_codex":0.00004843117,"about_ca_system_score_gemma":0.000036111993,"threshold_uncertainty_score":0.7369727},"labels":[],"label_agreement":null},{"id":"W2739741372","doi":"10.24963/ijcai.2017/513","title":"Focused Depth-first Proof Number Search using Convolutional Neural Networks for the Game of Hex","year":2017,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Convolutional neural network; Computer science; Heuristic; Node (physics); Branching (polymer chemistry); Value (mathematics); Artificial intelligence; Function (biology); Theoretical computer science; Algorithm; Machine learning","score_opus":0.1281617669474308,"score_gpt":0.360779666077797,"score_spread":0.23261789913036618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739741372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035435688,0.00004392908,0.96039134,0.002143594,0.00053375325,0.0004316202,0.0000015241226,0.000034332155,0.0009842312],"genre_scores_gemma":[0.9779857,0.000002778171,0.021340046,0.00009749306,0.00020230761,0.000021040156,3.8920086e-7,0.000008902581,0.00034137254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988361,0.00003266591,0.00025029312,0.0002614386,0.00028012102,0.0003393627],"domain_scores_gemma":[0.9981853,0.0005085379,0.00014496589,0.0008430134,0.00026273337,0.000055495377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044851657,0.00010541181,0.0001382311,0.000021647797,0.0006052972,0.0002799639,0.0017114113,0.000059963313,0.0000495744],"category_scores_gemma":[0.00014553579,0.000072002505,0.00010513775,0.000079375495,0.00039567862,0.00046962194,0.00042882905,0.00011907767,0.000010113666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116657226,0.00022827277,0.101856746,0.000053526062,0.00014316059,0.000007786006,0.001773759,0.29206467,0.00079409144,0.38984865,0.001985648,0.21112706],"study_design_scores_gemma":[0.000080377125,0.000029940373,0.004631283,0.000012078106,0.0000061718642,0.000007250045,0.000029345043,0.9848717,0.006789494,0.0031179679,0.0003309913,0.00009343924],"about_ca_topic_score_codex":0.0004391053,"about_ca_topic_score_gemma":0.00041887187,"teacher_disagreement_score":0.94255,"about_ca_system_score_codex":0.00003176018,"about_ca_system_score_gemma":0.00007437477,"threshold_uncertainty_score":0.4655518},"labels":[],"label_agreement":null},{"id":"W2742034366","doi":"10.3166/ria.31.311-335","title":"Approche de présélection multicritère à base de traces pour la prise de décision dans les applications interactives de type jeux","year":2017,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy; Mathematics","score_opus":0.10150888245296173,"score_gpt":0.3630867923261196,"score_spread":0.2615779098731579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742034366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085284,0.0019141096,0.8957635,0.007595125,0.00070779957,0.0007104953,0.000014508335,0.00019492808,0.00781554],"genre_scores_gemma":[0.83915913,0.001359043,0.13529976,0.00014902513,0.0006786121,0.00022488974,0.0000048459815,0.00007128523,0.023053395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957121,0.0007092148,0.00086767937,0.0011024652,0.00032090468,0.0012876402],"domain_scores_gemma":[0.9948593,0.001558318,0.0006110519,0.0018644705,0.00060841074,0.00049848366],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023575665,0.0004988027,0.00041800225,0.00021592212,0.0017093078,0.0014172054,0.0025961597,0.0005262057,0.0002553133],"category_scores_gemma":[0.003262373,0.00057062565,0.00028256245,0.0005097816,0.0009567235,0.001289314,0.00054005923,0.0010124018,0.0008026662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011039067,0.001299143,0.0056575667,0.00030916065,0.000069506044,0.0001287835,0.06594743,0.077363856,0.14461082,0.024408631,0.001679279,0.6784154],"study_design_scores_gemma":[0.000030736053,0.00010943163,0.00057219365,0.0004566743,0.00005622285,0.00028340323,0.006263505,0.60440254,0.34324706,0.014003682,0.030184723,0.00038983268],"about_ca_topic_score_codex":0.0036509202,"about_ca_topic_score_gemma":0.0009527732,"teacher_disagreement_score":0.7604637,"about_ca_system_score_codex":0.0008639643,"about_ca_system_score_gemma":0.0009833983,"threshold_uncertainty_score":0.9999753},"labels":[],"label_agreement":null},{"id":"W2743358237","doi":"10.1007/11871842_3","title":"Learning to Have Fun","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Metric (unit); Artificial intelligence; Applications of artificial intelligence; Multimedia; Human–computer interaction; Marketing","score_opus":0.024398507963071744,"score_gpt":0.27016773118830983,"score_spread":0.2457692232252381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743358237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017823526,0.00016721665,0.9789035,0.001127709,0.0017186773,0.00038304445,0.0000016640907,0.0003028453,0.017217109],"genre_scores_gemma":[0.357558,0.000018487559,0.6302678,0.0033384296,0.0013793804,0.000020976979,0.000004918472,0.00008627235,0.007325715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521667,0.000041430394,0.0006434293,0.0019393376,0.0012271369,0.000931983],"domain_scores_gemma":[0.997179,0.0005450203,0.00024900056,0.0014489066,0.00032296253,0.00025513518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091399316,0.00057997956,0.0005281136,0.0011081145,0.00035908152,0.0008900374,0.0045466316,0.00033212724,0.000033993652],"category_scores_gemma":[0.0002193009,0.0005644918,0.00015087609,0.00067722384,0.0005792205,0.00056499336,0.0021250818,0.0011497211,0.00049618515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023668426,0.000013242433,0.00013674308,0.000008995899,0.0000036502224,0.00008782434,0.0010613456,0.2775176,0.00012609009,0.007426199,0.00012055737,0.7134954],"study_design_scores_gemma":[0.000071730195,0.000428499,0.00011523437,0.00041646397,0.000006567111,0.000061652725,0.0000011622466,0.7784922,0.008620188,0.1885891,0.021892415,0.0013047553],"about_ca_topic_score_codex":0.00011481512,"about_ca_topic_score_gemma":0.00021645345,"teacher_disagreement_score":0.7121906,"about_ca_system_score_codex":0.0003918287,"about_ca_system_score_gemma":0.0004000173,"threshold_uncertainty_score":0.99968064},"labels":[],"label_agreement":null},{"id":"W2749155280","doi":"10.1371/journal.pcbi.1005955","title":"Ten simple rules to create a serious game, illustrated with examples from structural biology","year":2018,"lang":"en","type":"editorial","venue":"PLoS Computational Biology","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"CONTEST; Outreach; Set (abstract data type); Simple (philosophy); Field (mathematics); Computer science; Public relations; Engineering ethics; Management science; Political science; Engineering; Epistemology; Mathematics; Law","score_opus":0.028984738198619735,"score_gpt":0.30187441441530766,"score_spread":0.2728896762166879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749155280","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20894866,0.00027843536,0.4124874,0.0008742436,0.36991042,0.0012614002,0.0048767463,0.0009967469,0.0003659585],"genre_scores_gemma":[0.20473608,0.00002804641,0.25392604,0.0008038125,0.5236961,0.00022687585,0.016266517,0.00014372743,0.00017278775],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99609464,0.00037807925,0.0007502147,0.0015935631,0.00043496263,0.000748562],"domain_scores_gemma":[0.9942402,0.0031368202,0.00045528158,0.0006865449,0.0012393653,0.00024178218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017365061,0.00063439814,0.00085914356,0.0003466388,0.0002316281,0.00023924612,0.002141971,0.0009290201,0.0001976446],"category_scores_gemma":[0.0007077632,0.0005017298,0.00010471451,0.00043449865,0.0006675991,0.00019778515,0.00070605776,0.00057203555,0.000631142],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009351912,0.0003175874,0.004547509,0.000090166264,0.0024529633,0.00015172373,0.0038796945,0.019672526,0.0031540361,0.041189466,0.8734345,0.050174642],"study_design_scores_gemma":[0.0006613965,0.0034752593,0.0021811882,0.00016459097,0.00012395461,0.000023020897,0.00007493801,0.090182,0.0013891675,0.45419627,0.44532198,0.0022062284],"about_ca_topic_score_codex":0.0016449107,"about_ca_topic_score_gemma":0.0005060461,"teacher_disagreement_score":0.4281125,"about_ca_system_score_codex":0.00015356037,"about_ca_system_score_gemma":0.00075628515,"threshold_uncertainty_score":0.99974346},"labels":[],"label_agreement":null},{"id":"W2753254616","doi":"10.1145/3102071.3106345","title":"Exploration in NetHack using occupancy maps","year":2017,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Computer science; Occupancy; Automation; Face (sociological concept); Artificial intelligence; Point (geometry); Robotics; Resource (disambiguation); Machine learning; Feature (linguistics); Heuristic; Robot; Human–computer interaction; Engineering; Mathematics","score_opus":0.1950536570043825,"score_gpt":0.38036451110263325,"score_spread":0.18531085409825074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753254616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108687975,0.000016516306,0.87829804,0.000986896,0.0004963315,0.00008669574,1.9089516e-7,0.000066289525,0.011361078],"genre_scores_gemma":[0.9349951,0.000005564878,0.06449916,0.00011107014,0.000054091295,0.0000033229378,2.1312192e-7,0.0000032235478,0.00032824112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993394,0.000023006744,0.0001548553,0.0002041702,0.00011832384,0.0001602293],"domain_scores_gemma":[0.99911,0.000024408544,0.000077692275,0.000719906,0.000036770954,0.00003123994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019218592,0.0000609615,0.00007093622,0.000057244164,0.0001667709,0.00039085388,0.00088588224,0.000035221477,0.000020271385],"category_scores_gemma":[0.000103656144,0.0000565206,0.000019948284,0.00006723006,0.000044215492,0.0021562339,0.00024493405,0.00006192695,0.0001793893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009582024,0.000112278794,0.09161707,0.000011008918,0.0000067589413,0.000069643895,0.0051495465,0.004197712,0.0064085526,0.47514692,0.0015145042,0.41575643],"study_design_scores_gemma":[0.0000735531,0.00003037223,0.009873455,0.000038203827,0.0000013429502,0.0000046109467,0.000217405,0.7733045,0.053957887,0.16047204,0.0017665258,0.0002600817],"about_ca_topic_score_codex":0.00060286734,"about_ca_topic_score_gemma":0.00046542866,"teacher_disagreement_score":0.8263071,"about_ca_system_score_codex":0.000028610175,"about_ca_system_score_gemma":0.00003252181,"threshold_uncertainty_score":0.3769013},"labels":[],"label_agreement":null},{"id":"W2754879180","doi":"10.1613/jair.5699","title":"Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents","year":2018,"lang":"en","type":"preprint","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Innovates; Alberta Innovates - Technology Futures; Alberta Machine Intelligence Institute; Compute Canada; DeepMind; National Science Foundation","keywords":"Variety (cybernetics); Computer science; Benchmark (surveying); Key (lock); Field (mathematics); Data science; Best practice; State (computer science); Management science; Artificial intelligence; Engineering; Computer security; Political science","score_opus":0.49202711936732824,"score_gpt":0.5281472299857938,"score_spread":0.03612011061846554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754879180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028016062,0.00089895027,0.92830753,0.008870284,0.00075741415,0.032422516,0.000007447307,0.00003238358,0.00068739074],"genre_scores_gemma":[0.72156096,0.0024499423,0.23749515,0.00028589705,0.014444738,0.022401497,0.000019706795,0.00022555632,0.0011165865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913915,0.0022887783,0.0019440417,0.0008708995,0.0026374743,0.00086735416],"domain_scores_gemma":[0.99311304,0.0015147041,0.0015199129,0.0009487123,0.0026492588,0.000254399],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.03811995,0.00034290698,0.00060558174,0.00050782115,0.0011658409,0.0035673347,0.0060819145,0.00031498907,0.00013450763],"category_scores_gemma":[0.0045937216,0.00025266895,0.00023720652,0.00047925208,0.00075925986,0.00089079305,0.0056330874,0.002619629,0.00006736234],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013812596,0.00011046908,0.00021442902,0.00020637792,0.00011104503,0.000010349765,0.005573101,0.039547093,0.0017674891,0.014782822,0.00046700652,0.9370717],"study_design_scores_gemma":[0.00003873285,0.0006111695,0.000082067774,0.0009582578,0.000029301578,0.000030394065,0.0008029807,0.62088555,0.021886542,0.34459877,0.009816111,0.00026010428],"about_ca_topic_score_codex":0.00010970743,"about_ca_topic_score_gemma":0.000012704727,"teacher_disagreement_score":0.93681157,"about_ca_system_score_codex":0.00048385482,"about_ca_system_score_gemma":0.0010537917,"threshold_uncertainty_score":0.99999255},"labels":[],"label_agreement":null},{"id":"W2756674674","doi":"10.1609/aiide.v13i1.12923","title":"Learning Combat in NetHack","year":2021,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scripting language; Computer science; Automation; Adversary; Variety (cybernetics); Point (geometry); Action (physics); Artificial intelligence; Human–computer interaction; Space (punctuation); Software engineering; Machine learning; Programming language; Computer security; Engineering","score_opus":0.04371482850026954,"score_gpt":0.2891511786187464,"score_spread":0.24543635011847686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756674674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9449553,0.00006545974,0.013359952,0.004848044,0.0005629308,0.0004390805,0.000006072886,0.00007353227,0.035689645],"genre_scores_gemma":[0.9985744,0.000084966225,0.00030781736,0.0002948523,0.000029380224,0.000025659854,0.0000013399258,0.000012319282,0.0006692709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99784666,0.00003270008,0.00066190097,0.0006304811,0.00044076002,0.00038749323],"domain_scores_gemma":[0.9986459,0.00021745797,0.00030538123,0.00023664055,0.00049510854,0.00009948102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024254587,0.00026870045,0.00031993157,0.00014825242,0.0001217331,0.00072764396,0.00094845187,0.000077455494,0.00006206336],"category_scores_gemma":[0.00066964224,0.00021526954,0.00013454298,0.0005109053,0.00025821122,0.0013436239,0.0008174733,0.00049790443,0.00006400165],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001277213,0.00064752344,0.0061384225,0.00003900703,0.000044203465,0.000011161488,0.0076563046,0.0002327798,0.022614261,0.5893441,0.00006115045,0.37308335],"study_design_scores_gemma":[0.000054679054,0.000659675,0.0009306919,0.00068156794,0.000008140591,0.000026321546,0.012931163,0.06013257,0.8055604,0.118006214,0.0006106467,0.0003979056],"about_ca_topic_score_codex":0.00002841452,"about_ca_topic_score_gemma":0.00001775935,"teacher_disagreement_score":0.78294617,"about_ca_system_score_codex":0.00010873773,"about_ca_system_score_gemma":0.00007398223,"threshold_uncertainty_score":0.87784374},"labels":[],"label_agreement":null},{"id":"W2757125855","doi":"10.1609/aiide.v13i1.12927","title":"Deep Learning for Real-Time Heuristic Search Algorithm Selection","year":2017,"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":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Classifier (UML); Incremental heuristic search; Machine learning; Portfolio; Beam search; Artificial intelligence; Heuristic; Algorithm; Search algorithm; Data mining","score_opus":0.04766932784270206,"score_gpt":0.31756315292444887,"score_spread":0.2698938250817468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757125855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27135843,0.00001947248,0.6950214,0.003684611,0.00087824545,0.0018676643,0.00001967658,0.00019020512,0.026960293],"genre_scores_gemma":[0.9962777,0.00006598142,0.002325394,0.000054451135,0.00009356381,0.00007310442,0.0000018622944,0.000019718553,0.0010882481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978529,0.00001949961,0.00055448094,0.0006666552,0.00045443603,0.00045198968],"domain_scores_gemma":[0.9979263,0.00025407027,0.00055683655,0.0003061352,0.0008309852,0.00012566111],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003723747,0.00029791583,0.0003225776,0.00013612052,0.0008096836,0.0019757554,0.0016758466,0.00008570691,0.000035462628],"category_scores_gemma":[0.00086130266,0.00023478847,0.00017726715,0.00012921808,0.00042633354,0.0018880962,0.0007068692,0.00033152752,0.00007203208],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020026823,0.00028569752,0.00077543623,0.00003702233,0.000069604605,8.089142e-7,0.002671084,0.00014569836,0.016153445,0.14316538,0.00004475222,0.8364508],"study_design_scores_gemma":[0.000039736417,0.0008722091,0.00036937767,0.00024355037,0.000014362698,0.000008084571,0.0015950233,0.62842953,0.32526264,0.042717684,0.00017484529,0.00027294978],"about_ca_topic_score_codex":0.00007296681,"about_ca_topic_score_gemma":0.0000056116683,"teacher_disagreement_score":0.8361778,"about_ca_system_score_codex":0.00012438827,"about_ca_system_score_gemma":0.000049107857,"threshold_uncertainty_score":0.9990603},"labels":[],"label_agreement":null},{"id":"W2757818082","doi":"10.1609/aiide.v13i1.12910","title":"Crowdsourced Social Media Poetry","year":2017,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Crowdsourcing; Poetry; Creativity; Domain (mathematical analysis); Computer science; Social media; Artificial intelligence; Data science; World Wide Web; Art; Literature; Psychology; Social psychology","score_opus":0.06869993821997361,"score_gpt":0.3079221676523013,"score_spread":0.23922222943232768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757818082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86313176,0.000023769951,0.019008322,0.015634676,0.0017464028,0.000795834,0.000044421507,0.0001502652,0.09946457],"genre_scores_gemma":[0.99902767,0.000020174313,0.0002103421,0.00022822499,0.00013885298,0.00002962455,9.78448e-7,0.000017216229,0.00032693718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976047,0.000015118633,0.0006462263,0.00066516764,0.00061992457,0.0004488492],"domain_scores_gemma":[0.9978839,0.00017420806,0.0007964735,0.00048150914,0.00052813377,0.00013578014],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002593026,0.0003488818,0.00036844562,0.0001360232,0.0007893175,0.002360235,0.002965675,0.00010952901,0.000057097048],"category_scores_gemma":[0.001144527,0.00026179358,0.00021633496,0.00013911915,0.00085213693,0.0023653645,0.0014302394,0.00038899007,0.00009629564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015634966,0.00029229812,0.0008554505,0.000021422262,0.00005569843,0.0000020718965,0.009063831,0.0000024750254,0.0073125567,0.58569264,0.0002079444,0.3963373],"study_design_scores_gemma":[0.000084707666,0.00044936378,0.0041806726,0.0005030719,0.000026950716,0.000016345217,0.011174588,0.013597792,0.7022243,0.26615432,0.0008869618,0.0007008936],"about_ca_topic_score_codex":0.000023117444,"about_ca_topic_score_gemma":0.000010579937,"teacher_disagreement_score":0.6949118,"about_ca_system_score_codex":0.00009132172,"about_ca_system_score_gemma":0.000048972895,"threshold_uncertainty_score":0.99998343},"labels":[],"label_agreement":null},{"id":"W2759607370","doi":"10.1609/aiide.v13i1.12943","title":"Robustness of Real-Time Heuristic Search Algorithms to Read/Write Error in Externally Stored Heuristics","year":2017,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Incremental heuristic search; Computer science; Null-move heuristic; Heuristic; Consistent heuristic; Beam search; Robustness (evolution); Redundancy (engineering); Algorithm; Hyper-heuristic; Search algorithm; Artificial intelligence","score_opus":0.0680138195887928,"score_gpt":0.33286294498548796,"score_spread":0.26484912539669514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759607370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9235331,0.000010104022,0.061512902,0.0028597435,0.00058012566,0.00096345576,0.00005001372,0.00004281149,0.010447752],"genre_scores_gemma":[0.9973299,0.000046512174,0.0018342518,0.000057767164,0.000058178968,0.000036468777,0.0000012056471,0.000020034915,0.00061568717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970629,0.000029436238,0.000962368,0.00073996786,0.00071867794,0.00048664436],"domain_scores_gemma":[0.99744564,0.00022590553,0.00066669367,0.0006346257,0.0008419714,0.00018514335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004999476,0.0003512353,0.00051759166,0.0002793138,0.00022102828,0.0009341891,0.0027777646,0.000091064525,0.000042595842],"category_scores_gemma":[0.0010313323,0.0002835906,0.0001442953,0.0002470716,0.00071217946,0.0014062218,0.0013831822,0.00034029098,0.00003953889],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015757029,0.002170934,0.0071974443,0.00022912951,0.00016180029,0.000023777473,0.015759718,0.0032201444,0.053954493,0.24913155,0.00018215824,0.66639316],"study_design_scores_gemma":[0.000118054944,0.0016973222,0.0049646255,0.0022822816,0.000024039835,0.000017370638,0.005809007,0.4956734,0.46740103,0.021202343,0.00007887416,0.00073164684],"about_ca_topic_score_codex":0.0003489473,"about_ca_topic_score_gemma":0.000037676986,"teacher_disagreement_score":0.6656615,"about_ca_system_score_codex":0.00014794499,"about_ca_system_score_gemma":0.00008779358,"threshold_uncertainty_score":0.9999616},"labels":[],"label_agreement":null},{"id":"W2763490101","doi":"10.5539/jmr.v9n6p24","title":"Gray Code in the Solution of the Nine Rings Chinese Game","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; SWORD; Ring (chemistry); Repetition (rhetorical device); Code (set theory); Mathematical induction; Combinatorics; Function (biology); Binary number; Discrete mathematics; Algorithm; Computer science; Arithmetic; Programming language; Geometry","score_opus":0.18516050615480145,"score_gpt":0.4588439693966849,"score_spread":0.2736834632418835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763490101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92583156,0.00011823377,0.06023696,0.010618886,0.00026003938,0.00021051956,7.9619326e-7,0.0000038081057,0.0027191944],"genre_scores_gemma":[0.99223304,0.00004609709,0.0073810513,0.000020092106,0.00008647064,0.0000024860228,1.4313255e-8,0.0000048647025,0.00022589114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975025,0.00025360615,0.00052972016,0.00008636611,0.0013865638,0.00024126358],"domain_scores_gemma":[0.9970071,0.00084016594,0.00057530054,0.001023552,0.0005152299,0.000038692062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0083629675,0.000069656744,0.00018368792,0.00016362991,0.0002651523,0.0002799593,0.0048384587,0.000042923813,0.000012099653],"category_scores_gemma":[0.003929331,0.000031924126,0.000105016865,0.00028533585,0.0003654673,0.00040235338,0.00059767754,0.0006278436,0.000014268335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013527133,0.004926709,0.11800745,0.0009660149,0.0002286389,0.00036211516,0.2302406,0.0029782508,0.108542934,0.43393695,0.018069675,0.08160538],"study_design_scores_gemma":[0.00037312412,0.00040810223,0.08503636,0.0008897075,0.0000108286085,0.00036484463,0.0023136162,0.19374439,0.035064314,0.6805385,0.0010646294,0.00019158784],"about_ca_topic_score_codex":0.00006067177,"about_ca_topic_score_gemma":0.00013252684,"teacher_disagreement_score":0.24660154,"about_ca_system_score_codex":0.00005448006,"about_ca_system_score_gemma":0.00013835798,"threshold_uncertainty_score":0.899114},"labels":[],"label_agreement":null},{"id":"W2765697924","doi":"","title":"Workshop on Literature in Cognition and Computers","year":2006,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cognition; Cognitive science; The arts; Psychology; Scope (computer science); Cognitive psychology; Computer science; Art; Visual arts","score_opus":0.015308635816411018,"score_gpt":0.22684617750040378,"score_spread":0.21153754168399277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765697924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8923081,0.0010177719,0.043892846,0.0059690634,0.00061107107,0.00068229315,0.00047830064,0.0012122534,0.053828306],"genre_scores_gemma":[0.993508,0.000018791749,0.0047466625,0.0010748114,0.00013254426,0.000011820704,0.00014828307,0.000025072794,0.0003340192],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841505,0.00006591977,0.00035292568,0.0005328612,0.00026841613,0.00036481224],"domain_scores_gemma":[0.99911314,0.00031599845,0.00007773091,0.00033742056,0.000029442082,0.00012627964],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000114402595,0.00023644745,0.0001819315,0.0002867755,0.00008339204,0.0035837141,0.00057761575,0.00014280381,0.000018647395],"category_scores_gemma":[0.00010383077,0.00021826616,0.000063585976,0.0008402892,0.00008757156,0.0056063067,0.00028444148,0.0004357967,0.0005610127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002514044,0.0012612228,0.14434019,0.00012252523,0.000037828624,0.0009791639,0.00052456086,0.0008712329,0.0005999342,0.33770725,0.015063198,0.49824148],"study_design_scores_gemma":[0.00093901524,0.0003076817,0.043321144,0.002034078,0.000010521245,0.00010027824,0.00008462068,0.024713062,0.020542067,0.79319143,0.11288058,0.001875494],"about_ca_topic_score_codex":0.0000018052572,"about_ca_topic_score_gemma":0.0000026029597,"teacher_disagreement_score":0.496366,"about_ca_system_score_codex":0.00002147026,"about_ca_system_score_gemma":0.000027632024,"threshold_uncertainty_score":0.99745065},"labels":[],"label_agreement":null},{"id":"W2765775789","doi":"10.1145/3131284","title":"Heads-up limit hold'em poker is solved","year":2017,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Perfect information; Limit (mathematics); Imperfect; Computer science; Computation; Combinatorial game theory; Mathematical economics; Sequential game; Extensive-form game; Game theory; Theoretical computer science; Algorithm; Mathematics","score_opus":0.1735325352864427,"score_gpt":0.3759081998816928,"score_spread":0.20237566459525008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765775789","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11522909,0.0022208528,0.014868501,0.8430842,0.0017938591,0.0006789288,0.000018221508,0.00025839687,0.021847943],"genre_scores_gemma":[0.91232634,0.00020779211,0.08591447,0.0006325886,0.000021052902,0.000015522575,5.572639e-7,0.000007405397,0.00087428273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913573,0.00010066902,0.00025175672,0.00016975171,0.00018248477,0.0001595775],"domain_scores_gemma":[0.92202854,0.00025986444,0.00028754186,0.077214845,0.00017191062,0.000037280653],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0003629784,0.000087860455,0.00012455406,0.00003685539,0.001043295,0.00024120876,0.102171086,0.000051026145,0.000016318525],"category_scores_gemma":[0.005916355,0.00006759731,0.000119334916,0.00011589246,0.00050547125,0.00044369983,0.051150866,0.00019494443,0.00017780608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015958556,0.00063199125,0.024046266,0.000029535302,0.00017735257,8.965127e-7,0.026784869,0.00010687788,0.01418555,0.36828223,0.3328185,0.23291996],"study_design_scores_gemma":[0.00014705243,0.000047068963,0.04428506,0.00013875848,0.000032026997,0.0000063092657,0.00051775423,0.03280975,0.123303756,0.73075265,0.06760374,0.00035609235],"about_ca_topic_score_codex":0.0001415857,"about_ca_topic_score_gemma":0.00016191309,"teacher_disagreement_score":0.84245163,"about_ca_system_score_codex":0.000022919387,"about_ca_system_score_gemma":0.00006139221,"threshold_uncertainty_score":0.95652324},"labels":[],"label_agreement":null},{"id":"W2765848027","doi":"10.1109/cig.2017.8080410","title":"General video game playing escapes the no free lunch theorem","year":2017,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Video game design; Multimedia; Computer graphics (images); Mathematical economics; Game mechanics; Mathematics","score_opus":0.03430432890772098,"score_gpt":0.2914204591833838,"score_spread":0.2571161302756628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765848027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106787585,0.00012968156,0.6064677,0.012150478,0.0024048127,0.00029361655,0.000002142735,0.00038491437,0.27137905],"genre_scores_gemma":[0.9608268,0.00001779349,0.030455455,0.0011838737,0.00051777,0.000016802405,2.3027464e-7,0.000011555825,0.0069697276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986144,0.0000616943,0.00022985514,0.00038167933,0.00033999624,0.0003724054],"domain_scores_gemma":[0.9966206,0.00022940128,0.00014220177,0.0028075404,0.00012551762,0.00007472433],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005337531,0.00015348803,0.00013355694,0.00003397601,0.0008782579,0.0012885893,0.0059859175,0.00006084671,0.00025889088],"category_scores_gemma":[0.0006240847,0.000091548885,0.00009437773,0.000063075575,0.00028356834,0.00083574484,0.0014801554,0.00017233215,0.0011418127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056476397,0.000025836134,0.0025398333,0.0000031953552,0.000020954893,0.000014091796,0.0013235164,0.00017133991,0.003105308,0.90397024,0.016150346,0.072669715],"study_design_scores_gemma":[0.0001310322,0.00008725424,0.008988725,0.000031534513,0.000010774303,0.000025422321,0.00014306081,0.6091431,0.058637697,0.28585106,0.036420725,0.0005296555],"about_ca_topic_score_codex":0.00047237027,"about_ca_topic_score_gemma":0.00020511526,"teacher_disagreement_score":0.8540392,"about_ca_system_score_codex":0.000024116403,"about_ca_system_score_gemma":0.000048325797,"threshold_uncertainty_score":0.9997482},"labels":[],"label_agreement":null},{"id":"W2767141304","doi":"10.1109/cig.2017.8080452","title":"Improving hearthstone AI by learning high-level rollout policies and bucketing chance node events","year":2017,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Monte Carlo tree search; Entertainment; Adversary; Video game; State (computer science); Node (physics); Artificial intelligence; Game tree; Action (physics); Computer security; Sequential game; Multimedia; Game theory; Programming language; Monte Carlo method; Mathematical economics; Engineering; Visual arts","score_opus":0.03426155760626678,"score_gpt":0.3060478462723761,"score_spread":0.2717862886661093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767141304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48508716,0.00013671946,0.50858146,0.00477534,0.0003414319,0.00011529429,0.0000019253878,0.00018823126,0.00077244604],"genre_scores_gemma":[0.9760949,0.000029052353,0.019165004,0.000651523,0.00010641773,0.000008766596,6.6353357e-7,0.00001436278,0.0039293137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848574,0.000053527776,0.0002546844,0.0004683452,0.00027355156,0.0004641602],"domain_scores_gemma":[0.99881506,0.000104649866,0.00022272531,0.0006509267,0.000089287474,0.000117341755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004594673,0.00017666185,0.0002017709,0.00006287349,0.0011318148,0.00066198205,0.0009784786,0.00007448359,0.000018560397],"category_scores_gemma":[0.00043434152,0.00016502157,0.000039342827,0.000060882794,0.00014017856,0.0011211104,0.0008710435,0.00026219327,0.00009463485],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017813176,0.00009304293,0.10186904,0.000050741786,0.00003923731,0.000014153627,0.005103541,0.000561882,0.13142194,0.026705679,0.0011916418,0.7329313],"study_design_scores_gemma":[0.0005014553,0.00028969994,0.09220776,0.0002103554,0.000017952401,0.00004434728,0.0007273174,0.48922718,0.40120462,0.008554903,0.00557844,0.0014359627],"about_ca_topic_score_codex":0.0048242,"about_ca_topic_score_gemma":0.0001807707,"teacher_disagreement_score":0.7314953,"about_ca_system_score_codex":0.000028028782,"about_ca_system_score_gemma":0.000035052926,"threshold_uncertainty_score":0.8705119},"labels":[],"label_agreement":null},{"id":"W2767806554","doi":"10.1109/tg.2018.2861759","title":"Exploration in NetHack With Secret Discovery","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Automation; Point (geometry); Greedy algorithm; Feature (linguistics); Face (sociological concept); Identification (biology)","score_opus":0.0362188523720771,"score_gpt":0.27777378049138646,"score_spread":0.24155492811930934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767806554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07797594,0.000010067235,0.9194468,0.0008087681,0.0005064096,0.00014892894,0.000002455475,0.00013790905,0.00096268597],"genre_scores_gemma":[0.98981905,0.000017205397,0.008949008,0.0002736001,0.00006853154,0.000047656136,4.364938e-7,0.00001192351,0.0008125756],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890345,0.000060275772,0.000203912,0.00035827124,0.00023703586,0.00023706384],"domain_scores_gemma":[0.99928194,0.00009246394,0.000048673413,0.00045663933,0.000068825655,0.000051465315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012933534,0.0001366711,0.00012114818,0.00019497468,0.000105497864,0.0001887434,0.0003855324,0.000057701116,0.00004043482],"category_scores_gemma":[0.0000043716423,0.00011483276,0.000039336035,0.0005631902,0.00016821781,0.0019617185,0.000002069979,0.00016864609,0.0002330865],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005068174,0.0012361124,0.0008994898,0.000040860054,0.00008940574,0.00009239192,0.035567135,0.124334104,0.010101236,0.019357875,0.0012510646,0.8065235],"study_design_scores_gemma":[0.0003820048,0.0015890067,0.0008259862,0.00015906426,0.00001621472,0.000026242713,0.00133262,0.15107778,0.829636,0.011318199,0.0029457277,0.000691183],"about_ca_topic_score_codex":0.00012850093,"about_ca_topic_score_gemma":0.0015493205,"teacher_disagreement_score":0.9118431,"about_ca_system_score_codex":0.000055242916,"about_ca_system_score_gemma":0.00006475965,"threshold_uncertainty_score":0.46827438},"labels":[],"label_agreement":null},{"id":"W2768050560","doi":"10.1016/j.disc.2017.10.009","title":"A note on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>k</mml:mi></mml:math>-cop-win graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scroll; Graph; Mathematics; Combinatorics; Discrete mathematics; Algorithm; Theology","score_opus":0.028265365783923486,"score_gpt":0.28287838718056013,"score_spread":0.25461302139663666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768050560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9288127,0.00010797134,0.058507483,0.0009666351,0.0013365254,0.00016231519,0.00008375224,0.00033390205,0.009688762],"genre_scores_gemma":[0.9605858,0.00012332783,0.037545774,0.00067544373,0.0004078391,0.00016390704,0.000039325056,0.0001477279,0.00031089893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995755,0.000078957426,0.0009909833,0.00093326886,0.0012574485,0.0009843305],"domain_scores_gemma":[0.99459004,0.0006763512,0.0010680606,0.0032080736,0.000113820315,0.0003436492],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00095270993,0.000564152,0.00042095585,0.00017261195,0.0011747376,0.0014708639,0.003036137,0.00047219582,0.00005042601],"category_scores_gemma":[0.0011029408,0.0005878835,0.0005868233,0.00028259688,0.00062347023,0.0010841412,0.0014078327,0.0006417875,0.0029959888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049315586,0.00018870065,0.000012246283,0.00023041126,0.000117044285,0.0001904834,0.0036577526,0.00038188987,0.0006805693,0.9899493,0.00071810983,0.003824163],"study_design_scores_gemma":[0.00024236429,0.00034478543,0.000051090814,0.00061901606,0.00010793872,0.00009677179,0.00044232907,0.94826835,0.017140055,0.030449554,0.0016428194,0.0005949349],"about_ca_topic_score_codex":0.00018749412,"about_ca_topic_score_gemma":0.00013865494,"teacher_disagreement_score":0.9594998,"about_ca_system_score_codex":0.000030048526,"about_ca_system_score_gemma":0.00023601246,"threshold_uncertainty_score":0.9996573},"labels":[],"label_agreement":null},{"id":"W2779033804","doi":"10.1007/978-3-319-71649-7_9","title":"Exploring Positional Linear Go","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Set (abstract data type); Solver; Algorithm; Theoretical computer science; Programming language","score_opus":0.11204420023319324,"score_gpt":0.30427677475744375,"score_spread":0.19223257452425052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779033804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000926936,0.00020183939,0.98278815,0.0012251304,0.0037119947,0.0002460662,0.0000049371843,0.000199875,0.011529294],"genre_scores_gemma":[0.1977977,0.00017644413,0.7959663,0.0015993573,0.0024216447,0.000036136447,0.000007301404,0.00007447763,0.0019206158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995961,0.000023559205,0.00052403565,0.0015820988,0.0011967913,0.0007125314],"domain_scores_gemma":[0.99650306,0.00043152706,0.00034968337,0.0021782648,0.00033162432,0.00020586952],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007702097,0.0005055699,0.0004605804,0.00069031876,0.0006269723,0.00090343907,0.006077937,0.0002340941,0.00004011462],"category_scores_gemma":[0.0001927242,0.0004877964,0.00016907403,0.00019547292,0.0011293457,0.001860354,0.0020827907,0.00090047106,0.0004700398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039319875,0.000021225906,0.00003038988,0.000015772965,0.000009427521,0.00017356136,0.0008188284,0.015843248,0.00014807523,0.08473432,0.000014599092,0.8981866],"study_design_scores_gemma":[0.00007280562,0.00014976275,0.00010576195,0.0005661463,0.000006478454,0.0001009184,1.5611604e-7,0.5257284,0.008414592,0.4598107,0.0041542454,0.00089004246],"about_ca_topic_score_codex":0.000034755427,"about_ca_topic_score_gemma":0.00005359986,"teacher_disagreement_score":0.89729655,"about_ca_system_score_codex":0.0002950055,"about_ca_system_score_gemma":0.0005692697,"threshold_uncertainty_score":0.99975735},"labels":[],"label_agreement":null},{"id":"W2781375226","doi":"10.1109/tg.2017.2785042","title":"Move Prediction Using Deep Convolutional Neural Networks in &lt;italic&gt;Hex&lt;/italic&gt;","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convolutional neural network; Deep learning; Monte Carlo tree search; Computer science; Deep neural networks; Champion; Artificial neural network; Artificial intelligence; Machine learning; Monte Carlo method; Mathematics; Statistics","score_opus":0.035705505595701376,"score_gpt":0.2824381058683625,"score_spread":0.2467326002726611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781375226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1662628,0.0001752661,0.8285668,0.0004931501,0.003362812,0.00031988483,0.000028284992,0.00023680694,0.000554214],"genre_scores_gemma":[0.99431914,0.00005464417,0.004694989,0.00022279158,0.00027823274,0.00006344941,0.000003462606,0.00003409196,0.00032920536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971968,0.0001382733,0.00063538505,0.00078501756,0.0005723173,0.00067223265],"domain_scores_gemma":[0.9979404,0.00019960565,0.00027769982,0.001214577,0.00017634107,0.00019136292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036869288,0.00036583893,0.00034214617,0.00033262544,0.0009107014,0.0005974798,0.001304326,0.0002622927,0.00007075271],"category_scores_gemma":[0.000039986324,0.00038510736,0.00022961997,0.00035562212,0.00043332277,0.001960071,0.000021220898,0.0005127888,0.000065244865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072316114,0.00036649176,0.0009847529,0.000014328529,0.000064911306,0.00004735923,0.0010680904,0.89260375,0.0045635165,0.0038401114,0.00018698473,0.09618736],"study_design_scores_gemma":[0.00023998925,0.00012303397,0.005219047,0.000058629656,0.000026286927,0.000051971256,0.00006548238,0.98602295,0.006235508,0.0011759673,0.0004286106,0.00035250912],"about_ca_topic_score_codex":0.0002690601,"about_ca_topic_score_gemma":0.0008064269,"teacher_disagreement_score":0.82805634,"about_ca_system_score_codex":0.00029542044,"about_ca_system_score_gemma":0.000101717866,"threshold_uncertainty_score":0.9998601},"labels":[],"label_agreement":null},{"id":"W2784303387","doi":"","title":"A computational narrative simulation system for constructing multi-linear narratives in knowledge management","year":2013,"lang":"en","type":"article","venue":"Journal of Knowledge Management and Practice","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Narrative; Computer science; Knowledge management; Art; Literature","score_opus":0.06668742083164873,"score_gpt":0.37345699429408447,"score_spread":0.3067695734624357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784303387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074018277,0.0010349188,0.96114963,0.0006359385,0.00081426033,0.0009770598,6.546781e-7,0.000035433775,0.027950287],"genre_scores_gemma":[0.625444,0.00002778502,0.37400526,0.000032595784,0.0000913604,0.000028536775,6.047546e-7,0.00000790894,0.00036198893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981874,0.00035899848,0.00075156835,0.00026690416,0.00021372219,0.00022140477],"domain_scores_gemma":[0.9965337,0.0017505233,0.0006658609,0.00014561454,0.00082121877,0.000083111525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001538356,0.00017475337,0.00026577394,0.00042254032,0.00019630583,0.00024225352,0.0003864573,0.00004864708,0.0000066117304],"category_scores_gemma":[0.00024585237,0.00015645091,0.00007254793,0.00042198418,0.000074628035,0.0021417341,0.00022682335,0.00017641102,0.000031717376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030717498,0.0010952292,0.0008590679,0.0011850242,0.0007800762,0.0001073164,0.12945104,0.05952555,0.00006637127,0.43013173,0.0010824233,0.375409],"study_design_scores_gemma":[0.0012321342,0.0002255776,0.00061030453,0.00046845194,0.000065330816,0.00007768785,0.16943465,0.8089546,0.00007790229,0.0042935153,0.014281316,0.00027853993],"about_ca_topic_score_codex":0.000002485947,"about_ca_topic_score_gemma":0.000006721384,"teacher_disagreement_score":0.74942905,"about_ca_system_score_codex":0.00013546848,"about_ca_system_score_gemma":0.000037785292,"threshold_uncertainty_score":0.6379883},"labels":[],"label_agreement":null},{"id":"W2784386116","doi":"10.1609/aiide.v11i4.12834","title":"Designing Story-Centric Games for Player Emotion: A Theoretical Perspective","year":2015,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Narrative; Perspective (graphical); Affect (linguistics); Psychology; Focus (optics); Cognitive psychology; Affective computing; Computer science; Cognitive science; Human–computer interaction; Communication; Artificial intelligence","score_opus":0.06452692085270827,"score_gpt":0.3096996597059586,"score_spread":0.2451727388532503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784386116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19677489,0.000123071,0.7576554,0.014343417,0.0013720271,0.0021891666,0.000038462713,0.00017685481,0.027326731],"genre_scores_gemma":[0.9973911,0.000018071029,0.001859285,0.00029700217,0.00009507109,0.00009446881,0.0000010304973,0.000018457462,0.000225525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770975,0.000034422188,0.00053654227,0.0007067426,0.0005645106,0.00044801473],"domain_scores_gemma":[0.9973519,0.0003817076,0.00037779118,0.00025156914,0.0014198704,0.00021720228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050926703,0.00033483963,0.00034373318,0.0001872945,0.00019810851,0.00077319884,0.0011643366,0.00009028909,0.00002609213],"category_scores_gemma":[0.0015884566,0.0002463755,0.00019392779,0.00033165546,0.00062192976,0.0014635331,0.0004891375,0.00032731734,0.000042613763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034316862,0.00032692825,0.00014719692,0.000015153435,0.00005400925,8.622419e-7,0.010094335,0.00004146344,0.0019430071,0.92687523,0.00030285394,0.059855774],"study_design_scores_gemma":[0.00009298778,0.0014243945,0.000033484685,0.0003197484,0.000024778874,0.00001697184,0.041207325,0.054844,0.38095638,0.5202391,0.0004543895,0.00038642169],"about_ca_topic_score_codex":0.000011309289,"about_ca_topic_score_gemma":0.0000014364374,"teacher_disagreement_score":0.8006162,"about_ca_system_score_codex":0.00029321926,"about_ca_system_score_gemma":0.00012264309,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W2787252735","doi":"10.24251/hicss.2018.236","title":"Introduction to the Minitrack on Games and Gaming","year":2018,"lang":"en","type":"article","venue":"Proceedings of the ... Annual Hawaii International Conference on System Sciences/Proceedings of the Annual Hawaii International Conference on System Sciences","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.049219026872483196,"score_gpt":0.3078774584069395,"score_spread":0.2586584315344563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787252735","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100577235,0.000023978966,0.00035717222,0.047960024,0.0075748414,0.0012402171,0.00019517275,0.00020344928,0.8418679],"genre_scores_gemma":[0.99456555,0.000022328313,0.0010909428,0.0004971739,0.0016786108,0.00011534548,0.0000010406941,0.00002731246,0.0020017247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9906596,0.00008737259,0.0016566532,0.002024475,0.0046714493,0.0009004644],"domain_scores_gemma":[0.9890564,0.00034233174,0.002206687,0.0005478912,0.007576459,0.00027022502],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.005032006,0.00074501097,0.0007346811,0.0009409173,0.0017744121,0.0019644354,0.013894005,0.0002290608,0.000068099595],"category_scores_gemma":[0.00040686489,0.00043417027,0.00034532128,0.0023586794,0.0035592036,0.002931137,0.0022292386,0.00063470646,0.00015936642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013838721,0.000113225324,0.0014227597,0.0000782628,0.00006766847,5.538776e-7,0.005015473,0.000081903745,0.0015317963,0.98250747,0.0059044645,0.0031380185],"study_design_scores_gemma":[0.00048826568,0.0029825382,0.0037647774,0.0051175435,0.00005861697,0.00028163745,0.9456521,0.006697636,0.020519048,0.00727661,0.006012872,0.001148327],"about_ca_topic_score_codex":0.00024247672,"about_ca_topic_score_gemma":0.000033685406,"teacher_disagreement_score":0.9752309,"about_ca_system_score_codex":0.0004429827,"about_ca_system_score_gemma":0.00043112572,"threshold_uncertainty_score":0.999811},"labels":[],"label_agreement":null},{"id":"W2788471263","doi":"","title":"Game Studies at Scale: Towards Facilitating Exploration of Game Corpora","year":2017,"lang":"en","type":"article","venue":"Loading...","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Adventure; Computer science; Game mechanics; Video game design; Game art design; Game Developer; Game design; Video game development; Reading (process); Game development tool; Video game; Human–computer interaction; Game design document; Combinatorial game theory; Metagaming; Scale (ratio); Multimedia; Game programming; Sequential game; Artificial intelligence; Game theory; Simultaneous game; Mathematics; Mathematical economics; Linguistics","score_opus":0.1729451279393588,"score_gpt":0.37368206170517776,"score_spread":0.20073693376581897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788471263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81760705,0.00043072735,0.17510721,0.0013133716,0.0010997921,0.00023358285,0.0000074611594,0.00016062066,0.004040207],"genre_scores_gemma":[0.9848784,0.00006207802,0.013595319,0.00005640007,0.000073042815,0.000019295052,0.0000011160799,0.000008760746,0.0013055915],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850607,0.000053617616,0.0004203158,0.00038209924,0.00037145664,0.0002664453],"domain_scores_gemma":[0.9979573,0.00016049207,0.00049567764,0.0010156576,0.00030143105,0.00006946379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046489967,0.00015514475,0.00029218255,0.00007982513,0.00030278953,0.00017038132,0.0011734053,0.000059820526,0.000016213977],"category_scores_gemma":[0.0007553635,0.00014371435,0.0000850224,0.00011136895,0.00040426597,0.0016536718,0.0007645493,0.000096531025,0.00017186362],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006136598,0.00020442306,0.02231826,0.00034966713,0.00019928406,0.00005416575,0.14980073,0.001803865,0.08048301,0.045829423,0.0031314674,0.6957643],"study_design_scores_gemma":[0.0002528006,0.00037911173,0.004940884,0.0004196913,0.000026923684,0.000013080876,0.005068515,0.06682234,0.82039726,0.0969908,0.004032526,0.0006560311],"about_ca_topic_score_codex":0.000101722304,"about_ca_topic_score_gemma":0.00009454389,"teacher_disagreement_score":0.7399143,"about_ca_system_score_codex":0.00009569554,"about_ca_system_score_gemma":0.000041878873,"threshold_uncertainty_score":0.5860501},"labels":[],"label_agreement":null},{"id":"W2788603415","doi":"10.1609/aaai.v32i1.11531","title":"Memory-Augmented Monte Carlo Tree Search","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Computer science; Monte Carlo method; Exploit; Generalization; Tree (set theory); Algorithm; Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.10057922332975935,"score_gpt":0.3228504654192324,"score_spread":0.22227124208947305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788603415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80316436,0.000085999025,0.06381041,0.015109466,0.003198803,0.0018244138,0.000016514456,0.0007020938,0.11208794],"genre_scores_gemma":[0.99366254,0.000030270785,0.0041467897,0.00038241397,0.0003096557,0.000039509658,2.219255e-7,0.000029255818,0.0013993285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959613,0.000054086515,0.0009865299,0.0009815783,0.0011904938,0.0008260092],"domain_scores_gemma":[0.9962238,0.00017579687,0.00044591998,0.0008650411,0.002068144,0.00022130032],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001022585,0.0004263512,0.0004422614,0.00029662464,0.0005047992,0.00049941614,0.005126747,0.00017889493,0.00025353458],"category_scores_gemma":[0.0006569158,0.0003266885,0.00024244205,0.0015748829,0.001364372,0.0008271318,0.0011118259,0.0005366791,0.000884965],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012978062,0.00027806175,0.00023199077,0.000032917065,0.000042861502,0.0000020309344,0.005519118,0.000091744536,0.08020449,0.62158525,0.00093263993,0.29094914],"study_design_scores_gemma":[0.000021952435,0.00046534816,0.000166007,0.00017922267,0.000013265954,0.000007797496,0.0013711278,0.10342936,0.83660036,0.057178225,0.00023590737,0.00033142068],"about_ca_topic_score_codex":0.00027634331,"about_ca_topic_score_gemma":0.000115340365,"teacher_disagreement_score":0.7563959,"about_ca_system_score_codex":0.00011871979,"about_ca_system_score_gemma":0.00021156277,"threshold_uncertainty_score":0.9999185},"labels":[],"label_agreement":null},{"id":"W2793169582","doi":"10.1609/aiide.v9i4.12623","title":"Integrating Formal Qualitative Analysis Techniques within a Procedural Narrative Generation System","year":2013,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Narrative; Correctness; Computer science; Set (abstract data type); Quality (philosophy); Narrative network; Process (computing); Narrative inquiry; Narrative criticism; Event (particle physics); Process management; Programming language; Epistemology; Linguistics; Engineering","score_opus":0.053509688821119644,"score_gpt":0.327285202351243,"score_spread":0.2737755135301233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793169582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78042865,0.00001173632,0.20466866,0.0024016646,0.00032290857,0.001472246,0.00001635065,0.00017982292,0.010497974],"genre_scores_gemma":[0.9963404,0.000005178721,0.0028673771,0.00022064408,0.0000616706,0.00028402603,0.0000043051805,0.000014369696,0.00020205133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997142,0.000056570192,0.0010742252,0.0007053965,0.0005921151,0.00042969786],"domain_scores_gemma":[0.9972376,0.00017387154,0.000872258,0.00026605363,0.0013186235,0.00013159157],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004928574,0.00040045773,0.00047498188,0.0003562734,0.0003372488,0.0014334213,0.0011025993,0.00009856472,0.000037814945],"category_scores_gemma":[0.00045997975,0.00027470686,0.00025143215,0.00087059196,0.0003724135,0.0043341247,0.0005299313,0.00036831005,0.000041586976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008048394,0.000262121,0.00021725435,0.000053396627,0.00033473206,6.432404e-7,0.13501294,0.000055127606,0.028254356,0.74433786,0.00009686685,0.09129425],"study_design_scores_gemma":[0.00001723175,0.00053845847,0.000042069256,0.00030865104,0.00004264484,0.000006721329,0.1775025,0.2512327,0.5523529,0.017646858,0.000010797389,0.00029841205],"about_ca_topic_score_codex":0.00016386156,"about_ca_topic_score_gemma":0.000030272397,"teacher_disagreement_score":0.72669095,"about_ca_system_score_codex":0.00022955408,"about_ca_system_score_gemma":0.00006686158,"threshold_uncertainty_score":0.9999705},"labels":[],"label_agreement":null},{"id":"W2794254934","doi":"10.1109/tciaig.2017.2717902","title":"Game Tree Search Based on Nondeterministic Action Scripts in Real-Time Strategy Games","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative deepening depth-first search; Computer science; Nondeterministic algorithm; Scripting language; Tree (set theory); Search algorithm; Action (physics); Beam search; Adversarial system; Representation (politics); State (computer science); Search tree; Artificial intelligence; Incremental heuristic search; Machine learning; Theoretical computer science; Algorithm; Mathematics","score_opus":0.09331092000930677,"score_gpt":0.35050820193780496,"score_spread":0.2571972819284982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794254934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24604733,0.000010502208,0.73755217,0.0012414115,0.0015352783,0.00059008814,0.000024317022,0.00045755677,0.012541317],"genre_scores_gemma":[0.9945663,0.000050290353,0.0023038697,0.00017135935,0.00008331689,0.00008535115,0.000001719828,0.000037103768,0.0027006734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970839,0.00022003244,0.00049920875,0.00087645865,0.00067293725,0.0006474399],"domain_scores_gemma":[0.99716085,0.000413336,0.00018221026,0.0019230266,0.00012029477,0.00020027928],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046923017,0.00037017418,0.00037566482,0.0006005566,0.0004989268,0.0007788581,0.0016184772,0.00020683052,0.00018409276],"category_scores_gemma":[0.000038371516,0.00036785775,0.00019497158,0.00030919153,0.0003328176,0.000984796,0.000008753388,0.0005738648,0.0008533796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002688914,0.0009969916,0.00020400331,0.0000548961,0.000030685704,0.000182938,0.0013002481,0.103545226,0.015767977,0.0006765355,0.00022954482,0.87674206],"study_design_scores_gemma":[0.00048478472,0.0009784054,0.007191071,0.00022040421,0.000020572548,0.000014280401,0.00018715247,0.79353774,0.19519292,0.001315202,0.00028162752,0.00057583436],"about_ca_topic_score_codex":0.0006267354,"about_ca_topic_score_gemma":0.0007722816,"teacher_disagreement_score":0.8761662,"about_ca_system_score_codex":0.00022867223,"about_ca_system_score_gemma":0.00026783522,"threshold_uncertainty_score":0.9999246},"labels":[],"label_agreement":null},{"id":"W2794543545","doi":"10.1609/aimag.v39i1.2777","title":"The First MicroRTS Artificial Intelligence Competition","year":2018,"lang":"en","type":"article","venue":"AI Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Competition (biology); Observability; Computer science; Artificial intelligence; Term (time); Operations research; Computational intelligence; Engineering; Mathematics","score_opus":0.027165958814672875,"score_gpt":0.2869183879692783,"score_spread":0.25975242915460545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794543545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047177863,0.000120817116,0.95547706,0.029400326,0.0019931796,0.00021102667,0.0000016507889,0.0002651801,0.007812974],"genre_scores_gemma":[0.9897028,0.00004060741,0.0063055563,0.0026230784,0.00070797396,0.000018962517,0.0000016989829,0.000013209374,0.0005861211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985024,0.00004402669,0.00038553268,0.00038479158,0.0002801269,0.0004031653],"domain_scores_gemma":[0.99851584,0.00021818333,0.00009996386,0.0008003554,0.00029013926,0.00007550394],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042706498,0.00015246654,0.00011576667,0.00006228328,0.00070406194,0.00042719583,0.0012771001,0.000058251924,0.00011858455],"category_scores_gemma":[0.00013078544,0.00011383779,0.00006419613,0.0004939941,0.0005440877,0.00040126152,0.00034268852,0.00016372277,0.006812762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014033141,0.00005624852,0.00015399729,0.0000035607202,0.000009752019,0.000012263999,0.0006424718,0.000031800704,0.0016474259,0.7195952,0.011402644,0.2664306],"study_design_scores_gemma":[0.000017962611,0.0002714006,0.0009415532,0.000035535682,0.000006537152,0.000040735024,0.00007211639,0.066016994,0.118340366,0.29421064,0.51971436,0.00033184054],"about_ca_topic_score_codex":0.000027500078,"about_ca_topic_score_gemma":0.0008835084,"teacher_disagreement_score":0.984985,"about_ca_system_score_codex":0.00004286269,"about_ca_system_score_gemma":0.000048290014,"threshold_uncertainty_score":0.99396056},"labels":[],"label_agreement":null},{"id":"W2795257399","doi":"","title":"Formalizing Anthropomorphism Through Games: A Study in Deep Neural Networks.","year":2017,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Cognitive science; Psychology","score_opus":0.20896466148286322,"score_gpt":0.40576896193554923,"score_spread":0.19680430045268602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795257399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04907427,0.00007128899,0.92885035,0.0041535944,0.001787605,0.0009685421,0.0000054814195,0.0002198482,0.0148690315],"genre_scores_gemma":[0.99542326,0.000041249135,0.003519397,0.00056249235,0.00026085068,0.00011197275,0.0000036275503,0.000022591772,0.000054562992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956362,0.00021883594,0.001050173,0.0010561823,0.0012790334,0.0007595522],"domain_scores_gemma":[0.99690163,0.00039435743,0.0005321151,0.0012517197,0.00077333074,0.00014684885],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012201843,0.00041580887,0.00043664413,0.00029886095,0.0010901506,0.0016105752,0.003596044,0.00017325934,0.00022168524],"category_scores_gemma":[0.0012626449,0.00041252203,0.00012704097,0.0004763074,0.00057056814,0.0025403646,0.00063653593,0.00067076395,0.00035180428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006184662,0.00068692956,0.001936565,0.0000041221274,0.000017462598,0.00008952985,0.0030903902,0.0271731,0.00008080578,0.7568985,0.000037669903,0.20992306],"study_design_scores_gemma":[0.00004833353,0.00032481414,0.0031550946,0.000041834635,0.0000040347395,0.000008413854,0.0014951695,0.7986646,0.0026667533,0.19312018,0.00007186534,0.00039889748],"about_ca_topic_score_codex":0.00070922385,"about_ca_topic_score_gemma":0.0029692466,"teacher_disagreement_score":0.94634897,"about_ca_system_score_codex":0.00023033384,"about_ca_system_score_gemma":0.00020104308,"threshold_uncertainty_score":0.9998327},"labels":[],"label_agreement":null},{"id":"W2795812275","doi":"10.1007/978-3-319-89656-4_28","title":"Combining MCTS and A3C for Prediction of Spatially Spreading Processes in Forest Wildfire Settings","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Monte Carlo tree search; Reinforcement learning; Tree (set theory); Variety (cybernetics); Artificial intelligence; Monte Carlo method; Simulation","score_opus":0.024957770985953337,"score_gpt":0.26202402063684205,"score_spread":0.2370662496508887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795812275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007681992,0.0002466739,0.98974025,0.0003444509,0.00088287384,0.0006510974,0.000011874324,0.00008183052,0.0003589593],"genre_scores_gemma":[0.73230237,0.00003901221,0.2669255,0.0003079065,0.00031318716,0.000021797396,0.0000057688158,0.000029757295,0.000054671626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707955,0.000019915047,0.0006833212,0.001154838,0.000563215,0.0004991591],"domain_scores_gemma":[0.9975442,0.0009914157,0.00044485845,0.0005842473,0.00034249076,0.00009275562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009108478,0.00036175322,0.00047849593,0.000715679,0.00017708172,0.00029151488,0.0016207211,0.00026451208,0.0000028918707],"category_scores_gemma":[0.00063263375,0.0003509929,0.00005389708,0.0005647866,0.0009678406,0.00081408594,0.00071455765,0.00034111354,0.0000025807724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004925485,0.000095198615,0.013013891,0.000967368,0.000024860781,0.00003464402,0.022305248,0.035677038,0.0009329652,0.014075635,0.00005913813,0.9127647],"study_design_scores_gemma":[0.00017639634,0.0005241383,0.0006133343,0.0022963008,0.000008583464,0.000027740525,0.0000017282225,0.75491065,0.013032171,0.22753549,0.0004589783,0.00041450976],"about_ca_topic_score_codex":0.00005316757,"about_ca_topic_score_gemma":0.0007114465,"teacher_disagreement_score":0.91235024,"about_ca_system_score_codex":0.00013135908,"about_ca_system_score_gemma":0.00053045736,"threshold_uncertainty_score":0.9998942},"labels":[],"label_agreement":null},{"id":"W2796683355","doi":"10.1145/3183568","title":"Usertesting Without the User","year":2018,"lang":"en","type":"article","venue":"Computers in entertainment","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"University of Ontario Institute of Technology","keywords":"Computer science; Proxy (statistics); Process (computing); Human–computer interaction; Population; Human intelligence; Artificial intelligence; Cognition; Data science; Machine learning; Psychology","score_opus":0.027110126678112585,"score_gpt":0.28870809698484806,"score_spread":0.2615979703067355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796683355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1466116,0.000034104884,0.84747183,0.0021675006,0.001575263,0.00023922056,1.8446282e-7,0.00013272162,0.0017675482],"genre_scores_gemma":[0.9394867,0.0000040212285,0.058032814,0.0021351075,0.00020855463,0.000021448832,2.9752047e-7,0.000009504157,0.00010155977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985016,0.0001098071,0.00031523724,0.00039690247,0.00029098953,0.00038544327],"domain_scores_gemma":[0.9988325,0.00021894297,0.00008377245,0.0007475943,0.00005560448,0.000061578794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042898944,0.00015339947,0.00013304422,0.00008547977,0.00016505868,0.0002053272,0.001730285,0.00003503537,0.00001486523],"category_scores_gemma":[0.000050607712,0.000109611035,0.000049574624,0.00031706018,0.00020005592,0.00025550145,0.0006873498,0.00014667731,0.00017294586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003771316,0.000498301,0.2991714,0.000023121347,0.00007969026,0.000109762375,0.03452543,0.0023826843,0.0014628782,0.15345632,0.010854974,0.49739775],"study_design_scores_gemma":[0.0002992421,0.0003459901,0.019663822,0.00022667878,0.0000059182466,0.00004468466,0.00046285358,0.92983407,0.010258591,0.014280315,0.024088548,0.0004893182],"about_ca_topic_score_codex":0.000066919,"about_ca_topic_score_gemma":0.00007330908,"teacher_disagreement_score":0.9274514,"about_ca_system_score_codex":0.00011544608,"about_ca_system_score_gemma":0.000028348953,"threshold_uncertainty_score":0.44698083},"labels":[],"label_agreement":null},{"id":"W2800195367","doi":"","title":"A Call for Emotion Modeling in Interactive Storytelling.","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Narrative; Interactive storytelling; Computer science; Plot (graphics); Agency (philosophy); Storytelling; Consistency (knowledge bases); Face (sociological concept); Human–computer interaction; Artificial intelligence; Multimedia; Linguistics","score_opus":0.061989016119279206,"score_gpt":0.3022585697352455,"score_spread":0.2402695536159663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800195367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100043364,0.0000138749665,0.8972851,0.00062657136,0.0002375838,0.0003114034,1.5444482e-7,0.00007936508,0.0014025761],"genre_scores_gemma":[0.89679885,0.000002865393,0.102472745,0.00022453189,0.000036857207,0.00006687961,4.077773e-7,0.0000050237795,0.00039183308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992441,0.000022152883,0.00020503243,0.0002447857,0.000090141344,0.00019380433],"domain_scores_gemma":[0.99945503,0.00013417,0.000033407647,0.00020338305,0.00013439769,0.00003962699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015567118,0.00007330614,0.000086298416,0.00010804365,0.000035143767,0.00010600528,0.00037357752,0.000039662835,0.000036181806],"category_scores_gemma":[0.00008154272,0.00006602265,0.000038331364,0.00013121117,0.000013386676,0.0008669668,0.00007199277,0.0000825023,0.000208663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016639184,0.00021606601,0.0005001958,0.000019823625,0.000015225634,0.0000029070102,0.015378827,0.18752736,0.0034328697,0.065299325,0.0016856502,0.7259051],"study_design_scores_gemma":[0.000030499326,0.00003277429,0.000026502697,0.000013115636,5.0407454e-7,7.4743355e-7,0.0002940394,0.96575165,0.0038758353,0.02976218,0.0001299564,0.00008219743],"about_ca_topic_score_codex":0.0007816324,"about_ca_topic_score_gemma":0.00014914492,"teacher_disagreement_score":0.7967555,"about_ca_system_score_codex":0.00006985356,"about_ca_system_score_gemma":0.000024032483,"threshold_uncertainty_score":0.26923254},"labels":[],"label_agreement":null},{"id":"W2803989316","doi":"10.1007/978-3-319-92007-8_1","title":"On Addressing the Challenges of Complex Stochastic Games Using “Representative” Moves","year":2018,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Adversary; Game tree; Combinatorial game theory; Domain (mathematical analysis); Context (archaeology); Field (mathematics); Hobby; Artificial intelligence; Sequential game; Operations research; Game theory; Computer security; Mathematical economics; Engineering; Mathematics; Political science","score_opus":0.11044366440973685,"score_gpt":0.3638583940865384,"score_spread":0.25341472967680156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803989316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015404628,0.056844525,0.6175572,0.007198083,0.0004551227,0.0014983164,0.000026732489,0.00052781426,0.3143517],"genre_scores_gemma":[0.9291243,0.03154135,0.037749846,0.0005344651,0.000034071945,0.00008819514,0.000020304436,0.000030170684,0.00087728957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987804,0.000052394622,0.0006437238,0.0001713278,0.00021076693,0.00014138051],"domain_scores_gemma":[0.99724525,0.00048055165,0.00081362826,0.0012182677,0.00022389044,0.000018385848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028308827,0.0001862231,0.0002682811,0.0005896145,0.00017325288,0.000059412454,0.0014908775,0.00021791641,0.000029556439],"category_scores_gemma":[0.00018225536,0.00015394094,0.000034638608,0.00014367088,0.0012129507,0.001131045,0.000645829,0.00038548766,0.000023347244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006176793,0.00000655297,0.0000017625349,0.000019836676,0.00000654464,9.2112735e-8,0.00197355,0.00076242763,0.0000047837325,0.7826563,0.000020798589,0.21454118],"study_design_scores_gemma":[0.000091494556,0.00008998083,0.000016829885,0.0005362949,0.0000057920233,0.000010917876,0.002357349,0.043254763,0.00040122453,0.9371524,0.015886523,0.00019647542],"about_ca_topic_score_codex":0.0000076764045,"about_ca_topic_score_gemma":0.000041628056,"teacher_disagreement_score":0.9275838,"about_ca_system_score_codex":0.000051983676,"about_ca_system_score_gemma":0.00003993048,"threshold_uncertainty_score":0.62775296},"labels":[],"label_agreement":null},{"id":"W2805486795","doi":"","title":"Game of Cops and Robbers on Eulerian Digraphs","year":2018,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Eulerian path; Computer science; Mathematics; Pure mathematics","score_opus":0.015302004674741104,"score_gpt":0.23471979924543313,"score_spread":0.21941779457069202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805486795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9304824,0.00014204321,0.0043979045,0.000083047205,0.0015393242,0.0003701007,0.000034112527,0.00019243598,0.06275866],"genre_scores_gemma":[0.9837885,0.00019870038,0.0015165716,0.000074022384,0.00007462043,7.8501625e-7,0.000090157526,0.000028020184,0.014228643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850565,0.000071891656,0.00022765493,0.000602302,0.00031846366,0.0002740228],"domain_scores_gemma":[0.9986455,0.00010377305,0.0002835959,0.00060861773,0.00021963214,0.00013890029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010351243,0.00027773425,0.00032778725,0.00072084455,0.00011783909,0.0000709698,0.0011509927,0.00028807882,0.00007706523],"category_scores_gemma":[0.000036514237,0.00031425565,0.0001303156,0.0008264357,0.00019074629,0.0003976238,0.00011994572,0.00024553487,0.00007360201],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019481645,0.0012239686,0.19925377,0.0012213017,0.0012368337,0.00108441,0.007603109,0.00040768072,0.00043793596,0.39029416,0.09363451,0.30165416],"study_design_scores_gemma":[0.0013111369,0.0027342371,0.007855415,0.002239486,0.00042511476,4.6477776e-8,0.09641926,0.0053721075,0.21570075,0.02042837,0.64395803,0.00355604],"about_ca_topic_score_codex":0.0002334898,"about_ca_topic_score_gemma":0.035461325,"teacher_disagreement_score":0.55032355,"about_ca_system_score_codex":0.00006518624,"about_ca_system_score_gemma":0.00011841315,"threshold_uncertainty_score":0.999931},"labels":[],"label_agreement":null},{"id":"W2808044672","doi":"10.1007/978-1-4842-3691-8","title":"How to Kill the Scrum Monster","year":2018,"lang":"en","type":"book","venue":"Apress eBooks","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"NanoQuébec (Canada)","funders":"","keywords":"Monster; Scrum; Art; Computer science; Art history; Operating system; Software","score_opus":0.042548742832778465,"score_gpt":0.26309429231204734,"score_spread":0.22054554947926888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808044672","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001954706,0.0001266166,0.23098756,0.0022538088,0.0018291695,0.000603893,0.00000946146,0.00022011269,0.7639498],"genre_scores_gemma":[0.001427132,0.0000025806785,0.004820882,0.002905605,0.0011067215,0.000077569995,0.0000015901811,0.000044423174,0.9896135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979101,0.00008017615,0.00027449135,0.00071257126,0.0005389385,0.00048375546],"domain_scores_gemma":[0.99704856,0.0002562836,0.00017063071,0.0021603762,0.000208197,0.00015597067],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027247568,0.00035568417,0.00029089465,0.00012273829,0.00023449441,0.001325296,0.003980669,0.00026097312,0.000018145787],"category_scores_gemma":[0.00007700342,0.0002463333,0.00016151708,0.000038322065,0.0003595102,0.00023470813,0.0015401123,0.00038125247,0.0008449403],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063079547,0.000008761554,0.000002169521,0.00001858,0.00005782392,0.00002450803,0.0027175355,0.000006387569,0.00013817602,0.26562935,0.59466463,0.13672578],"study_design_scores_gemma":[0.000015447762,0.0000661632,0.0000020349446,0.00010837063,0.000013499268,0.000007921742,0.000017277735,0.00032348413,0.006853892,0.057841953,0.9344259,0.0003240593],"about_ca_topic_score_codex":0.000023088725,"about_ca_topic_score_gemma":0.000061436316,"teacher_disagreement_score":0.3397613,"about_ca_system_score_codex":0.000078812816,"about_ca_system_score_gemma":0.00019550351,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W2808584951","doi":"10.24963/ijcai.2018/523","title":"Three-Head Neural Network Architecture for Monte Carlo Tree Search","year":2018,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Artificial neural network; Tree (set theory); Artificial intelligence; Monte Carlo method; Head (geology); Regularization (linguistics); Node (physics); Exploit; Machine learning; Mathematics; Engineering","score_opus":0.06617931023848142,"score_gpt":0.3263063112610154,"score_spread":0.26012700102253394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808584951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05585289,0.00008758317,0.93507296,0.0037360378,0.0008803541,0.0003913202,0.0000016936287,0.0002779229,0.0036992622],"genre_scores_gemma":[0.8267953,0.0000014970384,0.16973127,0.00086929783,0.001509891,0.00003336563,5.096436e-7,0.000016984866,0.0010418812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832815,0.0000367811,0.00023412365,0.00047710323,0.00027595015,0.0006478971],"domain_scores_gemma":[0.99865687,0.0002621218,0.000038444046,0.0007088783,0.0002030479,0.00013066836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032799412,0.0001616354,0.00016475217,0.000062392945,0.00026647677,0.000193613,0.0013071615,0.00007819044,0.00004720291],"category_scores_gemma":[0.000052876465,0.00012733112,0.00011165399,0.00037975924,0.000204363,0.00022607006,0.00033090066,0.0001657513,0.00014103428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051993175,0.00003759105,0.0022973209,0.000009182863,0.000024289046,0.000006563275,0.0015887439,0.014482323,0.00042554393,0.04979681,0.02486564,0.906414],"study_design_scores_gemma":[0.00007508577,0.00047303893,0.0015903251,0.000012221025,0.000004126563,0.000010821978,0.000036402686,0.9427495,0.0051803486,0.036254425,0.013380919,0.00023278844],"about_ca_topic_score_codex":0.0004240942,"about_ca_topic_score_gemma":0.010011102,"teacher_disagreement_score":0.9282672,"about_ca_system_score_codex":0.000025573434,"about_ca_system_score_gemma":0.00005394861,"threshold_uncertainty_score":0.558643},"labels":[],"label_agreement":null},{"id":"W2810374059","doi":"10.1109/tg.2018.2844121","title":"Recommender System for Items in <i>Dota 2</i>","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Recommender system; Purchasing; Computer science; HERO; Cluster analysis; Logistic regression; Affect (linguistics); Feature (linguistics); Artificial intelligence; Psychology; Machine learning; Marketing; Business; Communication","score_opus":0.04347225596915313,"score_gpt":0.29619987816750115,"score_spread":0.25272762219834805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810374059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004965094,0.00002720665,0.9888145,0.0009023299,0.0026044538,0.00034336426,0.000009832036,0.0002745057,0.002058745],"genre_scores_gemma":[0.9843254,0.000009265036,0.0142654935,0.00038397216,0.00012711079,0.00016249657,3.0060167e-7,0.00001676949,0.00070916716],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986875,0.000060364484,0.00033258073,0.00041436544,0.00016940408,0.00033580032],"domain_scores_gemma":[0.99894863,0.00028430196,0.00006221082,0.00052311213,0.00010919589,0.000072525625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029363605,0.00015192006,0.00017599828,0.00020577337,0.00016268525,0.0001104185,0.00059730135,0.00008623885,0.000032370852],"category_scores_gemma":[0.0000084264,0.00014664141,0.00010131899,0.0004266923,0.00009156334,0.00035748928,0.0000025221748,0.00014323232,0.00023670927],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001652185,0.00069720397,0.00011883446,0.00013518895,0.00007738124,0.000015570462,0.0066428846,0.0055031567,0.006502318,0.0192007,0.009379052,0.95156246],"study_design_scores_gemma":[0.00044388723,0.0006981841,0.000057740577,0.00018781799,0.000017905986,0.000032426815,0.0010428344,0.26106247,0.69572556,0.003065177,0.037082203,0.0005837548],"about_ca_topic_score_codex":0.00008569637,"about_ca_topic_score_gemma":0.00026234717,"teacher_disagreement_score":0.97936034,"about_ca_system_score_codex":0.00012157224,"about_ca_system_score_gemma":0.000047358986,"threshold_uncertainty_score":0.59798634},"labels":[],"label_agreement":null},{"id":"W2810882517","doi":"10.1609/aimag.v39i2.2798","title":"The 13th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","year":2018,"lang":"en","type":"article","venue":"AI Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Canyon; Salt lake; Entertainment; Library science; Computer science; Artificial intelligence; Engineering; Visual arts; Cartography; Geography; Art; Geology","score_opus":0.04012822024253798,"score_gpt":0.30691995961728397,"score_spread":0.266791739374746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810882517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03509145,0.000054372445,0.92577267,0.020888966,0.001367697,0.00038208457,0.000007846839,0.00018740138,0.01624753],"genre_scores_gemma":[0.99681574,0.000033595134,0.0008273736,0.0011519964,0.00022165483,0.000017974473,0.0000013379384,0.000010104882,0.00092019606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841577,0.000054894623,0.0003432913,0.0004895656,0.0003197533,0.00037675296],"domain_scores_gemma":[0.998559,0.00037983077,0.00010934563,0.00060081744,0.00023701154,0.00011401272],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024243214,0.0001992311,0.00014240711,0.00006711667,0.00032623325,0.0010443992,0.0009228382,0.00004676618,0.000053348333],"category_scores_gemma":[0.00023525764,0.00013871264,0.000045055476,0.00022964283,0.0006057127,0.0006944875,0.0004952741,0.00022381255,0.0017472139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060713108,0.00008101102,0.0001196462,0.0000018778104,0.000017541386,0.000010708034,0.0017925214,0.000008292381,0.00048008937,0.30793542,0.0012835154,0.68820864],"study_design_scores_gemma":[0.00008945915,0.0028955808,0.0013986514,0.00017038257,0.0000151357835,0.00006937862,0.0014799687,0.28983703,0.11051821,0.50536627,0.087295935,0.00086401636],"about_ca_topic_score_codex":0.000013448788,"about_ca_topic_score_gemma":0.00008334152,"teacher_disagreement_score":0.96172434,"about_ca_system_score_codex":0.000056708584,"about_ca_system_score_gemma":0.000051561063,"threshold_uncertainty_score":0.9999926},"labels":[],"label_agreement":null},{"id":"W2811461449","doi":"10.4230/lipics.fun.2018.27","title":"The complexity of speedrunning video games","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Treewidth; Parameterized complexity; Boosting (machine learning); Bounded function; Computer science; Routing (electronic design automation); Time complexity; Exponential time hypothesis; Knapsack problem; Combinatorics; Theoretical computer science; Discrete mathematics; Mathematics; Mathematical optimization; Artificial intelligence; Pathwidth; Graph; Algorithm","score_opus":0.05888925186306259,"score_gpt":0.3089636948358681,"score_spread":0.2500744429728055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811461449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12870894,0.0001117797,0.8466733,0.0021262753,0.0035121504,0.001227473,0.00011254411,0.00035015983,0.017177358],"genre_scores_gemma":[0.9535795,0.00002720321,0.044938195,0.0006812437,0.0003644668,0.000040262166,0.000017542572,0.000025781232,0.00032581665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969071,0.000051999017,0.0013586336,0.00026930543,0.0006225219,0.00079040066],"domain_scores_gemma":[0.99673134,0.00039920025,0.0006728241,0.0013124968,0.0007271806,0.0001569365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010947424,0.00031411173,0.00038933154,0.00016152582,0.0007776012,0.00051320257,0.0026767638,0.00013697057,0.000027351654],"category_scores_gemma":[0.00034825693,0.00022935595,0.0002510227,0.00047105664,0.0017857933,0.001488028,0.0008492303,0.0002967192,0.00029772692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020179694,0.00036033077,0.008016469,0.0003388435,0.00031555732,0.000003966651,0.049211264,0.0001214845,0.00063324376,0.6847667,0.02495835,0.23107201],"study_design_scores_gemma":[0.0011370286,0.0011221523,0.003013989,0.00036277744,0.00004856813,0.000079966616,0.006033766,0.39703527,0.10203226,0.096995875,0.3909893,0.0011490658],"about_ca_topic_score_codex":0.000049598613,"about_ca_topic_score_gemma":0.000089630325,"teacher_disagreement_score":0.8248705,"about_ca_system_score_codex":0.00008029223,"about_ca_system_score_gemma":0.0001031453,"threshold_uncertainty_score":0.9352864},"labels":[],"label_agreement":null},{"id":"W286126187","doi":"10.1007/978-3-319-09165-5_7","title":"Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Monte Carlo method; Game tree; Tree (set theory); Theoretical computer science; Artificial intelligence; Game theory; Sequential game; Statistics; Mathematical economics; Mathematics","score_opus":0.05078262854680907,"score_gpt":0.31156800766840675,"score_spread":0.2607853791215977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W286126187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007190016,0.00038767693,0.99599206,0.001058491,0.0007249128,0.00065291225,0.0000062760796,0.00004570712,0.000412943],"genre_scores_gemma":[0.8962125,0.00002170565,0.103044145,0.00023213342,0.00024440716,0.0000118162225,9.2128823e-7,0.000021965021,0.00021039385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689853,0.00005332722,0.0007197751,0.0010155885,0.0007281087,0.000584685],"domain_scores_gemma":[0.9937613,0.004065745,0.00026447687,0.0014379849,0.000387867,0.00008263818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001490282,0.00034133825,0.0004929889,0.00086878566,0.00017903063,0.00029170784,0.0040841955,0.00021810996,0.000009627261],"category_scores_gemma":[0.0002951268,0.0002629694,0.00017414434,0.0008865024,0.00091777457,0.0003205741,0.0009152982,0.0006003519,0.00001108849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003885857,0.000010029445,0.00029264658,0.000015077412,0.00000585781,0.0000025477582,0.0010550515,0.5718605,0.00010227784,0.015648669,0.000004343398,0.4109991],"study_design_scores_gemma":[0.00007779664,0.00010333266,0.00028787256,0.00019980209,0.0000065304766,0.000003527186,6.332714e-7,0.942471,0.002919059,0.053220462,0.0004451452,0.00026483918],"about_ca_topic_score_codex":0.00012236804,"about_ca_topic_score_gemma":0.0011756959,"teacher_disagreement_score":0.8954935,"about_ca_system_score_codex":0.00019366131,"about_ca_system_score_gemma":0.0003630308,"threshold_uncertainty_score":0.99998224},"labels":[],"label_agreement":null},{"id":"W2865216059","doi":"10.24963/ijcai.2018/787","title":"Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents (Extended Abstract)","year":2018,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Variety (cybernetics); Key (lock); Field (mathematics); Focus (optics); Data science; Human–computer interaction; Artificial intelligence; Management science; Computer security; Engineering","score_opus":0.15740321787269704,"score_gpt":0.4028998136404876,"score_spread":0.24549659576779057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2865216059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056520417,0.00006514404,0.85460424,0.0054893694,0.00015605781,0.06346489,0.0000015448836,0.00016409285,0.019534236],"genre_scores_gemma":[0.875204,0.000010287924,0.1023365,0.00053862267,0.0006498464,0.018804617,0.00000391622,0.000021248912,0.0024309473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867374,0.00010750684,0.0002845784,0.00038779655,0.00030282978,0.00024357912],"domain_scores_gemma":[0.99924207,0.00012310468,0.00017006748,0.00032929922,0.00008733677,0.00004814295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022886028,0.000105202904,0.00010348533,0.000026766038,0.0004889329,0.0006733649,0.0009594736,0.000039533592,0.00017889167],"category_scores_gemma":[0.00019877435,0.000072316376,0.000027000691,0.00007662437,0.0001090792,0.00063003,0.00054421084,0.00010418437,0.000070089976],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010029256,0.000021801781,0.0007164352,0.000019727366,0.000014896444,3.2946903e-7,0.0023869677,0.0012762912,0.0037831282,0.020092703,0.00026119486,0.9714165],"study_design_scores_gemma":[0.00018349895,0.00017720138,0.0078066792,0.00006946284,0.000009028451,0.000004547244,0.00014051262,0.90064144,0.018475307,0.03074978,0.041560702,0.00018184997],"about_ca_topic_score_codex":0.00004877123,"about_ca_topic_score_gemma":0.0000066067028,"teacher_disagreement_score":0.9712346,"about_ca_system_score_codex":0.00004527638,"about_ca_system_score_gemma":0.00004087128,"threshold_uncertainty_score":0.64932734},"labels":[],"label_agreement":null},{"id":"W2886735516","doi":"10.1016/j.entcom.2021.100422","title":"Let CONAN tell you a story: Procedural quest generation","year":2021,"lang":"en","type":"preprint","venue":"Entertainment Computing","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Adventure; Narrative; Generator (circuit theory); Computer science; Set (abstract data type); Replicate; Literature; Artificial intelligence; Art; Mathematics; Programming language; Physics; Power (physics)","score_opus":0.04009970759455226,"score_gpt":0.29198633681279945,"score_spread":0.25188662921824717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886735516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28796706,0.00056760653,0.70338595,0.0027267626,0.0039085667,0.0005236027,0.0000029776236,0.00037192565,0.000545518],"genre_scores_gemma":[0.9582027,0.000029522322,0.03860513,0.0014743734,0.0010852895,0.000034671448,0.00008830377,0.00003699213,0.00044301906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628603,0.000367253,0.0006884155,0.0013656057,0.0006921605,0.0006005583],"domain_scores_gemma":[0.9978737,0.00012526958,0.00049386895,0.0011127285,0.00023767428,0.00015673712],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00078259956,0.0004883074,0.00046955346,0.00015989528,0.00035582331,0.0012016955,0.0016664272,0.00023098575,0.000033888344],"category_scores_gemma":[0.00015618454,0.0005246219,0.00023049481,0.00019493823,0.00008306987,0.00030552194,0.0033776814,0.0009073256,0.000063682055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028883816,0.0015736097,0.0118637895,0.001016336,0.0007252138,0.0008126233,0.097476944,0.21754949,0.020652385,0.04258903,0.019219894,0.5864918],"study_design_scores_gemma":[0.000098548015,0.00007396119,0.0002804627,0.0004803782,0.000019595615,0.000027789907,0.00061711256,0.9761195,0.01740681,0.00032817156,0.0038751357,0.0006725092],"about_ca_topic_score_codex":0.00011284139,"about_ca_topic_score_gemma":0.000063768675,"teacher_disagreement_score":0.75857,"about_ca_system_score_codex":0.00047898342,"about_ca_system_score_gemma":0.00034739988,"threshold_uncertainty_score":0.99983513},"labels":[],"label_agreement":null},{"id":"W2889214550","doi":"10.1016/j.procs.2018.08.017","title":"Data analytics on the board game Go for the discovery of interesting sequences of moves in joseki","year":2018,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Big data; Computer science; Popularity; Data science; Analytics; Focus (optics); Variety (cybernetics); Data analysis; Simple (philosophy); Data mining; Artificial intelligence","score_opus":0.15349501197432974,"score_gpt":0.3518479565146497,"score_spread":0.19835294454031993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889214550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1552178,0.000075951,0.84133184,0.0021087297,0.0007887789,0.00031707366,0.000011766575,0.000023981387,0.00012406908],"genre_scores_gemma":[0.9457615,0.000010238255,0.05364961,0.00033591644,0.00021195789,0.000011262076,3.3541372e-7,0.0000047193266,0.000014441402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979899,0.00003993734,0.0004686311,0.00059222145,0.00056294276,0.0003463844],"domain_scores_gemma":[0.995945,0.0018656594,0.00031467288,0.0014515736,0.00038414242,0.000038985254],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020972306,0.00013529212,0.00018455058,0.00016068977,0.00018344857,0.00036747975,0.007994802,0.000024965328,0.0000015333173],"category_scores_gemma":[0.001088989,0.000075494325,0.000043386764,0.0011315353,0.002695846,0.0014080633,0.0018570295,0.00012770717,0.000005874359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006798211,0.00036597022,0.008096897,0.00016266388,0.000045747613,0.0000045682154,0.032336276,0.009879338,0.01422695,0.6317217,0.0026340154,0.30045792],"study_design_scores_gemma":[0.000030410214,0.00022702175,0.0010103614,0.00012870901,0.0000040947525,0.00000212044,0.00017231554,0.9373163,0.049396202,0.011375652,0.00023578882,0.00010104003],"about_ca_topic_score_codex":0.00007434864,"about_ca_topic_score_gemma":0.00012757853,"teacher_disagreement_score":0.92743695,"about_ca_system_score_codex":0.000031976488,"about_ca_system_score_gemma":0.0003629414,"threshold_uncertainty_score":0.99737245},"labels":[],"label_agreement":null},{"id":"W2889616780","doi":"10.1609/aaai.v33i01.33011861","title":"Solving Large Extensive-Form Games with Strategy Constraints","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Computer science; Set (abstract data type); Nash equilibrium; Mathematical optimization; Perfect information; Counterfactual thinking; Consistency (knowledge bases); Complete information; Mathematical economics; Mathematics; Artificial intelligence; Machine learning","score_opus":0.07993644806912124,"score_gpt":0.3080277459254752,"score_spread":0.22809129785635396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889616780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34144136,0.00039710142,0.5257224,0.009145908,0.0059675053,0.0063924836,0.0002000778,0.0011623048,0.109570846],"genre_scores_gemma":[0.99268293,0.00013559053,0.0057914983,0.00040048736,0.00018375016,0.000096052674,0.000003385112,0.00006356956,0.0006427302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99382883,0.000055388256,0.0015178182,0.0018694826,0.0015186418,0.0012098603],"domain_scores_gemma":[0.9932286,0.00031369095,0.0018071999,0.0014741446,0.0029354405,0.00024088129],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011352838,0.00096922554,0.0010994407,0.0003921857,0.0003655034,0.0012759491,0.006948959,0.0005656976,0.00027277527],"category_scores_gemma":[0.00068716565,0.0007044164,0.00041492571,0.0008358329,0.0013683249,0.0008238161,0.0033635285,0.0019893725,0.00041650215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011575521,0.00031600334,0.00051544356,0.00029250397,0.00011518855,0.00000675384,0.0034212896,0.0019201159,0.004533004,0.8970601,0.0003483351,0.09135549],"study_design_scores_gemma":[0.000051723546,0.0006025835,0.00029280616,0.002725563,0.00007548551,0.00003314531,0.004039483,0.21017675,0.38852152,0.39204288,0.0001689897,0.0012690475],"about_ca_topic_score_codex":0.0001063042,"about_ca_topic_score_gemma":0.00006371525,"teacher_disagreement_score":0.6512416,"about_ca_system_score_codex":0.00018787784,"about_ca_system_score_gemma":0.001031921,"threshold_uncertainty_score":0.9997608},"labels":[],"label_agreement":null},{"id":"W2890301603","doi":"10.48550/arxiv.1809.07640","title":"Properties of a $q$-analogue of zero forcing","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Forcing (mathematics); Vertex (graph theory); Oracle; Mathematics; Zero (linguistics); Graph; Security token; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.16435542676159756,"score_gpt":0.20933959848517664,"score_spread":0.044984171723579075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890301603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47913268,0.00006318915,0.51922077,0.000023202298,0.0002816818,0.00014736847,0.0000046658206,0.00005566397,0.0010707864],"genre_scores_gemma":[0.99692535,0.000048127717,0.0025133914,0.000018296801,0.000035769368,4.8056154e-7,0.000001317911,0.000010889168,0.00044635506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985471,0.00009599416,0.0003516737,0.00064657826,0.00011610183,0.00024255812],"domain_scores_gemma":[0.9976977,0.000062136845,0.0004982358,0.0012157051,0.00045546298,0.00007076071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028049838,0.00020914592,0.00040869092,0.00027095462,0.00006038214,0.000029797322,0.0021914423,0.00020100892,0.000017166714],"category_scores_gemma":[0.00009670781,0.00021318474,0.0002271348,0.00044681964,0.0004454803,0.00028439186,0.0021610141,0.00024209169,0.00003453582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015661052,0.00044415914,0.01405953,0.0011840936,0.00058748544,0.00014213052,0.0073947455,0.2944852,0.010750486,0.6657532,0.0007659577,0.0042764004],"study_design_scores_gemma":[0.00010676585,0.00017820709,0.0002908952,0.00067883835,0.000096678305,0.0000029837208,0.00028018694,0.59743536,0.2355991,0.16472048,0.00012404556,0.00048646747],"about_ca_topic_score_codex":0.0006110311,"about_ca_topic_score_gemma":0.00007519689,"teacher_disagreement_score":0.5177927,"about_ca_system_score_codex":0.000073813615,"about_ca_system_score_gemma":0.00022338863,"threshold_uncertainty_score":0.86934215},"labels":[],"label_agreement":null},{"id":"W2895868736","doi":"10.3233/aic-170537","title":"Performance robustness of AI planners in the 2014 International Planning Competition","year":2018,"lang":"en","type":"article","venue":"AI Communications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Agile software development; Solver; Computer science; Robustness (evolution); Software; Benchmark (surveying); Competition (biology); Homogeneous; Software engineering; Operating system","score_opus":0.06033374970487245,"score_gpt":0.35273007519386257,"score_spread":0.29239632548899014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895868736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21113451,0.0001759715,0.7025282,0.054818287,0.0008473094,0.00031115214,0.00000760298,0.000111500136,0.03006551],"genre_scores_gemma":[0.9882972,0.00004750728,0.01077001,0.0007691044,0.000052552565,0.000021981068,0.000011865948,0.0000031224154,0.000026616408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924886,0.00012162443,0.00023930309,0.00010873424,0.00017258641,0.00010886037],"domain_scores_gemma":[0.9982231,0.00024957128,0.00008762544,0.0012490483,0.00017593111,0.000014671703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042579096,0.000058354188,0.00006817948,0.00010863202,0.00017535537,0.00006130847,0.003502191,0.000030458654,0.000020739397],"category_scores_gemma":[0.000045093282,0.00004869464,0.000022611353,0.00028043578,0.00031100138,0.0004668516,0.00039926392,0.00020457161,0.00005271826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024859899,0.0005037351,0.11587823,0.000017021901,0.000041283598,0.0000016254218,0.030318426,0.039893653,0.0006069683,0.7613787,0.016873265,0.034462214],"study_design_scores_gemma":[0.000056354063,0.000056030054,0.020329827,0.00007769473,0.0000026499936,0.000008715906,0.0005658553,0.961843,0.000976935,0.0018900363,0.014099609,0.00009325703],"about_ca_topic_score_codex":0.00006873473,"about_ca_topic_score_gemma":0.00012693803,"teacher_disagreement_score":0.9219494,"about_ca_system_score_codex":0.00002468249,"about_ca_system_score_gemma":0.000042517477,"threshold_uncertainty_score":0.65080005},"labels":[],"label_agreement":null},{"id":"W2895973392","doi":"10.1109/cig.2018.8490374","title":"Evolving Number Sentence Morphing Puzzles","year":2018,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Sentence; Computer science; Morphing; Class (philosophy); Edit distance; Artificial intelligence; Word (group theory); Object (grammar); Natural language processing; Theoretical computer science; Mathematics","score_opus":0.03646522643798296,"score_gpt":0.30391587003812004,"score_spread":0.2674506436001371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895973392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043249257,0.000017496743,0.8876772,0.0013067268,0.00067037344,0.000058850652,1.6028184e-7,0.00036337166,0.06665658],"genre_scores_gemma":[0.8616548,0.0000029798086,0.13574542,0.0006530853,0.00022994436,0.000003381013,9.937598e-8,0.0000058330497,0.0017044628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891067,0.000028166109,0.00018947302,0.0003311639,0.00024051324,0.0003000036],"domain_scores_gemma":[0.9990664,0.00009964369,0.000047554116,0.00051354046,0.00019579199,0.00007708443],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022798245,0.00009876748,0.00008626591,0.000040040555,0.00018443087,0.0002769914,0.0009565499,0.000037314356,0.0007430535],"category_scores_gemma":[0.00015422501,0.0000848303,0.0000405699,0.0003039831,0.00015081499,0.00097515946,0.00037574032,0.00007897425,0.004490948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044756503,0.00010248081,0.042838525,0.000011107703,0.000028691271,0.000053784344,0.0064807334,0.000055037257,0.017235775,0.6954337,0.03753135,0.20022434],"study_design_scores_gemma":[0.000049901802,0.00006439932,0.003287909,0.00006112864,0.000004394815,0.000091150934,0.0006237451,0.6008299,0.30004054,0.08321931,0.011189175,0.00053843786],"about_ca_topic_score_codex":0.00019923886,"about_ca_topic_score_gemma":0.00008607406,"teacher_disagreement_score":0.81840557,"about_ca_system_score_codex":0.000028481432,"about_ca_system_score_gemma":0.000033096832,"threshold_uncertainty_score":0.9962842},"labels":[],"label_agreement":null},{"id":"W2897422953","doi":"10.1109/cig.2018.8490428","title":"Toward General Mathematical Game Playing Agents","year":2018,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Dilemma; Computer science; Video game design; Simultaneous game; Combinatorial game theory; Sequential game; Non-cooperative game; Repeated game; Game mechanics; Game theory; Screening game; Adversary; Prisoner's dilemma; Domain (mathematical analysis); Artificial intelligence; Mathematical economics; Computer security; Mathematics","score_opus":0.10886584566970764,"score_gpt":0.3390000291593988,"score_spread":0.23013418348969117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897422953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09944932,0.0000060046646,0.84976876,0.00091091776,0.0003740204,0.00007251406,2.1038554e-7,0.00022964823,0.049188603],"genre_scores_gemma":[0.8103864,0.0000013943298,0.18585706,0.00091073377,0.00024995825,0.000005428513,1.7634952e-7,0.000006421,0.0025824218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988905,0.000027363523,0.0002264033,0.00029244038,0.00026166046,0.00030164132],"domain_scores_gemma":[0.9992837,0.00005681732,0.00003736658,0.00044264385,0.000077596356,0.00010190855],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017781476,0.00010136858,0.00011017785,0.000053640695,0.00007985133,0.00017102827,0.00087499584,0.0000481078,0.0009640663],"category_scores_gemma":[0.00007911365,0.00008182005,0.000049666356,0.00018498709,0.00012350737,0.00033368747,0.00033743188,0.00006929973,0.0050469856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003897887,0.00009235928,0.000547858,0.000010495673,0.000019458299,0.000043177883,0.005294039,0.000027205946,0.0023868221,0.90261674,0.011604844,0.07735311],"study_design_scores_gemma":[0.000036820264,0.0001119029,0.0004435778,0.000017328852,0.000003574126,0.000047501308,0.00008862462,0.75061023,0.07977966,0.16231275,0.0062749246,0.0002730664],"about_ca_topic_score_codex":0.000023338474,"about_ca_topic_score_gemma":0.000004703329,"teacher_disagreement_score":0.75058305,"about_ca_system_score_codex":0.000026199852,"about_ca_system_score_gemma":0.000027313159,"threshold_uncertainty_score":0.9999492},"labels":[],"label_agreement":null},{"id":"W2897843712","doi":"10.1109/cig.2018.8490400","title":"Anxious Learning in Real-Time Heuristic Search","year":2018,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Computer science; Incremental heuristic search; Null-move heuristic; Artificial intelligence; Pathfinding; Consistent heuristic; Process (computing); Plan (archaeology); Machine learning; Beam search; Search algorithm; Theoretical computer science; Algorithm","score_opus":0.039138213282300126,"score_gpt":0.32278708803653233,"score_spread":0.2836488747542322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897843712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4767004,0.000015528447,0.35859397,0.0009384004,0.00025395467,0.00015080348,1.13781326e-7,0.00060952315,0.16273731],"genre_scores_gemma":[0.9735361,0.000011444987,0.01884286,0.00010628691,0.00010272268,0.0000031495033,2.6761958e-7,0.000006987657,0.00739018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885786,0.00009918471,0.0001879695,0.0003105988,0.0002151241,0.00032925734],"domain_scores_gemma":[0.9993135,0.00016818602,0.000023450537,0.0003349164,0.00009404612,0.00006594159],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004644509,0.000078701414,0.000101353166,0.0001285705,0.00009352197,0.0001163124,0.00065895834,0.000042380205,0.00034737706],"category_scores_gemma":[0.0001491175,0.00007202233,0.000022291122,0.00047663352,0.0001240557,0.00023544331,0.00027119354,0.00014892899,0.0048445957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000330175,0.00025504152,0.049207363,0.000016446642,0.000017809421,0.00023403628,0.016838692,0.0027407266,0.039062377,0.18016414,0.0065013254,0.70492905],"study_design_scores_gemma":[0.00006142526,0.0003412856,0.005668667,0.000024104656,0.0000011178827,0.000016738575,0.00018301616,0.9373852,0.04440773,0.008606519,0.0030368727,0.00026729357],"about_ca_topic_score_codex":0.0007193663,"about_ca_topic_score_gemma":0.0001508435,"teacher_disagreement_score":0.9346445,"about_ca_system_score_codex":0.00004211757,"about_ca_system_score_gemma":0.00006258578,"threshold_uncertainty_score":0.99593025},"labels":[],"label_agreement":null},{"id":"W2899286946","doi":"10.7202/1052636ar","title":"La fabrique des restes","year":2018,"lang":"fr","type":"article","venue":"Anthropologie et Sociétés","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy; Art","score_opus":0.3800986455057762,"score_gpt":0.5906765284692278,"score_spread":0.2105778829634516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899286946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046035785,0.010107943,0.5436983,0.16605726,0.044469,0.00041815784,0.00002338874,0.0008482489,0.18834192],"genre_scores_gemma":[0.92944175,0.010596519,0.03562117,0.002067518,0.0010322186,0.000021341986,0.000002262736,0.00004666764,0.021170573],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962898,0.0011476454,0.00049930066,0.000771863,0.00033136323,0.0009600101],"domain_scores_gemma":[0.9965748,0.0017071988,0.000132176,0.0009209657,0.00048253045,0.00018232837],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014057665,0.0003638408,0.00036969365,0.00009054526,0.00078092096,0.00050358777,0.0014815034,0.00056834327,0.01106557],"category_scores_gemma":[0.0017736293,0.0003611753,0.00020160447,0.0005760772,0.017228488,0.0012970403,0.00095444545,0.00061527255,0.0027330539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012472542,0.0002473237,0.0017229406,0.000042670024,0.000054624168,0.00018978339,0.011220142,0.000011687153,0.00050589314,0.24772044,0.07185626,0.66641575],"study_design_scores_gemma":[0.0001547442,0.0012862456,0.0021276535,0.00034063833,0.0000433948,0.00019334134,0.019316418,0.006966354,0.100701265,0.4487927,0.41919023,0.00088703947],"about_ca_topic_score_codex":0.002608511,"about_ca_topic_score_gemma":0.00078536256,"teacher_disagreement_score":0.8834059,"about_ca_system_score_codex":0.00019103021,"about_ca_system_score_gemma":0.00042541797,"threshold_uncertainty_score":0.999884},"labels":[],"label_agreement":null},{"id":"W2901082336","doi":"10.1007/978-3-030-04028-4_54","title":"Expressive Range Analysis of a Possible Worlds Driven Emergent Narrative System","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"","keywords":"Affordance; Computer science; Narrative; Range (aeronautics); Human–computer interaction; Cognitive science; Data science; Linguistics; Psychology","score_opus":0.025800836142940046,"score_gpt":0.2820332817646234,"score_spread":0.25623244562168335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901082336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016761842,0.0003868262,0.99262065,0.00017373794,0.0018033562,0.00047590476,0.000016198506,0.0001494517,0.002697696],"genre_scores_gemma":[0.78480715,0.0000304466,0.21354748,0.00026226163,0.00047984513,0.000028259572,0.0000069422945,0.000040238323,0.00079741015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495107,0.00009310642,0.0010479107,0.0017839333,0.001437977,0.00068598444],"domain_scores_gemma":[0.9954649,0.0004588756,0.0008899293,0.0020368893,0.00094043714,0.00020894784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008398807,0.0005962644,0.0011478136,0.002571117,0.00028993408,0.000315973,0.0046884334,0.00032826193,0.00016496854],"category_scores_gemma":[0.00011103432,0.0005250503,0.00042902853,0.0030288177,0.0014676775,0.000613802,0.0016213699,0.0005109562,0.00005989732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006769827,0.00019963022,0.0015337366,0.00028205643,0.0014827476,0.00035890983,0.13316911,0.43995366,0.0015081498,0.07042639,0.0003385309,0.3506794],"study_design_scores_gemma":[0.000078599034,0.00023138571,0.00014076763,0.0006798263,0.00014770315,0.000010951038,0.000015525393,0.97524095,0.008681115,0.0139260385,0.00018296337,0.0006641993],"about_ca_topic_score_codex":0.00008413145,"about_ca_topic_score_gemma":0.0004757999,"teacher_disagreement_score":0.78313094,"about_ca_system_score_codex":0.0004348604,"about_ca_system_score_gemma":0.00048403806,"threshold_uncertainty_score":0.9997201},"labels":[],"label_agreement":null},{"id":"W2902175002","doi":"10.1609/aiide.v14i1.13035","title":"Modelling Player Understanding of Non-Player Character Paths","year":2018,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Backtracking; Abstraction; Path (computing); Representation (politics); Character (mathematics); Adversary; Human–computer interaction; Simple (philosophy); Work (physics); Artificial intelligence; Theoretical computer science; Computer security; Algorithm; Mathematics; Programming language","score_opus":0.08910228045014464,"score_gpt":0.2975196434999934,"score_spread":0.20841736304984876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902175002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5049217,0.000009809327,0.47424287,0.0010017896,0.00066483533,0.0005214829,0.000018563844,0.000043066968,0.018575888],"genre_scores_gemma":[0.9986642,0.00003232903,0.0007735653,0.00019307257,0.00009783431,0.000022133103,9.968845e-7,0.000018958937,0.00019690812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974466,0.000018386383,0.00086478016,0.0006454532,0.0005874247,0.0004373698],"domain_scores_gemma":[0.9980078,0.00020508646,0.0006394411,0.000326266,0.000697693,0.00012376123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034386152,0.0003482301,0.00039926078,0.00022696346,0.00023495436,0.00050128397,0.0012846071,0.00010016205,0.000068368594],"category_scores_gemma":[0.00018045297,0.00026012937,0.000183227,0.00037224233,0.0006560692,0.0018035254,0.0006423659,0.00034868822,0.00006532967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000607272,0.0007905967,0.0011135257,0.00008847875,0.00017763223,0.0000021529372,0.02238567,0.00034201343,0.0595164,0.8292821,0.00016151294,0.085532665],"study_design_scores_gemma":[0.000032009168,0.0007189896,0.000039617757,0.00053667027,0.0000130657145,0.0000060198704,0.005917476,0.29602996,0.61908543,0.07725581,0.000101567486,0.0002633823],"about_ca_topic_score_codex":0.000040259125,"about_ca_topic_score_gemma":0.0000042781126,"teacher_disagreement_score":0.75202626,"about_ca_system_score_codex":0.00014765852,"about_ca_system_score_gemma":0.00005894022,"threshold_uncertainty_score":0.9999851},"labels":[],"label_agreement":null},{"id":"W2902275664","doi":"10.1609/aiide.v14i1.13029","title":"Toward a Unified Understanding of Experience Management","year":2018,"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":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Task (project management); Point (geometry); Representation (politics); Basis (linear algebra); Human–computer interaction; Artificial intelligence; Mathematics; Engineering","score_opus":0.11648290546083394,"score_gpt":0.3147600715243256,"score_spread":0.19827716606349166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902275664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.575016,0.000023569535,0.3112788,0.0025053434,0.0010148168,0.0010576437,0.000016122596,0.00010107894,0.108986594],"genre_scores_gemma":[0.9987108,0.000038345384,0.00076562515,0.00015611186,0.000038323218,0.00002972813,4.363952e-7,0.000011473067,0.00024917538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977838,0.000014480335,0.00071354257,0.0005737327,0.00055714726,0.0003573451],"domain_scores_gemma":[0.99853456,0.00011022482,0.00048301896,0.00030844455,0.00046226682,0.00010148532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002038825,0.00027641415,0.00030168222,0.000204603,0.00015893904,0.00040347705,0.0014733542,0.000060409173,0.00005495835],"category_scores_gemma":[0.00015379816,0.00020795407,0.00016034904,0.00046835153,0.0009333994,0.0012434243,0.000864158,0.0001771008,0.00003358198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018646213,0.00025241022,0.00043634107,0.000043534725,0.000069333495,0.0000011915918,0.012628077,0.000004493781,0.006088668,0.92144465,0.000040217543,0.05880464],"study_design_scores_gemma":[0.00004001777,0.00084421295,0.00015240541,0.00061267975,0.000015613115,0.000007861831,0.030628985,0.013374855,0.7281776,0.22571537,0.00015279811,0.0002776113],"about_ca_topic_score_codex":0.00002022493,"about_ca_topic_score_gemma":0.0000033869678,"teacher_disagreement_score":0.72208893,"about_ca_system_score_codex":0.00014371831,"about_ca_system_score_gemma":0.000029698773,"threshold_uncertainty_score":0.8480121},"labels":[],"label_agreement":null},{"id":"W2902955471","doi":"10.1609/aiide.v14i1.13018","title":"Action Abstractions for Combinatorial Multi-Armed Bandit Tree Search","year":2018,"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":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Alberta","keywords":"Action (physics); Computer science; Abstraction; Space (punctuation); Tree (set theory); State (computer science); Theoretical computer science; Machine learning; Algorithm; Mathematics","score_opus":0.11638598488370626,"score_gpt":0.3538952261254863,"score_spread":0.23750924124178002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902955471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6569259,0.000018213457,0.31598386,0.0048933723,0.0044501047,0.0023368243,0.00007000299,0.00019163317,0.015130035],"genre_scores_gemma":[0.99818134,0.000023965866,0.00089937,0.00014210709,0.00022888907,0.00009729247,0.0000024718204,0.000017493478,0.00040705185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978036,0.000016905678,0.00063361623,0.00064422423,0.00046461172,0.00043702105],"domain_scores_gemma":[0.997883,0.00026735166,0.00035604936,0.0002673683,0.0010892339,0.00013696466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029427628,0.00029675462,0.0002853388,0.00015621891,0.00037046714,0.0008022245,0.0010943793,0.00010259604,0.000054243385],"category_scores_gemma":[0.00042245502,0.0002302571,0.0001879758,0.00027125454,0.0006161443,0.001697058,0.00039161072,0.00029286524,0.00010222804],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007641694,0.0011854805,0.00048054854,0.00005046837,0.00011997795,6.105454e-7,0.005489608,0.000017855187,0.042563528,0.5422067,0.00036060976,0.40676045],"study_design_scores_gemma":[0.00010286698,0.001399447,0.00034980837,0.00019407152,0.000017697475,0.000007253063,0.0050016176,0.060996078,0.86823684,0.06253618,0.0008563116,0.0003018418],"about_ca_topic_score_codex":0.000038258793,"about_ca_topic_score_gemma":0.000023901572,"teacher_disagreement_score":0.8256733,"about_ca_system_score_codex":0.00015317931,"about_ca_system_score_gemma":0.00007390417,"threshold_uncertainty_score":0.9389612},"labels":[],"label_agreement":null},{"id":"W2904526711","doi":"10.1609/aaai.v33i01.33011158","title":"Improving Search with Supervised Learning in Trick-Based Card Games","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Sampling (signal processing); Artificial intelligence; Machine learning; Focus (optics); Monte Carlo tree search; Sample (material); Sampling bias; Process (computing); Monte Carlo method; Sample size determination; Statistics; Mathematics","score_opus":0.05390015759600682,"score_gpt":0.281418344109766,"score_spread":0.2275181865137592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904526711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94760174,0.00003090697,0.040135313,0.0025176103,0.0003493294,0.0010553275,0.0000018988522,0.00020736433,0.008100499],"genre_scores_gemma":[0.99400467,0.000011770413,0.0052502314,0.00017300356,0.000042336553,0.000042938485,5.0342703e-7,0.000029704508,0.00044484495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99645877,0.000069004716,0.0007923724,0.0009262566,0.001011993,0.00074158754],"domain_scores_gemma":[0.99775887,0.00033401797,0.00037739318,0.0005468231,0.00085389626,0.00012898206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001130356,0.0003751452,0.00048584514,0.0004442265,0.00017495191,0.00043048756,0.0029405379,0.00015057129,0.000105004925],"category_scores_gemma":[0.00047283695,0.00027466842,0.00015399882,0.0018489327,0.00035823867,0.0007384504,0.00045074546,0.00087300135,0.00024562204],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004778474,0.0004196602,0.035685334,0.00023143842,0.000029774726,0.0000061337632,0.0058983755,0.016381737,0.13501658,0.45570803,0.000023362294,0.3501217],"study_design_scores_gemma":[0.000052191004,0.0005021255,0.0005166485,0.00031998777,0.0000064141495,0.0000029350663,0.0018714999,0.44127873,0.54923886,0.0058633657,0.000036855705,0.0003103977],"about_ca_topic_score_codex":0.0004056739,"about_ca_topic_score_gemma":0.00006803295,"teacher_disagreement_score":0.44984466,"about_ca_system_score_codex":0.00013731174,"about_ca_system_score_gemma":0.0004244349,"threshold_uncertainty_score":0.99997056},"labels":[],"label_agreement":null},{"id":"W2905140178","doi":"10.1109/tg.2018.2882899","title":"Guest Editorial Special Issue on Deep/Reinforcement Learning and Games","year":2018,"lang":"en","type":"editorial","venue":"IEEE Transactions on Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Chiao Tung University; Shanghai Educational Development Foundation; University of Alberta","keywords":"Reinforcement learning; Computer science; Monte Carlo tree search; Artificial intelligence; Probabilistic logic; Variety (cybernetics); Convolutional neural network; Deep learning; Scheduling (production processes); Video game; Multimedia; Monte Carlo method; Engineering","score_opus":0.013021686781069589,"score_gpt":0.2802858460963722,"score_spread":0.2672641593153026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905140178","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011875956,0.000040996645,0.2311497,0.00013604663,0.76478064,0.00032641017,0.000015425467,0.00031194618,0.0032269338],"genre_scores_gemma":[0.0015505167,0.0004929801,0.0007880252,0.000060013648,0.98792744,0.00010002009,0.000015557594,0.0000788466,0.008986591],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949744,0.00020529833,0.0007781151,0.0013408598,0.0019512324,0.0007501291],"domain_scores_gemma":[0.9964924,0.0014983655,0.00036740163,0.00087514403,0.00048644518,0.00028027027],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005138605,0.0007616685,0.00068050594,0.0005368171,0.0006331789,0.0007428515,0.0012491652,0.0011723675,0.0004965331],"category_scores_gemma":[0.00023098462,0.0007524403,0.00027351792,0.0003862697,0.0004271341,0.0005444016,0.000022814173,0.0021492909,0.0016127349],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012841568,0.00011596314,4.1391078e-7,0.000035548805,0.00007803118,0.000012250231,0.0013757144,0.003979371,0.000020399613,0.00004824877,0.9479777,0.04622792],"study_design_scores_gemma":[0.00026862088,0.0015127361,3.815036e-7,0.00018449475,0.000065551445,0.0000025386112,0.00013180706,0.0031855388,0.008406781,0.00020132682,0.9853173,0.0007229448],"about_ca_topic_score_codex":0.00013141954,"about_ca_topic_score_gemma":0.00017919368,"teacher_disagreement_score":0.23036167,"about_ca_system_score_codex":0.00029440105,"about_ca_system_score_gemma":0.0003127991,"threshold_uncertainty_score":0.99949265},"labels":[],"label_agreement":null},{"id":"W2908003704","doi":"10.1109/icbk.2018.00056","title":"Opponent Resource Prediction in StarCraft Using Imperfect Information","year":2018,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Focus (optics); Perfect information; Adversary; Imperfect; Machine learning; Resource (disambiguation); State (computer science); Algorithm; Mathematics","score_opus":0.03367370452275216,"score_gpt":0.2834640481862793,"score_spread":0.24979034366352715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908003704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34845704,0.000004533031,0.6449123,0.00021976454,0.0002150766,0.0001060193,6.604069e-7,0.000121182304,0.0059634307],"genre_scores_gemma":[0.9772698,0.0000013506074,0.0222229,0.00032677368,0.00009046399,0.000003863523,0.0000013544295,0.0000027256833,0.0000807252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991564,0.000044664972,0.0002701064,0.00013588417,0.00020170902,0.00019120955],"domain_scores_gemma":[0.99951154,0.000037296835,0.000050583374,0.0002821474,0.00007477664,0.000043676635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037566418,0.00006855112,0.000063748696,0.00018027065,0.00008046472,0.00013152524,0.00033435063,0.000044261935,0.00007442829],"category_scores_gemma":[0.00006664658,0.000062069346,0.000020265823,0.0003582333,0.000056537487,0.0017372542,0.00015779333,0.00007167031,0.00028257212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010698657,0.00021572267,0.04091996,0.00004285352,0.000029119905,0.000012254454,0.046462834,0.0153193,0.025791265,0.083335,0.011496363,0.77626836],"study_design_scores_gemma":[0.00004786262,0.0001129021,0.0021846641,0.000017795857,0.0000010247486,0.000006857104,0.00026966794,0.9524267,0.032225106,0.0013872785,0.0112298,0.000090345195],"about_ca_topic_score_codex":0.00036706755,"about_ca_topic_score_gemma":0.00007844239,"teacher_disagreement_score":0.9371074,"about_ca_system_score_codex":0.000105777246,"about_ca_system_score_gemma":0.000045877066,"threshold_uncertainty_score":0.3631987},"labels":[],"label_agreement":null},{"id":"W2912387951","doi":"","title":"Solving checkers","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Value (mathematics); Simple (philosophy); Space (punctuation); Artificial intelligence; Theoretical computer science; Machine learning","score_opus":0.12737641878613642,"score_gpt":0.33874866211450416,"score_spread":0.21137224332836774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912387951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00710079,0.00003007685,0.8857418,0.03354484,0.00248794,0.0002786227,0.000008221014,0.0005365015,0.070271224],"genre_scores_gemma":[0.95563924,0.00007334553,0.040576924,0.0020090598,0.0007196667,0.000047855367,0.0000060683024,0.000024504267,0.00090331415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962464,0.00009259931,0.0010342047,0.00095830305,0.0010331435,0.00063537236],"domain_scores_gemma":[0.99773705,0.0001965947,0.00030476123,0.0008700014,0.00064078544,0.0002508241],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006217316,0.00038713525,0.00030416137,0.00045263465,0.00023991679,0.0008476148,0.0026905395,0.00015162781,0.001617485],"category_scores_gemma":[0.0005334717,0.0003853845,0.00021438648,0.00044396677,0.00026366624,0.0013092608,0.00045714062,0.00050012156,0.007807428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015176814,0.00013622397,0.000018550238,0.0000016180519,0.000020248473,0.0000146040575,0.00062061584,0.0018756661,0.0052182307,0.5968045,0.00037772654,0.3948968],"study_design_scores_gemma":[0.000023367249,0.00012574655,0.00009496399,0.00009160557,0.0000048709694,0.000026448757,0.0004211501,0.5241276,0.30617607,0.15812957,0.010257584,0.0005209943],"about_ca_topic_score_codex":0.0000755375,"about_ca_topic_score_gemma":0.00014059119,"teacher_disagreement_score":0.9485385,"about_ca_system_score_codex":0.0002903492,"about_ca_system_score_gemma":0.00019606581,"threshold_uncertainty_score":0.9998598},"labels":[],"label_agreement":null},{"id":"W2912875245","doi":"10.1007/978-3-540-79723-4_17","title":"Parameterized Chess","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Class (philosophy); Computer science; Mathematics; Mathematical economics; Artificial intelligence; Algorithm","score_opus":0.04138271908632098,"score_gpt":0.2748051032470701,"score_spread":0.2334223841607491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912875245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020340472,0.00051241234,0.98835456,0.0006946344,0.0025823985,0.00038820805,0.0000028348747,0.00031424366,0.0069473037],"genre_scores_gemma":[0.12059111,0.0002659777,0.87407655,0.0026384003,0.00081434316,0.000013403072,0.0000039216484,0.00007429753,0.0015220294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951412,0.000041698408,0.0007320589,0.0019242251,0.0012608604,0.00089993095],"domain_scores_gemma":[0.9963138,0.00068506476,0.00034382733,0.0021372722,0.0002828005,0.00023724594],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006659071,0.0006474384,0.00069565774,0.00084784796,0.00032566756,0.0005533834,0.0057283053,0.0004269898,0.00004957758],"category_scores_gemma":[0.00017207612,0.0006036862,0.00021061586,0.0007294415,0.0016162315,0.00079513935,0.0018017458,0.00097265065,0.00034112734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061154205,0.000030957675,0.000029578023,0.000016671404,0.000011005192,0.00028010036,0.0014288583,0.011347192,0.0001945099,0.010036014,0.0001010494,0.976518],"study_design_scores_gemma":[0.00017772961,0.0002785771,0.0000685765,0.00041659572,0.000008889992,0.00032750037,2.1441818e-7,0.70363504,0.01794047,0.25578192,0.019734597,0.0016299066],"about_ca_topic_score_codex":0.000027944332,"about_ca_topic_score_gemma":0.00003989942,"teacher_disagreement_score":0.974888,"about_ca_system_score_codex":0.00032721227,"about_ca_system_score_gemma":0.00066611933,"threshold_uncertainty_score":0.9996512},"labels":[],"label_agreement":null},{"id":"W2913078482","doi":"","title":"On a switch-setting problem arising from a variation of the 'lights out' game","year":2012,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Toronto Metropolitan University","funders":"","keywords":"Variation (astronomy); Computer science; Mathematical economics; Psychology; Economics; Physics; Astronomy","score_opus":0.01568678509075069,"score_gpt":0.20871295685113478,"score_spread":0.19302617176038409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913078482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5288784,0.000047715304,0.4376272,0.000262569,0.0022358,0.00024906808,0.0000082307115,0.0001340266,0.030556992],"genre_scores_gemma":[0.9882616,0.0000017137169,0.010454579,0.000056294255,0.00021822876,0.0000010610247,0.0000026148773,0.000006762058,0.0009971632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983473,0.00015704549,0.0002960473,0.00035633612,0.0005509145,0.00029238308],"domain_scores_gemma":[0.9986336,0.00025967346,0.00030920858,0.0005154425,0.00017259682,0.00010947673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002096386,0.00016828976,0.00015749135,0.00017309778,0.00072498736,0.0000983682,0.0009024961,0.00011324231,0.000010272268],"category_scores_gemma":[0.00010785736,0.00014910662,0.00013052231,0.0004539359,0.00026383868,0.0011913612,0.0003183795,0.00024269678,0.00004599536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035076904,0.00025211886,0.018482555,0.000016446387,0.00007712536,0.00006326833,0.0038170228,0.0067873634,0.025759669,0.9425533,0.00008304085,0.0020730258],"study_design_scores_gemma":[0.0013127801,0.0003255373,0.4708237,0.002159867,0.00034029598,0.0002481125,0.0012972828,0.07269194,0.34748548,0.055266783,0.045774397,0.0022738408],"about_ca_topic_score_codex":0.00038714282,"about_ca_topic_score_gemma":0.000037503636,"teacher_disagreement_score":0.8872865,"about_ca_system_score_codex":0.0004194577,"about_ca_system_score_gemma":0.00029383483,"threshold_uncertainty_score":0.60803914},"labels":[],"label_agreement":null},{"id":"W2913550238","doi":"10.1142/s0129626418500111","title":"Using Convolution and Deep Learning in Gomoku Game Artificial Intelligence","year":2018,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University; Lakehead University","funders":"","keywords":"Computer science; Artificial intelligence; Artificial neural network; Deep learning; Convolutional neural network; Game tree; Machine learning; Tree (set theory); Convolution (computer science); Sequential game; Game theory; Mathematics","score_opus":0.06885911131113163,"score_gpt":0.32108509519682515,"score_spread":0.2522259838856935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913550238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26764178,0.00027624622,0.7302367,0.0013175101,0.00017287687,0.00009697795,7.219296e-8,0.00013439647,0.00012344074],"genre_scores_gemma":[0.9206022,0.000014186498,0.078320794,0.000832969,0.00019529673,0.000008274822,5.4170636e-7,0.000014954342,0.0000107648375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981082,0.00011477523,0.00043811204,0.0005749481,0.0002613396,0.00050262007],"domain_scores_gemma":[0.99933964,0.00008413378,0.0001735015,0.00022134504,0.00009569261,0.0000856644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004849024,0.00019657625,0.0001967952,0.00023149571,0.00027698494,0.000397916,0.0004961011,0.000083097475,0.000009964504],"category_scores_gemma":[0.00016134095,0.0002066416,0.000031841777,0.00059681095,0.0004924212,0.00094224623,0.0001994496,0.00030409708,0.00006557234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049166872,0.000076067394,0.0088007655,0.00006769333,0.00001134945,0.000049764545,0.015836636,0.03281621,0.04934917,0.00957624,0.00001748051,0.8833495],"study_design_scores_gemma":[0.0000306489,0.0000510822,0.00089716824,0.0000979189,0.000004631204,0.000029057757,0.00032698232,0.9828299,0.006405465,0.008844657,0.00019573656,0.00028672518],"about_ca_topic_score_codex":0.000114144874,"about_ca_topic_score_gemma":0.000073766845,"teacher_disagreement_score":0.9500137,"about_ca_system_score_codex":0.00010153207,"about_ca_system_score_gemma":0.000057489717,"threshold_uncertainty_score":0.84266},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0945553412646733,"score_gpt":0.30020233166960725,"score_spread":0.20564699040493395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913764096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043957755,0.00021630288,0.9793222,0.0030702981,0.001638596,0.00021033526,0.000001594869,0.0006073275,0.010537574],"genre_scores_gemma":[0.92268103,0.00006762069,0.07469707,0.001246871,0.00050413003,0.000024223102,8.96572e-7,0.000022433205,0.0007557137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972997,0.000100280944,0.0006889181,0.0007587783,0.00048246057,0.00066991855],"domain_scores_gemma":[0.99807847,0.00028859088,0.00013619025,0.001089001,0.0001871434,0.00022058203],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034542737,0.0002784473,0.00025118882,0.00019262826,0.0002840432,0.0004307094,0.0020115143,0.000121464334,0.0010937329],"category_scores_gemma":[0.00012264038,0.0002731487,0.00015282063,0.000929493,0.00028321007,0.0008968255,0.00042488214,0.0002845253,0.017801458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017824424,0.00011546698,0.00005219465,0.0000029144717,0.000008481426,0.000030319747,0.0010459614,0.0008307474,0.00042095248,0.41147327,0.00243738,0.58358055],"study_design_scores_gemma":[0.0000074669824,0.00014413052,0.00003638755,0.000017976157,0.0000046079704,0.000031807685,0.00007459451,0.7747851,0.07367004,0.13831776,0.012498042,0.00041207654],"about_ca_topic_score_codex":0.000047963596,"about_ca_topic_score_gemma":0.00003879013,"teacher_disagreement_score":0.91828525,"about_ca_system_score_codex":0.00006135398,"about_ca_system_score_gemma":0.000019578174,"threshold_uncertainty_score":0.99997205},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16285222363553653,"score_gpt":0.41267342097697784,"score_spread":0.24982119734144131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913781869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026341104,0.0009457857,0.95433867,0.032947615,0.0029697942,0.0013837579,0.0000024501824,0.00021024198,0.0045675957],"genre_scores_gemma":[0.96640515,0.00024119842,0.019384334,0.0007999935,0.000939672,0.0002081724,0.0000020584105,0.000051636107,0.011967804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960883,0.00022530921,0.0007192388,0.000915184,0.0008693484,0.0011825733],"domain_scores_gemma":[0.9951604,0.0019894966,0.00012762388,0.0016931546,0.0007774605,0.00025185058],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027657936,0.00025334297,0.000262685,0.00019669803,0.00089123234,0.00097404147,0.0034721661,0.00015919589,0.00012346702],"category_scores_gemma":[0.0009832397,0.00019469374,0.0001948225,0.0009770301,0.00038084653,0.0007468685,0.00058917835,0.0005724311,0.0045509115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003150698,0.00004253442,0.000025607893,0.0000054049606,0.00001288802,0.0000023061016,0.001264079,0.00024422188,0.00040889034,0.57263404,0.0072072414,0.4181213],"study_design_scores_gemma":[0.000015350253,0.0003210878,0.000012595204,0.000024864765,0.0000034414309,0.0000032661903,0.0010980722,0.11471922,0.05819198,0.67678356,0.14857647,0.00025007664],"about_ca_topic_score_codex":0.00039821846,"about_ca_topic_score_gemma":0.00071861054,"teacher_disagreement_score":0.96377105,"about_ca_system_score_codex":0.00012429692,"about_ca_system_score_gemma":0.00043910605,"threshold_uncertainty_score":0.99622416},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046735180475390686,"score_gpt":0.2919325657892966,"score_spread":0.24519738531390592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914296650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8154395,0.00007129367,0.0875568,0.014844702,0.0008936614,0.0013019443,0.00003394485,0.00019903632,0.07965908],"genre_scores_gemma":[0.99795353,0.00004271212,0.0007270474,0.0005246004,0.000085860396,0.000040666055,8.6528735e-7,0.000014185565,0.00061055674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977934,0.000017079332,0.0006720951,0.00061838224,0.00049465225,0.00040439266],"domain_scores_gemma":[0.99853045,0.00016526133,0.00037980807,0.0002650697,0.0005286948,0.00013070657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023246164,0.00032457625,0.00030398092,0.00015918138,0.00022456248,0.0008810651,0.0013387178,0.00007445915,0.00007685438],"category_scores_gemma":[0.0003576244,0.00023371237,0.00014937752,0.00034800282,0.00036346752,0.0022919353,0.0006871707,0.00033771963,0.00016174492],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008799041,0.00032799222,0.00034418405,0.000011444399,0.000041149677,7.7466694e-7,0.004984636,0.00007382204,0.010081897,0.61212456,0.0001296425,0.37179193],"study_design_scores_gemma":[0.000039662224,0.0006204738,0.00013913502,0.00038221455,0.000011618724,0.000015227606,0.00528684,0.06617791,0.8815267,0.043839157,0.0015556138,0.000405435],"about_ca_topic_score_codex":0.00001239661,"about_ca_topic_score_gemma":0.0000068023955,"teacher_disagreement_score":0.8714448,"about_ca_system_score_codex":0.00013918238,"about_ca_system_score_gemma":0.000051284824,"threshold_uncertainty_score":0.9530514},"labels":[],"label_agreement":null},{"id":"W2917307490","doi":"10.1609/aiide.v10i1.12702","title":"AIIDE 2013 StarCraft Competition","year":2013,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Testbed; Competition (biology); Video game; Scripting language; Artificial intelligence; Task (project management); Entertainment; Video game development; Adversary; Multimedia; Human–computer interaction; Operations research; Game design; Computer security; World Wide Web; Engineering; Programming language","score_opus":0.035521026374979954,"score_gpt":0.26992387560672754,"score_spread":0.2344028492317476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917307490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8586063,0.000044293076,0.084207214,0.017680142,0.0009197991,0.0016499127,0.000023702129,0.00018009148,0.036688544],"genre_scores_gemma":[0.998161,0.000059193335,0.00058581406,0.0005004549,0.000050907915,0.00009421274,0.0000014565659,0.000015145184,0.0005317678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977015,0.000019185647,0.00070115406,0.00060915074,0.0005415565,0.00042745564],"domain_scores_gemma":[0.9982289,0.00016971605,0.00040231823,0.00030904522,0.00073392707,0.00015609802],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001720675,0.00032888682,0.00030680143,0.00016735311,0.00018381879,0.0011646794,0.0013659878,0.000076623706,0.0002520393],"category_scores_gemma":[0.0002266341,0.00023962957,0.00015798192,0.00030325475,0.0004156468,0.0028064,0.00069594587,0.00032129418,0.00047382026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007409069,0.0004827992,0.00079199113,0.00003863404,0.00005843124,8.584622e-7,0.0031652797,0.000034528945,0.019935472,0.7580553,0.00069790246,0.21666469],"study_design_scores_gemma":[0.000049081802,0.0009287958,0.00092705636,0.00057092245,0.0000144776595,0.00001619247,0.007083963,0.07071188,0.47499081,0.44302383,0.0011218181,0.0005611817],"about_ca_topic_score_codex":0.0001618842,"about_ca_topic_score_gemma":0.0000085448955,"teacher_disagreement_score":0.45505533,"about_ca_system_score_codex":0.00010342324,"about_ca_system_score_gemma":0.00003965291,"threshold_uncertainty_score":0.9998722},"labels":[],"label_agreement":null},{"id":"W2919540475","doi":"10.22215/etd/2018-12727","title":"Exploration of Narrative Structure in Games for Story Creation","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Narrative; Plot (graphics); Storytelling; Event (particle physics); Limiting; Narrative structure; Video game; Character (mathematics); Computer science; Narrative inquiry; Literature; Multimedia; Art; Engineering; Mathematics; Statistics","score_opus":0.04079764760335823,"score_gpt":0.34367786158861185,"score_spread":0.3028802139852536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919540475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25373235,0.00020012913,0.73702544,0.00029131366,0.0023460775,0.001313521,0.000017532266,0.00010423422,0.0049693766],"genre_scores_gemma":[0.9182519,0.000035668047,0.07025777,0.000044827433,0.00020893871,0.0001503656,0.0004057218,0.000023777342,0.01062105],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99891216,0.00005596634,0.00034945953,0.0003421331,0.00021117515,0.0001291197],"domain_scores_gemma":[0.998771,0.00012288576,0.0003214635,0.00028755458,0.00047534856,0.000021706503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017677752,0.00015480081,0.00022485608,0.00026624813,0.000058754194,0.00004590558,0.0004315292,0.00021695046,0.000053211657],"category_scores_gemma":[0.00020250195,0.0001437655,0.000057969664,0.00024463507,0.0000397425,0.0009350776,0.000017445198,0.00011695137,0.0000056865724],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022095036,0.000119682205,0.00011193355,0.00028336406,0.00005655725,0.0000011874985,0.4386193,0.00075781136,0.0145407105,0.15808353,0.007965761,0.37923923],"study_design_scores_gemma":[0.00016319567,0.0005049389,0.000991475,0.00028848907,0.000016998029,4.4274677e-7,0.050516047,0.034414597,0.7068012,0.2009697,0.004807359,0.00052555464],"about_ca_topic_score_codex":0.00006117671,"about_ca_topic_score_gemma":0.004527565,"teacher_disagreement_score":0.6922605,"about_ca_system_score_codex":0.00006591193,"about_ca_system_score_gemma":0.00016480422,"threshold_uncertainty_score":0.5862587},"labels":[],"label_agreement":null},{"id":"W2921168138","doi":"10.1145/3299819.3299820","title":"A Hybrid Gomoku Deep Learning Artificial Intelligence","year":2018,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University; Lakehead University","funders":"","keywords":"Artificial intelligence; Computer science; Deep learning; Convolutional neural network; Tree (set theory); Artificial neural network; Machine learning; Game tree; Feature (linguistics); Monte Carlo tree search; Convolution (computer science); Sequential game; Game theory; Mathematics","score_opus":0.04616666988822361,"score_gpt":0.30405711228723703,"score_spread":0.25789044239901343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921168138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019310713,0.000040227744,0.95304304,0.0008208092,0.00082698365,0.000113919996,1.873345e-7,0.0006037001,0.02524041],"genre_scores_gemma":[0.9327286,0.0000097578295,0.065379895,0.0004517939,0.00046411768,0.000010454057,6.0685363e-7,0.0000134445245,0.00094136625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803066,0.000091933405,0.00042448821,0.0005780033,0.00035808026,0.00051683723],"domain_scores_gemma":[0.9987014,0.00018338507,0.00009807831,0.0006140606,0.0002543843,0.00014869473],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047295872,0.00018381211,0.00016462867,0.00014379159,0.00034818536,0.00035781323,0.0014062979,0.000054464184,0.0007468534],"category_scores_gemma":[0.0003467474,0.00016845795,0.000082987186,0.00045953854,0.00031767995,0.0006310926,0.0004641687,0.00024743073,0.006781798],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000493017,0.000035426052,0.0001150655,0.0000016693062,0.0000065849204,0.000015223245,0.0009750452,0.00018923976,0.0009042735,0.3367614,0.00017850568,0.6608126],"study_design_scores_gemma":[0.000006689702,0.00023855224,0.000046411405,0.000009412118,0.0000029636526,0.00003204996,0.0002705853,0.51598084,0.30477005,0.1704402,0.007931259,0.00027098347],"about_ca_topic_score_codex":0.00008252469,"about_ca_topic_score_gemma":0.00009580627,"teacher_disagreement_score":0.9134179,"about_ca_system_score_codex":0.000046643017,"about_ca_system_score_gemma":0.000050448056,"threshold_uncertainty_score":0.99399155},"labels":[],"label_agreement":null},{"id":"W2922074370","doi":"10.1201/b18805-12","title":"3: Hybrid Reconstruction Antialiasing","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Geology","score_opus":0.08671144920246876,"score_gpt":0.2904903207664711,"score_spread":0.20377887156400232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922074370","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008583205,0.00016475217,0.32851255,0.00018750288,0.0019201194,0.00008124431,0.0000018245224,0.00025484402,0.6688686],"genre_scores_gemma":[0.0023996728,0.000069507216,0.05802249,0.00016998111,0.00056812254,0.0000018730453,0.0000041944236,0.000034515757,0.93872964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986488,0.000011974995,0.0003372949,0.00047040463,0.0003417082,0.00018978184],"domain_scores_gemma":[0.9987736,0.00003793826,0.00017968872,0.0006570982,0.00024610528,0.000105604595],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002344299,0.00021957545,0.00023322647,0.00015715971,0.00006795084,0.00019146274,0.00072684046,0.00014268693,0.0005580046],"category_scores_gemma":[0.000032798656,0.00021074123,0.000098027405,0.000022181868,0.000114840856,0.00042421205,0.0002516324,0.00023640113,0.001987655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.093801e-7,0.0000015514469,9.0593295e-7,0.000002371242,0.000008888249,0.000015882397,0.000028899927,0.000008628755,0.000011305806,0.578921,0.0095831305,0.41141662],"study_design_scores_gemma":[0.000016640715,0.000034059536,2.8960392e-7,0.000078408404,0.000008392786,0.00024626436,0.000005525982,0.0065930556,0.002686334,0.6475128,0.34248725,0.0003309854],"about_ca_topic_score_codex":0.000029686851,"about_ca_topic_score_gemma":0.000010896475,"teacher_disagreement_score":0.4110856,"about_ca_system_score_codex":0.00010152068,"about_ca_system_score_gemma":0.00015710389,"threshold_uncertainty_score":0.9987894},"labels":[],"label_agreement":null},{"id":"W2922080958","doi":"","title":"Hex: The Full Story","year":2019,"lang":"en","type":"book","venue":"CERN Document Server (European Organization for Nuclear Research)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Newspaper; Identity (music); Set (abstract data type); Computer science; Game theory; Mathematics education; Mathematics; Mathematical economics; Art; Media studies; Sociology; Programming language; Aesthetics","score_opus":0.04126602432210687,"score_gpt":0.28077711985306497,"score_spread":0.23951109553095812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922080958","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01107879,0.0023433329,0.008794053,0.036745094,0.009124823,0.011708922,0.000032727847,0.005363637,0.91480863],"genre_scores_gemma":[0.07374842,0.0002157125,0.000071310125,0.0008141096,0.0006624486,0.0000016777092,0.00017776988,0.00075091736,0.92355764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961141,0.00075080304,0.00044005277,0.0008917809,0.0011990756,0.0006041932],"domain_scores_gemma":[0.99626464,0.0002571747,0.00028643038,0.0020615312,0.00095610274,0.00017413191],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0022353374,0.0003402425,0.00027630766,0.00027456024,0.0013595024,0.0018675833,0.006072257,0.00017353997,0.0028530424],"category_scores_gemma":[0.00041581024,0.0002837366,0.0001575556,0.00046708115,0.00032694917,0.0007749717,0.0037327076,0.00097046734,0.03707504],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015000719,0.00004052443,0.0000022723984,0.00010079378,0.00007494992,0.000016359072,0.00171699,0.00011414947,0.000021143176,0.73260915,0.26118633,0.004102324],"study_design_scores_gemma":[0.00011931219,0.00025098136,0.000030195446,0.000107062144,0.000017688124,0.0000191772,0.00012226915,0.000060137627,0.00023904347,0.062624335,0.93602324,0.0003865509],"about_ca_topic_score_codex":0.0000087074695,"about_ca_topic_score_gemma":0.000003068798,"teacher_disagreement_score":0.67483693,"about_ca_system_score_codex":0.00078738213,"about_ca_system_score_gemma":0.0001682988,"threshold_uncertainty_score":0.9999615},"labels":[],"label_agreement":null},{"id":"W2922253549","doi":"","title":"Vine copula structure learning via Monte Carlo tree search","year":2019,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Vine copula; Monte Carlo tree search; Computer science; Copula (linguistics); Monte Carlo method; Tree structure; Tree (set theory); Sampling (signal processing); Artificial intelligence; Bivariate analysis; Vine; Machine learning; Mathematics; Algorithm; Statistics; Econometrics; Binary tree","score_opus":0.07554591244505358,"score_gpt":0.3394016780820889,"score_spread":0.2638557656370353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922253549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045494445,0.000036266072,0.9457437,0.0015899211,0.0015626834,0.00030672108,0.00009513558,0.0001381907,0.005032955],"genre_scores_gemma":[0.96786916,0.00011585793,0.030262766,0.0002554175,0.00015661749,0.00000859105,0.000024533145,0.000021166197,0.0012858632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714744,0.00016522144,0.0006333325,0.00075662986,0.00084018597,0.00045717473],"domain_scores_gemma":[0.9980197,0.00050753844,0.00017922111,0.00044355952,0.00066422427,0.00018578257],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003744833,0.00031788304,0.000306467,0.00027263773,0.00019621522,0.0006473095,0.0012040811,0.00014189702,0.0010806674],"category_scores_gemma":[0.0003216542,0.00030545352,0.000059718943,0.00027573027,0.00022509412,0.0004655813,0.00031834305,0.0006031527,0.00079043687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005857829,0.00005071121,0.00053870666,0.0000084737685,0.000029389745,0.000028806438,0.001161148,0.005309527,0.006246651,0.629402,0.00007586517,0.35709015],"study_design_scores_gemma":[0.00003200939,0.00040204648,0.0004034629,0.000055179717,0.0000067468545,0.00002626469,0.00080808916,0.83821535,0.01664785,0.14236796,0.0006663666,0.00036866099],"about_ca_topic_score_codex":0.0002796276,"about_ca_topic_score_gemma":0.00033306715,"teacher_disagreement_score":0.9223747,"about_ca_system_score_codex":0.00009553673,"about_ca_system_score_gemma":0.00012543345,"threshold_uncertainty_score":0.99998754},"labels":[],"label_agreement":null},{"id":"W2924821341","doi":"","title":"Monte-Carlo Tree Search for Constrained MDPs","year":2018,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monte Carlo tree search; Monte Carlo method; Computer science; Tree (set theory); Mathematical optimization; Mathematics; Statistics; Combinatorics","score_opus":0.07943145295394001,"score_gpt":0.3377519798999285,"score_spread":0.2583205269459885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924821341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033229563,0.00001558455,0.9237377,0.0023672353,0.00044617665,0.00028569746,0.0000023437417,0.00025478375,0.039660927],"genre_scores_gemma":[0.8858841,0.0000014772148,0.10971095,0.00042904398,0.00023065791,0.000020000032,1.9722516e-7,0.000006847554,0.0037167403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989126,0.000026612432,0.000193442,0.0003275027,0.00019454776,0.00034529372],"domain_scores_gemma":[0.9989071,0.00023324242,0.000026641777,0.00046314544,0.00027473344,0.0000951731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032474232,0.00009583955,0.000109480556,0.000070108246,0.00014258454,0.00014887462,0.0008779611,0.000051552954,0.00014351033],"category_scores_gemma":[0.00008269095,0.00008035388,0.000066623405,0.00021786631,0.0002803178,0.00029262653,0.000165987,0.00005825798,0.00043627847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021454767,0.000071363254,0.0005930771,0.000008094,0.00002426708,0.0000049096216,0.0026319097,0.000054582746,0.0050414703,0.47825798,0.014967931,0.49832296],"study_design_scores_gemma":[0.00016252071,0.00059961964,0.00034458065,0.000012681776,0.0000044054727,0.000011561618,0.00052035507,0.6403702,0.3265703,0.012784897,0.018314332,0.00030456763],"about_ca_topic_score_codex":0.000093802686,"about_ca_topic_score_gemma":0.00018747855,"teacher_disagreement_score":0.8526545,"about_ca_system_score_codex":0.000023412023,"about_ca_system_score_gemma":0.00008498111,"threshold_uncertainty_score":0.5607623},"labels":[],"label_agreement":null},{"id":"W2942670770","doi":"10.1145/3290607.3313039","title":"Artificial Playfulness","year":2019,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"University of Ontario Institute of Technology","keywords":"Computer science; Usability; Visualization; Human–computer interaction; Process (computing); Resource (disambiguation); Artificial intelligence","score_opus":0.029295967188916864,"score_gpt":0.27431309889626015,"score_spread":0.2450171317073433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942670770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20932844,0.000010347204,0.6940015,0.0009352562,0.0011639636,0.00013074648,2.4228618e-7,0.0003243102,0.09410519],"genre_scores_gemma":[0.98328424,4.4781632e-7,0.013063291,0.00043393188,0.00007343757,0.000005176336,2.5210716e-7,0.0000045747884,0.003134664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991588,0.000019909892,0.0001634993,0.00026144434,0.0001894367,0.00020692048],"domain_scores_gemma":[0.99930257,0.000078364974,0.000029433155,0.0004990539,0.000042193067,0.000048399124],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015048913,0.00007315728,0.000084848376,0.000054351214,0.000041242467,0.00012392855,0.0007554387,0.00003876415,0.0007453846],"category_scores_gemma":[0.000021313568,0.000062081555,0.00003917424,0.00023335207,0.000023477569,0.00041789893,0.00017004284,0.00006992559,0.008653332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018062318,0.000021374479,0.0010333917,0.0000017198408,0.000002708144,0.0000037593343,0.00019403319,0.00016605071,0.0023634308,0.8711372,0.00071785727,0.12435668],"study_design_scores_gemma":[0.000029796449,0.00010190583,0.0007874127,0.000009591186,0.0000017844632,0.000016155833,0.0001889056,0.18364021,0.6156207,0.16480607,0.034403354,0.0003941392],"about_ca_topic_score_codex":0.000028097114,"about_ca_topic_score_gemma":0.000014281274,"teacher_disagreement_score":0.77395576,"about_ca_system_score_codex":0.0000148337695,"about_ca_system_score_gemma":0.000030559302,"threshold_uncertainty_score":0.99211854},"labels":[],"label_agreement":null},{"id":"W2945710931","doi":"","title":"How high does Paper Mario have to jump to match the strength of his regular counterpart","year":2019,"lang":"en","type":"article","venue":"Journal of Interdisciplinary Science Topics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Superstar; Jump; Long jump; Jumping; Order (exchange); Mathematics; Computer science; Mathematical economics; Simulation; Economics; Physics; Art; Art history; Geology","score_opus":0.011800573125236411,"score_gpt":0.28373641729421323,"score_spread":0.2719358441689768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945710931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88202834,0.000036756817,0.037769157,0.07516421,0.0035741893,0.00030433133,0.0000040457494,0.000017242677,0.0011017488],"genre_scores_gemma":[0.9752035,0.000006544493,0.018813003,0.0008082206,0.00030781765,0.0000035085973,1.227086e-7,0.000008789083,0.0048484667],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971437,0.000068587644,0.0007043227,0.0004083124,0.0012267313,0.00044838063],"domain_scores_gemma":[0.99724346,0.00015873216,0.00046231144,0.0010559655,0.0008189677,0.00026056363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015416896,0.0001994582,0.00037541133,0.00037376318,0.0002334633,0.00054244784,0.0043518916,0.000059823415,0.0000868131],"category_scores_gemma":[0.00021245018,0.00011100053,0.00017244542,0.0008557224,0.00035984186,0.0019087405,0.0024350653,0.000308668,0.00005866596],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059510366,0.0010988347,0.037178192,0.00019695601,0.00024953578,0.00033540983,0.15064692,0.010656715,0.208239,0.13010137,0.044544872,0.41615707],"study_design_scores_gemma":[0.00069855526,0.009147986,0.07126068,0.0018738218,0.00009284056,0.00070576015,0.04850032,0.028309498,0.609725,0.102233395,0.1255399,0.0019122236],"about_ca_topic_score_codex":0.000026991589,"about_ca_topic_score_gemma":0.00010271023,"teacher_disagreement_score":0.41424486,"about_ca_system_score_codex":0.00022409497,"about_ca_system_score_gemma":0.00030343505,"threshold_uncertainty_score":0.808697},"labels":[],"label_agreement":null},{"id":"W2946514075","doi":"","title":"Applications of Stochastic Processes to Modular Game Design","year":2019,"lang":"en","type":"article","venue":"MacEwan University Student Research Proceedings","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Modular design; Computer science; Mathematical economics; Economics; Programming language","score_opus":0.09465455041391585,"score_gpt":0.369541026953121,"score_spread":0.27488647653920517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946514075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.159298,0.000025606314,0.8341439,0.00077957514,0.00003289564,0.0019720173,0.0000022852723,0.00011739173,0.0036283673],"genre_scores_gemma":[0.9861993,0.000007773829,0.010585034,0.000026780606,0.000025490974,0.000020581401,3.5166875e-7,0.000009349591,0.0031253383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975682,0.00004138916,0.00016941017,0.0005703351,0.0011630197,0.0004876282],"domain_scores_gemma":[0.9973438,0.0002354175,0.00007380708,0.00033474583,0.0018057341,0.00020653247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009762198,0.00012521821,0.00018536545,0.0006360498,0.00019256327,0.00015257354,0.0027345214,0.00005912119,0.0000360742],"category_scores_gemma":[0.00018400638,0.00013494468,0.000039534792,0.0026923416,0.000150326,0.0005533526,0.001331524,0.0002543383,0.00041044393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048430057,0.0024738638,0.023819668,0.0015917084,0.0003425746,0.00004501047,0.1227996,0.015858559,0.11024194,0.65484643,0.008878187,0.058618136],"study_design_scores_gemma":[0.0027740183,0.010303051,0.019931974,0.001792092,0.00013133089,0.000045870045,0.20191194,0.1246158,0.3683434,0.07026014,0.19537468,0.0045156763],"about_ca_topic_score_codex":0.00007008839,"about_ca_topic_score_gemma":0.000008633637,"teacher_disagreement_score":0.8269013,"about_ca_system_score_codex":0.00020089417,"about_ca_system_score_gemma":0.00025124208,"threshold_uncertainty_score":0.55028844},"labels":[],"label_agreement":null},{"id":"W2946581269","doi":"10.1109/cig.2019.8848029","title":"Policy Based Inference in Trick-Taking Card Games","year":2019,"lang":"en","type":"preprint","venue":"2019 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Computer science; Sequence (biology); Set (abstract data type); State (computer science); Action (physics); Artificial intelligence; Feature (linguistics); German; Approximate inference; Theoretical computer science; Machine learning; Algorithm; Programming language","score_opus":0.08961568525558564,"score_gpt":0.35239628772256115,"score_spread":0.26278060246697554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946581269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07675391,0.001182225,0.8244406,0.0091899745,0.012791198,0.0056635253,0.00026571148,0.0017313045,0.06798153],"genre_scores_gemma":[0.9883917,0.00043858166,0.006254234,0.0013746063,0.0005213748,0.0003124349,0.00003442643,0.00009482522,0.0025778413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920967,0.0006200213,0.0015354828,0.0027526522,0.0013889051,0.0016062391],"domain_scores_gemma":[0.99175,0.0014681477,0.0015070521,0.004197537,0.0006926375,0.00038464073],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0010342235,0.0012939466,0.0016257816,0.0020341256,0.00012754828,0.0013624589,0.0063378527,0.0011140665,0.0001903431],"category_scores_gemma":[0.0017776204,0.0012858881,0.0005166184,0.0012896424,0.00038706692,0.0006673478,0.0017511344,0.0026010103,0.0021833312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024641308,0.0009777781,0.012462603,0.00081348076,0.00026725465,0.00027308022,0.0072055967,0.25705796,0.002116888,0.18982363,0.0051709535,0.52358437],"study_design_scores_gemma":[0.00073248486,0.0005498583,0.007782748,0.0033891737,0.00006944614,0.0000071257737,0.00023362374,0.91882914,0.013675304,0.04871846,0.0029673683,0.0030452819],"about_ca_topic_score_codex":0.003221661,"about_ca_topic_score_gemma":0.0004881579,"teacher_disagreement_score":0.9116378,"about_ca_system_score_codex":0.00052238605,"about_ca_system_score_gemma":0.004574049,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2947113339","doi":"","title":"Subject Guides: Vancouver Referencing Style: Theses/Dissertation Citations","year":2015,"lang":"en","type":"libguides","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Subject (documents); Style (visual arts); Computer science; World Wide Web; Art; Visual arts","score_opus":0.07576469615134335,"score_gpt":0.34419115429926067,"score_spread":0.2684264581479173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947113339","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006533059,0.00060235,0.50527817,0.0007544387,0.007937284,0.00062089594,0.000027170334,0.0011568508,0.48296952],"genre_scores_gemma":[0.16546698,0.00045603237,0.377211,0.0029265883,0.0023989037,0.0003300335,0.00035184657,0.00025819012,0.45060042],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99658245,0.00017740687,0.0008784946,0.00087190967,0.00096888543,0.0005208273],"domain_scores_gemma":[0.9960568,0.0007494056,0.00046479265,0.0013113411,0.0012209967,0.00019664862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008179213,0.000451433,0.00046242934,0.00047084677,0.00022351634,0.00054813933,0.0022498763,0.0003946263,0.0002993162],"category_scores_gemma":[0.0015930812,0.0003888397,0.00016332332,0.00083330006,0.00008452211,0.0011570693,0.00033048604,0.00047073295,0.0007619321],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044121584,0.000036267913,0.00003243827,0.00003702864,0.00004719327,0.0000183743,0.004073065,0.00027558836,0.000055773507,0.03049924,0.92702365,0.037897],"study_design_scores_gemma":[0.00017473358,0.00034781994,0.00016864564,0.00062374613,0.00010122297,0.000019966974,0.0108890915,0.057928625,0.007653467,0.15540622,0.7645195,0.002166937],"about_ca_topic_score_codex":0.0023652185,"about_ca_topic_score_gemma":0.015694326,"teacher_disagreement_score":0.16481368,"about_ca_system_score_codex":0.0002911134,"about_ca_system_score_gemma":0.0011794243,"threshold_uncertainty_score":0.99985635},"labels":[],"label_agreement":null},{"id":"W2948747265","doi":"","title":"The Markov Chain Perspective of Roulette","year":2018,"lang":"en","type":"article","venue":"Student Research Proceedings","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Roulette; Markov chain; Odds; Perspective (graphical); Computer science; Mathematical economics; Artificial intelligence; Mathematics; Machine learning","score_opus":0.1096383194947739,"score_gpt":0.45360319173250935,"score_spread":0.3439648722377354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948747265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6321118,0.00063938287,0.012966343,0.04335618,0.00080140133,0.0018960186,0.0000016903537,0.0002807249,0.3079465],"genre_scores_gemma":[0.9953086,0.00007004166,0.0016192987,0.0000771254,0.00039484093,0.00006457712,3.9574342e-8,0.000009510434,0.0024560096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969966,0.0000631479,0.0002597571,0.0004347826,0.0015947359,0.00065099396],"domain_scores_gemma":[0.99599284,0.00035026466,0.0000848772,0.00033998358,0.0031340327,0.0000980201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040195393,0.0001061979,0.00012329189,0.00017522366,0.00073444186,0.00042651655,0.002971444,0.000046775116,0.000020903948],"category_scores_gemma":[0.001000757,0.000071340364,0.00005585734,0.0011231886,0.0012666918,0.0003870784,0.0014931569,0.0003820627,0.00016436703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024510498,0.00008466426,0.0032373425,0.000008803465,0.000034285906,0.0000026665473,0.027474593,1.6606455e-7,0.0056707948,0.9339295,0.014255063,0.01527759],"study_design_scores_gemma":[0.00033640783,0.0033648903,0.026597489,0.00021679077,0.000009959752,0.000021393616,0.10823234,0.010442025,0.30189827,0.4786806,0.069539174,0.0006606515],"about_ca_topic_score_codex":0.00019309194,"about_ca_topic_score_gemma":0.000045729663,"teacher_disagreement_score":0.45524892,"about_ca_system_score_codex":0.0001788665,"about_ca_system_score_gemma":0.00010425849,"threshold_uncertainty_score":0.5648807},"labels":[],"label_agreement":null},{"id":"W2948811720","doi":"10.1109/cig.2019.8847990","title":"The Riddle of Togelby","year":2019,"lang":"en","type":"preprint","venue":"2019 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Simple (philosophy); Representation (politics); Space (punctuation); Computer science; Combinatorial game theory; Theoretical computer science; Artificial intelligence; Sequential game; Mathematics; Epistemology; Mathematical economics; Game theory; Political science; Politics; Philosophy","score_opus":0.07207285091656218,"score_gpt":0.30925238682364603,"score_spread":0.23717953590708385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948811720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08880889,0.0048150937,0.68834424,0.0125301285,0.04150959,0.0062567242,0.00031977444,0.0011879225,0.15622765],"genre_scores_gemma":[0.9837954,0.00090855407,0.0027110812,0.00028979967,0.00028199967,0.00011209981,0.000009162547,0.00004453028,0.011847381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996066,0.00025777757,0.00090257,0.0011753016,0.00089927064,0.000699127],"domain_scores_gemma":[0.99381304,0.00077956566,0.00085117825,0.003733899,0.0006695887,0.00015274908],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077905407,0.00056768814,0.000724192,0.00018879925,0.00015802191,0.0006183764,0.005901273,0.00047075137,0.000105123334],"category_scores_gemma":[0.00023968198,0.00041879414,0.00035776393,0.00024684877,0.00047473345,0.00024249617,0.0016579442,0.001132882,0.0020727182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001431193,0.0004046523,0.00073478336,0.00031527693,0.00043856064,0.000024952797,0.004609692,0.015440708,0.0036102307,0.52995914,0.05500935,0.38930956],"study_design_scores_gemma":[0.0004451565,0.0011963367,0.0018712839,0.0023782074,0.00017084101,0.000017826416,0.0007468566,0.5458446,0.14698958,0.23714459,0.06026566,0.0029290454],"about_ca_topic_score_codex":0.0002933919,"about_ca_topic_score_gemma":0.00008940794,"teacher_disagreement_score":0.8949865,"about_ca_system_score_codex":0.00007525927,"about_ca_system_score_gemma":0.0008735377,"threshold_uncertainty_score":0.9998264},"labels":[],"label_agreement":null},{"id":"W2950070083","doi":"","title":"\"Mouse\" and \"The Laughing Mathematician\"","year":2016,"lang":"en","type":"article","venue":"Dalhousie review","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Art; Philosophy; Computer science","score_opus":0.02803240716361018,"score_gpt":0.2845366016395453,"score_spread":0.25650419447593514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950070083","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013130191,0.19995391,0.7204876,0.069624566,0.0003387808,0.0011102041,0.0000036020788,0.00041568506,0.006752609],"genre_scores_gemma":[0.086786054,0.8028586,0.06124644,0.038072847,0.0005866721,0.0004276126,9.970106e-7,0.000103163904,0.009917617],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893516,0.00013159664,0.00031383368,0.0002305282,0.00018856287,0.00020032395],"domain_scores_gemma":[0.9986372,0.0005079248,0.00011885361,0.0006387156,0.00004483488,0.000052443833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010833277,0.00010885881,0.00027082115,0.000021533,0.00009941853,0.00007743665,0.00074535835,0.000023383154,0.000051676874],"category_scores_gemma":[0.0004940384,0.000048226444,0.00007098672,0.0001732256,0.00017557133,0.0002866671,0.00028086093,0.000057247533,0.00057461334],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5701436e-7,0.0000079658685,0.000020257608,0.00030343854,0.000007656657,0.0000034632308,0.00029934777,9.607986e-8,0.000072982904,0.23600404,0.0026834353,0.76059645],"study_design_scores_gemma":[0.00045593336,0.00004463847,0.000078479345,0.013264731,0.00009000601,0.00019988515,0.000038221857,0.0022398578,0.0042752256,0.1395394,0.8390674,0.0007062358],"about_ca_topic_score_codex":0.000008448415,"about_ca_topic_score_gemma":0.000006744956,"teacher_disagreement_score":0.83638394,"about_ca_system_score_codex":0.000012268157,"about_ca_system_score_gemma":0.000020644444,"threshold_uncertainty_score":0.7385683},"labels":[],"label_agreement":null},{"id":"W2950348125","doi":"","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":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Prior probability; Computer science; Adversary; Fictitious play; Artificial intelligence; Dirichlet distribution; Probabilistic logic; Task (project management); Domain (mathematical analysis); Class (philosophy); Observability; Bayesian game; Bluff; Stochastic game; Machine learning; Bayesian probability; Game theory; Mathematical economics; Mathematics; Sequential game; Computer security","score_opus":0.1747774249227732,"score_gpt":0.21595339186949236,"score_spread":0.041175966946719156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950348125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21542266,0.0001552278,0.77995926,0.00013363485,0.0009234475,0.0002398835,0.0000036389465,0.00018218158,0.0029800485],"genre_scores_gemma":[0.9914989,0.0002195664,0.007108184,0.00009497366,0.0001248714,0.000001612946,0.0000048586953,0.000023061993,0.0009239821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749047,0.00017174547,0.00035719294,0.0011824293,0.0001443363,0.00065381173],"domain_scores_gemma":[0.99780273,0.0001402719,0.0002344944,0.0014637922,0.00012316364,0.000235518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050525676,0.00036773385,0.0003805545,0.00042694475,0.00009938222,0.00014145956,0.00251866,0.0003844648,0.0000696698],"category_scores_gemma":[0.00002580271,0.00043761806,0.00020931193,0.00059628254,0.00011848477,0.0006884379,0.0027459476,0.00086306763,0.0004813795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010952569,0.00011157806,0.002683467,0.000024638995,0.000022020167,0.00015961844,0.00082232594,0.8072248,0.000020708076,0.18769231,0.00006116094,0.0011663786],"study_design_scores_gemma":[0.000069766495,0.000011948501,0.00018962931,0.00009123042,0.000018992863,0.000002531488,0.00010023283,0.9152979,0.00050535833,0.08272331,0.00053545454,0.0004536277],"about_ca_topic_score_codex":0.0007505069,"about_ca_topic_score_gemma":0.0001111134,"teacher_disagreement_score":0.7760762,"about_ca_system_score_codex":0.00036942144,"about_ca_system_score_gemma":0.00017793407,"threshold_uncertainty_score":0.99980754},"labels":[],"label_agreement":null},{"id":"W29505111","doi":"10.1111/mmi.13947","title":"Koko: engineering affective applications","year":2009,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Allergy and Infectious Diseases; Canadian Institutes of Health Research; National Institutes of Health","keywords":"Affect (linguistics); Entertainment; Computer science; Empathy; Multimedia; Human–computer interaction; Psychology; Social psychology; Visual arts; Communication","score_opus":0.04968349176655432,"score_gpt":0.295271183228059,"score_spread":0.2455876914615047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29505111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014001813,0.00068309775,0.9825608,0.00010466367,0.0004848475,0.0010111479,0.000008821124,0.00022485021,0.0009199165],"genre_scores_gemma":[0.98877996,0.00006645044,0.010196839,0.00016145593,0.000114336464,0.00013054282,0.000002411756,0.000012715484,0.00053527026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985089,0.00006178454,0.0002968409,0.00052808307,0.00024888953,0.00035553172],"domain_scores_gemma":[0.99906963,0.00007922012,0.00012033001,0.00043495686,0.00011761838,0.00017821978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020830263,0.00022352037,0.00022859026,0.0001223232,0.00019111551,0.0001984608,0.00050600886,0.00008080398,0.0000051742127],"category_scores_gemma":[0.000030762014,0.00020615148,0.00006142166,0.00028327055,0.000037030226,0.0004368215,0.00012746964,0.00012998386,0.00013263672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040508454,0.0017510863,0.0068481187,0.00014655494,0.00059424527,0.00020856419,0.015924899,0.032106645,0.010595874,0.41717264,0.004561822,0.51004905],"study_design_scores_gemma":[0.00027951738,0.00019242727,0.021471255,0.00009165641,0.000019588917,0.000028810944,0.00044212892,0.9565611,0.0011543058,0.0003355133,0.018950393,0.0004733436],"about_ca_topic_score_codex":0.00016262889,"about_ca_topic_score_gemma":0.000006223776,"teacher_disagreement_score":0.9747782,"about_ca_system_score_codex":0.0000737529,"about_ca_system_score_gemma":0.000020836938,"threshold_uncertainty_score":0.84066135},"labels":[],"label_agreement":null},{"id":"W2950706753","doi":"10.48550/arxiv.1303.4441","title":"Solving Imperfect Information Games Using Decomposition","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Perfect information; Computer science; Decomposition; Extensive-form game; Subgame perfect equilibrium; Imperfect; Sequential game; Nash equilibrium; Mathematical optimization; Subgame; Normal-form game; Construct (python library); Repeated game; Combinatorial game theory; Game theory; Mathematical economics; Best response; Mathematics; Epsilon-equilibrium","score_opus":0.07602123312568335,"score_gpt":0.22660961671084812,"score_spread":0.15058838358516477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950706753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43064716,0.000020818226,0.56743425,0.000031103988,0.00055358146,0.00020003933,0.0000026724176,0.00019809935,0.0009122487],"genre_scores_gemma":[0.9888108,0.00006569026,0.010834279,0.000110289824,0.00008017255,0.0000011406033,0.000012911608,0.000010945529,0.00007381322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985207,0.000119421115,0.0003097245,0.0005706652,0.00011444413,0.000365081],"domain_scores_gemma":[0.9981766,0.00010739659,0.0003802099,0.00091709924,0.0002892129,0.00012952808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000228916,0.0002859697,0.00025597712,0.00038439344,0.00022992169,0.00051989703,0.0014713502,0.0002833287,0.00006933864],"category_scores_gemma":[0.00005033664,0.0003378355,0.0001839806,0.00041962715,0.000097231685,0.003000837,0.0017672051,0.00045851737,0.0004861464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012133183,0.000049483235,0.00205851,0.0000968228,0.00007408433,0.00004370316,0.0015182769,0.85240656,0.00066432566,0.13269296,0.00039002657,0.009993094],"study_design_scores_gemma":[0.000053649193,0.000025537165,0.0003535602,0.000109336346,0.000028325101,0.000006949514,0.00015222678,0.954202,0.0024608574,0.0421048,0.00013635607,0.0003664067],"about_ca_topic_score_codex":0.0007191507,"about_ca_topic_score_gemma":0.000017529213,"teacher_disagreement_score":0.5581636,"about_ca_system_score_codex":0.00038032344,"about_ca_system_score_gemma":0.00018201186,"threshold_uncertainty_score":0.9999074},"labels":[],"label_agreement":null},{"id":"W2952245085","doi":"","title":"Circular Nim Games","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Security token; Computer science; Combinatorial game theory; Combinatorics; Mathematics; Mathematical economics; Repeated game; Game theory; Computer security","score_opus":0.1203924913374357,"score_gpt":0.21229637113314948,"score_spread":0.09190387979571378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952245085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14931625,0.00033930148,0.8404856,0.00014971815,0.0016407289,0.00024518944,0.00000612409,0.00046867138,0.007348423],"genre_scores_gemma":[0.9953212,0.00015668246,0.0022997258,0.00014959261,0.00021680405,0.0000011858423,0.0000054896927,0.000022825332,0.0018264604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774975,0.00015524015,0.0002448874,0.0011253598,0.00013910168,0.0005856831],"domain_scores_gemma":[0.99720526,0.000119467295,0.00025168667,0.001979415,0.00017728115,0.00026689144],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003237749,0.00036065278,0.00034825713,0.000251686,0.0001505012,0.0001793163,0.0031907065,0.000377295,0.00013155273],"category_scores_gemma":[0.00006027231,0.00042526083,0.00029734868,0.0005185329,0.0001990582,0.0006360326,0.003067394,0.0006688346,0.0012070223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014463245,0.0002491045,0.011819003,0.00012564776,0.00020033639,0.0005545734,0.0016622276,0.1105513,0.00022316583,0.8633642,0.001620541,0.009615418],"study_design_scores_gemma":[0.00016741068,0.000053350217,0.0026331323,0.00017543406,0.00015528986,0.0000212901,0.0003158642,0.61614496,0.0046861353,0.359238,0.014686939,0.0017221961],"about_ca_topic_score_codex":0.00019990272,"about_ca_topic_score_gemma":0.00001896815,"teacher_disagreement_score":0.84600496,"about_ca_system_score_codex":0.00022506407,"about_ca_system_score_gemma":0.00018766156,"threshold_uncertainty_score":0.99981993},"labels":[],"label_agreement":null},{"id":"W2952508336","doi":"10.1017/9781316135167.025","title":"Phutball Endgames Are Hard","year":2002,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Contrast (vision); Combinatorial game theory; Mathematical economics; Combinatorics; Computer science; Mathematics; Sequential game; Game theory; Artificial intelligence","score_opus":0.09175700883234549,"score_gpt":0.2939007554506296,"score_spread":0.2021437466182841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952508336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033090138,0.0008094442,0.89721817,0.005175686,0.0033108739,0.00035520428,0.0000100288025,0.0012263141,0.08858524],"genre_scores_gemma":[0.6357494,0.0005520806,0.28518313,0.002701061,0.0008795551,0.00012822967,0.0000058775377,0.000058629026,0.074742034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757093,0.000074266,0.0004523984,0.0009925535,0.00047659295,0.00043327163],"domain_scores_gemma":[0.99742395,0.00011733138,0.0002735742,0.0018679447,0.00017264402,0.00014457222],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002183053,0.000345846,0.0003789707,0.00016438273,0.00008029522,0.0006156405,0.0033799359,0.00032109334,0.0010138823],"category_scores_gemma":[0.00012110518,0.00031412876,0.00022720409,0.00017683947,0.000097363685,0.0002626102,0.003338556,0.00065465213,0.0027810025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005132516,0.0004183355,0.004259093,0.00024889427,0.00018935543,0.00029764042,0.00499975,0.006349449,0.00023548203,0.20190167,0.23404169,0.5470535],"study_design_scores_gemma":[0.00008004121,0.000080243575,0.0025927625,0.00041197613,0.00002772691,0.00003566563,0.00030723467,0.52392536,0.035481248,0.22418395,0.21075298,0.0021207917],"about_ca_topic_score_codex":0.00014348803,"about_ca_topic_score_gemma":0.00005016177,"teacher_disagreement_score":0.6324404,"about_ca_system_score_codex":0.00008709437,"about_ca_system_score_gemma":0.00006833615,"threshold_uncertainty_score":0.9999311},"labels":[],"label_agreement":null},{"id":"W2953974932","doi":"10.22215/etd/2015-11045","title":"Impartial Intersection Restriction Games","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Combinatorial game theory; Graph; Mathematics; Arc (geometry); Intersection (aeronautics); Computer science; Sequential game; Game theory; Mathematical economics; Engineering; Geometry","score_opus":0.0387709413294268,"score_gpt":0.33877513126149306,"score_spread":0.30000418993206623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953974932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25191033,0.00042923455,0.41555947,0.0004968106,0.032509457,0.00074149546,0.000003859515,0.001990329,0.29635903],"genre_scores_gemma":[0.95414495,0.00007933938,0.005810496,0.00009881671,0.0008856713,0.00007132339,0.00016626308,0.00003805532,0.038705073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845475,0.000056002456,0.0003645904,0.00046775825,0.00042299868,0.00023391278],"domain_scores_gemma":[0.9988379,0.00003812671,0.00020063913,0.0004807712,0.00033816774,0.00010441687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023018278,0.00020772386,0.00019087012,0.00027194875,0.00007765124,0.00026189492,0.00068292883,0.00026373644,0.00008951368],"category_scores_gemma":[0.00013975886,0.00019398084,0.00009934642,0.0003943114,0.00001767214,0.00061637914,0.000059887225,0.0002765638,0.00071041216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013819983,0.00017573526,0.000119565644,0.00005925544,0.00008720636,0.000028933435,0.009347947,0.00033954106,0.004417258,0.095390245,0.1980638,0.6918323],"study_design_scores_gemma":[0.00035562433,0.0014704695,0.0029278493,0.00041641825,0.00013356586,0.000057625373,0.01494625,0.15196474,0.3419987,0.40547976,0.07727344,0.002975541],"about_ca_topic_score_codex":0.000541399,"about_ca_topic_score_gemma":0.0012115017,"teacher_disagreement_score":0.7022346,"about_ca_system_score_codex":0.00018760073,"about_ca_system_score_gemma":0.00024332677,"threshold_uncertainty_score":0.9131148},"labels":[],"label_agreement":null},{"id":"W2954089099","doi":"10.1145/3321707.3321866","title":"Evolving dota 2 shadow fiend bots using genetic programming with external memory","year":2019,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristics; Observability; Context (archaeology); Genetic programming; Shadow (psychology); Artificial intelligence; Reinforcement learning; Set (abstract data type); Task (project management); Human–computer interaction; Programming language; Psychology; Engineering; Mathematics","score_opus":0.0237815563799038,"score_gpt":0.2475599406890724,"score_spread":0.22377838430916858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954089099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6962656,0.0004343234,0.30215612,0.00019715478,0.00016907215,0.00034173924,7.3893574e-7,0.000044599667,0.00039070574],"genre_scores_gemma":[0.7316492,0.000011519659,0.26816714,0.00003920119,0.00003602049,0.0000073993374,1.8954805e-7,0.000007854241,0.000081438506],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985,0.000016989647,0.00033274924,0.00044004174,0.00043716122,0.00027307257],"domain_scores_gemma":[0.99882513,0.00006218444,0.0003019591,0.00014995747,0.0005856453,0.00007512993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000134593,0.0001752064,0.00017981092,0.00009482752,0.00020580468,0.00019467426,0.00067267724,0.000054834985,0.00001927847],"category_scores_gemma":[0.000033513632,0.0001359099,0.000044472163,0.00034194623,0.00020787504,0.00046980797,0.00038613667,0.000131181,0.000007812139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105658015,0.0002560173,0.47516873,0.0006309292,0.00012144969,0.0000065137856,0.008321808,0.12377898,0.042595815,0.021877116,0.0003375297,0.32679945],"study_design_scores_gemma":[0.00013444618,0.0001416008,0.16119713,0.00026425824,0.000018023318,0.00013922779,0.00035459537,0.8221235,0.001874522,0.013510052,0.0000320456,0.00021059715],"about_ca_topic_score_codex":0.00008113892,"about_ca_topic_score_gemma":0.000002031442,"teacher_disagreement_score":0.6983445,"about_ca_system_score_codex":0.00004822508,"about_ca_system_score_gemma":0.00015233607,"threshold_uncertainty_score":0.5542245},"labels":[],"label_agreement":null},{"id":"W2954533597","doi":"10.1007/978-3-030-24337-1_7","title":"Analyzing the Impact of Knowledge and Search in Monte Carlo Tree Search in Go","year":2019,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Monte Carlo tree search; Tree (set theory); Monte Carlo method; Information retrieval; Search tree; Search algorithm; Statistics; Mathematics; Algorithm; Combinatorics","score_opus":0.09255515193758446,"score_gpt":0.37890422392948514,"score_spread":0.2863490719919007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954533597","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18974662,0.010959543,0.27545515,0.0034280883,0.00067490037,0.0042435806,0.000049405888,0.00013831194,0.5153044],"genre_scores_gemma":[0.9895097,0.0026355763,0.007448374,0.000031050015,0.000009874142,0.000008366267,0.0000029785333,0.0000051225516,0.00034892934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831384,0.00010444188,0.0007603304,0.00024994704,0.00030277687,0.00026866797],"domain_scores_gemma":[0.9969936,0.0006665359,0.00017344294,0.0017660324,0.00033917712,0.00006123969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026159112,0.0001720886,0.00028580107,0.0015504396,0.00017230315,0.0003414494,0.0035006267,0.000099142184,0.0000033640865],"category_scores_gemma":[0.000054563134,0.00013493399,0.000050048762,0.0010206978,0.0011357766,0.00365799,0.0030835927,0.00062089926,0.000024100724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069061894,0.000045249733,0.015865352,0.00004984205,0.000008846501,5.4951704e-7,0.03542706,0.017889434,0.000016817583,0.20158006,0.00006131318,0.72904855],"study_design_scores_gemma":[0.0001029509,0.00006236985,0.042670604,0.0002486059,0.0000011841545,0.0000058224127,0.00010741973,0.9543638,0.000023461018,0.001593867,0.0006675048,0.00015239594],"about_ca_topic_score_codex":0.00053795165,"about_ca_topic_score_gemma":0.00045035713,"teacher_disagreement_score":0.9364744,"about_ca_system_score_codex":0.00023524884,"about_ca_system_score_gemma":0.0006180235,"threshold_uncertainty_score":0.65050936},"labels":[],"label_agreement":null},{"id":"W2963225502","doi":"10.48550/arxiv.1907.09633","title":"Low-Variance and Zero-Variance Baselines for Extensive-Form Games","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Variance (accounting); Regret; Baseline (sea); Computer science; Sampling (signal processing); Fraction (chemistry); Tree (set theory); Mathematical optimization; Game tree; Importance sampling; Monte Carlo tree search; Counterfactual thinking; Computation; Variance reduction; Monte Carlo method; Mathematics; Algorithm; Repeated game; Statistics; Mathematical economics; Game theory; Machine learning","score_opus":0.07617428834402142,"score_gpt":0.2219628485635528,"score_spread":0.1457885602195314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963225502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06698613,0.0002544949,0.9290845,0.00040049266,0.0016082817,0.0007846332,0.00004411159,0.00023967553,0.0005976948],"genre_scores_gemma":[0.9771556,0.000553205,0.01657761,0.00046114397,0.00018810117,0.0000061425108,0.000012232896,0.000033858574,0.005012076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713975,0.00008696661,0.00034937798,0.0017448892,0.00012263049,0.0005564078],"domain_scores_gemma":[0.9966227,0.0005262181,0.00039593078,0.001667876,0.0005982666,0.00018900911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039041715,0.00046193154,0.0005420364,0.00022054337,0.00020400049,0.00027571243,0.0020134803,0.0003853874,0.000017999997],"category_scores_gemma":[0.0002653989,0.00052039267,0.00022989356,0.0003968677,0.0002464772,0.0007493639,0.001936147,0.00045486612,0.00013237649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016665398,0.00019907576,0.0028406566,0.00064590876,0.000199671,0.00023904025,0.0012050903,0.25802958,0.00042040524,0.71407914,0.0036691802,0.018305609],"study_design_scores_gemma":[0.00022539777,0.000082993894,0.0004978472,0.00026894474,0.000052146563,0.000007825571,0.000102663405,0.80671436,0.0020885165,0.18594521,0.0033386396,0.00067543634],"about_ca_topic_score_codex":0.00012010048,"about_ca_topic_score_gemma":0.00004045573,"teacher_disagreement_score":0.9125069,"about_ca_system_score_codex":0.00013339042,"about_ca_system_score_gemma":0.00029348145,"threshold_uncertainty_score":0.99972475},"labels":[],"label_agreement":null},{"id":"W2964056654","doi":"10.1609/aiide.v13i1.12922","title":"Combining Strategic Learning with Tactical Search in Real-Time Strategy Games","year":2021,"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":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Action (physics); Set (abstract data type); Machine learning; Adversary; Game tree; Sequential game; Tree (set theory); Game theory; Computer security; Mathematics","score_opus":0.06795166991312225,"score_gpt":0.3104732466031462,"score_spread":0.24252157669002394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964056654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93858606,0.000026064992,0.0032028253,0.0012193078,0.00010087963,0.00033056826,0.000003769402,0.000060607283,0.056469943],"genre_scores_gemma":[0.9989162,0.00012145445,0.0003051816,0.000071827984,0.000024142393,0.000025552039,0.0000022337047,0.000017515787,0.0005158602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974571,0.00005307569,0.0006425397,0.0007424827,0.0006042342,0.00050056656],"domain_scores_gemma":[0.9984173,0.00030192832,0.00026772794,0.00023833975,0.00063769205,0.00013698233],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003039026,0.00032187637,0.00038732262,0.00017001582,0.00014745942,0.0011226842,0.0008191407,0.00008589709,0.00008583603],"category_scores_gemma":[0.00022481318,0.00023893935,0.00009978766,0.0005786674,0.00038095325,0.001670981,0.000520593,0.0006259873,0.00005869873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004854215,0.0010156378,0.0045273467,0.000071255185,0.00008617485,0.00003988075,0.0077314875,0.0010114957,0.044321816,0.7957566,0.000010089029,0.1449428],"study_design_scores_gemma":[0.00010559091,0.0018309203,0.00061906315,0.0011032615,0.000016274054,0.000067063746,0.03561782,0.14088602,0.7478625,0.07127094,0.000054856882,0.0005656635],"about_ca_topic_score_codex":0.00005309492,"about_ca_topic_score_gemma":0.000018140536,"teacher_disagreement_score":0.72448564,"about_ca_system_score_codex":0.00012641368,"about_ca_system_score_gemma":0.00017837941,"threshold_uncertainty_score":0.9999142},"labels":[],"label_agreement":null},{"id":"W2964177268","doi":"10.48550/arxiv.1212.6435","title":"Dead Ends in Misere Play: The Misere Monoid of Canonical Numbers","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada","funders":"","keywords":"Dead end; Monoid; Mathematics; Integer (computer science); Dead body; Universe; Construct (python library); Combinatorics; Computer science; Physics; History; Geometry","score_opus":0.10224403447793666,"score_gpt":0.22194453268576772,"score_spread":0.11970049820783106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964177268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86444885,0.0003443446,0.12212547,0.0003996805,0.00096931146,0.00043361165,0.000018005183,0.00012618682,0.011134537],"genre_scores_gemma":[0.99787885,0.00013919809,0.00087372505,0.00007907034,0.00007793766,0.0000017942123,0.000003767764,0.00001679214,0.0009288679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978884,0.0002441342,0.00037943042,0.0008119943,0.0001558015,0.00052025815],"domain_scores_gemma":[0.99739337,0.0003428609,0.00033214106,0.0016285491,0.00013173897,0.00017132238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004429852,0.00031774415,0.00040108094,0.00019114443,0.00009993126,0.00006399105,0.003519235,0.00037311742,0.000080836864],"category_scores_gemma":[0.00007061665,0.0002960755,0.000248578,0.00065707555,0.00032959218,0.00034769028,0.002220522,0.0008614805,0.00010306384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013476498,0.0005580482,0.12426829,0.0001833832,0.00022743561,0.00048277032,0.007666194,0.30261144,0.00027004775,0.5532896,0.0010266037,0.0092814155],"study_design_scores_gemma":[0.0009045637,0.00017820073,0.031505845,0.0007766523,0.00029340497,0.00003734306,0.0032383837,0.7710601,0.011768542,0.16856098,0.0088791875,0.002796782],"about_ca_topic_score_codex":0.0026229096,"about_ca_topic_score_gemma":0.0017438728,"teacher_disagreement_score":0.46844867,"about_ca_system_score_codex":0.0002590735,"about_ca_system_score_gemma":0.00041934155,"threshold_uncertainty_score":0.99994916},"labels":[],"label_agreement":null},{"id":"W2964755937","doi":"10.1609/aaai.v33i01.33019748","title":"Predicting Unsolvable Deals in the Birds of a Feather Solitaire Game","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Adjacency matrix; Feather; Computer science; Binary number; Graph; Adjacency list; Combinatorics; Theoretical computer science; Artificial intelligence; Mathematics; Algorithm; Arithmetic; Zoology; Biology","score_opus":0.06224596502994323,"score_gpt":0.3009733816748913,"score_spread":0.23872741664494807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964755937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9664036,0.00005767077,0.0054774336,0.0037216432,0.0005209751,0.0010491571,0.000004559172,0.0000872149,0.022677723],"genre_scores_gemma":[0.99803656,0.00003140704,0.0012262395,0.00028195977,0.000057992536,0.000043738914,1.8417946e-7,0.00001966172,0.00030223018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967088,0.00007050739,0.0010697702,0.0006337622,0.000934547,0.0005825835],"domain_scores_gemma":[0.99739337,0.00043578082,0.0007067047,0.00073618785,0.00066242256,0.000065538115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016420825,0.0003081082,0.0004544157,0.00023564816,0.00011837927,0.00022925959,0.004555824,0.00014973218,0.00010737265],"category_scores_gemma":[0.00065931486,0.00019887388,0.00020121537,0.0014535412,0.00043122383,0.00065565057,0.0005267638,0.00051463174,0.00018053524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059711776,0.00025396413,0.016097583,0.000080647114,0.000017219101,8.6029013e-7,0.010610839,0.0004378068,0.036219615,0.9102638,0.00006283637,0.025895132],"study_design_scores_gemma":[0.00003597534,0.0004333485,0.0015977757,0.00062325684,0.000013978736,0.000008272648,0.0066370205,0.12911727,0.5814155,0.2796667,0.00012767866,0.00032325037],"about_ca_topic_score_codex":0.00043309736,"about_ca_topic_score_gemma":0.0000990289,"teacher_disagreement_score":0.6305971,"about_ca_system_score_codex":0.00006430052,"about_ca_system_score_gemma":0.00017136175,"threshold_uncertainty_score":0.8465931},"labels":[],"label_agreement":null},{"id":"W2964993916","doi":"10.1609/aaai.v33i01.33019648","title":"Computational Intractability and Solvability for the Birds of a Feather Game","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Testbed; Feather; Graph; Computer science; Theoretical computer science; Game theory; Mathematical economics; Discrete mathematics; Mathematics; Zoology; World Wide Web; Biology","score_opus":0.06356466278561955,"score_gpt":0.3092906926676545,"score_spread":0.24572602988203496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964993916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8414786,0.000058234105,0.14726685,0.0073310803,0.0005762739,0.0017155545,0.000015774453,0.00007097235,0.0014866587],"genre_scores_gemma":[0.99430096,0.000016559034,0.0053090947,0.0001870286,0.000040014453,0.000050725335,2.2613578e-7,0.000011938384,0.00008347114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978183,0.000029115545,0.000751736,0.0005675113,0.0005184671,0.00031489195],"domain_scores_gemma":[0.9965507,0.0012147179,0.0005181205,0.00048535614,0.0011659754,0.000065128435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012604435,0.00022487469,0.00034090344,0.0000793414,0.00014859406,0.00016675524,0.001950337,0.00009972156,0.000074714924],"category_scores_gemma":[0.0009170098,0.00014107265,0.00017122045,0.00046865823,0.0008375499,0.00039722314,0.00044696746,0.0002579865,0.000029349965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010301133,0.0001805403,0.0039244145,0.00009686119,0.00002665786,3.3408977e-8,0.0025354654,0.00091980083,0.012686998,0.89233065,0.00004085763,0.0871547],"study_design_scores_gemma":[0.00002270668,0.00023978032,0.0025013094,0.00008082612,0.000013391086,0.0000016248448,0.0007488876,0.33875838,0.20074473,0.4566299,0.00010707738,0.00015138007],"about_ca_topic_score_codex":0.000085975844,"about_ca_topic_score_gemma":0.000015850108,"teacher_disagreement_score":0.43570074,"about_ca_system_score_codex":0.000041128973,"about_ca_system_score_gemma":0.00014041325,"threshold_uncertainty_score":0.5752776},"labels":[],"label_agreement":null},{"id":"W2966266863","doi":"","title":"Integrating Factorization Ranked Features in MCTS: An Experimental Study.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ranking (information retrieval); Factorization; Computer science; Factor (programming language); Feature (linguistics); Tree (set theory); Artificial intelligence; Monte Carlo tree search; Machine learning; Monte Carlo method; Open source; State (computer science); Data mining; Algorithm; Statistics; Software; Mathematics; Programming language","score_opus":0.11557657437519758,"score_gpt":0.3635510990341819,"score_spread":0.24797452465898434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966266863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32773447,0.000015615928,0.6611191,0.0032838082,0.0025109164,0.00069861,0.000012197794,0.00032097445,0.0043042763],"genre_scores_gemma":[0.9950317,0.000015984057,0.0040891254,0.00027049164,0.00025161874,0.00011943169,0.0000065279773,0.000025918895,0.00018921545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99587315,0.0003237248,0.0011343935,0.0011356139,0.0010140601,0.00051906484],"domain_scores_gemma":[0.99789345,0.00029490681,0.00031610607,0.00079229515,0.000511234,0.0001919807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065910583,0.00041858965,0.0003524404,0.0006227194,0.0001594264,0.00065256696,0.002148338,0.00014364143,0.00059462053],"category_scores_gemma":[0.0007018613,0.00031774357,0.00011035183,0.00050918595,0.00020095539,0.0019297246,0.00033391957,0.0003459617,0.0005244374],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116079194,0.0017491643,0.0013887265,0.0000017436989,0.000027323902,0.00006315906,0.006002237,0.00025276997,0.082346395,0.683867,0.00003358371,0.22415186],"study_design_scores_gemma":[0.00017229262,0.0016717091,0.0031563828,0.00032085314,0.000005443903,0.000019390216,0.009842928,0.04757351,0.8002218,0.13597712,0.00015052027,0.00088803994],"about_ca_topic_score_codex":0.00036721863,"about_ca_topic_score_gemma":0.00093482854,"teacher_disagreement_score":0.7178754,"about_ca_system_score_codex":0.00040537675,"about_ca_system_score_gemma":0.00015585238,"threshold_uncertainty_score":0.99992746},"labels":[],"label_agreement":null},{"id":"W2967535898","doi":"10.1109/cec.2019.8790055","title":"Applying an Adaptive Generative Representation to the Investigation of Affordances in Puzzles","year":2019,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Affordance; Computer science; Representation (politics); Adaptability; Solver; Simple (philosophy); Generative grammar; Artificial intelligence; Variety (cybernetics); ENCODE; Machine learning; Human–computer interaction; Theoretical computer science; Programming language","score_opus":0.07876375416908163,"score_gpt":0.3234088099228587,"score_spread":0.24464505575377707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967535898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57471234,0.000012783924,0.4224617,0.0008835236,0.00011949955,0.0005128524,3.4027732e-7,0.000022640723,0.0012743401],"genre_scores_gemma":[0.9187277,0.0000020168673,0.080691464,0.00030954045,0.000025213665,0.00008854566,7.0009986e-7,0.0000024371263,0.00015235979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991852,0.00010475782,0.00019674806,0.00023028915,0.0001827791,0.00010024814],"domain_scores_gemma":[0.9993811,0.00012252525,0.00007386696,0.00031595206,0.00007766206,0.000028877448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029899713,0.000057021993,0.00008162346,0.0000792996,0.000034116383,0.000051607356,0.00045456892,0.000019959982,0.000011957223],"category_scores_gemma":[0.000040203962,0.000039413237,0.000015879752,0.00047622994,0.00003890024,0.0007063722,0.00009533833,0.00004711583,0.000051556985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025376848,0.00003159652,0.050770525,0.000005733936,0.000009617306,0.0000010354271,0.039051536,0.10319666,0.057093162,0.5931918,0.00021960675,0.15640336],"study_design_scores_gemma":[0.00002950348,0.00014860259,0.008518936,0.000018905397,9.235361e-7,5.709531e-7,0.0055330815,0.41788888,0.5278463,0.039829474,0.00009083703,0.00009399383],"about_ca_topic_score_codex":0.0004951027,"about_ca_topic_score_gemma":0.0014564319,"teacher_disagreement_score":0.5533623,"about_ca_system_score_codex":0.000021480042,"about_ca_system_score_gemma":0.000034507953,"threshold_uncertainty_score":0.16072251},"labels":[],"label_agreement":null},{"id":"W2969288761","doi":"10.1016/j.tcs.2020.11.015","title":"Bounding game temperature using confusion intervals","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Concordia University of Edmonton","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Upper and lower bounds; Combinatorics; Confusion; Mathematics; Bounded function; Interval (graph theory); Bounding overwatch; Closure (psychology); Class (philosophy); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.052806332973846626,"score_gpt":0.33198652342372825,"score_spread":0.2791801904498816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969288761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11199266,0.00008756756,0.87848663,0.0030179622,0.0046620574,0.00043993208,0.000005639457,0.00054983335,0.0007577001],"genre_scores_gemma":[0.77957517,0.000010821404,0.21834941,0.0013974472,0.0006272383,0.000007708223,0.000001987105,0.000024390016,0.0000058071446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940036,0.00031658512,0.0008127114,0.0023007928,0.001533978,0.0010323446],"domain_scores_gemma":[0.99617267,0.00034399863,0.00032054356,0.0019998509,0.00052918046,0.00063373544],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020026274,0.0005972687,0.0007046732,0.00038557753,0.00058227323,0.003540933,0.008896891,0.00035037944,0.00008336765],"category_scores_gemma":[0.00043901324,0.00052643975,0.0002640757,0.0014181162,0.004670763,0.0008423122,0.016989611,0.001625419,0.00018019199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009172919,0.000043679694,0.000019398285,0.000051006267,0.000011343854,0.00007198038,0.002724202,0.0030551818,0.016613483,0.9630581,0.00007758176,0.014264852],"study_design_scores_gemma":[0.000035410103,0.00009002392,0.00003073699,0.00030351002,0.000010066931,0.000038294,0.000014118998,0.6506827,0.03017815,0.31808785,0.00008958631,0.0004395804],"about_ca_topic_score_codex":0.000018522032,"about_ca_topic_score_gemma":8.6646236e-7,"teacher_disagreement_score":0.6675825,"about_ca_system_score_codex":0.00030873282,"about_ca_system_score_gemma":0.0007969648,"threshold_uncertainty_score":0.9997187},"labels":[],"label_agreement":null},{"id":"W2973413571","doi":"10.7151/dmgt.2239","title":"Bounds on watching and watching graph products","year":2019,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.01496610401219423,"score_gpt":0.25460680920500744,"score_spread":0.23964070519281322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973413571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8452979,0.0002324728,0.13988577,0.0041727526,0.0008961823,0.0007081289,0.0000025706656,0.0004636489,0.008340619],"genre_scores_gemma":[0.98315597,0.000029459712,0.01500146,0.00032636433,0.000059327635,0.000034984085,0.000001881623,0.00003441104,0.0013561648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761325,0.00022859672,0.00044487556,0.0007496265,0.00049779925,0.0004658671],"domain_scores_gemma":[0.997875,0.00053971005,0.00017222881,0.0012076567,0.0000671829,0.00013822134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014294608,0.0003185361,0.000360991,0.00027637047,0.0003357072,0.0003218768,0.00096127804,0.00008865084,0.0000683317],"category_scores_gemma":[0.000275529,0.00019010773,0.00012901062,0.00053719606,0.00019091941,0.00070955546,0.0004208806,0.00028891282,0.0004738407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018188372,0.00013292498,0.00021378553,0.00011841426,0.000027169433,0.000007991572,0.00913152,0.000030035197,0.0028325072,0.965371,0.00012352994,0.021992907],"study_design_scores_gemma":[0.000083347004,0.00009159664,0.00036495,0.00032108702,0.000011826206,0.000027964943,0.0014346031,0.0016813899,0.008325324,0.9869596,0.0003536383,0.00034467038],"about_ca_topic_score_codex":0.0000037057418,"about_ca_topic_score_gemma":0.0000012204133,"teacher_disagreement_score":0.1378581,"about_ca_system_score_codex":0.000018026036,"about_ca_system_score_gemma":0.000030098086,"threshold_uncertainty_score":0.77523685},"labels":[],"label_agreement":null},{"id":"W2975442767","doi":"10.1109/cig.2019.8848095","title":"Deep Variational Autoencoders for NPC Behaviour Classification","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Artificial intelligence; Computer science; Deep learning; Set (abstract data type); Machine learning; Unsupervised learning; Video game; Training set; Pattern recognition (psychology); Multimedia","score_opus":0.06522760177606564,"score_gpt":0.31019196062656246,"score_spread":0.24496435885049683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975442767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0107287755,0.000034588273,0.97660035,0.0025525803,0.002396688,0.0010921429,0.000020508332,0.00027577562,0.00629857],"genre_scores_gemma":[0.9534482,0.000020844698,0.04087021,0.000576891,0.0001724359,0.00020642555,0.000029665873,0.00002828459,0.0046470542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752593,0.00008719723,0.0004830928,0.0008626922,0.0005273254,0.0005137345],"domain_scores_gemma":[0.9977087,0.00035442624,0.0002967856,0.0009991813,0.00049156486,0.00014936719],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040867517,0.00029026205,0.00029208683,0.00020080265,0.00013718051,0.00036403522,0.0014265679,0.00020295303,0.00034081453],"category_scores_gemma":[0.00011642203,0.00028229938,0.00015221667,0.00026546183,0.000100019795,0.0007144598,0.00008640809,0.00024070445,0.0025255093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000658727,0.00027647946,0.003377888,0.000029388937,0.000057834415,0.0000025415952,0.0017885882,0.008404551,0.005760031,0.91182715,0.0065461476,0.061863538],"study_design_scores_gemma":[0.00023109344,0.00030656395,0.009671157,0.000047088146,0.00002185046,0.0000035942953,0.00017803363,0.96180516,0.003086993,0.022134578,0.0020997967,0.00041410548],"about_ca_topic_score_codex":0.00005371834,"about_ca_topic_score_gemma":0.000038711674,"teacher_disagreement_score":0.9534006,"about_ca_system_score_codex":0.00009906286,"about_ca_system_score_gemma":0.00033207797,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W2976200185","doi":"10.1109/cig.2019.8848114","title":"Learning to Select Mates in Evolving Non-playable Characters","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.02209196078967483,"score_gpt":0.2720301828173503,"score_spread":0.2499382220276755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976200185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9679802,0.00004471899,0.016511265,0.0011503844,0.0014467763,0.00086605275,0.0000027122287,0.00028633536,0.011711564],"genre_scores_gemma":[0.98923904,0.0000334517,0.0027752568,0.00059634366,0.00008020878,0.00005831522,0.00000307608,0.000031717304,0.007182622],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971724,0.0001266546,0.00047243302,0.00092214433,0.00045926074,0.00084711215],"domain_scores_gemma":[0.9983125,0.0002859567,0.0001789342,0.0007973972,0.00022594167,0.00019926963],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005423362,0.00034952958,0.00044109783,0.00044208468,0.00009514128,0.0005370863,0.001529102,0.00015124232,0.0003687896],"category_scores_gemma":[0.00017090885,0.0003437696,0.00008576797,0.0007152049,0.000049896353,0.0008935067,0.00022781052,0.00057039905,0.0099768955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030956563,0.0006947782,0.1322321,0.00025222902,0.00017372175,0.00016767895,0.04022025,0.04797711,0.44556051,0.04382645,0.011900407,0.2766852],"study_design_scores_gemma":[0.00048813093,0.0016779354,0.04358766,0.0011815702,0.00001638601,0.000017192095,0.0013187866,0.76827735,0.17458831,0.0031270788,0.003951421,0.0017681855],"about_ca_topic_score_codex":0.00034220744,"about_ca_topic_score_gemma":0.000083543164,"teacher_disagreement_score":0.72030026,"about_ca_system_score_codex":0.00011931004,"about_ca_system_score_gemma":0.00021203235,"threshold_uncertainty_score":0.9999014},"labels":[],"label_agreement":null},{"id":"W2976261784","doi":"10.1109/cig.2019.8848093","title":"Towards Procedurally Generated Languages for Non-playable Characters in Video Games","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Neuroevolution; Communication source; Architecture; Video game; Illusion; Atmosphere (unit); Artificial intelligence; Artificial neural network; Multimedia; Human–computer interaction; Computer network","score_opus":0.03239987219828947,"score_gpt":0.2993356794207047,"score_spread":0.2669358072224152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976261784","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9286265,0.00022866644,0.05122644,0.0038050287,0.002489313,0.0031638914,0.000053539483,0.00046398613,0.00994265],"genre_scores_gemma":[0.98540896,0.000096237054,0.005565369,0.0012700261,0.00017111012,0.00029622397,0.000021525135,0.000043768672,0.007126776],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969457,0.00008218446,0.00059978856,0.0010553825,0.0004549862,0.0008619536],"domain_scores_gemma":[0.99796647,0.00020988556,0.00026985566,0.0009907933,0.0003874152,0.00017555927],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000472485,0.0004449832,0.0005622029,0.00035135416,0.000076882905,0.0004651096,0.0017169972,0.0002324696,0.00017534886],"category_scores_gemma":[0.00016306237,0.00040068527,0.0001469098,0.00049828994,0.00010311286,0.00092010456,0.00015033317,0.00034210875,0.0014155274],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073324493,0.0010936239,0.008825316,0.0006266813,0.00029248054,0.00012169492,0.015101645,0.0057117185,0.42642692,0.11574806,0.039179306,0.3861393],"study_design_scores_gemma":[0.0015559702,0.0016491723,0.01403752,0.00096218364,0.000041384334,0.00002505775,0.0012240049,0.461384,0.5021154,0.006935851,0.007879224,0.0021902206],"about_ca_topic_score_codex":0.00027303424,"about_ca_topic_score_gemma":0.00016465432,"teacher_disagreement_score":0.4556723,"about_ca_system_score_codex":0.00010208913,"about_ca_system_score_gemma":0.000540432,"threshold_uncertainty_score":0.9998445},"labels":[],"label_agreement":null},{"id":"W2978094613","doi":"10.5220/0008175902050212","title":"Playing Iterated Rock-Paper-Scissors with an Evolutionary Algorithm","year":2019,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Evolutionary algorithm; Iterated function; Algorithm; Competition (biology); Genetic algorithm; Evolutionary computation; Adversary; Artificial intelligence; Machine learning; Mathematics; Computer security","score_opus":0.01648315115917423,"score_gpt":0.2541589264493264,"score_spread":0.23767577529015219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978094613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14073168,0.000050037826,0.8480025,0.0003927977,0.00034610444,0.00021408658,0.0000015508217,0.0004572867,0.009803982],"genre_scores_gemma":[0.69581884,0.000002355186,0.30139184,0.00052143616,0.000053790536,0.000008500249,0.000003916758,0.000011775676,0.002187543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985699,0.00005067338,0.00020780141,0.00049154577,0.00034770602,0.0003323739],"domain_scores_gemma":[0.9989571,0.00007356566,0.000056835408,0.00063004653,0.00015900927,0.00012341996],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014275777,0.00015379595,0.00013776736,0.00010410669,0.00015727275,0.0001945473,0.00082222774,0.0000622447,0.0005045776],"category_scores_gemma":[0.000011338752,0.00011799799,0.000031701304,0.0004842483,0.000028344823,0.0019681884,0.00015925354,0.00013048058,0.0013480058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001416401,0.00089312246,0.069934145,0.00003933355,0.00016609515,0.00025264337,0.009160951,0.043691102,0.018756133,0.15626025,0.0039382004,0.6967664],"study_design_scores_gemma":[0.00007601349,0.00033018997,0.003394977,0.000020280737,0.0000024192013,0.00004538677,0.00020559835,0.9879544,0.0044864225,0.0016137917,0.0015993634,0.0002711606],"about_ca_topic_score_codex":0.0001398541,"about_ca_topic_score_gemma":0.000020178335,"teacher_disagreement_score":0.9442633,"about_ca_system_score_codex":0.000051723593,"about_ca_system_score_gemma":0.00008634994,"threshold_uncertainty_score":0.9994296},"labels":[],"label_agreement":null},{"id":"W2979144778","doi":"10.1071/aj09129","title":"Kipper-Tuna-Turrum","year":2010,"lang":"fr","type":"article","venue":"The APPEA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ARC Resources (Canada)","funders":"","keywords":"Tuna; Fishery; Biology; Fish <Actinopterygii>","score_opus":0.04579326281708071,"score_gpt":0.3023424895758868,"score_spread":0.2565492267588061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979144778","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20677628,0.01261517,0.31057507,0.36436412,0.06909394,0.00037689967,0.0000069749667,0.00016532092,0.03602624],"genre_scores_gemma":[0.9476748,0.0006413518,0.012069605,0.0032378766,0.008276602,0.00000432839,3.080203e-7,0.000041647098,0.028053492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972149,0.00030486207,0.000599285,0.00031842824,0.00065539853,0.00090710435],"domain_scores_gemma":[0.9976181,0.00032341882,0.00034079724,0.0010225665,0.0003190747,0.00037605653],"candidate_categories":["scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023722001,0.00027689143,0.00023753897,0.00009389768,0.001079436,0.0015210916,0.0033363919,0.00020048852,0.002019149],"category_scores_gemma":[0.00038097225,0.00019144961,0.00026243093,0.0004468128,0.0008754249,0.001033632,0.0005757456,0.0028192664,0.004803543],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014961595,0.00013583874,0.0006011938,0.000009042445,0.000058181908,0.00021240096,0.0059899697,0.00022861498,0.008507592,0.31878093,0.041931275,0.62353],"study_design_scores_gemma":[0.00011111615,0.00015674415,0.0011155535,0.00011735676,0.00004206569,0.008176104,0.0005253593,0.030209217,0.012521733,0.17684962,0.76977944,0.00039570776],"about_ca_topic_score_codex":0.00010922303,"about_ca_topic_score_gemma":0.00014991048,"teacher_disagreement_score":0.7408985,"about_ca_system_score_codex":0.000051102794,"about_ca_system_score_gemma":0.00034855548,"threshold_uncertainty_score":0.9995154},"labels":[],"label_agreement":null},{"id":"W2980266615","doi":"10.1109/ccece.2019.8861965","title":"Towards Generating Image Assets Through Deep Learning for Game Development","year":2019,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Generative grammar; Computer science; Artificial intelligence; Deep learning; Adversarial system; Image (mathematics); Machine learning","score_opus":0.03987205184270435,"score_gpt":0.3125818892577405,"score_spread":0.2727098374150361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980266615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08148117,0.000046059125,0.9083755,0.0003346006,0.0004250021,0.0002723606,1.0250536e-7,0.00023313658,0.008832045],"genre_scores_gemma":[0.39203516,0.0000027366343,0.6058968,0.00027674192,0.000056861587,0.00002865558,0.0000017032377,0.0000101504775,0.0016912139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985971,0.000037234113,0.00031123855,0.0004247983,0.00024957265,0.0003800519],"domain_scores_gemma":[0.9992467,0.00013595025,0.00009024834,0.00030189194,0.00017423593,0.000050944218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036922982,0.00014299732,0.00015692016,0.000040261046,0.00014528632,0.0003017907,0.0006538039,0.000056552562,0.00015924012],"category_scores_gemma":[0.00015355769,0.00012589929,0.00006089868,0.00016018104,0.00002290978,0.00076606596,0.00028429864,0.00012234652,0.00070090103],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061959677,0.000060075286,0.0019441338,0.0000440256,0.000037693408,0.000005927906,0.0116901975,0.008887297,0.037162494,0.08589623,0.0005244444,0.8537413],"study_design_scores_gemma":[0.000081414604,0.00008523312,0.0003701596,0.000016895146,0.0000021270484,0.000005335385,0.00032868306,0.65179485,0.30661386,0.0040637865,0.03632028,0.00031738478],"about_ca_topic_score_codex":0.000029167184,"about_ca_topic_score_gemma":0.000023435141,"teacher_disagreement_score":0.8534239,"about_ca_system_score_codex":0.000067972,"about_ca_system_score_gemma":0.00011034091,"threshold_uncertainty_score":0.9008899},"labels":[],"label_agreement":null},{"id":"W2981531092","doi":"10.1145/3341215.3358247","title":"Oui, Chef!!: Supervised Learning for Novel Gameplay with Believable AI","year":2019,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Game design; Game mechanics; Human–computer interaction; Artificial intelligence; Game Developer; Train; Multimedia; Video game development; Educational game","score_opus":0.025593858027721218,"score_gpt":0.270997567195973,"score_spread":0.2454037091682518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981531092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067357406,0.000021334034,0.9195223,0.0013449875,0.00023954014,0.00042583718,6.317371e-7,0.00028254229,0.0108054215],"genre_scores_gemma":[0.8562137,0.0000026509308,0.122767754,0.001149641,0.00006292682,0.000039423598,0.0000024547865,0.000022035389,0.019739447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986044,0.000017549566,0.00020865088,0.00047933325,0.00026724997,0.00042282877],"domain_scores_gemma":[0.9989233,0.00022376438,0.00005955916,0.0005123893,0.00019455845,0.000086399144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030746017,0.0001580362,0.00018897276,0.00007675291,0.00012012293,0.00022833448,0.00079309667,0.00006614272,0.0002682686],"category_scores_gemma":[0.0000620328,0.00012106647,0.00006224469,0.0002888337,0.000039896626,0.00068066607,0.00016667994,0.00017476933,0.0006982257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026896186,0.00066855556,0.056921974,0.00019702832,0.00019244134,0.000011052312,0.010348526,0.107098795,0.12837727,0.55342036,0.0065520927,0.13594297],"study_design_scores_gemma":[0.00038585748,0.0006400922,0.00036484425,0.000039684543,0.0000070930614,0.000012165856,0.0004430525,0.85267866,0.098577105,0.0015082266,0.044923387,0.00041985587],"about_ca_topic_score_codex":0.00008189555,"about_ca_topic_score_gemma":0.000056323388,"teacher_disagreement_score":0.79675454,"about_ca_system_score_codex":0.000033375105,"about_ca_system_score_gemma":0.00009721298,"threshold_uncertainty_score":0.89745116},"labels":[],"label_agreement":null},{"id":"W2982378153","doi":"10.1609/aiide.v15i1.5228","title":"Pathfinding and Abstraction with Dynamic Terrain Costs","year":2019,"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":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Terrain; Abstraction; Computer science; Path (computing); Programming language; Theoretical computer science; Shortest path problem; Geography; Cartography","score_opus":0.020321478016749866,"score_gpt":0.266035848648368,"score_spread":0.24571437063161813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982378153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9786063,0.00001552454,0.0101218885,0.0015052926,0.0002662184,0.0005979468,0.000006680221,0.00006530511,0.008814881],"genre_scores_gemma":[0.99917585,0.000037944134,0.0002770898,0.00016524637,0.000015495192,0.000025727615,7.7459543e-7,0.000017701183,0.00028419239],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99819636,0.000011859529,0.00045185792,0.00060708076,0.00041393374,0.000318905],"domain_scores_gemma":[0.99887025,0.00014851714,0.0003798566,0.00022181125,0.0002782319,0.00010130127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019124283,0.0002836617,0.00026769025,0.00015131166,0.00012608853,0.0007508105,0.0006521093,0.00006633,0.000031125648],"category_scores_gemma":[0.00010571732,0.00019526145,0.0000700719,0.00022557814,0.00026821753,0.0018149072,0.0003864361,0.00029866214,0.0000719636],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049338414,0.00043984616,0.009266024,0.00007870177,0.0001043263,0.0000029323453,0.006759699,0.000059718164,0.0454318,0.3388064,0.000020090603,0.5985371],"study_design_scores_gemma":[0.00019516457,0.0039572255,0.007262585,0.0026021604,0.000044034074,0.00012445882,0.033673234,0.18267603,0.6918956,0.07587777,0.00042336356,0.0012683587],"about_ca_topic_score_codex":0.000042797245,"about_ca_topic_score_gemma":0.000019250268,"teacher_disagreement_score":0.6464638,"about_ca_system_score_codex":0.0001365471,"about_ca_system_score_gemma":0.00003486156,"threshold_uncertainty_score":0.7962531},"labels":[],"label_agreement":null},{"id":"W298550780","doi":"","title":"La {-k}-autoduality des sommes lexicographiques finies de tournois suivant un 3-cycle ou un tournoi critique.","year":2006,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Humanities; Philosophy","score_opus":0.03123489315163599,"score_gpt":0.30835286969836256,"score_spread":0.2771179765467266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W298550780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93420154,0.022313247,0.015645439,0.011316065,0.0054407967,0.00042061912,0.000046015168,0.0007224211,0.009893884],"genre_scores_gemma":[0.9801129,0.0017721228,0.015232917,0.0006701953,0.00017916536,0.00005407429,0.000009204219,0.00008015329,0.0018892478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936892,0.0016221129,0.0011971067,0.0010764577,0.0007395635,0.0016755518],"domain_scores_gemma":[0.99555093,0.0017054264,0.0003965404,0.0012886621,0.00064733723,0.00041112237],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024329633,0.0007167994,0.0007077261,0.00029606346,0.000859924,0.001233261,0.0019537904,0.0006202766,0.00026057262],"category_scores_gemma":[0.00078362296,0.0008036971,0.00047598637,0.0012278333,0.0021405225,0.0017453162,0.00073831424,0.0009282247,0.00017836761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021225154,0.0010990845,0.017100012,0.00011002551,0.00008736427,0.00037527664,0.0046988116,0.00016501888,0.00032281192,0.86240655,0.007575857,0.10603794],"study_design_scores_gemma":[0.00030765226,0.00029235956,0.02180755,0.00031889701,0.00006933866,0.0001412941,0.0006693456,0.0037037183,0.06813523,0.88565814,0.018082544,0.00081393094],"about_ca_topic_score_codex":0.010220927,"about_ca_topic_score_gemma":0.00093689177,"teacher_disagreement_score":0.105224006,"about_ca_system_score_codex":0.00035828596,"about_ca_system_score_gemma":0.00040903743,"threshold_uncertainty_score":0.99980354},"labels":[],"label_agreement":null},{"id":"W2986507538","doi":"","title":"Fun with mnemonics","year":2021,"lang":"en","type":"article","venue":"Canadian Family Physician","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mnemonic; World Wide Web; Data science; Psychology; Cognitive psychology","score_opus":0.02535893124586235,"score_gpt":0.23310014985794889,"score_spread":0.20774121861208653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986507538","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055889655,0.0015040094,0.12110069,0.0062591266,0.0013210309,0.0002809971,0.000031400712,0.00035273514,0.8132604],"genre_scores_gemma":[0.82856387,0.000020239495,0.016411562,0.15312402,0.0002824322,0.000018538341,0.0000119624465,0.00003796856,0.0015294013],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987122,0.000035035395,0.00013387918,0.00040603074,0.00020424846,0.00050864526],"domain_scores_gemma":[0.9985707,0.00003659789,0.00003877236,0.00076588074,0.00018833729,0.0003997154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057181114,0.00014321282,0.00014441335,0.0000893007,0.00018375315,0.00022701088,0.00068359263,0.000050025286,0.0000035922455],"category_scores_gemma":[0.000009496728,0.00014284381,0.000050600243,0.00072802324,0.000074606316,0.00035559412,0.000064122425,0.00015156966,0.00048821556],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027779852,0.000055760353,0.00023371342,0.000011359946,0.000057221252,0.001133121,0.0006856533,0.0007129926,0.0046190433,0.3206781,0.025130441,0.6466798],"study_design_scores_gemma":[0.000166624,0.00015216401,0.003576291,0.00010735401,0.000021762002,0.000015068192,0.0020323903,0.019041192,0.05050449,0.026095534,0.8971933,0.0010937924],"about_ca_topic_score_codex":0.004283564,"about_ca_topic_score_gemma":0.036277596,"teacher_disagreement_score":0.8720629,"about_ca_system_score_codex":0.00017393347,"about_ca_system_score_gemma":0.0014550238,"threshold_uncertainty_score":0.9813078},"labels":[],"label_agreement":null},{"id":"W2989640809","doi":"10.1609/aaai.v34i04.5857","title":"Algorithmic Improvements for Deep Reinforcement Learning Applied to Interactive Fiction","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Compute Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Observability; Computer science; Artificial intelligence; Action (physics); Function (biology); Domain (mathematical analysis); Baseline (sea); Point (geometry); Machine learning; Mathematics","score_opus":0.0794015375588785,"score_gpt":0.32264253964009265,"score_spread":0.24324100208121416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989640809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056226975,0.000012073915,0.9754496,0.0044341916,0.0021134329,0.003874668,0.000009597954,0.0002918209,0.008191884],"genre_scores_gemma":[0.97700083,0.000027780992,0.020726256,0.0006656739,0.00033717437,0.00092459685,0.0000068254367,0.00005205327,0.00025882895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952569,0.000028997107,0.0014495973,0.0015927956,0.0009583769,0.000713356],"domain_scores_gemma":[0.9959396,0.00023854966,0.0013970599,0.0006348868,0.0015313993,0.00025847345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070545636,0.0006790772,0.0007336997,0.0003337243,0.00039482457,0.0007753831,0.0046708444,0.0003232534,0.00006249258],"category_scores_gemma":[0.0011696329,0.00059675437,0.0003853615,0.0007258655,0.00020440386,0.00038512537,0.003566586,0.0013420423,0.00017917328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005093945,0.00021159608,0.00001828821,0.0003223693,0.00015912298,6.3660065e-7,0.012436532,0.059450444,0.07273891,0.54838246,0.000656368,0.3051139],"study_design_scores_gemma":[0.000019868052,0.0004047145,0.000007454544,0.00029947513,0.000028111584,5.9540326e-7,0.0011468161,0.44959614,0.4280668,0.119796835,0.0002530443,0.0003801598],"about_ca_topic_score_codex":0.00008776887,"about_ca_topic_score_gemma":0.000013444082,"teacher_disagreement_score":0.9713781,"about_ca_system_score_codex":0.00034461965,"about_ca_system_score_gemma":0.00025591275,"threshold_uncertainty_score":0.9996484},"labels":[],"label_agreement":null},{"id":"W2990854486","doi":"10.1007/978-3-030-35288-2_4","title":"Multi-Minimax: A New AI Paradigm for Simultaneously-Played Multi-player Games","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Minimax; Non-cooperative game; Game tree; Combinatorial game theory; Pruning; Sequential game; Screening game; Adversary; Repeated game; Strategy; Game theory; Artificial intelligence; Mathematical economics; Theoretical computer science; Computer security; Mathematics","score_opus":0.04153817435843266,"score_gpt":0.30482928025162326,"score_spread":0.2632911058931906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990854486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043552496,0.0007317178,0.9904613,0.0019258193,0.004245523,0.001850066,0.000025761537,0.00037843172,0.0003378469],"genre_scores_gemma":[0.0502252,0.0000570041,0.9374742,0.0053153713,0.00087231037,0.000034248238,0.000012463038,0.00012587418,0.0058833617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992874,0.000051786097,0.0011711777,0.003149508,0.0012231161,0.0015303988],"domain_scores_gemma":[0.99353004,0.0023007295,0.0005888739,0.0026464658,0.00046261647,0.00047128435],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009040124,0.0011391719,0.0011504067,0.0010318194,0.00036742995,0.0011944841,0.006703809,0.000768973,0.000056250614],"category_scores_gemma":[0.00056871725,0.0010578048,0.00041506186,0.0006886536,0.00088302564,0.0010773941,0.0015796367,0.0012318797,0.000470952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005042503,0.00014531067,0.000081445745,0.00009666544,0.000053510546,0.00016322128,0.0034193231,0.19997348,0.0008471573,0.020636603,0.00046681953,0.77406603],"study_design_scores_gemma":[0.0004900869,0.00036764436,0.000023315717,0.0003684907,0.000018997605,0.00008568524,7.0667136e-7,0.93006504,0.004858417,0.045370247,0.017081806,0.0012695745],"about_ca_topic_score_codex":0.00014201073,"about_ca_topic_score_gemma":0.00061760255,"teacher_disagreement_score":0.77279645,"about_ca_system_score_codex":0.00047143115,"about_ca_system_score_gemma":0.0021105183,"threshold_uncertainty_score":0.99984235},"labels":[],"label_agreement":null},{"id":"W2990888871","doi":"10.20380/gi2019.28","title":"Biologically-Inspired Gameplay: Movement Algorithms for Artificially Intelligent (AI) Non-Player Characters (NPC)","year":2019,"lang":"en","type":"article","venue":"Canada Human-Computer Communications Society","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Flocking (texture); Computer science; Salient; Firefly algorithm; Leverage (statistics); Particle swarm optimization; Artificial intelligence; Swarm intelligence; Algorithm; Machine learning; Perception; Human–computer interaction","score_opus":0.054801797953048334,"score_gpt":0.30836805331007905,"score_spread":0.2535662553570307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990888871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025051083,0.00017477754,0.95532936,0.015230259,0.0016277444,0.0017436754,0.00004347947,0.00029620194,0.0005034143],"genre_scores_gemma":[0.6448762,0.00013891987,0.31949008,0.033440605,0.00036372818,0.00046273056,0.00022473412,0.000064399515,0.0009386164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996749,0.00013915722,0.0009655639,0.00087609445,0.000499814,0.0007703636],"domain_scores_gemma":[0.9943987,0.000530056,0.00038142706,0.0038863078,0.0005587685,0.0002447186],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006693958,0.00042762875,0.00049714575,0.00007929991,0.00086989405,0.00040974212,0.0055337455,0.00019862018,0.000053000927],"category_scores_gemma":[0.000023041222,0.00042287257,0.0004093956,0.00044907525,0.0002521086,0.00045072386,0.0016348633,0.00051142916,0.000079186444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004274088,0.0018509012,0.005303485,0.00026984353,0.001438615,0.000016887783,0.017799517,0.008908913,0.024455817,0.34423658,0.31128243,0.2843943],"study_design_scores_gemma":[0.0003395935,0.00025715516,0.0028485118,0.00009587356,0.000031059786,0.000004819453,0.00048225155,0.80075943,0.009179542,0.0068279593,0.17810278,0.0010710489],"about_ca_topic_score_codex":0.02666906,"about_ca_topic_score_gemma":0.039376836,"teacher_disagreement_score":0.7918505,"about_ca_system_score_codex":0.0007861582,"about_ca_system_score_gemma":0.0008900225,"threshold_uncertainty_score":0.9998468},"labels":[],"label_agreement":null},{"id":"W2995226313","doi":"10.1080/03610918.2019.1698746","title":"Distinguishing luck from skill through statistical simulation: a case study","year":2019,"lang":"en","type":"article","venue":"Communications in Statistics - Simulation and Computation","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Luck; Psychology; Computer science; Cognitive psychology; Epistemology; Philosophy","score_opus":0.17764707539074193,"score_gpt":0.47334648490143477,"score_spread":0.29569940951069285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995226313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20137292,0.000083099025,0.79709363,0.00008485418,0.00019550679,0.0006259685,0.00005907962,0.00011329859,0.0003716292],"genre_scores_gemma":[0.6881402,0.0000073755787,0.3115935,0.00008286078,0.00001765077,0.000018565095,0.00011089193,0.000013039372,0.000015929387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997641,0.0004907483,0.0008015573,0.0005109425,0.00033486,0.00022087492],"domain_scores_gemma":[0.99134415,0.006846872,0.00026713396,0.0011274628,0.0003413041,0.00007308186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004162231,0.00020586011,0.0002716209,0.00014987904,0.00034970813,0.00043110625,0.0006444196,0.000078769124,0.000035703644],"category_scores_gemma":[0.00060976075,0.00023276248,0.000022127295,0.000514114,0.00012555892,0.0007438283,0.0005616804,0.00029729673,0.000070070106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008854358,0.00029616454,0.021302497,0.000009231277,0.000016563034,0.00006854399,0.01634212,0.8494638,0.000002187799,0.050916556,0.000016283384,0.061557196],"study_design_scores_gemma":[0.00036953954,0.00009511992,0.011152457,0.00002682942,0.000015434513,0.00001335429,0.003276149,0.91812754,0.0000014212178,0.06648364,0.0002069836,0.00023153308],"about_ca_topic_score_codex":0.0012355974,"about_ca_topic_score_gemma":0.00065008743,"teacher_disagreement_score":0.48676726,"about_ca_system_score_codex":0.000110487264,"about_ca_system_score_gemma":0.00006418548,"threshold_uncertainty_score":0.94917786},"labels":[],"label_agreement":null},{"id":"W2995593705","doi":"10.4212/cjhp.v72i6.2949","title":"Daring To Be Different","year":2019,"lang":"en","type":"article","venue":"The Canadian Journal of Hospital Pharmacy","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Information retrieval; Computer science","score_opus":0.035492506828615794,"score_gpt":0.29164034869058225,"score_spread":0.2561478418619665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995593705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95772725,0.000183988,0.0039377217,0.03313481,0.003073791,0.00016488084,0.0000017032376,0.000010540053,0.0017652867],"genre_scores_gemma":[0.99690056,0.0000043823384,0.0004998136,0.0020570701,0.0001902638,0.0000011722633,7.2538995e-8,0.000008523524,0.0003381668],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897903,0.000040740826,0.00027032822,0.0001204683,0.0002595068,0.00032993217],"domain_scores_gemma":[0.99878633,0.00006880906,0.00012428602,0.0003062619,0.00015476091,0.0005595508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029627501,0.00010560057,0.00013824207,0.00014774142,0.00015649432,0.00030928667,0.0017940835,0.000014413749,0.0001738333],"category_scores_gemma":[0.0000658778,0.000070806454,0.000116953466,0.00020662215,0.000049295177,0.0004246562,0.00008878654,0.0002676376,0.00023722248],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008307081,0.0003078146,0.1944335,0.00005017826,0.00068739324,0.0013815006,0.102484874,0.015326026,0.0076273563,0.17226894,0.108008444,0.3973409],"study_design_scores_gemma":[0.0014754459,0.003467709,0.0482149,0.00039013696,0.00014057913,0.00057315215,0.0027668471,0.032027252,0.17145704,0.04429396,0.6929065,0.0022865043],"about_ca_topic_score_codex":0.0042058905,"about_ca_topic_score_gemma":0.007381507,"teacher_disagreement_score":0.58489805,"about_ca_system_score_codex":0.00016541885,"about_ca_system_score_gemma":0.00044795193,"threshold_uncertainty_score":0.63580763},"labels":[],"label_agreement":null},{"id":"W2997123841","doi":"10.1609/aaai.v34i04.5885","title":"Monte-Carlo Tree Search in Continuous Action Spaces with Value Gradients","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute; Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Iran Telecommunication Research Center; National Research Foundation","keywords":"Monte Carlo tree search; Discretization; Smoothness; Action (physics); Tree (set theory); Mathematical optimization; Computer science; Monte Carlo method; Set (abstract data type); Space (punctuation); Mathematics; Discrete space; Exploit; Algorithm; Mathematical analysis","score_opus":0.12340160450697585,"score_gpt":0.3139371520565129,"score_spread":0.19053554754953705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997123841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621522,0.00003773089,0.015651546,0.014861102,0.00036424038,0.0008920852,0.000004313952,0.00019009942,0.0058466876],"genre_scores_gemma":[0.99636406,0.000040039064,0.0029452266,0.00037441327,0.000093358234,0.000037610273,1.8693396e-7,0.000023592182,0.00012149705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967723,0.000054829765,0.00073891116,0.0008744354,0.00094265724,0.0006168689],"domain_scores_gemma":[0.9982061,0.0001540546,0.00038940503,0.00037475428,0.0006651433,0.0002105762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053828297,0.00035921173,0.00045587806,0.00021108174,0.0001837481,0.000450014,0.0028326556,0.00013151907,0.000036122456],"category_scores_gemma":[0.00048401926,0.0002636396,0.0001283965,0.0016472199,0.00048411387,0.0008977421,0.00048159328,0.0006313548,0.0001348214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058899284,0.00044933418,0.008594979,0.00010992552,0.00005331714,0.000010677733,0.017430076,0.004253126,0.050166704,0.7345434,0.00019246072,0.18360706],"study_design_scores_gemma":[0.000056190525,0.0009146956,0.0011481651,0.000333282,0.000016953103,0.000007894726,0.004727217,0.28862953,0.6813947,0.022229169,0.00010807014,0.00043414906],"about_ca_topic_score_codex":0.00036322145,"about_ca_topic_score_gemma":0.00016446305,"teacher_disagreement_score":0.7123142,"about_ca_system_score_codex":0.00009675231,"about_ca_system_score_gemma":0.00015631391,"threshold_uncertainty_score":0.9999816},"labels":[],"label_agreement":null},{"id":"W2997443382","doi":"10.1609/aaai.v34i06.6551","title":"Active Goal Recognition","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Expediting; Observer (physics); Computer science; Agency (philosophy); Artificial intelligence; Goal orientation; Landmark; Machine learning; Human–computer interaction; Psychology; Engineering; Social psychology","score_opus":0.13642033691760833,"score_gpt":0.3062379934139301,"score_spread":0.16981765649632177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997443382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5245655,0.000065986176,0.2618753,0.097255364,0.0025141553,0.0026387875,0.00006122586,0.0011619705,0.1098617],"genre_scores_gemma":[0.9934105,0.00003008285,0.0048418106,0.0014026689,0.00018539868,0.00003448122,7.475557e-7,0.00001818126,0.000076090844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973996,0.000031308933,0.0007067482,0.0007318095,0.00068611203,0.0004443823],"domain_scores_gemma":[0.9979082,0.00014882065,0.000500016,0.00031456,0.00092301413,0.00020539721],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031343434,0.00029910737,0.00032647315,0.00010379763,0.00023386194,0.00029650307,0.0029524574,0.00013161759,0.00020680382],"category_scores_gemma":[0.0011276295,0.00023613726,0.00019583615,0.0011180118,0.0003964539,0.000877773,0.0006015139,0.00049038744,0.00089333684],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012354755,0.00011740314,0.00006140228,0.000028260924,0.000020277921,0.0000010651647,0.0042545716,0.00004159363,0.061220765,0.54580367,0.00040635432,0.38792112],"study_design_scores_gemma":[0.000012842619,0.0002679179,0.000060303268,0.00009491499,0.000010337008,0.0000030076924,0.0010082239,0.044622317,0.7496775,0.2037681,0.00023411609,0.00024041881],"about_ca_topic_score_codex":0.0000332538,"about_ca_topic_score_gemma":0.000006427142,"teacher_disagreement_score":0.6884567,"about_ca_system_score_codex":0.0000557404,"about_ca_system_score_gemma":0.00012485893,"threshold_uncertainty_score":0.9998846},"labels":[],"label_agreement":null},{"id":"W2997475283","doi":"10.1609/aaai.v34i04.5857","title":"Algorithmic Improvements for Deep Reinforcement Learning Applied to Interactive Fiction","year":2020,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; McGill University","funders":"Compute Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Observability; Computer science; Artificial intelligence; Action (physics); Function (biology); Domain (mathematical analysis); Baseline (sea); Point (geometry); Machine learning; Mathematics","score_opus":0.029864837394477615,"score_gpt":0.290029295663619,"score_spread":0.2601644582691414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997475283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010349372,0.000002241068,0.9905301,0.0012670909,0.00024925004,0.00069704105,1.7858952e-7,0.0002159847,0.0060032206],"genre_scores_gemma":[0.90829396,8.4664975e-7,0.08810812,0.0028370442,0.00012844377,0.00018351352,0.0000028506147,0.000009060772,0.0004361582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989813,0.000010799728,0.00023776958,0.00036419078,0.00017310007,0.0002328279],"domain_scores_gemma":[0.9994783,0.00007577726,0.00007166795,0.00015815577,0.00008809041,0.00012802314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105410734,0.00010867644,0.00010713623,0.0000514686,0.0001162916,0.00012848237,0.00044357748,0.000029822471,0.00007036611],"category_scores_gemma":[0.00009461965,0.00010399625,0.000045662597,0.00021505251,0.000009644299,0.0002968807,0.00025839597,0.00010108973,0.00025834364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084653286,0.00003070248,0.000028297296,0.000015736394,0.00004199951,0.0000011879143,0.011743243,0.20538908,0.026286054,0.025071897,0.0024984255,0.7288087],"study_design_scores_gemma":[0.00007652474,0.00034998436,0.0000097073425,0.0000035342096,0.0000026969435,3.009245e-7,0.0007564297,0.8601572,0.1289367,0.00046055648,0.009122569,0.00012382022],"about_ca_topic_score_codex":0.000023763636,"about_ca_topic_score_gemma":0.000004642092,"teacher_disagreement_score":0.90725905,"about_ca_system_score_codex":0.00007358993,"about_ca_system_score_gemma":0.000019365527,"threshold_uncertainty_score":0.42408442},"labels":[],"label_agreement":null},{"id":"W2999458623","doi":"10.1007/s00182-019-00702-3","title":"Three-player nim with podium rule","year":2020,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Equivalence (formal languages); Combinatorial game theory; Order (exchange); Mathematical economics; Characterization (materials science); Computer science; Discrete mathematics; Game theory; Sequential game; Physics","score_opus":0.027153284574486517,"score_gpt":0.2752359548013868,"score_spread":0.24808267022690028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999458623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06334682,0.00012570657,0.9245291,0.009142407,0.00088324904,0.000042373642,0.000002245364,0.000039130122,0.0018889923],"genre_scores_gemma":[0.9678607,0.00001549282,0.028475974,0.002574669,0.0009985985,0.0000010839121,3.6239885e-7,0.000011464968,0.000061643164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850625,0.00006169452,0.00039193055,0.00016602676,0.0007199674,0.00015416209],"domain_scores_gemma":[0.99852735,0.00021231548,0.0003505326,0.00015886563,0.00060195604,0.00014900295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045339268,0.00011791493,0.00016432094,0.0001153513,0.000026628513,0.0001740597,0.00195704,0.00003763654,0.00018499998],"category_scores_gemma":[0.00015976165,0.00008688226,0.0001018441,0.00014140485,0.00010389747,0.00067906966,0.00018296331,0.0002625867,0.00019463731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012217709,0.00022243713,0.0045020543,0.00000818187,0.00057472533,0.0012992566,0.0073216297,0.003535173,0.0052167983,0.6187657,0.0034476137,0.35388467],"study_design_scores_gemma":[0.001313546,0.0024268772,0.007284665,0.00030837418,0.00006749704,0.002158479,0.0007345462,0.051038876,0.07672883,0.82966006,0.027409287,0.0008689874],"about_ca_topic_score_codex":0.000005246189,"about_ca_topic_score_gemma":0.000003911197,"teacher_disagreement_score":0.9045139,"about_ca_system_score_codex":0.00005160479,"about_ca_system_score_gemma":0.00013621274,"threshold_uncertainty_score":0.36367},"labels":[],"label_agreement":null},{"id":"W3005422563","doi":"10.1109/tg.2020.2972463","title":"Discriminative Neural Network for Hero Selection in Professional <i>Heroes of the Storm</i> and <i>DOTA 2</i>","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Artificial intelligence; Selection (genetic algorithm); Discriminative model","score_opus":0.034483233420543075,"score_gpt":0.28029665265623427,"score_spread":0.2458134192356912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005422563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18151931,0.0000746788,0.81205875,0.0048655365,0.00091497716,0.00047173977,0.000009305575,0.000052800686,0.000032866545],"genre_scores_gemma":[0.9948172,0.000013211374,0.0042440137,0.00062805007,0.00005272977,0.00007639701,1.6580957e-7,0.000008880977,0.00015935091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906075,0.00010295224,0.00023026917,0.00026729307,0.00015133178,0.00018741017],"domain_scores_gemma":[0.9994116,0.00027513033,0.00008482606,0.00011846882,0.000061331455,0.00004866387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118013144,0.00011513334,0.00014572575,0.000032847318,0.00015178016,0.00003083607,0.00032497552,0.00005012309,0.0000067027295],"category_scores_gemma":[0.000017137236,0.00008336888,0.00007478589,0.00042929512,0.000115164665,0.0002762439,0.000006061269,0.0002075864,0.0000013717756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005735099,0.0007513556,0.0045978357,0.0002276035,0.00009334407,0.0000024438352,0.03740058,0.32290906,0.024129761,0.008591817,0.0052745393,0.5954482],"study_design_scores_gemma":[0.00043994456,0.0006886474,0.004530421,0.00014788052,0.000035732508,0.0000075370067,0.0013756565,0.7176203,0.26733208,0.0056989803,0.0017664975,0.00035632498],"about_ca_topic_score_codex":0.000040404764,"about_ca_topic_score_gemma":0.00029691812,"teacher_disagreement_score":0.81329787,"about_ca_system_score_codex":0.000024962872,"about_ca_system_score_gemma":0.000048542708,"threshold_uncertainty_score":0.33996844},"labels":[],"label_agreement":null},{"id":"W3006111153","doi":"10.22215/etd/2016-11500","title":"Enhancing AI-Based Game Playing Using Adaptive Data Structures","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Ranking (information retrieval); Sophistication; Pruning; Premise; Field (mathematics); Core (optical fiber); Tree (set theory); Game tree; Sequential game; Artificial intelligence; Game theory; Mathematics","score_opus":0.09145587251845948,"score_gpt":0.3627629948782847,"score_spread":0.2713071223598252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006111153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01335918,0.00017485647,0.9806335,0.00007899616,0.0020223244,0.00024398835,0.00002685636,0.00024203103,0.0032182846],"genre_scores_gemma":[0.7997845,0.0000074299332,0.19734628,0.00043372356,0.00041208998,0.000008949613,0.00019681253,0.000055973855,0.0017542804],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973452,0.00008043052,0.0005164915,0.0010644504,0.0005482699,0.00044511916],"domain_scores_gemma":[0.99713826,0.00031835068,0.00034931483,0.0018448342,0.00024910457,0.0001001443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027770933,0.00036663254,0.00034267025,0.00026437663,0.0002248443,0.0003578431,0.003269182,0.00028118558,0.00020350344],"category_scores_gemma":[0.0002162531,0.0002882145,0.00007910269,0.00025944298,0.000048853017,0.0011126348,0.00034423347,0.00032999302,0.000099419056],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002734311,0.00012865283,0.00047119273,0.00038422772,0.00038187005,0.0001885507,0.008308586,0.0038803504,0.29063457,0.14980346,0.0021072677,0.54343784],"study_design_scores_gemma":[0.00006750333,0.000049118513,0.00015259052,0.0005713555,0.000036659996,0.000004680269,0.0005715462,0.4391232,0.54225606,0.015998097,0.000390129,0.0007790361],"about_ca_topic_score_codex":0.00045858565,"about_ca_topic_score_gemma":0.0012405053,"teacher_disagreement_score":0.7864253,"about_ca_system_score_codex":0.00012149423,"about_ca_system_score_gemma":0.0006813195,"threshold_uncertainty_score":0.999957},"labels":[],"label_agreement":null},{"id":"W3008136107","doi":"10.4212/cjhp.v73i1.2969","title":"Standing on the Shoulders of Giants","year":2020,"lang":"en","type":"article","venue":"The Canadian Journal of Hospital Pharmacy","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Shoulders; Medicine; Surgery","score_opus":0.09061611176940874,"score_gpt":0.3079059985205487,"score_spread":0.21728988675113992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008136107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71860784,0.000659053,0.015775643,0.2589073,0.0019994627,0.0002806514,0.000011324631,0.000016425478,0.0037423207],"genre_scores_gemma":[0.99670833,0.000017265604,0.00019048587,0.0028721779,0.00018794235,5.815184e-7,4.3979107e-8,0.000007255883,0.00001593517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989766,0.000082512124,0.00030779713,0.000091885275,0.00030741654,0.00023381409],"domain_scores_gemma":[0.99888647,0.00018658048,0.00023649137,0.00019380744,0.00015394867,0.0003426925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004515899,0.000091573005,0.00012721361,0.00006499216,0.00021746894,0.00013630556,0.0017760023,0.000014142547,0.000113518865],"category_scores_gemma":[0.000301936,0.00005149158,0.00010323256,0.00031268655,0.00020279738,0.0002991913,0.000042315412,0.00034410047,0.00003071412],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018816734,0.0001669692,0.024270939,0.000055236425,0.0007529654,0.0014517945,0.16300902,0.01374974,0.0065963827,0.3519318,0.24222559,0.1956014],"study_design_scores_gemma":[0.0016367269,0.0057328944,0.0055220034,0.0006287798,0.00022513844,0.00021812985,0.015747817,0.113556325,0.6218956,0.07751426,0.15561435,0.0017079598],"about_ca_topic_score_codex":0.0012934078,"about_ca_topic_score_gemma":0.0007814221,"teacher_disagreement_score":0.6152992,"about_ca_system_score_codex":0.00007597938,"about_ca_system_score_gemma":0.00060201273,"threshold_uncertainty_score":0.33002838},"labels":[],"label_agreement":null},{"id":"W3012333240","doi":"10.1007/s00182-020-00715-3","title":"On lattices from combinatorial game theory: infinite case","year":2020,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Distributive lattice; Converse; Iterated function; Distributive property; Mathematics; Partially ordered set; Lattice (music); Finite set; Combinatorics; Complete lattice; Map of lattices; Existential quantification; Discrete mathematics; Pure mathematics; Universality (dynamical systems)","score_opus":0.03442724259271438,"score_gpt":0.30245293624011366,"score_spread":0.26802569364739925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012333240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5331968,0.0003167432,0.44610646,0.0068075485,0.008355631,0.00011480195,0.0000316051,0.00010031118,0.004970105],"genre_scores_gemma":[0.9932188,0.000027625154,0.0017049538,0.0033507745,0.001625747,0.0000015914379,0.000001457028,0.000016862428,0.00005222102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756694,0.0004658333,0.00066326436,0.0002615787,0.0008442331,0.00019813982],"domain_scores_gemma":[0.9958183,0.002517719,0.0006270267,0.0002621022,0.00055633736,0.00021852135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010468656,0.00019000498,0.00027259477,0.00018839278,0.000044075554,0.00032690822,0.0021881126,0.00008389072,0.0003352074],"category_scores_gemma":[0.0016439223,0.00016027446,0.00020344942,0.00017212833,0.00015832859,0.000778129,0.00030012842,0.0004874395,0.0003269047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079291104,0.00012993185,0.00009782996,0.000001985338,0.0002497632,0.0042182156,0.0064853407,0.0009082832,0.00043893108,0.9251542,0.0004074561,0.06111513],"study_design_scores_gemma":[0.0005185264,0.0004769902,0.00007277205,0.00008257383,0.000026586687,0.0006305948,0.0004636221,0.005690996,0.008869148,0.97807014,0.0048932526,0.00020477467],"about_ca_topic_score_codex":0.000017279703,"about_ca_topic_score_gemma":0.0000023047987,"teacher_disagreement_score":0.46002197,"about_ca_system_score_codex":0.00008425732,"about_ca_system_score_gemma":0.0001246328,"threshold_uncertainty_score":0.65358025},"labels":[],"label_agreement":null},{"id":"W3014256205","doi":"10.1145/3261442","title":"Session details: Sketching &amp; writing","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Session (web analytics); Computer science; Computer graphics (images); Multimedia; Engineering drawing; World Wide Web; Engineering","score_opus":0.055330348068155344,"score_gpt":0.31131171763169124,"score_spread":0.2559813695635359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014256205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052600026,0.000035224795,0.940845,0.0052889683,0.0004961555,0.00009487745,0.0000035357075,0.00037439444,0.00026182955],"genre_scores_gemma":[0.941012,0.00015877542,0.05798766,0.00053890015,0.000046797886,0.000020182682,3.2740067e-7,0.000015934971,0.0002194135],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984844,0.00009423491,0.0003151541,0.00042498848,0.0003427603,0.0003385108],"domain_scores_gemma":[0.99776137,0.0007826948,0.000078685865,0.0011594768,0.000103931096,0.000113871865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037898414,0.00016342831,0.0001306975,0.00027872025,0.00045298855,0.00012999689,0.0011606783,0.000109495326,0.000070140064],"category_scores_gemma":[0.00013973664,0.00011892141,0.00014230945,0.0006309198,0.000105091465,0.00082612684,0.000025647156,0.00025426174,0.0002940694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008758573,0.00011948882,0.00092342065,0.000008078682,0.000024266832,0.0000064598107,0.00064778724,0.00017824433,0.008303449,0.023365436,0.00011002402,0.9663046],"study_design_scores_gemma":[0.0007170191,0.00045184707,0.003917941,0.0012905406,0.00007936831,0.00013750739,0.0006091286,0.012108692,0.23756391,0.70359445,0.037470363,0.0020592534],"about_ca_topic_score_codex":0.0000322951,"about_ca_topic_score_gemma":0.00017257282,"teacher_disagreement_score":0.9642453,"about_ca_system_score_codex":0.00004030385,"about_ca_system_score_gemma":0.000043228338,"threshold_uncertainty_score":0.4849474},"labels":[],"label_agreement":null},{"id":"W3018055465","doi":"10.7557/23.6175","title":"Design Foundations for Emotional Game Characters","year":2020,"lang":"en","type":"article","venue":"Eludamos Journal for Computer Game Culture","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Variety (cybernetics); Computer science; Expansive; Game mechanics; Game design; Agency (philosophy); Video game; Mood; Cognition; Cognitive psychology; Human–computer interaction; Psychology; Cognitive science; Multimedia; Social psychology; Artificial intelligence; Sociology","score_opus":0.11094937809031614,"score_gpt":0.3291627737110764,"score_spread":0.21821339562076025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018055465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007979524,0.00013234124,0.98117846,0.014152145,0.002682225,0.0008286051,0.000017461842,0.00018854608,0.000022264714],"genre_scores_gemma":[0.04814389,0.000041954085,0.9376247,0.0077744303,0.005623515,0.00010049214,0.000033226013,0.00004565723,0.0006121599],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977903,0.00010036842,0.00059954246,0.00052824727,0.00040006978,0.000581507],"domain_scores_gemma":[0.99793315,0.0003080772,0.00034806377,0.00027431623,0.00070620485,0.00043018104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043471734,0.00029882023,0.0003285935,0.00009011101,0.00046328257,0.0010256874,0.0014890017,0.00014216156,0.000033661065],"category_scores_gemma":[0.00019184325,0.00025359643,0.0003986208,0.00033857257,0.00007338805,0.0011934842,0.00015861994,0.00040931045,0.000091624366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037354123,0.00049833045,0.00014115045,0.00018317647,0.0006749345,0.000070434144,0.04374871,0.1273197,0.009493447,0.12782978,0.43905804,0.25060877],"study_design_scores_gemma":[0.00054695783,0.0009158668,0.00014766281,0.00006872105,0.000031161064,0.00021931762,0.00007377138,0.7147551,0.0025855207,0.022561466,0.257641,0.000453437],"about_ca_topic_score_codex":5.0982675e-7,"about_ca_topic_score_gemma":5.030384e-7,"teacher_disagreement_score":0.5874354,"about_ca_system_score_codex":0.00010325659,"about_ca_system_score_gemma":0.00019784503,"threshold_uncertainty_score":0.99999166},"labels":[],"label_agreement":null},{"id":"W3019257765","doi":"10.1109/tg.2020.2989072","title":"Tension Space Analysis for Emergent Narrative","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Narrative; Computer science; Storytelling; Sketch; Interactive storytelling; Narrative network; Human–computer interaction; Space (punctuation); Cognitive science; Interface (matter); Narrative inquiry; Narrative criticism; Psychology; Art; Literature; Algorithm","score_opus":0.05627657491735296,"score_gpt":0.3010639616787002,"score_spread":0.24478738676134723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019257765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008866619,0.00003458314,0.97705287,0.012971038,0.00046924388,0.00026545906,0.000010408428,0.00022470282,0.00010505415],"genre_scores_gemma":[0.9715194,0.000023639428,0.026932001,0.0009916539,0.000053248154,0.000065295026,9.852225e-7,0.000010991569,0.00040277693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873346,0.000050207895,0.00025493768,0.00048355348,0.0002418885,0.00023597546],"domain_scores_gemma":[0.99910074,0.0001587917,0.00007438297,0.00035506196,0.0001552208,0.0001557838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009736165,0.00016030871,0.00023375993,0.0001793143,0.0002299426,0.00007786931,0.00043787874,0.00006153957,0.00012256572],"category_scores_gemma":[0.000021167923,0.00014630437,0.0003277092,0.0011926763,0.00005446635,0.00027652876,0.0000027448054,0.0001369153,0.00009847379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002243398,0.0005131963,0.00014644471,0.000043422937,0.0013672118,0.00001781223,0.06586785,0.7206436,0.026519341,0.0055085425,0.0069163726,0.17223188],"study_design_scores_gemma":[0.000105948406,0.00038895925,0.000072794595,0.000007652267,0.00017419647,0.0000011100927,0.001680985,0.71191657,0.27935106,0.0007455135,0.0052755177,0.00027969092],"about_ca_topic_score_codex":0.00003827239,"about_ca_topic_score_gemma":0.000076833225,"teacher_disagreement_score":0.9626528,"about_ca_system_score_codex":0.00003473765,"about_ca_system_score_gemma":0.000040197847,"threshold_uncertainty_score":0.5966119},"labels":[],"label_agreement":null},{"id":"W3020479143","doi":"10.1016/j.tcs.2020.04.007","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:mi mathvariant=\"sans-serif\">NP</mml:mi></mml:math>-completeness of the game Kingdomino<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.svg\"><mml:msup><mml:mrow/><mml:mrow><mml:mtext mathvariant=\"italic\">TM</mml:mtext></mml:mrow></mml:msup></mml:math>","year":2020,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"Campus France; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Mathematics; Scalable Vector Graphics; Domino; Completeness (order theory); Combinatorics; Algebra over a field; Computer science; Artificial intelligence; Discrete mathematics; Pure mathematics; World Wide Web","score_opus":0.027275776130689044,"score_gpt":0.25469439900238244,"score_spread":0.2274186228716934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020479143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8708686,0.00072825106,0.0696044,0.0038569141,0.005972997,0.00022881445,0.00036409943,0.00070149597,0.047674432],"genre_scores_gemma":[0.9712428,0.00047379645,0.01902048,0.0052160714,0.002476536,0.0006390681,0.00017393785,0.0006514433,0.00010588172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9807026,0.0009897652,0.0037566833,0.0043396354,0.00566852,0.0045428025],"domain_scores_gemma":[0.98512983,0.0033365672,0.003120883,0.005708022,0.00060375704,0.0021009247],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.005261028,0.0018799884,0.0010521521,0.0006548482,0.003169981,0.0044399886,0.010937158,0.0024053126,0.008753292],"category_scores_gemma":[0.0026969875,0.0024550864,0.0025161589,0.0034869248,0.01059584,0.0035025647,0.009927299,0.0030429664,0.00673541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093395857,0.0006209435,0.000008163021,0.0010546718,0.0006860982,0.0018321287,0.00867151,0.004018624,0.005410595,0.9660685,0.003601659,0.0070931455],"study_design_scores_gemma":[0.00096585223,0.0019646625,0.000092652,0.0012693619,0.0007012075,0.0023595868,0.0011357083,0.8141039,0.1711125,0.0019636329,0.0024960972,0.0018348433],"about_ca_topic_score_codex":0.0010992296,"about_ca_topic_score_gemma":0.00020616947,"teacher_disagreement_score":0.9641049,"about_ca_system_score_codex":0.00007040873,"about_ca_system_score_gemma":0.0030638385,"threshold_uncertainty_score":0.9993944},"labels":[],"label_agreement":null},{"id":"W3022772269","doi":"10.1609/icaps.v23i1.13578","title":"Temporal-Difference Search in Computer Go","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Monte Carlo method; Search algorithm; Reinforcement learning; Beam search; Tree (set theory); Binary search algorithm; Artificial intelligence; Temporal difference learning; Search tree; Machine learning; Algorithm; Mathematics; Statistics","score_opus":0.06008416597085555,"score_gpt":0.31047455053372397,"score_spread":0.25039038456286844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022772269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883174,0.000019569818,0.005447683,0.0029292013,0.0002706409,0.00016485626,0.0000012083473,0.00021505289,0.002634412],"genre_scores_gemma":[0.9763987,0.000006684259,0.023237703,0.00018960454,0.00003457626,0.000013778323,7.44665e-7,0.0000063581215,0.000111834495],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869174,0.000012644256,0.00033473922,0.00032668715,0.00041602325,0.00021816656],"domain_scores_gemma":[0.9991837,0.00009791753,0.00015666273,0.00011017343,0.00039511253,0.00005642033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003170609,0.00014121002,0.00016054268,0.00018983406,0.00008245157,0.00043489825,0.001339599,0.00007214637,0.000020713627],"category_scores_gemma":[0.000107641456,0.00010520813,0.000029853529,0.00024160849,0.0000942503,0.00041725198,0.0004165713,0.00029378445,0.00002664325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054149496,0.0002608417,0.43390876,0.00011376071,0.00009059003,0.000008016477,0.010278942,0.013221631,0.14044045,0.35258883,0.0008171656,0.048216857],"study_design_scores_gemma":[0.000077893375,0.0000506214,0.031817574,0.00047202676,0.0000011399616,0.000008968484,0.00026172498,0.9434426,0.017031182,0.0067135175,0.000006633835,0.000116163756],"about_ca_topic_score_codex":0.00015390161,"about_ca_topic_score_gemma":0.0000018852396,"teacher_disagreement_score":0.9302209,"about_ca_system_score_codex":0.00003684623,"about_ca_system_score_gemma":0.00004704082,"threshold_uncertainty_score":0.4290263},"labels":[],"label_agreement":null},{"id":"W3023245170","doi":"10.48550/arxiv.2004.14950","title":"Invertible Elements of the Misere Dicotic Universe","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Invertible matrix; Universe; Characterization (materials science); Mathematics; Physics; Pure mathematics; Astrophysics; Optics","score_opus":0.13094614408590238,"score_gpt":0.20809410382725033,"score_spread":0.07714795974134794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023245170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5177921,0.00005392897,0.46959823,0.001148278,0.0015715546,0.0006626707,0.000027201046,0.00025909953,0.008886934],"genre_scores_gemma":[0.99763787,0.00006171826,0.00092834415,0.0001942746,0.00003459813,3.110661e-7,0.000002211575,0.00001265381,0.0011280039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983447,0.0001636307,0.0002727606,0.0007857437,0.00015572153,0.0002774103],"domain_scores_gemma":[0.99777395,0.00007808073,0.00038770994,0.0014615102,0.00016090061,0.00013785815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012993561,0.00024344011,0.00028084993,0.000118986754,0.0001271842,0.000053490363,0.004036079,0.00017422036,0.000065962435],"category_scores_gemma":[0.000076865435,0.00023014062,0.00026848158,0.0008536372,0.0002435686,0.00027357772,0.0060985647,0.0004964531,0.00012581894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052849042,0.00025040584,0.033528566,0.0002723739,0.0002945369,0.00026573986,0.00229109,0.18806587,0.0010247767,0.76779354,0.0030506323,0.0031096523],"study_design_scores_gemma":[0.00019630484,0.00006812124,0.001462788,0.00021810747,0.00011384841,0.0000017263196,0.0005068168,0.78114986,0.01127248,0.20291588,0.001602504,0.0004915538],"about_ca_topic_score_codex":0.00024636652,"about_ca_topic_score_gemma":0.00008118382,"teacher_disagreement_score":0.59308404,"about_ca_system_score_codex":0.00016545072,"about_ca_system_score_gemma":0.0003248002,"threshold_uncertainty_score":0.9384862},"labels":[],"label_agreement":null},{"id":"W3026736587","doi":"10.48550/arxiv.2005.11335","title":"Single-Agent Optimization Through Policy Iteration Using Monte-Carlo Tree Search","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Reinforcement learning; Normalization (sociology); Set (abstract data type); Search algorithm; Tree (set theory); Iterative deepening depth-first search; Monte Carlo method; Beam search; Mathematical optimization; Artificial intelligence; Algorithm; Best-first search; Mathematics","score_opus":0.2789313618876238,"score_gpt":0.26314395241625593,"score_spread":0.015787409471367864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026736587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08703981,0.000038627437,0.9093158,0.0007154774,0.00050358754,0.00037148298,0.000009154701,0.00029985447,0.0017061806],"genre_scores_gemma":[0.9511148,0.00009293181,0.04789709,0.00022536398,0.00030271726,7.614248e-7,0.000012275755,0.000028433526,0.00032567125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997534,0.00025110925,0.00033114062,0.0012564603,0.00020620057,0.0004211371],"domain_scores_gemma":[0.9981358,0.00008860983,0.00025589392,0.0010255758,0.00032245723,0.00017165119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016460125,0.00034868845,0.00032135195,0.00031499204,0.00025369905,0.00046371296,0.0017061443,0.00029536377,0.000027477872],"category_scores_gemma":[0.000105563384,0.000431527,0.00021104405,0.0012161627,0.00013608103,0.0011128692,0.0021562588,0.000519501,0.00007333666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016941596,0.0000704247,0.00019641533,0.00003107894,0.000040275092,0.00010708106,0.0020558373,0.9497086,0.0004153252,0.045928467,0.00005039302,0.0013792035],"study_design_scores_gemma":[0.00008586152,0.00006404427,0.000029993811,0.00007597253,0.000033423054,0.0000036130375,0.00018142977,0.9831944,0.0028822008,0.012936216,0.00013120612,0.00038165392],"about_ca_topic_score_codex":0.0011999592,"about_ca_topic_score_gemma":0.000063116146,"teacher_disagreement_score":0.86407495,"about_ca_system_score_codex":0.00079362444,"about_ca_system_score_gemma":0.00044074803,"threshold_uncertainty_score":0.9998137},"labels":[],"label_agreement":null},{"id":"W3035431356","doi":"10.48550/arxiv.2006.06054","title":"Marginal Utility for Planning in Continuous or Large Discrete Action Spaces","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute; Compute Canada","keywords":"Generator (circuit theory); Action (physics); Computer science; Domain (mathematical analysis); Sample (material); Space (punctuation); Artificial intelligence; State space; Marginal utility; Machine learning; Mathematics; Statistics; Economics","score_opus":0.21010812573677132,"score_gpt":0.28029738185573794,"score_spread":0.07018925611896662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035431356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20126557,0.000028579581,0.79639924,0.00034589742,0.00059517735,0.00046437155,0.000032694876,0.00018764164,0.000680847],"genre_scores_gemma":[0.9958323,0.000030338279,0.0033328906,0.0000831967,0.00010413544,0.0000037027971,0.000014511827,0.000014597297,0.00058430806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979446,0.00012699174,0.00025232777,0.0011366453,0.00009249203,0.00044694],"domain_scores_gemma":[0.9985991,0.00026244225,0.00025771052,0.0006493512,0.00009712339,0.0001342816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035007767,0.00027737618,0.00038661392,0.00019328958,0.00013720735,0.00018666248,0.0014086075,0.00024706026,0.000034699537],"category_scores_gemma":[0.00013704732,0.000293097,0.00016860133,0.00046618833,0.0000892183,0.00048662315,0.0013359392,0.0005546016,0.00003459162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004018376,0.0007614489,0.21179703,0.0013954474,0.00043755953,0.0041627698,0.012501119,0.26874208,0.00042551706,0.46744657,0.004177327,0.024134751],"study_design_scores_gemma":[0.00025487025,0.000111800684,0.0026752192,0.00014696494,0.00002911462,0.0000026358305,0.001114562,0.9401746,0.0007418547,0.04999431,0.004329791,0.00042429141],"about_ca_topic_score_codex":0.0001988791,"about_ca_topic_score_gemma":0.00038737664,"teacher_disagreement_score":0.79456675,"about_ca_system_score_codex":0.0001678104,"about_ca_system_score_gemma":0.00020326143,"threshold_uncertainty_score":0.99995214},"labels":[],"label_agreement":null},{"id":"W3035908455","doi":"10.1007/978-3-030-51310-8_18","title":"Literary Natural Language Generation with Psychological Traits","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Parsing; Creativity; Computer science; Artificial intelligence; Natural language processing; Text generation; Natural language generation; Natural (archaeology); Personality; Literary language; Linguistics; Natural language; Psychology; History; Philosophy; Social psychology","score_opus":0.03215910308621596,"score_gpt":0.28881465221331426,"score_spread":0.2566555491270983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035908455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007091543,0.0009939914,0.9917356,0.0016752545,0.0012213547,0.0003363125,0.0000036151343,0.00025669966,0.0030680252],"genre_scores_gemma":[0.65234154,0.00001215313,0.3428075,0.003695117,0.00090494024,0.0000073052306,0.0000074495974,0.000024450854,0.00019952498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963792,0.000042892792,0.00044324066,0.0017139592,0.00091633346,0.0005043819],"domain_scores_gemma":[0.99841464,0.0002171509,0.00020341107,0.0008202258,0.00016430815,0.00018026514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032193883,0.000487694,0.00042278733,0.00037079284,0.00018400926,0.00072208536,0.0029228113,0.00025640344,0.000031021307],"category_scores_gemma":[0.00007491116,0.0003696516,0.00009928765,0.00062539504,0.00066079176,0.00075176416,0.0006382312,0.0010163913,0.0000998699],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009652253,0.000023161007,0.000010962226,0.000010399409,0.0000070678207,0.00041421587,0.0027647733,0.0036070324,0.0012854106,0.017563995,0.000045227494,0.9742581],"study_design_scores_gemma":[0.00015365017,0.00065132906,0.00012114155,0.00024386219,0.000008365547,0.00036340827,7.0632854e-7,0.9232827,0.008690287,0.06479244,0.0006626406,0.0010294694],"about_ca_topic_score_codex":0.0000052372657,"about_ca_topic_score_gemma":0.000045178575,"teacher_disagreement_score":0.97322863,"about_ca_system_score_codex":0.0001344423,"about_ca_system_score_gemma":0.0001941652,"threshold_uncertainty_score":0.99987555},"labels":[],"label_agreement":null},{"id":"W3037305688","doi":"10.1609/aiide.v13i2.12961","title":"The Current State of StarCraft AI Competitions and Bots","year":2017,"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":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Tournament; Popularity; Entertainment; Competition (biology); Computer science; State (computer science); Artificial intelligence; Multimedia; Psychology; Political science","score_opus":0.0464982675154513,"score_gpt":0.32068297483021085,"score_spread":0.2741847073147595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037305688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9430857,0.00022149249,0.027707042,0.01596259,0.001240641,0.0011524339,0.00007745196,0.00005442814,0.010498237],"genre_scores_gemma":[0.99920195,0.00038027862,0.000101406484,0.00008915199,0.000026689182,0.000029773293,5.276277e-7,0.000009008726,0.00016120823],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981634,0.000017092543,0.0006288301,0.00043762062,0.00043708712,0.0003159486],"domain_scores_gemma":[0.99787873,0.00023932967,0.00070428656,0.0004492686,0.0006245656,0.000103830855],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002922723,0.00024361943,0.0002672535,0.00007946536,0.00067729043,0.0015824699,0.001708122,0.000026473073,0.000006289178],"category_scores_gemma":[0.000540943,0.00015416475,0.00010553829,0.00009440318,0.0012386919,0.0015755551,0.001143385,0.00033492807,0.000013152343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010336387,0.0001848695,0.0010702333,0.00002618516,0.000037273257,3.6542943e-7,0.0019552081,0.000007147332,0.002054533,0.27392668,0.0000522697,0.7205819],"study_design_scores_gemma":[0.000060843166,0.00084518624,0.0051480774,0.001025723,0.00002267993,0.000008244502,0.0018107557,0.03472689,0.432568,0.5213609,0.0020090968,0.0004135917],"about_ca_topic_score_codex":0.00003610972,"about_ca_topic_score_gemma":0.00003132418,"teacher_disagreement_score":0.7201683,"about_ca_system_score_codex":0.00004948865,"about_ca_system_score_gemma":0.00006330607,"threshold_uncertainty_score":0.99945396},"labels":[],"label_agreement":null},{"id":"W3037392402","doi":"10.1609/aiide.v13i2.12969","title":"Effects of Self-Knowledge: Once Bitten Twice Shy","year":2017,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Pathfinding; Computer science; Task (project management); Function (biology); Irrational number; Focus (optics); Video game; Artificial intelligence; State (computer science); Feature (linguistics); Human–computer interaction; Theoretical computer science; Multimedia; Mathematics; Algorithm; Engineering","score_opus":0.03471506957564033,"score_gpt":0.3015969314874356,"score_spread":0.2668818619117953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037392402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9276446,0.00011753036,0.019746274,0.0028260003,0.0013226414,0.0012485012,0.000014966429,0.00012190594,0.046957567],"genre_scores_gemma":[0.99885046,0.000088461835,0.0005299209,0.00010824289,0.00006118726,0.00004412715,3.7175272e-7,0.00001659034,0.00030060578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976873,0.000021710677,0.00073468895,0.0006600002,0.0004915268,0.00040476996],"domain_scores_gemma":[0.9972298,0.0003488689,0.0009982333,0.00055452425,0.00073209306,0.00013648564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026606556,0.00035741358,0.00044347884,0.00015738934,0.0003646985,0.001013358,0.0029238572,0.00009365694,0.00001361894],"category_scores_gemma":[0.00093371357,0.0002669659,0.0002115224,0.00018085037,0.0006321936,0.0022859587,0.0014568344,0.00032372487,0.000057383193],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027004766,0.0014031958,0.0017047495,0.00026850041,0.00019039189,0.000003379949,0.011769999,0.000006975536,0.054998994,0.58620965,0.00012461965,0.34304953],"study_design_scores_gemma":[0.000050974002,0.00074693933,0.0012437849,0.00087591173,0.000032761123,0.000005971559,0.0014506521,0.015485141,0.9308819,0.048612498,0.00030911076,0.00030435182],"about_ca_topic_score_codex":0.00004971054,"about_ca_topic_score_gemma":0.000006015257,"teacher_disagreement_score":0.8758829,"about_ca_system_score_codex":0.00008535304,"about_ca_system_score_gemma":0.00007660509,"threshold_uncertainty_score":0.99997824},"labels":[],"label_agreement":null},{"id":"W3037493829","doi":"10.1609/aiide.v13i2.12981","title":"Towards Positively Surprising Non-Player Characters in Video Games","year":2017,"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":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Video game; Deep neural networks; Artificial intelligence; Human–computer interaction; Artificial neural network; Multimedia","score_opus":0.046129248985870876,"score_gpt":0.3042893785799648,"score_spread":0.2581601295940939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037493829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9555006,0.000012492212,0.01099012,0.0046111317,0.000631606,0.0006153418,0.000014315259,0.000038733455,0.027585682],"genre_scores_gemma":[0.99902475,0.00005574003,0.00026345765,0.00029362692,0.000053041807,0.00004475892,8.9089434e-7,0.00001750535,0.0002462052],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974002,0.00001794352,0.00076430367,0.00076888443,0.000543109,0.00050555676],"domain_scores_gemma":[0.99801415,0.00013266335,0.0007642396,0.00050185213,0.00045163286,0.0001354641],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003863083,0.00038230454,0.00042982976,0.00023062807,0.00035554348,0.0022004363,0.0023815632,0.00009957494,0.000022547167],"category_scores_gemma":[0.00067391305,0.00029510286,0.00017622224,0.00017895408,0.0005481915,0.003569813,0.0011695113,0.00042634737,0.000057572022],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047216544,0.00075433805,0.010566866,0.00005486666,0.000093522176,0.000012338218,0.011909501,0.00002104221,0.037337795,0.28820735,0.00006930859,0.6505009],"study_design_scores_gemma":[0.00007860457,0.00056930044,0.022978745,0.0012625284,0.000012991862,0.00001548575,0.004489773,0.020084605,0.89080125,0.059020203,0.00014725656,0.00053925294],"about_ca_topic_score_codex":0.00026089893,"about_ca_topic_score_gemma":0.000033740704,"teacher_disagreement_score":0.8534635,"about_ca_system_score_codex":0.00016421825,"about_ca_system_score_gemma":0.000078546924,"threshold_uncertainty_score":0.9999501},"labels":[],"label_agreement":null},{"id":"W3037498460","doi":"10.1609/aiide.v13i2.12962","title":"An Analysis of Model-Based Heuristic Search Techniques for StarCraft Combat Scenarios","year":2017,"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":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Benchmark (surveying); Reinforcement learning; Heuristic; Artificial intelligence; Control (management); Machine learning; Simulation","score_opus":0.07687274324031944,"score_gpt":0.35470646005106987,"score_spread":0.2778337168107504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037498460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43599945,0.000006399381,0.5602118,0.0012792049,0.00012520657,0.0008085119,0.00009323012,0.00004807391,0.0014281448],"genre_scores_gemma":[0.99658984,0.000013605035,0.003079521,0.00013288372,0.00002094201,0.00007420655,0.000004703857,0.000015039194,0.00006927445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976996,0.000017665036,0.0007255727,0.00066026003,0.0005290192,0.0003678687],"domain_scores_gemma":[0.99710196,0.00021916053,0.00070091354,0.00070410647,0.001138907,0.00013494887],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004352579,0.00029724019,0.0005094067,0.00035840724,0.00036948928,0.0010909153,0.002582816,0.000085417385,0.000014205145],"category_scores_gemma":[0.00050522585,0.00022820935,0.00029835853,0.0002462332,0.0007116164,0.0016785947,0.0004852163,0.00021730576,0.0000032145906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010524758,0.0019468367,0.006845409,0.00015600644,0.0005460609,0.000001193381,0.0062184194,0.006640976,0.05037946,0.5292064,0.000036679736,0.3969701],"study_design_scores_gemma":[0.000018101435,0.0005849891,0.00024231343,0.00014529335,0.000056790526,3.2320688e-7,0.0008082024,0.57945037,0.4009738,0.017563656,0.000010192051,0.00014595294],"about_ca_topic_score_codex":0.00009547616,"about_ca_topic_score_gemma":0.000026626014,"teacher_disagreement_score":0.5728094,"about_ca_system_score_codex":0.00009495603,"about_ca_system_score_gemma":0.00010002805,"threshold_uncertainty_score":0.99994606},"labels":[],"label_agreement":null},{"id":"W3037624633","doi":"10.1609/aaai.v34i09.7124","title":"Abstraction and Refinement in Games with Dynamic Weighted Terrain","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Abstraction; Terrain; Computer science; Programming language; Work (physics); Theoretical computer science; Geography; Epistemology; Engineering; Cartography","score_opus":0.051167445417047715,"score_gpt":0.2847045815880936,"score_spread":0.23353713617104588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037624633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92222214,0.000050913008,0.03706769,0.03377851,0.00020967892,0.00074117986,0.0000040818895,0.00015973109,0.0057660528],"genre_scores_gemma":[0.99411505,0.000058240144,0.0052108327,0.00048509848,0.000029671508,0.000030497784,3.3479623e-7,0.000013340587,0.00005695278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979034,0.000020603195,0.00061103026,0.00064171525,0.00047891875,0.0003443309],"domain_scores_gemma":[0.9989036,0.00008903398,0.00035533318,0.00023204283,0.0002963893,0.00012362227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032431955,0.00025485124,0.00028601018,0.00014033145,0.000114033326,0.00023081813,0.0012417858,0.00008640209,0.000048504426],"category_scores_gemma":[0.00021933188,0.00018178971,0.00005324856,0.0008214539,0.00034003472,0.0005429131,0.00030720583,0.0003823619,0.000044923094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028415408,0.00023664189,0.0016705838,0.000098166776,0.000026127384,0.000004993274,0.012311764,0.00022443554,0.08014189,0.554608,0.000086538224,0.35030672],"study_design_scores_gemma":[0.00005369976,0.0007507368,0.0021256048,0.00039908616,0.000014091315,0.000011085678,0.0030575686,0.3735901,0.5311064,0.088142335,0.00029784345,0.00045143088],"about_ca_topic_score_codex":0.000090808186,"about_ca_topic_score_gemma":0.00010215893,"teacher_disagreement_score":0.46646565,"about_ca_system_score_codex":0.000057294405,"about_ca_system_score_gemma":0.00008081025,"threshold_uncertainty_score":0.7413169},"labels":[],"label_agreement":null},{"id":"W3037653762","doi":"10.1609/aiide.v13i2.12973","title":"Designing Stronger AI Personalities","year":2017,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Studio; Personality psychology; Character (mathematics); Game design; Computer science; Recipe; Personality; Game Developer; Game art design; Video game development; Video game; Human–computer interaction; Multimedia; World Wide Web; Psychology; Telecommunications; Social psychology","score_opus":0.07028087751818489,"score_gpt":0.3151067728071075,"score_spread":0.24482589528892262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037653762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7549916,0.00006296832,0.1399179,0.020588934,0.0016735985,0.001278499,0.00004371694,0.00017420572,0.08126859],"genre_scores_gemma":[0.9980544,0.000026687503,0.0005627873,0.0003629436,0.000071117065,0.000037317852,5.770635e-7,0.0000146751945,0.00086950563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978683,0.000014869173,0.0005478423,0.00061040587,0.00053763064,0.00042096304],"domain_scores_gemma":[0.9981081,0.00013249733,0.0006035432,0.00048664407,0.00054297916,0.00012626583],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00026564844,0.0003219145,0.00031318088,0.00011391997,0.00062423106,0.0027867819,0.002360001,0.00007455821,0.000056592264],"category_scores_gemma":[0.0005948894,0.00023801002,0.00017821483,0.000092445734,0.00072407804,0.0032343601,0.0010574094,0.0003526739,0.00006681454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017575691,0.00031563704,0.0044590053,0.000036516176,0.000090993046,0.0000025088043,0.007939511,0.000016676124,0.013776229,0.7328748,0.00019685895,0.24011551],"study_design_scores_gemma":[0.000042471245,0.00058933883,0.0008486881,0.00062171405,0.000015185598,0.00001271673,0.01123333,0.019117977,0.8192646,0.14732271,0.0004791612,0.0004521046],"about_ca_topic_score_codex":0.000047935944,"about_ca_topic_score_gemma":0.000008260046,"teacher_disagreement_score":0.80548835,"about_ca_system_score_codex":0.00009051674,"about_ca_system_score_gemma":0.00005796852,"threshold_uncertainty_score":0.9982484},"labels":[],"label_agreement":null},{"id":"W3038055381","doi":"10.22266/ijies2020.0831.19","title":"HOGO: Hide Objects Game Optimization","year":2020,"lang":"en","type":"article","venue":"International journal of intelligent engineering and systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; University of Calgary","funders":"Villum Fonden","keywords":"Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.026436901151505498,"score_gpt":0.24987081184851387,"score_spread":0.22343391069700838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038055381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01261407,0.0011888129,0.98230296,0.00096767757,0.0026808411,0.00006373777,0.0000015365135,0.000057173474,0.000123186],"genre_scores_gemma":[0.9870328,0.00030064236,0.011858327,0.00012901895,0.0006381699,0.0000019573195,7.361141e-7,0.000011077691,0.000027278536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986068,0.000029451581,0.0005957153,0.00015403028,0.0004787326,0.00013524533],"domain_scores_gemma":[0.9988789,0.0001245092,0.00025551353,0.000100505604,0.000473233,0.0001673419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026476893,0.00012458983,0.00019531137,0.00017377977,0.000017474396,0.0003264554,0.000779134,0.000049106457,0.000008726966],"category_scores_gemma":[0.0003818551,0.00011052508,0.0000790758,0.00014837593,0.000017008559,0.0004653542,0.00010387988,0.00017176867,0.00001536333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011549566,0.00001542781,0.00018811498,0.000016506556,0.000088117245,0.00008736299,0.0017525612,0.9846683,0.0011437254,0.007274678,0.00016342159,0.0045902277],"study_design_scores_gemma":[0.00006304633,0.00010354856,0.000026016873,0.0001314672,0.0000053973245,0.0002759183,0.00022645344,0.9900247,0.0052214167,0.000053836582,0.0037526614,0.00011556357],"about_ca_topic_score_codex":0.000011774843,"about_ca_topic_score_gemma":2.377943e-7,"teacher_disagreement_score":0.9744187,"about_ca_system_score_codex":0.000062567575,"about_ca_system_score_gemma":0.000042183983,"threshold_uncertainty_score":0.45070818},"labels":[],"label_agreement":null},{"id":"W3041349757","doi":"10.24963/ijcai.2020/764","title":"RLCard: A Platform for Reinforcement Learning in Card Games","year":2020,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Reinforcement learning; Debugging; Python (programming language); Human–computer interaction; Visualization; Bridging (networking); Multimedia; Artificial intelligence; Programming language","score_opus":0.06500251615242786,"score_gpt":0.29653362770087466,"score_spread":0.2315311115484468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041349757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071632355,0.000032959022,0.97774863,0.0036487204,0.00012104644,0.00027925553,1.7526077e-7,0.00021500056,0.010790966],"genre_scores_gemma":[0.9745503,0.000009269821,0.023047185,0.0014920147,0.000070575734,0.000043478107,0.0000011396737,0.0000068127774,0.00077923556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901175,0.000010671729,0.00025865846,0.0002772115,0.00017365038,0.00026803382],"domain_scores_gemma":[0.99952376,0.00012940385,0.00004729644,0.00016802322,0.000045506244,0.00008602599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017882069,0.000098775505,0.00014513439,0.000053651438,0.0000532818,0.000098623415,0.0005089461,0.000039201368,0.000031401145],"category_scores_gemma":[0.00021060967,0.00008571577,0.000068690795,0.00024591686,0.000021667676,0.00038033084,0.00019300579,0.00011716195,0.00010620732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005445668,0.000027787248,0.0039954036,0.00005588231,0.000030348954,0.000019606125,0.020909913,0.26973087,0.0016148394,0.32964158,0.0057802503,0.36813906],"study_design_scores_gemma":[0.000101767204,0.00022043628,0.000084569765,0.0000113626975,0.0000015690164,0.0000010133191,0.0007047791,0.92550623,0.022895923,0.0025833799,0.047728572,0.00016039002],"about_ca_topic_score_codex":0.00006776312,"about_ca_topic_score_gemma":0.000030760984,"teacher_disagreement_score":0.9673871,"about_ca_system_score_codex":0.000040425606,"about_ca_system_score_gemma":0.000052785548,"threshold_uncertainty_score":0.34953877},"labels":[],"label_agreement":null},{"id":"W3041462746","doi":"10.1016/j.disc.2022.113229","title":"Atomic weights and the combinatorial game of bipass","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Indian Institute of Technology Bombay; Killam Trusts","keywords":"Mathematics; Integer (computer science); Combinatorics; Surjective function; Function (biology); Combinatorial game theory; Simple (philosophy); STRIPS; Discrete mathematics; Game theory; Sequential game; Mathematical economics; Computer science; Algorithm","score_opus":0.01681235723702562,"score_gpt":0.2571901889042398,"score_spread":0.24037783166721416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041462746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6139927,0.00045247635,0.37484503,0.0025643974,0.0020138659,0.0006760585,0.000014980626,0.00014237883,0.0052981214],"genre_scores_gemma":[0.9909494,0.0000120777895,0.008833872,0.00005094263,0.000033586268,0.00003371316,6.4348774e-7,0.000008334271,0.00007743518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890804,0.00011790312,0.00030915914,0.0001568876,0.00036158512,0.00014643597],"domain_scores_gemma":[0.99864715,0.0005988257,0.00018193545,0.0005041508,0.000035368546,0.000032577344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006322736,0.000092341026,0.00020551033,0.000047379956,0.00016561612,0.00006258729,0.00089371065,0.000019135266,0.000034707868],"category_scores_gemma":[0.00010931931,0.00006105116,0.00006761551,0.00021919217,0.0002511867,0.00010301223,0.00076695654,0.00013180038,0.000010154053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076987,0.0000312287,0.000033591674,0.000017528202,0.000012985372,0.0000016312704,0.0075426404,0.000027285663,0.00006181753,0.99154395,0.000112202215,0.0006074385],"study_design_scores_gemma":[0.0002235059,0.000042816184,0.000016146067,0.000009155309,0.000010984537,0.000013121342,0.0007844182,0.17194878,0.0026249946,0.8231527,0.0010860892,0.00008725757],"about_ca_topic_score_codex":0.000018575662,"about_ca_topic_score_gemma":0.0000012290581,"teacher_disagreement_score":0.3769567,"about_ca_system_score_codex":0.000020240876,"about_ca_system_score_gemma":0.000031155032,"threshold_uncertainty_score":0.24895942},"labels":[],"label_agreement":null},{"id":"W3041759287","doi":"10.1007/978-3-319-73062-2","title":"Intelligent Technologies for Interactive Entertainment","year":2018,"lang":"en","type":"book","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Entertainment; Computer science; Human–computer interaction; Multimedia; Art; Visual arts","score_opus":0.027107467044293187,"score_gpt":0.2755763615782542,"score_spread":0.24846889453396104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041759287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000645301,0.00028744276,0.9954239,0.0013616568,0.0010851385,0.0009743994,0.000050352228,0.00014935987,0.00060318364],"genre_scores_gemma":[0.005549966,0.00009120811,0.9937491,0.00015262974,0.0001549086,0.00012736389,0.000023340075,0.00001531334,0.0001362093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853754,0.000013612428,0.0007008217,0.00021740135,0.00023488775,0.000295757],"domain_scores_gemma":[0.9975946,0.0007559568,0.00055979064,0.00075835147,0.00030090634,0.000030382726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044551966,0.00029186433,0.00036741138,0.00025499417,0.00079653953,0.00029557914,0.0036236702,0.00023184906,4.847242e-7],"category_scores_gemma":[0.00023452267,0.00022757644,0.00024371642,0.00029986943,0.0007603301,0.00042186768,0.0015728939,0.0003290991,0.0000011243051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008929166,0.00007677636,0.0000053354465,0.00057348347,0.00030318514,1.0980909e-7,0.011776084,0.6254777,0.000031428288,0.11643752,0.0031508917,0.2421586],"study_design_scores_gemma":[0.00007832471,0.00018692703,0.000002858432,0.00031434317,0.00003454274,0.0000059145805,0.000039385104,0.880914,0.002859464,0.010067352,0.10517802,0.00031886288],"about_ca_topic_score_codex":0.000012408929,"about_ca_topic_score_gemma":0.000049751055,"teacher_disagreement_score":0.25543636,"about_ca_system_score_codex":0.0001852605,"about_ca_system_score_gemma":0.00026310564,"threshold_uncertainty_score":0.92802984},"labels":[],"label_agreement":null},{"id":"W3042073861","doi":"10.24963/ijcai.2020/681","title":"Planning Algorithms for Zero-Sum Games with Exponential Action Spaces: A Unifying Perspective","year":2020,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Perspective (graphical); Exponential function; Exponential growth; Action (physics); Computer science; Algorithm; Zero (linguistics); Mathematics; Theoretical computer science; Zero-sum game; Mathematical optimization; Artificial intelligence; Nash equilibrium","score_opus":0.13049614174517313,"score_gpt":0.35117652067154265,"score_spread":0.22068037892636952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042073861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012064133,0.00006566111,0.9807361,0.0046200757,0.00023067577,0.0003085545,0.0000015420383,0.00037683907,0.0015964305],"genre_scores_gemma":[0.76810443,0.000003940447,0.23080187,0.0005466876,0.00024410759,0.000040611678,0.000001224316,0.000015906006,0.0002412118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987451,0.000029885497,0.0001657353,0.0005095744,0.00024952894,0.00030020074],"domain_scores_gemma":[0.9992536,0.00013560175,0.000092544404,0.00021090407,0.00018208602,0.0001253073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109411274,0.00015586463,0.00015942253,0.00006671137,0.00018104295,0.00030959072,0.0004696868,0.00005225541,0.000020939116],"category_scores_gemma":[0.00008487823,0.00012723645,0.00006276808,0.0003226487,0.00006595213,0.0007898515,0.00011883608,0.00012973027,0.00003227183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081085606,0.00030342533,0.001906205,0.00015571508,0.0004449144,0.0002226763,0.20954378,0.036343925,0.035314057,0.52181023,0.008528734,0.18461546],"study_design_scores_gemma":[0.00029308844,0.0008451877,0.000112430396,0.000060212547,0.000022764727,0.000019361065,0.033355366,0.83428323,0.11634076,0.008650875,0.005524826,0.0004919021],"about_ca_topic_score_codex":0.00013628892,"about_ca_topic_score_gemma":0.000016675505,"teacher_disagreement_score":0.7979393,"about_ca_system_score_codex":0.000071155424,"about_ca_system_score_gemma":0.0000751661,"threshold_uncertainty_score":0.51885515},"labels":[],"label_agreement":null},{"id":"W3045709494","doi":"10.3233/icg-200149","title":"The 1970 United States computer chess championship: The start of the longest-running experiment in computer science history","year":2020,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Championship; Tournament; Computer chess; Event (particle physics); Competition (biology); Computer science; Artificial intelligence; Domain (mathematical analysis); History; Mathematics","score_opus":0.07192620348136695,"score_gpt":0.2837338832472188,"score_spread":0.21180767976585185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045709494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48392692,0.0017046364,0.47578162,0.03498904,0.0031405988,0.00032351422,0.0000011281236,0.00005348063,0.00007904673],"genre_scores_gemma":[0.9887972,0.0000755553,0.0063201967,0.004359011,0.000408025,0.0000066670527,2.445672e-7,0.000010944914,0.00002215895],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975561,0.00029409313,0.00055080827,0.00030020095,0.00084272365,0.00045608357],"domain_scores_gemma":[0.99815756,0.00046544784,0.00035550568,0.0005960451,0.0002754429,0.00015002147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015401248,0.00016732927,0.00017092327,0.00012079185,0.0007821596,0.00037572611,0.003676965,0.000036269936,0.000017635622],"category_scores_gemma":[0.00007286208,0.00008427018,0.000100626705,0.0009783803,0.0011426597,0.0004422609,0.0009285976,0.00067416264,0.000011756966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012226735,0.0004148462,0.0147294365,0.000038602942,0.000119636665,0.00013926384,0.3498178,0.24442963,0.0061867656,0.028316107,0.045611985,0.31007364],"study_design_scores_gemma":[0.00017555279,0.00021392218,0.0075297346,0.00012665134,0.0000061693718,0.00008206917,0.0015498002,0.91855454,0.0156192025,0.001700095,0.05419627,0.00024600292],"about_ca_topic_score_codex":0.00007600736,"about_ca_topic_score_gemma":0.00003686587,"teacher_disagreement_score":0.6741249,"about_ca_system_score_codex":0.0002771858,"about_ca_system_score_gemma":0.00037629457,"threshold_uncertainty_score":0.68327767},"labels":[],"label_agreement":null},{"id":"W3047111047","doi":"10.3233/icg-200148","title":"An analysis of games played in world computer chess championships over the years","year":2020,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer chess; Championship; Soul; World championship; Computer science; Advertising; Operations research; Engineering; Epistemology; Business; Philosophy","score_opus":0.057331193096916144,"score_gpt":0.31150746463978674,"score_spread":0.2541762715428706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047111047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78966427,0.00011592566,0.20727725,0.0025746182,0.00021274277,0.000055216224,0.0000020083355,0.000022982926,0.00007498737],"genre_scores_gemma":[0.9934978,0.0000135348655,0.005303717,0.00094264885,0.00022118124,0.0000014225551,5.5573685e-7,0.000005794903,0.000013349787],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985802,0.00021221802,0.0004213945,0.00020941223,0.00035877142,0.00021800888],"domain_scores_gemma":[0.9990427,0.00021205135,0.00020860272,0.00033481067,0.00006594454,0.00013588576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057033217,0.00009752555,0.00024522748,0.00034921936,0.00007065886,0.00021976326,0.0013133015,0.000034775985,0.00012184825],"category_scores_gemma":[0.00003402142,0.00007213345,0.00014962428,0.0019156955,0.00008421243,0.00042081246,0.00013631438,0.00038762033,0.00001535192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009653922,0.00041417,0.45144805,0.000013733931,0.0009056022,0.00034080577,0.066324204,0.2528879,0.002041294,0.02072844,0.00509136,0.1997079],"study_design_scores_gemma":[0.000068329224,0.0000675849,0.33469522,0.000014707576,0.000038389637,0.000007877985,0.00025696572,0.66201013,0.00083558756,0.00074292446,0.0011547409,0.00010751678],"about_ca_topic_score_codex":0.000039722207,"about_ca_topic_score_gemma":0.00035292553,"teacher_disagreement_score":0.40912223,"about_ca_system_score_codex":0.000029731107,"about_ca_system_score_gemma":0.000057709294,"threshold_uncertainty_score":0.29415166},"labels":[],"label_agreement":null},{"id":"W3080471220","doi":"10.1007/s10664-020-09840-9","title":"An empirical study of the characteristics of popular Minecraft mods","year":2020,"lang":"en","type":"article","venue":"Empirical Software Engineering","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Queen's University","funders":"","keywords":"Popularity; Remuneration; Context (archaeology); Mod; Empirical research; Empirical evidence","score_opus":0.0470913351693498,"score_gpt":0.312429986715034,"score_spread":0.2653386515456842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080471220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6133212,0.000015664107,0.385793,0.000424193,0.00017516401,0.00013760389,0.000002982251,0.00012799536,0.000002207675],"genre_scores_gemma":[0.984865,7.174652e-7,0.014758085,0.00023958631,0.00010276303,0.000008078787,8.923723e-7,0.000018350778,0.000006491261],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983628,0.00007299167,0.0005400612,0.0003395809,0.0004460528,0.00023853031],"domain_scores_gemma":[0.99880093,0.00015418557,0.00012923023,0.0006421675,0.00010616994,0.000167311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015139657,0.0001745629,0.0003371467,0.000048410137,0.00004499111,0.0000330233,0.0013547742,0.000077341174,0.000010710467],"category_scores_gemma":[0.0010144686,0.00013448171,0.000102132064,0.00070448476,0.000041771276,0.00020411186,0.0003746084,0.00024207054,0.0000059191525],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010752077,0.0005112683,0.9598757,0.000063603606,0.000037103422,0.000015810241,0.0110601,0.0209024,0.0018949773,0.0001094388,0.00021068803,0.005308159],"study_design_scores_gemma":[0.00017599844,0.0009935267,0.5639244,0.000048402297,0.000028907572,0.0000052838245,0.0002692059,0.4232955,0.009141679,0.00011333591,0.0016008733,0.00040290307],"about_ca_topic_score_codex":0.000016290911,"about_ca_topic_score_gemma":0.000002002117,"teacher_disagreement_score":0.4023931,"about_ca_system_score_codex":0.000026067162,"about_ca_system_score_gemma":0.000040132472,"threshold_uncertainty_score":0.54840046},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Villum Fonden","keywords":"Computer science; Football; Mathematical optimization; Operations research; Mathematics; Political science","score_opus":0.024944420936636093,"score_gpt":0.25663096518298045,"score_spread":0.23168654424634436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080963199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016467192,0.00026594766,0.99491817,0.002083981,0.0008384391,0.00012460219,0.0000027218753,0.000061101564,0.00005834292],"genre_scores_gemma":[0.91803133,0.000043357442,0.0809312,0.00045590175,0.00049262925,0.000018608864,0.0000033818085,0.000013989914,0.000009602162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848175,0.000026669479,0.00063009816,0.00021320298,0.000505914,0.00014238765],"domain_scores_gemma":[0.99866337,0.00008129983,0.000230765,0.00015793853,0.00058481155,0.0002817909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027838524,0.00014221441,0.00019447495,0.00019219932,0.000024482426,0.0003136537,0.0009210499,0.00004818671,0.0000055622063],"category_scores_gemma":[0.000071173476,0.00013047829,0.00006442252,0.00017664132,0.000012336061,0.0003371957,0.000090112444,0.00010922997,0.00000722849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000176025,0.0000412217,0.00007078574,0.000011689926,0.00005077238,0.000016529979,0.00077529915,0.964065,0.0010254837,0.02303803,0.00010672886,0.010780856],"study_design_scores_gemma":[0.00006898203,0.00026412928,0.000013433623,0.00008844713,0.0000053522685,0.000044611035,0.00010542749,0.97970927,0.005211582,0.00007172815,0.0142868515,0.00013018025],"about_ca_topic_score_codex":0.000038291528,"about_ca_topic_score_gemma":0.0000017477993,"teacher_disagreement_score":0.91638464,"about_ca_system_score_codex":0.00010485824,"about_ca_system_score_gemma":0.000049466475,"threshold_uncertainty_score":0.532075},"labels":[],"label_agreement":null},{"id":"W3081299320","doi":"10.3233/icg-200156","title":"Computer loses in king-size blunder","year":2020,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Champion; Championship; Computer chess; Grammar school; Mathematics education; Class (philosophy); Grammar; Computer science; Artificial intelligence; Psychology; Linguistics; Law; Political science; Philosophy","score_opus":0.055701394612798674,"score_gpt":0.29213632695540814,"score_spread":0.23643493234260948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081299320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10281233,0.00017640165,0.87954277,0.015273511,0.000910353,0.00006495832,3.452909e-7,0.00008296774,0.0011363572],"genre_scores_gemma":[0.9439057,0.000021813099,0.050748058,0.0045013474,0.0007743459,0.0000010324205,6.328895e-8,0.000008556837,0.000039067145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987193,0.0000851431,0.00035512765,0.00023109809,0.00030656316,0.00030276334],"domain_scores_gemma":[0.99924797,0.00019443364,0.000110884444,0.00017702197,0.00007397956,0.0001957024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024400091,0.00011386919,0.00015736891,0.00006612032,0.000092984905,0.00039870307,0.0010090005,0.000049419057,0.00016749711],"category_scores_gemma":[0.00009897451,0.000100649355,0.000074387615,0.0003527723,0.00004788962,0.0005920897,0.00023127496,0.00042063906,0.00029904358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008541343,0.00044536122,0.07131051,0.000048955117,0.00011538656,0.0033350328,0.032582186,0.0323033,0.0053526117,0.06544673,0.03974255,0.74923193],"study_design_scores_gemma":[0.00076388265,0.0007455952,0.039760135,0.00022667713,0.000013735866,0.0013107493,0.0006843761,0.8213863,0.016896399,0.06437452,0.052754942,0.001082711],"about_ca_topic_score_codex":0.000013380239,"about_ca_topic_score_gemma":0.000015886259,"teacher_disagreement_score":0.84109336,"about_ca_system_score_codex":0.000047300644,"about_ca_system_score_gemma":0.000086131244,"threshold_uncertainty_score":0.41043615},"labels":[],"label_agreement":null},{"id":"W3087340423","doi":"10.3233/icg-200158","title":"Fifty years of computer chess","year":2020,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer chess; Computer science; Computer graphics (images); History; Archaeology","score_opus":0.05605456768780404,"score_gpt":0.285756617454809,"score_spread":0.22970204976700498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087340423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12932962,0.00015376665,0.8665544,0.0028763213,0.00057239964,0.000034701596,7.236023e-7,0.00003929935,0.0004387693],"genre_scores_gemma":[0.9364093,0.000019480738,0.06213694,0.00089683535,0.0005085627,3.8483935e-7,9.416288e-8,0.000005519013,0.000022908946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991482,0.000043522927,0.00026516157,0.0001295531,0.00025603082,0.00015753978],"domain_scores_gemma":[0.9994078,0.00006542945,0.00013797417,0.00015750187,0.00008799641,0.000143295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017425296,0.00006096098,0.00012677084,0.000038719878,0.000042862677,0.000106621796,0.0008663391,0.00003250915,0.00007621552],"category_scores_gemma":[0.000034425673,0.000058282694,0.000078551384,0.00020003256,0.000049525097,0.00031220712,0.00017346357,0.00020912098,0.00012357369],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001487959,0.000069544105,0.0022227766,0.000014501114,0.000044761517,0.00019462587,0.008431808,0.003236263,0.0032828245,0.010206222,0.015285521,0.95699626],"study_design_scores_gemma":[0.00056243886,0.001162839,0.029116131,0.00017382955,0.000026808779,0.000718501,0.0003949925,0.7110056,0.10578866,0.022215122,0.1279928,0.000842262],"about_ca_topic_score_codex":0.0000034670636,"about_ca_topic_score_gemma":8.0120685e-7,"teacher_disagreement_score":0.956154,"about_ca_system_score_codex":0.000011539405,"about_ca_system_score_gemma":0.00005730043,"threshold_uncertainty_score":0.23766993},"labels":[],"label_agreement":null},{"id":"W3088303759","doi":"10.1145/3402942.3403000","title":"Effect of Timer, Top Score and Leaderboard on Performance and Motivation in a Human Computing Game","year":2020,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Timer; Computer science; Game mechanics; Outcome (game theory); Video game; Human–computer interaction; Quality (philosophy); Multimedia; Mathematical economics; Mathematics; Physics","score_opus":0.045184182631366906,"score_gpt":0.289585936037855,"score_spread":0.24440175340648806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088303759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98022705,0.000022877852,0.018474484,0.00043840395,0.000022716498,0.0001292977,7.972794e-8,0.00004011452,0.0006449482],"genre_scores_gemma":[0.9988026,0.0000054656653,0.0009384139,0.00021202651,0.000020462468,0.0000011882014,2.2501291e-7,0.0000032634414,0.000016337133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999346,0.000048090056,0.00016850048,0.00022006792,0.00010812498,0.00010920987],"domain_scores_gemma":[0.9995957,0.0001972807,0.000048974623,0.00010320192,0.000016458727,0.000038353945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020244057,0.00007744177,0.0001341372,0.000054874898,0.000032853353,0.000035210163,0.00015303642,0.0000285,0.0000036306533],"category_scores_gemma":[0.00006550683,0.00006436788,0.00001128078,0.00018432067,0.00006775961,0.00018598881,0.00009356817,0.00008864182,0.000004524143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052400905,0.000038412014,0.44353268,0.0003014578,0.00000911488,0.000005985746,0.012604686,0.0030563357,0.019774592,0.012616535,0.000075200136,0.5079326],"study_design_scores_gemma":[0.00013863239,0.0011820071,0.04061279,0.00010488541,0.0000017540916,0.0000015536206,0.000050253264,0.71531755,0.24235788,0.000111252884,0.000021349753,0.00010009166],"about_ca_topic_score_codex":0.000030051955,"about_ca_topic_score_gemma":0.0000033485285,"teacher_disagreement_score":0.7122612,"about_ca_system_score_codex":0.0000064989636,"about_ca_system_score_gemma":0.0000062182285,"threshold_uncertainty_score":0.2624846},"labels":[],"label_agreement":null},{"id":"W3088679033","doi":"10.1145/3402942.3409793","title":"Shopping for Game levels: A Visual Analytics Approach to Exploring Procedurally Generated Content","year":2020,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Analytics; Visual analytics; Process (computing); Task (project management); Domain (mathematical analysis); Game design; Human–computer interaction; Content (measure theory); Level design; Visualization; Data science; Artificial intelligence; Engineering; Systems engineering","score_opus":0.5087072860422821,"score_gpt":0.34766135535750703,"score_spread":0.16104593068477507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088679033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058612462,0.000019688667,0.93555796,0.0039216345,0.00015530591,0.0005993348,0.0000018716133,0.00035534718,0.0007763832],"genre_scores_gemma":[0.75768024,0.0000017995276,0.23728415,0.0044260044,0.00018667214,0.00017672879,0.0000015928158,0.000015883592,0.00022689797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827665,0.000022085113,0.00040278953,0.000604348,0.00027468763,0.0004194392],"domain_scores_gemma":[0.99903035,0.00007040724,0.00006412366,0.00023201956,0.0003109153,0.00029215618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018982204,0.00018343212,0.00023288684,0.00008512827,0.00009362575,0.00031221408,0.000836741,0.00003630221,0.0000079905],"category_scores_gemma":[0.0003907105,0.00016256607,0.000089591544,0.0006806985,0.00002474846,0.0005811356,0.00029669245,0.00009449179,0.00006355182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023144255,0.0006465784,0.0009465847,0.00036204953,0.00033002615,0.000031000625,0.0376333,0.15157108,0.23012489,0.3636007,0.007114167,0.20740819],"study_design_scores_gemma":[0.00007097452,0.00023229848,0.000061579616,0.000013201078,0.0000062624904,0.0000031716647,0.0010626521,0.9236996,0.072830096,0.00017037337,0.0015993457,0.0002504163],"about_ca_topic_score_codex":0.000011635898,"about_ca_topic_score_gemma":0.0000057709362,"teacher_disagreement_score":0.7721286,"about_ca_system_score_codex":0.000055282828,"about_ca_system_score_gemma":0.0001063615,"threshold_uncertainty_score":0.6629252},"labels":[],"label_agreement":null},{"id":"W3092916815","doi":"10.2197/ipsjjip.28.919","title":"Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard","year":2020,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Generalization; Computational complexity theory; Theoretical computer science; Algorithm; Mathematics","score_opus":0.03635320821608718,"score_gpt":0.2868326374416269,"score_spread":0.25047942922553973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092916815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.287962,0.00048598184,0.6661177,0.04209147,0.000661209,0.0002924466,0.000003157446,0.000117677686,0.0022683109],"genre_scores_gemma":[0.9298088,0.000024364066,0.06370971,0.006320256,0.0001028776,0.0000024578915,2.4072855e-7,0.0000050799695,0.000026239648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762774,0.000027777352,0.0010072,0.00014045747,0.00090021774,0.00029658384],"domain_scores_gemma":[0.9976616,0.000033681503,0.0010686181,0.00015648617,0.0008994332,0.00018021191],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0011665922,0.0001286428,0.00022560514,0.000456211,0.00021664769,0.0010983385,0.0011056765,0.00005189284,0.000017046255],"category_scores_gemma":[0.00070090266,0.00010938794,0.00006088333,0.0015305434,0.00015686991,0.015589279,0.00017178003,0.00034563712,0.00009375354],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009603604,0.00009705741,0.013147466,0.00043535908,0.000015100688,0.00004695355,0.09215307,0.007674983,0.007935011,0.003017515,0.0060132355,0.8693682],"study_design_scores_gemma":[0.0008626555,0.00055209675,0.023663407,0.0016080457,0.000017785027,0.00055059924,0.010138927,0.6327752,0.26539898,0.00628999,0.057192978,0.0009493699],"about_ca_topic_score_codex":0.0000058057576,"about_ca_topic_score_gemma":0.0000017796863,"teacher_disagreement_score":0.8684188,"about_ca_system_score_codex":0.000115010516,"about_ca_system_score_gemma":0.00071259745,"threshold_uncertainty_score":0.9999386},"labels":[],"label_agreement":null},{"id":"W3093491577","doi":"10.1609/aiide.v16i1.7448","title":"A Sketch-Based Tool for Authoring and Analyzing Emergent Narratives","year":2020,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sketch; Narrative; Computer science; Context (archaeology); Character (mathematics); Space (punctuation); Narrative network; Interface (matter); Human–computer interaction; Narrative criticism; Narrative inquiry; Linguistics; History; Mathematics; Geometry; Algorithm; Philosophy","score_opus":0.0706843691147511,"score_gpt":0.30665900554378234,"score_spread":0.23597463642903124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093491577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.604534,0.00005024071,0.37206495,0.020268608,0.0003138761,0.0010833971,0.00002761296,0.00008680815,0.0015705208],"genre_scores_gemma":[0.99702406,0.00002298779,0.0021134806,0.00063802314,0.000059896538,0.0000796004,0.0000011807601,0.000014598662,0.000046195222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99802536,0.000015531576,0.00061930134,0.0006742329,0.0003278761,0.00033770196],"domain_scores_gemma":[0.9987108,0.00019066775,0.0003671942,0.00015733803,0.0004193643,0.00015460562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020852912,0.00030146408,0.00032477427,0.0001030693,0.0002163673,0.00070912763,0.00079341186,0.00005880483,0.000020065048],"category_scores_gemma":[0.0005712061,0.0002304273,0.00015776366,0.00027963085,0.0002819757,0.0011820119,0.00043016567,0.00021721801,0.000009421767],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073540735,0.0003996112,0.0030742353,0.00019003042,0.00014843619,0.0000013976617,0.025385818,0.00017642867,0.047887377,0.5558242,0.0001886689,0.36598837],"study_design_scores_gemma":[0.00008005353,0.001447199,0.00021435037,0.00046594226,0.000022607164,0.0000028721959,0.010059727,0.23885049,0.682695,0.064866535,0.00080703385,0.00048820558],"about_ca_topic_score_codex":0.0000053734966,"about_ca_topic_score_gemma":0.0000019680772,"teacher_disagreement_score":0.6348076,"about_ca_system_score_codex":0.000052762054,"about_ca_system_score_gemma":0.00004869777,"threshold_uncertainty_score":0.93965524},"labels":[],"label_agreement":null},{"id":"W3093593979","doi":"10.1109/cog47356.2020.9231889","title":"Combining Influence Maps with Heuristic Search for Executing Sneak-Attacks in RTS Games","year":2020,"lang":"en","type":"article","venue":"2020 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Adversary; Computer science; Surprise; Heuristic; Path (computing); Domain (mathematical analysis); Order (exchange); Artificial intelligence; Computer security; Programming language; Mathematics","score_opus":0.07439078111553457,"score_gpt":0.31316774152662985,"score_spread":0.23877696041109528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093593979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53067786,0.0001984031,0.44771308,0.011808999,0.0006830546,0.002388189,0.000045741195,0.00074292935,0.005741739],"genre_scores_gemma":[0.9875866,0.000042268985,0.009913494,0.0019102641,0.0001469648,0.00018587524,0.0000073617352,0.00004739405,0.00015977546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960212,0.00019901888,0.00073036813,0.00134049,0.0007100721,0.00099882],"domain_scores_gemma":[0.9973446,0.00079526036,0.00024779545,0.0007800826,0.00043703383,0.00039520042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050980475,0.0004818232,0.000612567,0.00015311615,0.00019980814,0.00061352225,0.001998031,0.00016452117,0.000045986493],"category_scores_gemma":[0.0005139741,0.0004480851,0.00010913507,0.001033735,0.00031975395,0.00068781077,0.0003219743,0.00069749454,0.00024250202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001845699,0.0010730186,0.06298331,0.001562862,0.0003971138,0.0016673491,0.08919531,0.19842465,0.032379594,0.28219503,0.00847609,0.31979996],"study_design_scores_gemma":[0.0010963342,0.0024791455,0.0035371762,0.00138795,0.000044948414,0.000033629618,0.0027606434,0.92240196,0.056347523,0.006101175,0.0022616817,0.0015478062],"about_ca_topic_score_codex":0.00011159786,"about_ca_topic_score_gemma":0.00008463228,"teacher_disagreement_score":0.7239773,"about_ca_system_score_codex":0.000077431476,"about_ca_system_score_gemma":0.00045940606,"threshold_uncertainty_score":0.9997971},"labels":[],"label_agreement":null},{"id":"W3093665713","doi":"10.1609/aiide.v16i1.7421","title":"The Unexpected Consequence of Incremental Design Changes","year":2020,"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":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Human–computer interaction","score_opus":0.09231229999099444,"score_gpt":0.29108659567506745,"score_spread":0.198774295684073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093665713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6808662,0.00023631306,0.23271531,0.067704454,0.0010357106,0.00303464,0.00006512821,0.00021974876,0.01412251],"genre_scores_gemma":[0.9987124,0.00010925329,0.00050129235,0.0005174627,0.000037870377,0.000042890177,5.947235e-7,0.000011650692,0.00006656678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978906,0.000037867747,0.0006654246,0.00050487544,0.00055715017,0.00034407468],"domain_scores_gemma":[0.9980128,0.0004523644,0.00059887784,0.00023823917,0.00056511327,0.00013263358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027651017,0.0002809004,0.0003054291,0.00006999428,0.00022705954,0.0005237876,0.0017541848,0.000057514666,0.00002209581],"category_scores_gemma":[0.0008362958,0.00017760448,0.000118875076,0.00041208984,0.000796247,0.0007906902,0.0007393305,0.00026999423,0.000026245109],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079264236,0.00032968953,0.00033166003,0.000052805568,0.00014556128,0.0000042557467,0.010810467,0.00007019395,0.21962875,0.5183086,0.0002378325,0.24928759],"study_design_scores_gemma":[0.000028862622,0.0010224058,0.000043975317,0.00020378001,0.00001088128,0.000009170087,0.0072593694,0.036160834,0.92938733,0.02544921,0.0002303704,0.0001938198],"about_ca_topic_score_codex":0.000025685113,"about_ca_topic_score_gemma":0.0000059308627,"teacher_disagreement_score":0.7097586,"about_ca_system_score_codex":0.00006506223,"about_ca_system_score_gemma":0.00007125323,"threshold_uncertainty_score":0.72425},"labels":[],"label_agreement":null},{"id":"W3093709204","doi":"10.1609/aiide.v16i1.7456","title":"Personalized Procedural Content Generation for Increased Player Agency","year":2020,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Intersection (aeronautics); Agency (philosophy); Game design; Content (measure theory); Multimedia; Space (punctuation); Video game development; Game Developer; Video game design; Screening game; Human–computer interaction; World Wide Web; Non-cooperative game; Game theory; Sociology; Engineering; Mathematics; Mathematical economics","score_opus":0.14317265793183354,"score_gpt":0.3047097539064078,"score_spread":0.16153709597457427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093709204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7966127,0.000046528745,0.17879924,0.018246839,0.0005089652,0.0020501488,0.00006465039,0.0001205823,0.0035503544],"genre_scores_gemma":[0.9967313,0.000025060614,0.0008723063,0.001884705,0.00013874305,0.00015171673,0.000005176631,0.000017816992,0.00017321498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977297,0.000016945598,0.000708742,0.00071647053,0.0004605058,0.00036761607],"domain_scores_gemma":[0.9982904,0.00014181314,0.00044834858,0.00017454113,0.0007508717,0.00019399988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018473878,0.00033231406,0.00034883007,0.000085212974,0.00020506332,0.00071297266,0.0010545435,0.000076115495,0.00004438187],"category_scores_gemma":[0.0008705687,0.0002457208,0.00022455528,0.00025213583,0.00028518296,0.001456304,0.0003687564,0.00021876945,0.00003460649],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007877916,0.00045012232,0.00055520266,0.000095605144,0.00012026372,0.0000011224404,0.013753845,0.000028545235,0.24536607,0.6202096,0.0006851217,0.11794673],"study_design_scores_gemma":[0.000091500144,0.0010718589,0.00007190496,0.00017174259,0.000021024494,0.0000052856394,0.0036366966,0.20198712,0.774425,0.01774158,0.00044293338,0.00033332637],"about_ca_topic_score_codex":0.000020285026,"about_ca_topic_score_gemma":0.0000034709897,"teacher_disagreement_score":0.602468,"about_ca_system_score_codex":0.00008532327,"about_ca_system_score_gemma":0.0000770323,"threshold_uncertainty_score":0.9999995},"labels":[],"label_agreement":null},{"id":"W3094114563","doi":"10.1609/aiide.v16i1.7429","title":"Image-to-Level: Generation and Repair","year":2020,"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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Machine Intelligence Institute","keywords":"Computer science; Process (computing); Fidelity; Image (mathematics); Human–computer interaction; Artificial intelligence; Game design; Content (measure theory); Multimedia; Programming language; Mathematics","score_opus":0.09519799346194492,"score_gpt":0.2999875914977209,"score_spread":0.204789598035776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094114563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7731376,0.000036255697,0.1828632,0.03130885,0.00049972837,0.0012381598,0.00004040324,0.00021776423,0.010658007],"genre_scores_gemma":[0.99486387,0.000031998803,0.0031195178,0.0017417236,0.000091760136,0.000032631655,0.0000010115158,0.000013509472,0.00010398831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99806017,0.000015053486,0.0005486934,0.00068520417,0.00040034327,0.00029052],"domain_scores_gemma":[0.99881655,0.00008590668,0.00023900434,0.00018659768,0.00044046965,0.00023146588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016084372,0.00027043742,0.00026547513,0.00009888834,0.00015042143,0.0007818355,0.0007773964,0.00005560917,0.00002761749],"category_scores_gemma":[0.000622177,0.00020660098,0.0001125316,0.00032444563,0.00024038833,0.0014835045,0.00078996806,0.00022593727,0.00008125457],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030884103,0.00032601575,0.0009853629,0.0000762424,0.00009375272,0.000003272166,0.018223464,0.0000375763,0.15461232,0.4697678,0.0011735858,0.35439178],"study_design_scores_gemma":[0.000037242833,0.0012444699,0.00033152424,0.00021643653,0.000015467072,0.000009444321,0.004328079,0.2393237,0.73429805,0.018922895,0.00085763657,0.000415048],"about_ca_topic_score_codex":0.00001658779,"about_ca_topic_score_gemma":0.0000039852716,"teacher_disagreement_score":0.57968575,"about_ca_system_score_codex":0.000051075058,"about_ca_system_score_gemma":0.000034082703,"threshold_uncertainty_score":0.8424943},"labels":[],"label_agreement":null},{"id":"W3094375143","doi":"10.1109/cog47356.2020.9231854","title":"Monte Carlo Tree Search Strategies in 2-Player Iterated Prisoner Dilemma Games","year":2020,"lang":"en","type":"article","venue":"2020 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Monte Carlo tree search; Computer science; Iterated function; Prisoner's dilemma; Game tree; Tree (set theory); Dilemma; Game theory; Monte Carlo method; Fictitious play; Adversary; Variety (cybernetics); Mathematical optimization; Artificial intelligence; Mathematical economics; Sequential game; Mathematics; Computer security","score_opus":0.085846143607329,"score_gpt":0.3095868613929219,"score_spread":0.2237407177855929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094375143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89407223,0.00039940487,0.06442752,0.021516474,0.0012131056,0.0015948319,0.000047171965,0.0010039099,0.015725335],"genre_scores_gemma":[0.9949941,0.00012409469,0.0025732042,0.0011981813,0.00024949713,0.00011082174,0.0000042448737,0.000044026463,0.0007018428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956035,0.0003602995,0.00082290446,0.0013911529,0.00085052993,0.0009716375],"domain_scores_gemma":[0.99775785,0.00027796754,0.00018597367,0.0009329687,0.00040761335,0.00043763866],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034436956,0.0005643386,0.00065953966,0.0002352767,0.0001236689,0.0012926986,0.0022610156,0.00024973098,0.00034852998],"category_scores_gemma":[0.00019558407,0.00051950343,0.00016487595,0.0013289273,0.00026672552,0.0013832618,0.00035001608,0.0009057678,0.0010712167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010713028,0.0013161663,0.011171174,0.00041738164,0.00047959428,0.0029304519,0.09731022,0.116114475,0.08684272,0.18503003,0.036312364,0.4610041],"study_design_scores_gemma":[0.0005475371,0.0009538314,0.0046386435,0.00026339878,0.000024562562,0.000014162793,0.0031271444,0.952181,0.029371846,0.0022139985,0.00549901,0.0011648674],"about_ca_topic_score_codex":0.00046015324,"about_ca_topic_score_gemma":0.00052942603,"teacher_disagreement_score":0.83606654,"about_ca_system_score_codex":0.00008319693,"about_ca_system_score_gemma":0.00058004155,"threshold_uncertainty_score":0.99974406},"labels":[],"label_agreement":null},{"id":"W3096715124","doi":"10.1145/3410404.3414249","title":"Artificial Players in the Design Process: Developing an Automated Testing Tool for Game Level and World Design","year":2020,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Game design; Workflow; Game Developer; Process (computing); Context (archaeology); Video game development; Game testing; Engineering design process; Human–computer interaction; Design process; Level design; Game design document; Pathos; User experience design; User story; Fidelity; Game development tool; Software engineering; Software; Work in process; Engineering; Software development","score_opus":0.38361516642361254,"score_gpt":0.375589101850592,"score_spread":0.00802606457302052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096715124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019908877,0.0000134416305,0.9756589,0.0028152862,0.000057350702,0.0009098574,9.63893e-7,0.0005697748,0.0000655662],"genre_scores_gemma":[0.53938186,4.0076347e-7,0.4588486,0.0016217377,0.000048008424,0.000080731304,4.4075588e-7,0.000009123857,0.000009107607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982377,0.00019630656,0.00043233577,0.00050196785,0.00023860708,0.00039306577],"domain_scores_gemma":[0.99772376,0.0017579747,0.00009806184,0.00021361293,0.00013322453,0.000073365445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011944806,0.00018058224,0.00017573625,0.00010896063,0.00018239536,0.00047035504,0.00092370855,0.000051038558,0.0000035079995],"category_scores_gemma":[0.0012981651,0.00013513355,0.000020424977,0.0011658467,0.00006995834,0.00077289675,0.00008586096,0.00013289692,0.000012621277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025449955,0.00020930001,0.0036043164,0.00018010373,0.000042972628,0.00008676647,0.07750638,0.18590951,0.018462384,0.12408067,0.0022533853,0.58740973],"study_design_scores_gemma":[0.00004474022,0.00015423083,0.0005155819,0.000029664236,0.0000035347198,0.0000062975723,0.00064496696,0.94446045,0.040778086,0.013086919,0.000044897693,0.00023063002],"about_ca_topic_score_codex":0.00002621125,"about_ca_topic_score_gemma":0.00006478818,"teacher_disagreement_score":0.75855094,"about_ca_system_score_codex":0.00003323158,"about_ca_system_score_gemma":0.00028685923,"threshold_uncertainty_score":0.55105865},"labels":[],"label_agreement":null},{"id":"W3096896923","doi":"10.1007/s00521-022-07746-9","title":"Incorporating rivalry in reinforcement learning for a competitive game","year":2022,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"H2020 European Research Council; Istituto Italiano di Tecnologia; European Commission","keywords":"Rivalry; Reinforcement learning; Computer science; Perception; Reinforcement; Social learning; Social relation; Cognitive psychology; Human–computer interaction; Artificial intelligence; Psychology; Social psychology; Knowledge management; Microeconomics; Economics","score_opus":0.031967766496367,"score_gpt":0.3038891163346676,"score_spread":0.2719213498383006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096896923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07991336,0.000054396933,0.9173413,0.0008142255,0.00006387261,0.00055988703,9.784882e-7,0.00014344821,0.0011085413],"genre_scores_gemma":[0.98794085,0.0000013880615,0.011412115,0.00024563493,0.000057762933,0.0002643253,0.000006984726,0.0000060842103,0.00006482927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990959,0.00006389026,0.00024347292,0.00029250552,0.0001244353,0.00017976435],"domain_scores_gemma":[0.9993094,0.00033093372,0.00012646284,0.000156108,0.00004000351,0.00003706075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003025587,0.0000790584,0.0001015163,0.00008293759,0.0005654368,0.00007723676,0.00033670387,0.000013586066,0.000002438296],"category_scores_gemma":[0.000031302017,0.000089481895,0.000023858574,0.0003521912,0.000041452615,0.00008640031,0.00047250118,0.0002298839,0.0000024678395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037643365,0.000030972005,0.0017861066,0.000010452196,0.0000029390383,0.0000011730709,0.0012702775,0.53479177,0.00073060667,0.34125295,0.00002362869,0.12009539],"study_design_scores_gemma":[0.000082433304,0.000106638814,0.00043638833,0.0000067055466,0.0000015675264,0.000008570275,0.00061648875,0.98282623,0.0003135102,0.010290728,0.0052009197,0.00010980777],"about_ca_topic_score_codex":0.00003454692,"about_ca_topic_score_gemma":0.000005874736,"teacher_disagreement_score":0.9080275,"about_ca_system_score_codex":0.00004754106,"about_ca_system_score_gemma":0.000024912355,"threshold_uncertainty_score":0.43489397},"labels":[],"label_agreement":null},{"id":"W3102089800","doi":"10.24963/ijcai.2021/294","title":"Deep Reinforcement Learning for Navigation in AAA Video Games","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ubisoft (Canada)","funders":"","keywords":"Reinforcement learning; Computer science; Variety (cybernetics); Video game; Representation (politics); Point (geometry); Artificial intelligence; Graph; Human–computer interaction; Multimedia; Theoretical computer science","score_opus":0.04080469939508952,"score_gpt":0.31520473653878445,"score_spread":0.27440003714369493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102089800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012017998,0.000207062,0.9833254,0.0007180667,0.00085850246,0.0005531218,9.29092e-8,0.00017012667,0.002149599],"genre_scores_gemma":[0.90049845,0.000057357734,0.09749329,0.00020482152,0.00010297746,0.00027266116,0.00004576719,0.000014857825,0.001309816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800664,0.00007844209,0.0005744322,0.0007016211,0.00030959712,0.000329282],"domain_scores_gemma":[0.9985913,0.00025052647,0.00021549755,0.0006271434,0.0002566111,0.000058922655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351566,0.0002146186,0.0002785082,0.0001517939,0.00007530465,0.0005012903,0.0009361085,0.00021065168,0.00007255712],"category_scores_gemma":[0.0003416578,0.00022183951,0.00014455926,0.00022018938,0.00003470526,0.00034482815,0.001376067,0.0005051741,0.00003274749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039843667,0.000021302547,0.0004472649,0.00009245857,0.000014612256,0.000009166884,0.003763278,0.8851333,0.00016976394,0.016590996,0.0000901866,0.09366366],"study_design_scores_gemma":[0.000043035503,0.000040087394,0.00011414463,0.00024621774,0.0000042623838,0.0000019526672,0.0005895941,0.968007,0.017264642,0.012373673,0.0010554106,0.0002599584],"about_ca_topic_score_codex":0.00037575082,"about_ca_topic_score_gemma":0.0002288926,"teacher_disagreement_score":0.8884804,"about_ca_system_score_codex":0.00018740738,"about_ca_system_score_gemma":0.00018235264,"threshold_uncertainty_score":0.90463525},"labels":[],"label_agreement":null},{"id":"W3102693878","doi":"","title":"A Dynamical Systems Approach for Static Evaluation in Go","year":2016,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Strengths and weaknesses; Extension (predicate logic); Computer science; Monte Carlo method; Dynamical systems theory; Monte Carlo tree search; Tree (set theory); Statistical physics; Theoretical computer science; Mathematics; Physics; Programming language","score_opus":0.0836819423448809,"score_gpt":0.3402695423931504,"score_spread":0.25658760004826947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102693878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009799645,0.00002209844,0.98623025,0.0006435191,0.0001875952,0.0006378847,0.0000011413989,0.000061007668,0.002416855],"genre_scores_gemma":[0.9196671,0.0000011807139,0.07939869,0.00005430602,0.000024015691,0.00026095493,9.325922e-7,0.000004206832,0.00058856694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899286,0.00008581185,0.00022610322,0.0002624631,0.00024881918,0.00018392094],"domain_scores_gemma":[0.9991521,0.0003913522,0.000039489158,0.0002752238,0.00010724299,0.000034588367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093588274,0.00006155493,0.00009060043,0.00007422659,0.000021883778,0.00006541183,0.00037745928,0.00003605732,0.00001032157],"category_scores_gemma":[0.00032220827,0.000037770944,0.000024151033,0.00015061793,0.000028180903,0.00030435185,0.00005202636,0.000023494478,0.000056623667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011674106,0.00014009759,0.0011815901,0.00003404113,0.000009085639,8.22701e-7,0.0007907634,0.0062201624,0.0016952078,0.5980446,0.0014020163,0.39046997],"study_design_scores_gemma":[0.00009168108,0.000038217237,0.00014093108,0.000014966245,0.0000016911079,0.0000014491238,0.00008376237,0.9845268,0.0005955131,0.014247966,0.0001861482,0.0000708854],"about_ca_topic_score_codex":0.00004823661,"about_ca_topic_score_gemma":0.00002751439,"teacher_disagreement_score":0.97830665,"about_ca_system_score_codex":0.00012898189,"about_ca_system_score_gemma":0.000062367035,"threshold_uncertainty_score":0.15402544},"labels":[],"label_agreement":null},{"id":"W3105730733","doi":"10.1609/aiide.v16i1.7451","title":"A Demonstration of Anhinga: A Mixed-Initiative EPCG Tool for Snakebird","year":2020,"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":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Software engineering","score_opus":0.0778093972416592,"score_gpt":0.29505645413810067,"score_spread":0.21724705689644147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105730733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5017697,0.00002396736,0.4719058,0.013328824,0.00046378214,0.0017468937,0.000098888515,0.0000941656,0.010567969],"genre_scores_gemma":[0.998037,0.000022625576,0.0012865171,0.00047691216,0.000052741136,0.000070097885,0.0000020955445,0.00001342425,0.00003857743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979321,0.00001804822,0.0008037823,0.0005506881,0.00040402843,0.00029135728],"domain_scores_gemma":[0.9979881,0.00031364078,0.0006351741,0.00016935359,0.0007878919,0.000105822306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021208882,0.00027432214,0.0003639495,0.00009539227,0.00010328696,0.00037986023,0.000977698,0.00007013594,0.000013729513],"category_scores_gemma":[0.00081855763,0.00021148489,0.0002052124,0.00030755482,0.00032866147,0.0015130553,0.00038986662,0.00021132742,0.000015674152],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059861626,0.00041905674,0.00085709704,0.000114974915,0.000105649524,6.776218e-7,0.011997849,0.00006299474,0.03856187,0.62077147,0.00025056163,0.32625923],"study_design_scores_gemma":[0.00005266114,0.0014458986,0.00013956579,0.000309508,0.00002000356,0.0000031963398,0.0056389384,0.07795512,0.86588925,0.04807743,0.00020960993,0.0002588099],"about_ca_topic_score_codex":0.0000074192567,"about_ca_topic_score_gemma":0.0000025743182,"teacher_disagreement_score":0.8273274,"about_ca_system_score_codex":0.000052875333,"about_ca_system_score_gemma":0.000072527946,"threshold_uncertainty_score":0.86241037},"labels":[],"label_agreement":null},{"id":"W3111616442","doi":"10.2196/24049","title":"The Impact of Artificial Intelligence on the Chess World","year":2020,"lang":"en","type":"article","venue":"JMIR Serious Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Popularity; Cheating; Computer science; Key (lock); Artificial intelligence; Psychology; Computer security; Social psychology","score_opus":0.060927846985726675,"score_gpt":0.33516219362403477,"score_spread":0.2742343466383081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111616442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78906083,0.0006700279,0.11276859,0.081183776,0.0013590949,0.0022010193,0.00001677918,0.00066933123,0.012070549],"genre_scores_gemma":[0.9983455,0.00002649783,0.00046336174,0.0006511471,0.00021278037,0.00006361786,3.678709e-7,0.000016050233,0.00022070798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981267,0.0001549351,0.00048446498,0.00038855392,0.00041737745,0.00042798158],"domain_scores_gemma":[0.99771667,0.0009034847,0.00023113999,0.0008934954,0.00012570573,0.00012951443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039157883,0.00022580473,0.00022670858,0.000059008093,0.00028928084,0.00032199835,0.0024807611,0.00005019416,0.000073619085],"category_scores_gemma":[0.0003040478,0.00011629004,0.0002472672,0.0010402756,0.00037470902,0.00020425457,0.0003501093,0.00032860064,0.00033734622],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011400056,0.00011537119,0.00040265045,0.000009553548,0.00007119477,0.000013152465,0.0080074,0.0034460803,0.0031057335,0.24882519,0.009083567,0.7268061],"study_design_scores_gemma":[0.00005820435,0.0019821937,0.008475028,0.0001287831,0.000017658089,0.000014043885,0.0027180358,0.44116658,0.39073166,0.12956978,0.024174029,0.0009639886],"about_ca_topic_score_codex":0.00007572168,"about_ca_topic_score_gemma":0.000106796826,"teacher_disagreement_score":0.7258421,"about_ca_system_score_codex":0.00005125332,"about_ca_system_score_gemma":0.00012426886,"threshold_uncertainty_score":0.47421703},"labels":[],"label_agreement":null},{"id":"W3111857876","doi":"10.1609/aaai.v35i6.16702","title":"Hindsight and Sequential Rationality of Correlated Play","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":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Alberta","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Hindsight bias; Rationality; Mathematical economics; Computer science; Counterfactual thinking; Regret; Bounded rationality; Fictitious play; Game theory; Artificial intelligence; Mathematics; Epistemology; Machine learning; Psychology; Cognitive psychology; Social psychology","score_opus":0.08312385965456567,"score_gpt":0.3069914782112599,"score_spread":0.2238676185566942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111857876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8850184,0.00017208185,0.090266764,0.007207516,0.001352825,0.00055723346,0.000021032,0.00013335395,0.0152707705],"genre_scores_gemma":[0.9954897,0.000057270354,0.003969042,0.00013369178,0.00004841315,0.000010936069,9.137906e-7,0.00000992653,0.0002800814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976421,0.000045743112,0.0008342406,0.0005651655,0.000621594,0.00029114724],"domain_scores_gemma":[0.9973163,0.00021433657,0.00052610796,0.0003760864,0.0014699841,0.000097180084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005518949,0.00022165492,0.0003387361,0.00010424752,0.00018194968,0.00019736834,0.0013052839,0.0001346455,0.00016668912],"category_scores_gemma":[0.00086441345,0.00017893533,0.00012864442,0.0008044226,0.00059016823,0.0005102159,0.00060458755,0.00031506203,0.000035839614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003191981,0.00014123789,0.0006645146,0.000030026486,0.000022947108,0.0000014498273,0.0015851359,0.00007534167,0.13215119,0.8437922,0.00007529101,0.021428723],"study_design_scores_gemma":[0.00001528805,0.000065900735,0.00043501728,0.0001295927,0.000012834539,0.000012158253,0.00037777898,0.030988818,0.7675764,0.20017721,0.000058605274,0.00015040221],"about_ca_topic_score_codex":0.000053696764,"about_ca_topic_score_gemma":0.0000250052,"teacher_disagreement_score":0.643615,"about_ca_system_score_codex":0.00003737089,"about_ca_system_score_gemma":0.00025892272,"threshold_uncertainty_score":0.7296771},"labels":[],"label_agreement":null},{"id":"W3112926432","doi":"10.3233/icg-200170","title":"A polyomino puzzle for arithmetic practice","year":2020,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"sort; Simple (philosophy); Computer science; Generator (circuit theory); Measure (data warehouse); Space (punctuation); Arithmetic; Variety (cybernetics); Evolutionary algorithm; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Data mining; Epistemology","score_opus":0.06772812399629113,"score_gpt":0.33157716404757276,"score_spread":0.2638490400512816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112926432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013351017,0.00031033508,0.93764675,0.0580156,0.00064398814,0.000122065234,0.0000013132535,0.00006706381,0.0018577897],"genre_scores_gemma":[0.56057805,0.000045369696,0.428987,0.008760006,0.0013650621,0.000012223421,2.791259e-7,0.00001783217,0.00023416452],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884003,0.000069439295,0.00029982085,0.00021499083,0.00028259572,0.00029313678],"domain_scores_gemma":[0.9986834,0.00043231083,0.00019440326,0.00019302017,0.00023900789,0.00025788805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043724888,0.00009911117,0.0001292461,0.00005222433,0.0002498601,0.0005015663,0.0009218595,0.000043738677,0.000050763152],"category_scores_gemma":[0.0013214818,0.000088082576,0.00010530302,0.00023439204,0.000037212154,0.0010390619,0.00012203869,0.000276447,0.00019929282],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023800351,0.00034487352,0.00035018608,0.000042143518,0.00017856264,0.0005179887,0.015453556,0.0013390749,0.008955893,0.17567739,0.080883935,0.7160184],"study_design_scores_gemma":[0.00037300942,0.0007672688,0.000115198,0.000034217315,0.000044327306,0.0017089242,0.001247799,0.2069958,0.028962137,0.02615877,0.7331668,0.00042573275],"about_ca_topic_score_codex":0.0000055082246,"about_ca_topic_score_gemma":0.000001713645,"teacher_disagreement_score":0.7155927,"about_ca_system_score_codex":0.000034773697,"about_ca_system_score_gemma":0.00012026954,"threshold_uncertainty_score":0.4836615},"labels":[],"label_agreement":null},{"id":"W3116419616","doi":"10.22215/etd/2019-13509","title":"Procedural Generation of Three-Dimensional Game Levels with Interior Architecture","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Modular design; Computer science; Architecture; Polygon mesh; Fitness function; Function (biology); Game engine; Engineering drawing; Genetic algorithm; Engineering; Human–computer interaction; Programming language; Computer graphics (images); Machine learning","score_opus":0.04404814416702867,"score_gpt":0.28880842400815737,"score_spread":0.2447602798411287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116419616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911589,0.00009514524,0.40482298,0.00026316883,0.0010381525,0.00058377394,0.0000073912584,0.000109167886,0.0019212826],"genre_scores_gemma":[0.9495726,9.1859107e-7,0.041874267,0.00017754195,0.00011674745,0.00002851824,0.00009531884,0.000026689682,0.008107388],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99837404,0.000025595522,0.00039274507,0.0005036096,0.000495423,0.00020859721],"domain_scores_gemma":[0.9987397,0.000050638442,0.00030542296,0.00048203883,0.00037457692,0.000047597347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009785206,0.00026308955,0.00031202447,0.00017836594,0.000037811988,0.00008828011,0.00071095757,0.00018294122,0.00013792311],"category_scores_gemma":[0.00003479455,0.00018791799,0.0000841696,0.00022490999,0.00004444634,0.0002513826,0.00006575584,0.000250843,0.00007917753],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004701696,0.00026952426,0.00084494246,0.0009883948,0.0004078217,0.000033065622,0.016142247,0.022329388,0.45977062,0.05705399,0.0030474572,0.43864238],"study_design_scores_gemma":[0.00016149119,0.0007541683,0.0027529825,0.0006463743,0.000041119474,0.000045387074,0.00024773378,0.21251822,0.7777448,0.0038637484,0.0003519558,0.00087202893],"about_ca_topic_score_codex":0.000101171194,"about_ca_topic_score_gemma":0.0024970144,"teacher_disagreement_score":0.43777034,"about_ca_system_score_codex":0.000033648033,"about_ca_system_score_gemma":0.00040836865,"threshold_uncertainty_score":0.76630735},"labels":[],"label_agreement":null},{"id":"W3121873148","doi":"10.1515/9783110755411-017","title":"Impartial games with entailing moves","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Combinatorial game theory; Axiom; Game theory; Scope (computer science); Mathematics; Affine transformation; Mathematical economics; Algebra over a field; Computer science; Sequential game; Pure mathematics; Programming language","score_opus":0.030926779878383118,"score_gpt":0.2602796739564116,"score_spread":0.2293528940780285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121873148","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006523296,0.00026910435,0.13094947,0.00056971,0.00055191753,0.00022522692,0.000004823473,0.00040286663,0.86696166],"genre_scores_gemma":[0.0124664325,0.000110302426,0.021664158,0.000737663,0.0003323439,0.000032497122,0.000008843228,0.00006774791,0.96458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812543,0.000015338865,0.0003267627,0.0006440582,0.0005846547,0.00030375973],"domain_scores_gemma":[0.9987251,0.000117494135,0.0001728852,0.0008164062,0.00006701346,0.00010106955],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014622246,0.00031051176,0.00029167402,0.00015199324,0.00016179253,0.00020221256,0.0012872324,0.00010415063,0.0054434543],"category_scores_gemma":[0.000010632973,0.0002526492,0.00012298745,0.000053770025,0.00012569096,0.0003864132,0.00070166966,0.00040986668,0.00040904674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086590135,0.000010140427,0.0000147455885,0.000005672789,0.000041033705,0.0000762125,0.00036785827,0.00031252453,0.000024943898,0.96005857,0.0014267691,0.037652887],"study_design_scores_gemma":[0.00006105561,0.00039588334,0.0000051422726,0.00006310562,0.000029613173,0.000067041445,0.00010448629,0.009343785,0.004709085,0.10527814,0.8790435,0.00089913013],"about_ca_topic_score_codex":0.00008222627,"about_ca_topic_score_gemma":0.00008520738,"teacher_disagreement_score":0.87761676,"about_ca_system_score_codex":0.0000936794,"about_ca_system_score_gemma":0.00016356005,"threshold_uncertainty_score":0.99999255},"labels":[],"label_agreement":null},{"id":"W3125097583","doi":"10.1515/9783110755411-006","title":"Advances in finding ideal play on poset games","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Partially ordered set; Ideal (ethics); Mathematics; Combinatorial game theory; Combinatorics; Class (philosophy); Equivalence (formal languages); Aside; Discrete mathematics; Computer science; Mathematical economics; Game theory; Sequential game; Artificial intelligence; Epistemology; Philosophy","score_opus":0.039743238291572454,"score_gpt":0.3021306801746957,"score_spread":0.26238744188312324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125097583","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028983255,0.0007910024,0.007871558,0.00057123,0.0014386943,0.00021469283,0.000011179998,0.00018337568,0.9888893],"genre_scores_gemma":[0.018979637,0.0027482652,0.010748747,0.0019523659,0.00034903386,0.000062456325,0.000027912633,0.00009115262,0.96504045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99792683,0.000027636497,0.000439078,0.00070952123,0.0005667906,0.00033012388],"domain_scores_gemma":[0.9987007,0.0003928895,0.00017987177,0.0006317113,0.000027895423,0.000066978224],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026942245,0.00030565404,0.00032415692,0.00042909765,0.000119404576,0.00011271751,0.0014465483,0.00014413735,0.0027087335],"category_scores_gemma":[0.000043597483,0.00029048062,0.000115559225,0.00009215464,0.00007267411,0.0005163244,0.00057318097,0.00061371253,0.00061205035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049800815,0.000009552705,0.000025667267,0.0000053497047,0.000003829419,0.00008330459,0.00031552138,0.00062662945,0.0000025210022,0.8484889,0.0012942831,0.14913942],"study_design_scores_gemma":[0.00003058777,0.00016538499,0.000016363183,0.00010147041,0.0000023822736,0.000009605451,0.000040530318,0.0017606058,0.0003087052,0.25476444,0.7423847,0.0004152624],"about_ca_topic_score_codex":0.00005025034,"about_ca_topic_score_gemma":0.00035061577,"teacher_disagreement_score":0.74109036,"about_ca_system_score_codex":0.00019290858,"about_ca_system_score_gemma":0.000115376024,"threshold_uncertainty_score":0.99995476},"labels":[],"label_agreement":null},{"id":"W3130833452","doi":"10.34894/7x9aua","title":"ISEBEL an Intelligent Search Engine for Belief Legends","year":2019,"lang":"en","type":"dataset","venue":"Data Archiving and Networked Services (DANS)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Globe; World Wide Web; Computer science; Database; Psychology","score_opus":0.06935233893006697,"score_gpt":0.3319690484290163,"score_spread":0.26261670949894933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130833452","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006147266,0.00079873326,0.18427636,0.00015611576,0.0013196038,0.00067697826,0.8119655,0.00014572877,0.000046206835],"genre_scores_gemma":[0.0010343468,0.0018137743,0.012317877,0.0005020179,0.0012245096,0.000051457864,0.98282206,0.00005784588,0.00017610684],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953255,0.00028151093,0.00073478936,0.0020040886,0.0005975983,0.0010565011],"domain_scores_gemma":[0.9929414,0.00089556136,0.00026955214,0.0054020155,0.00010787361,0.00038362652],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001507985,0.00066631945,0.00069025386,0.00031685547,0.00045449563,0.0008348514,0.010889212,0.0002779747,0.000026853817],"category_scores_gemma":[0.000026562728,0.0006076946,0.00010637745,0.00041844332,0.00015733269,0.001215488,0.0053716195,0.0007654206,0.0001450514],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090962225,0.00027937515,0.0001232256,0.0014627422,0.0002152262,0.000030357953,0.0030917667,0.008773254,0.00004671098,0.0005138215,0.81546795,0.1699046],"study_design_scores_gemma":[0.000061865394,0.00018721732,0.000053625463,0.0002953276,0.000049028284,0.00001522033,0.00018390248,0.48586655,0.00006228307,0.000370843,0.51237845,0.0004757075],"about_ca_topic_score_codex":0.0014780312,"about_ca_topic_score_gemma":0.0036158445,"teacher_disagreement_score":0.47709328,"about_ca_system_score_codex":0.00004658104,"about_ca_system_score_gemma":0.0001542824,"threshold_uncertainty_score":0.9996374},"labels":[],"label_agreement":null},{"id":"W3134068678","doi":"10.1515/9783110755411-001","title":"The game of flipping coins","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Iterated function; Line (geometry); Contrast (vision); Rest (music); Combinatorics; Position (finance); Mathematics; Mathematical economics; Computer science; Artificial intelligence; Economics; Physics; Geometry; Mathematical analysis","score_opus":0.055710669632349614,"score_gpt":0.3186186214142463,"score_spread":0.2629079517818967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134068678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005881834,0.00053206633,0.9357775,0.002967924,0.0029504998,0.00030137147,0.0000035902517,0.00021097965,0.05137426],"genre_scores_gemma":[0.9718326,0.0002758843,0.020123048,0.00034749013,0.00013079267,0.000084238636,0.0000021468793,0.000016318983,0.007187521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856496,0.00009949447,0.00037800177,0.00035367702,0.0003985699,0.00020531446],"domain_scores_gemma":[0.99787784,0.00041791424,0.00022159229,0.0013572875,0.00009115188,0.000034232675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005686523,0.00012297793,0.00016938138,0.00005818189,0.0001506633,0.00016613581,0.0033638836,0.00006253266,0.0002353312],"category_scores_gemma":[0.00013358408,0.0000873952,0.00013203316,0.0001785005,0.00012283427,0.00007075125,0.005954017,0.00045437762,0.000039569986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033674016,0.000042961245,0.00022115259,0.00003310786,0.000053740965,0.00000825505,0.0034842484,0.021447374,0.00021311779,0.8334167,0.0031436323,0.13793235],"study_design_scores_gemma":[0.00002579405,0.000076920056,0.00034144966,0.00006203455,0.000011617139,0.000006400137,0.0010956485,0.504958,0.0195248,0.3124818,0.16095495,0.00046063753],"about_ca_topic_score_codex":0.00025829932,"about_ca_topic_score_gemma":0.00006956828,"teacher_disagreement_score":0.9659507,"about_ca_system_score_codex":0.000056561934,"about_ca_system_score_gemma":0.00020576891,"threshold_uncertainty_score":0.7421256},"labels":[],"label_agreement":null},{"id":"W3135862234","doi":"10.2478/ausi-2020-0011","title":"Improved balance in multiplayer online battle arena games","year":2020,"lang":"en","type":"article","venue":"Acta Universitatis Sapientiae Informatica","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Battle; Computer science; Balance (ability); Big data; Virtuous circle and vicious circle; Matching (statistics); Competition (biology); Sample (material); Artificial intelligence; Computer security; Multimedia; Data mining; Psychology; Statistics; Mathematics","score_opus":0.018374543408248848,"score_gpt":0.2376563787256511,"score_spread":0.21928183531740225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135862234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38983163,0.000114334354,0.5845743,0.014916415,0.0008872704,0.0007252357,0.00009314829,0.00060270994,0.008254972],"genre_scores_gemma":[0.9313429,0.000028680126,0.06732006,0.0011729827,0.000027915523,0.000002653821,0.000019127096,0.000008713947,0.000076991615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998515,0.000042712894,0.00045043093,0.00029321967,0.00028061244,0.00041800507],"domain_scores_gemma":[0.99875885,0.0003154159,0.00017972864,0.00042916337,0.00011016072,0.00020666426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103835264,0.00019603084,0.00024216017,0.0001884056,0.00009471795,0.00014823819,0.0013577985,0.00007955117,0.00018094605],"category_scores_gemma":[0.00034148557,0.00020128462,0.00007577147,0.00075042597,0.00010281336,0.002678927,0.000528516,0.00025463413,0.0003040983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037053524,0.0012096084,0.020559898,0.0006523283,0.00044201146,0.00048740252,0.3574978,0.00613475,0.024280872,0.065533265,0.08582834,0.43700317],"study_design_scores_gemma":[0.00050229824,0.0001672638,0.0025534625,0.00006201168,0.000010346789,0.0000063066027,0.005981295,0.9716187,0.0033129016,0.00039028778,0.014986235,0.00040888326],"about_ca_topic_score_codex":0.000060710117,"about_ca_topic_score_gemma":0.000071853254,"teacher_disagreement_score":0.96548396,"about_ca_system_score_codex":0.00007528155,"about_ca_system_score_gemma":0.000087250795,"threshold_uncertainty_score":0.8208149},"labels":[],"label_agreement":null},{"id":"W3136757919","doi":"10.1609/aaai.v35i14.17469","title":"Policy-Guided Heuristic Search with Guarantees","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":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Compute Canada; Canadian Institute for Advanced Research","keywords":"Incremental heuristic search; Beam search; Heuristic; Best-first search; Computer science; Mathematical optimization; Function (biology); Bidirectional search; Search algorithm; Quality (philosophy); Search cost; Null-move heuristic; Algorithm; Artificial intelligence; Mathematics; Economics","score_opus":0.09946954893367661,"score_gpt":0.3333868331638339,"score_spread":0.23391728423015729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136757919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58954304,0.00015909287,0.263576,0.049648307,0.001336215,0.0014878943,0.000024949786,0.00068104436,0.09354345],"genre_scores_gemma":[0.98968256,0.00007035759,0.008412877,0.0005429143,0.00015261964,0.000029334391,6.391614e-7,0.000027109649,0.0010815724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99639124,0.000055484386,0.00081326044,0.00090680335,0.0011200894,0.00071311404],"domain_scores_gemma":[0.99616194,0.0002431601,0.00034911264,0.0007923947,0.0022783864,0.00017500565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005992016,0.00037593677,0.00043783142,0.00025306412,0.00035733194,0.0005907809,0.00323388,0.00013007787,0.00012633721],"category_scores_gemma":[0.0011395446,0.00026941308,0.00017741848,0.002251618,0.0007386869,0.0005879559,0.0008253752,0.00052627147,0.00025979357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004951785,0.0001972223,0.00036564018,0.00004543289,0.000029273238,0.000009219056,0.0017430778,0.00028603623,0.03799427,0.9172198,0.00016679398,0.04189369],"study_design_scores_gemma":[0.000020103924,0.00019757528,0.0001690441,0.00027926848,0.000012352827,0.000056268666,0.0010150038,0.028356053,0.77579725,0.19369893,0.000102508486,0.00029566817],"about_ca_topic_score_codex":0.0001668363,"about_ca_topic_score_gemma":0.000054662793,"teacher_disagreement_score":0.737803,"about_ca_system_score_codex":0.0000984507,"about_ca_system_score_gemma":0.00078883674,"threshold_uncertainty_score":0.9999758},"labels":[],"label_agreement":null},{"id":"W3138705837","doi":"10.48550/arxiv.2103.13501","title":"The combinatorial game nofil played on Steiner Triple Systems","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Concordia University of Edmonton","funders":"","keywords":"Hypergraph; Graph; Combinatorics; Node (physics); Mathematics; Computer science; Steiner system; Discrete mathematics; Complete graph; Theoretical computer science","score_opus":0.08201183719257282,"score_gpt":0.20508433059582865,"score_spread":0.12307249340325582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138705837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49183956,0.00043454167,0.46391553,0.0004422606,0.032005593,0.00111753,0.000022406362,0.0006360175,0.009586557],"genre_scores_gemma":[0.9949053,0.0001648975,0.00008465446,0.00006506798,0.00034690296,0.0000037484308,0.0000089908235,0.000023604782,0.0043968316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971925,0.00043490942,0.00036299916,0.0012342668,0.0002634108,0.00051190297],"domain_scores_gemma":[0.9962574,0.0005951564,0.00036053534,0.0022476274,0.00035893198,0.00018035343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000515983,0.00038413904,0.00041696528,0.00015124182,0.0003710062,0.0008552214,0.0034553483,0.0003700666,0.00001638508],"category_scores_gemma":[0.00016948082,0.00034305,0.0002898853,0.0006413352,0.00020539755,0.00030184086,0.0022090408,0.0008682768,0.00023045161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007280678,0.00013370224,0.0002199395,0.000031175518,0.00013194076,0.0004726546,0.0004543455,0.20580706,0.000045408247,0.7905292,0.001385006,0.0007167898],"study_design_scores_gemma":[0.00043690056,0.00019851369,0.00014670343,0.00023882693,0.00006535531,0.000007939561,0.00090673193,0.9487062,0.0017421573,0.036562644,0.010152916,0.00083510944],"about_ca_topic_score_codex":0.00046657986,"about_ca_topic_score_gemma":0.00007527446,"teacher_disagreement_score":0.7539665,"about_ca_system_score_codex":0.00033948806,"about_ca_system_score_gemma":0.00038253758,"threshold_uncertainty_score":0.9999021},"labels":[],"label_agreement":null},{"id":"W3148866278","doi":"10.48550/arxiv.2103.16692","title":"On AO*, Proof Number Search and Minimax Search","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimax; Mathematics; Mathematical economics; Computer science","score_opus":0.1344679078719994,"score_gpt":0.2485302219547873,"score_spread":0.11406231408278791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148866278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7460534,0.000041571668,0.24705003,0.00024282394,0.00035396396,0.00028658714,0.0000054578595,0.000119630866,0.005846548],"genre_scores_gemma":[0.9937132,0.00012362622,0.0022635546,0.00012633677,0.00006760745,0.0000012154934,0.000006357511,0.000020948217,0.0036771703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721533,0.00028775292,0.00020729953,0.0015419138,0.00023480003,0.0005128915],"domain_scores_gemma":[0.9976733,0.00029771007,0.00007014929,0.0013909402,0.00031772983,0.00025018398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041914868,0.000313014,0.00033246083,0.00020953982,0.0001971489,0.0003959226,0.0017389463,0.00030977174,0.00017629322],"category_scores_gemma":[0.00007080632,0.00035991438,0.00015049198,0.0006402895,0.0002895687,0.00036850496,0.0038952106,0.0009838059,0.00029443367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119252356,0.0006219252,0.017005894,0.00037644833,0.00027103318,0.0036860502,0.006376711,0.27463284,0.00026811662,0.67293787,0.00092184625,0.022781968],"study_design_scores_gemma":[0.0002122167,0.00015569925,0.001815127,0.00033728348,0.00003992611,0.000028609245,0.0010889639,0.93204474,0.015163592,0.047867313,0.0002989424,0.00094757776],"about_ca_topic_score_codex":0.0004184056,"about_ca_topic_score_gemma":0.00010040971,"teacher_disagreement_score":0.6574119,"about_ca_system_score_codex":0.00019411874,"about_ca_system_score_gemma":0.00039345873,"threshold_uncertainty_score":0.99988526},"labels":[],"label_agreement":null},{"id":"W3151426015","doi":"10.71781/10223","title":"Multi-player games in the era of machine learning","year":2020,"lang":"en","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Human–computer interaction; Artificial intelligence; Data science; Multimedia","score_opus":0.012248932310141977,"score_gpt":0.2097609072115189,"score_spread":0.19751197490137692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151426015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8609933,0.042358924,0.036872406,0.0030574535,0.0029956882,0.0014280537,0.00003947229,0.00045896362,0.051795732],"genre_scores_gemma":[0.9882651,0.00033061445,0.0051583536,0.000117941876,0.00005820045,0.000015247821,0.000081187216,0.000014871069,0.005958485],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810797,0.00019995817,0.00038517278,0.00046788182,0.0005858467,0.00025319087],"domain_scores_gemma":[0.9988414,0.00018474554,0.00035879033,0.00037744592,0.00014757027,0.00009002488],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00022301658,0.0002586638,0.00030100005,0.00017787232,0.0014798215,0.000065436696,0.0013344047,0.00021389536,0.000012787071],"category_scores_gemma":[0.00013229238,0.00023568558,0.00019074576,0.0004964315,0.00011205725,0.00034312153,0.00017212993,0.00084316556,0.000035407727],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008237181,0.00078897254,0.035513956,0.00040041978,0.00041567514,0.0060089775,0.6646435,0.029053977,0.05005401,0.12009591,0.0006428037,0.09155806],"study_design_scores_gemma":[0.0014202447,0.0005712003,0.10800746,0.0010972674,0.0002816924,0.0007367638,0.13511424,0.52538943,0.1294503,0.002059154,0.093772404,0.0020998307],"about_ca_topic_score_codex":0.014419857,"about_ca_topic_score_gemma":0.008811667,"teacher_disagreement_score":0.5295293,"about_ca_system_score_codex":0.00075336645,"about_ca_system_score_gemma":0.00069445826,"threshold_uncertainty_score":0.9998201},"labels":[],"label_agreement":null},{"id":"W3154529125","doi":"10.1007/978-3-030-73050-5_60","title":"An Island Model Genetic Algorithm Approach to Tuning AI Bots","year":2021,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Game engine; Genetic algorithm; Partition (number theory); Mode (computer interface); State (computer science); Artificial intelligence; Population; Machine learning; Human–computer interaction; Algorithm; Mathematics","score_opus":0.030159697010406387,"score_gpt":0.2939649413225386,"score_spread":0.2638052443121322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154529125","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007805503,0.018781114,0.9423776,0.000027597756,0.0011762964,0.00055265,0.000008365668,0.00013199261,0.036866322],"genre_scores_gemma":[0.1682466,0.004991536,0.789793,0.00084180833,0.0017022454,0.00009049881,0.000045848356,0.00025995643,0.03402852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960963,0.00008610789,0.0011469789,0.0014969078,0.0005608726,0.0006128107],"domain_scores_gemma":[0.99798,0.00016767692,0.00035473585,0.0009820717,0.00024299654,0.00027254983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051267404,0.0005940275,0.0008213268,0.00038720912,0.00022437377,0.00062789617,0.0012522842,0.00028895398,0.0000045738016],"category_scores_gemma":[0.00002608007,0.00061009993,0.000112428286,0.00018766081,0.00009618182,0.0006029323,0.0006790364,0.00061463605,0.000025408614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002020411,0.000035751276,0.000047296944,0.0001119628,0.000018668601,0.000041640757,0.0014463969,0.5503922,0.000007435611,0.13496059,0.000035635163,0.31290036],"study_design_scores_gemma":[0.00003879596,0.00009015915,0.0000025333118,0.0010471963,0.00001049047,0.000096723896,0.0003486985,0.97372824,0.00006207076,0.011208711,0.012689241,0.00067716173],"about_ca_topic_score_codex":0.00007226319,"about_ca_topic_score_gemma":0.000044120654,"teacher_disagreement_score":0.423336,"about_ca_system_score_codex":0.00015445522,"about_ca_system_score_gemma":0.00011330046,"threshold_uncertainty_score":0.99963504},"labels":[],"label_agreement":null},{"id":"W3162673503","doi":"10.1145/1227504.1227503","title":"The games computers play...","year":2007,"lang":"en","type":"article","venue":"ACM SIGCSE Bulletin","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Simple (philosophy); Space (punctuation); Artificial intelligence; Combinatorial game theory; Video game design; Human–computer interaction; Game mechanics; Sequential game; Game theory; Mathematical economics; Mathematics; Epistemology; Operating system","score_opus":0.0221212513490587,"score_gpt":0.27319952615600973,"score_spread":0.25107827480695105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162673503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04079195,0.0006611441,0.88611627,0.05342184,0.0027818063,0.00036717523,0.0000010192238,0.00062724826,0.015231567],"genre_scores_gemma":[0.9086681,0.00007922693,0.082799196,0.0039449106,0.0004278442,0.000014718645,9.4161464e-7,0.000024230523,0.0040408038],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820226,0.00006916685,0.00037302167,0.00039042006,0.00038156405,0.0005835913],"domain_scores_gemma":[0.9957596,0.0024710628,0.00011774387,0.0014235334,0.000095716794,0.00013233285],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012635491,0.00016848554,0.00013413772,0.00008788509,0.00041422652,0.00031605025,0.0033516618,0.00007219591,0.00007059275],"category_scores_gemma":[0.0007757755,0.00012084927,0.00009050914,0.00036584018,0.00021844791,0.00009378238,0.0009040586,0.00022244858,0.0021165905],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023539169,0.000060616287,0.0006673123,0.0000036488718,0.000028093498,0.0000975764,0.0018159276,0.00016447576,0.00045175897,0.09969287,0.18762249,0.7093717],"study_design_scores_gemma":[0.00006612534,0.0000703547,0.0012312196,0.0000164397,0.0000030528786,0.000025768397,0.00022829494,0.0014353356,0.020521961,0.010132933,0.96603304,0.00023548726],"about_ca_topic_score_codex":0.000057847185,"about_ca_topic_score_gemma":0.000030505054,"teacher_disagreement_score":0.8678762,"about_ca_system_score_codex":0.000044988406,"about_ca_system_score_gemma":0.00003374762,"threshold_uncertainty_score":0.9986604},"labels":[],"label_agreement":null},{"id":"W3168756878","doi":"","title":"The Game of timber","year":2013,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada","funders":"","keywords":"Catalan; Catalan number; Mathematics; Mathematical economics; Game tree; Sequential game; Game theory; Combinatorics; Humanities; Art","score_opus":0.014351661995461592,"score_gpt":0.23216839671929246,"score_spread":0.21781673472383087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168756878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09626054,0.0004401731,0.80137706,0.022591952,0.00018730412,0.000290347,0.0000015179838,0.00017088764,0.07868024],"genre_scores_gemma":[0.9393801,0.000109887274,0.050083023,0.000101461286,0.000008909823,0.0000344845,0.000002505604,0.000010600662,0.010269011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99724793,0.0015238302,0.00036020766,0.00029213543,0.00031294065,0.00026295282],"domain_scores_gemma":[0.99425775,0.0021012286,0.00022507565,0.001728999,0.0015938769,0.00009306733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002494346,0.00011474178,0.00012581982,0.000054545006,0.00024838714,0.00035993085,0.0020145786,0.00005654319,0.00012827585],"category_scores_gemma":[0.0011470742,0.00008855416,0.00008789585,0.00041902674,0.00031973724,0.0003682508,0.0005470479,0.00014620749,0.0003781353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011103415,0.00013079484,0.0009539562,0.0000074128125,0.00001647488,6.0512707e-7,0.006474675,0.00003529597,0.004732955,0.7530345,0.0028186555,0.2317936],"study_design_scores_gemma":[0.00018512424,9.4788294e-7,0.010927213,0.00030405138,0.000010057988,0.000013351828,0.0003665687,0.26220834,0.5472708,0.10895123,0.06933954,0.0004227932],"about_ca_topic_score_codex":0.00081502396,"about_ca_topic_score_gemma":0.00033246883,"teacher_disagreement_score":0.84311956,"about_ca_system_score_codex":0.000025876623,"about_ca_system_score_gemma":0.00007758616,"threshold_uncertainty_score":0.48602906},"labels":[],"label_agreement":null},{"id":"W3172982719","doi":"10.1109/lra.2021.3083465","title":"Expectations Vs. Reality: Unreliability and Transparency in a Treasure Hunt Game With Icub","year":2021,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Commission","keywords":"iCub; Transparency (behavior); Affect (linguistics); Robot; Treasure; Humanoid robot; Computer science; Human–computer interaction; Psychology; Quality (philosophy); Simulation; Artificial intelligence; Computer security; Communication; Geography","score_opus":0.024699854357770064,"score_gpt":0.261043406057689,"score_spread":0.23634355169991894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172982719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41454014,0.000061392595,0.56393814,0.021151507,0.00009032093,0.00010091643,0.0000022215236,0.00007190164,0.000043452856],"genre_scores_gemma":[0.974653,0.000025552887,0.024650784,0.00061691366,0.000020155901,0.0000132728765,0.0000036708439,0.000005663588,0.000010985655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895406,0.00009164974,0.00026814046,0.0003384197,0.00018367749,0.00016405275],"domain_scores_gemma":[0.9994242,0.00012205861,0.0000653793,0.0002579176,0.00006816911,0.00006224539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014526008,0.000110133304,0.00015252008,0.00007300936,0.00007206161,0.00016866837,0.00011383016,0.000041540923,0.0000028827476],"category_scores_gemma":[0.00003589801,0.00010078322,0.000020789677,0.00033132563,0.00009354203,0.0003558925,0.00001889002,0.00009868304,0.0000027387796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004934375,0.0007359775,0.084512345,0.00039474553,0.00011336589,0.00037777683,0.06574573,0.6506008,0.030319264,0.06578865,0.0010294992,0.10033253],"study_design_scores_gemma":[0.00040134887,0.00011149028,0.1552327,0.00018834756,0.000027422155,0.0000593656,0.0007534396,0.8280767,0.008941802,0.005561378,0.00017266684,0.00047334083],"about_ca_topic_score_codex":0.00008344138,"about_ca_topic_score_gemma":0.0003652719,"teacher_disagreement_score":0.56011283,"about_ca_system_score_codex":0.000035101,"about_ca_system_score_gemma":0.000048518657,"threshold_uncertainty_score":0.41098204},"labels":[],"label_agreement":null},{"id":"W3174479306","doi":"10.1007/s10107-024-02126-8","title":"Optimizing for strategy diversity in the design of video games","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Polytope; Upper and lower bounds; Combinatorics; Asymptotically optimal algorithm; Constraint (computer-aided design); Matrix (chemical analysis); Linear programming; Connection (principal bundle); Point (geometry); Mathematical optimization; Discrete mathematics","score_opus":0.13555552960445652,"score_gpt":0.33985580955813793,"score_spread":0.2043002799536814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174479306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002203039,0.00023146556,0.99611163,0.00042484823,0.00005848363,0.00056417217,3.6408093e-7,0.00009649817,0.00030950503],"genre_scores_gemma":[0.634449,0.0000019840243,0.36543718,0.000020956179,0.000016887807,0.00005101016,1.511301e-7,0.000004426718,0.000018389263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896663,0.00007181433,0.00027377254,0.00021732591,0.00022727915,0.00024315904],"domain_scores_gemma":[0.99806887,0.0015799836,0.00003675561,0.0002516926,0.00003552411,0.000027147817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013555584,0.000090876296,0.00014608582,0.000073114425,0.00009225051,0.00024703966,0.00079908984,0.000042593972,0.00000789428],"category_scores_gemma":[0.00023980458,0.000060371443,0.00007851402,0.00034357756,0.00009338379,0.0002701296,0.000246764,0.00011077857,0.000016582255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048858356,0.00010953595,0.00002399246,0.00029157763,0.000014927104,0.000018562712,0.015572454,0.0022241245,0.00011735312,0.6160397,0.000092555376,0.36549035],"study_design_scores_gemma":[0.000026123462,0.000112503585,0.0000059107324,0.00014889009,0.000010252696,0.0000068249333,0.0010385332,0.6526047,0.0018025647,0.3438834,0.00027255274,0.00008773054],"about_ca_topic_score_codex":0.000010403922,"about_ca_topic_score_gemma":0.0000021030899,"teacher_disagreement_score":0.6503806,"about_ca_system_score_codex":0.000021473865,"about_ca_system_score_gemma":0.000029746061,"threshold_uncertainty_score":0.2461876},"labels":[],"label_agreement":null},{"id":"W3175400448","doi":"10.1609/aaai.v35i17.17830","title":"Random Forests for Opponent Hand Estimation in Gin Rummy","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Random forest; Adversary; Computer science; Artificial intelligence; Simple (philosophy); Machine learning; Classifier (UML); Fictitious play; Game theory; Mathematics; Computer security; Mathematical economics","score_opus":0.08798144882918432,"score_gpt":0.32476330913354723,"score_spread":0.2367818603043629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175400448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23299459,0.00008826919,0.7512802,0.010305778,0.0009874367,0.0012318,0.00001031597,0.000098950106,0.003002667],"genre_scores_gemma":[0.98166007,0.000031441024,0.017603466,0.00020286729,0.000054934462,0.00014131924,0.0000016937364,0.000017264152,0.00028696362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973035,0.00003545971,0.00091713696,0.00069964485,0.0005412109,0.0005030845],"domain_scores_gemma":[0.9976192,0.00039842582,0.00040811216,0.0004295634,0.0010418601,0.00010285634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087184424,0.00027728197,0.00040362575,0.00019775187,0.00024655784,0.0005122896,0.0017613709,0.00013486714,0.000051392504],"category_scores_gemma":[0.001947526,0.00022950437,0.00019711998,0.00093711464,0.00033805464,0.0006356087,0.0004019622,0.00027846405,0.00006189335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017039714,0.00026262138,0.00061593455,0.00006805934,0.000015524505,0.0000022134993,0.002033339,0.0025413567,0.039247062,0.820271,0.00018388349,0.13458858],"study_design_scores_gemma":[0.000044332377,0.00007341795,0.0001854222,0.00018702923,0.000006112461,0.0000040748755,0.0002798657,0.27611178,0.48204854,0.24083374,0.000079043704,0.00014665512],"about_ca_topic_score_codex":0.00006382984,"about_ca_topic_score_gemma":0.00027453393,"teacher_disagreement_score":0.74866545,"about_ca_system_score_codex":0.00009544789,"about_ca_system_score_gemma":0.00025703292,"threshold_uncertainty_score":0.9358916},"labels":[],"label_agreement":null},{"id":"W3177194733","doi":"10.1609/aaai.v35i1.16114","title":"Programmatic Strategies for Real-Time Strategy 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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Division of Mathematical Sciences; Centro de Ciências Matemáticas Aplicadas à Indústria; Compute Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canadian Institute for Advanced Research","keywords":"Computer science; Predictability; Rendering (computer graphics); Domain (mathematical analysis); Combinatorial game theory; Theoretical computer science; Game theory; Artificial intelligence; Sequential game","score_opus":0.09010801286729087,"score_gpt":0.32662128122570616,"score_spread":0.2365132683584153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177194733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49264446,0.0002226256,0.3666535,0.016012175,0.00217433,0.00441309,0.000043373308,0.0012977528,0.11653867],"genre_scores_gemma":[0.97691333,0.00007347654,0.021359535,0.0001335715,0.00012522808,0.00016743313,0.0000018757762,0.000029247854,0.0011962767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99673396,0.000040753814,0.0010055905,0.0008621622,0.00067594036,0.0006816139],"domain_scores_gemma":[0.9962788,0.00034200473,0.00057326385,0.0006375901,0.002022233,0.00014610852],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000680002,0.00038561044,0.0004899302,0.00013656248,0.00031749668,0.0011500429,0.0027055794,0.00016704494,0.0001515115],"category_scores_gemma":[0.0007179759,0.000305893,0.00029913947,0.0010417264,0.0005024665,0.0009916045,0.00046318362,0.0002972643,0.00018559383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033831242,0.00018987212,0.000024462128,0.00008339365,0.000026660537,0.0000014385423,0.0013855553,0.00018406591,0.089127816,0.80783784,0.00027037054,0.10083468],"study_design_scores_gemma":[0.000014673172,0.00021562801,0.000024570676,0.00015833716,0.000015611284,0.000007675954,0.0024409445,0.06302207,0.4751258,0.45860365,0.0001348069,0.00023623918],"about_ca_topic_score_codex":0.000046525627,"about_ca_topic_score_gemma":0.000029382054,"teacher_disagreement_score":0.48426887,"about_ca_system_score_codex":0.00006647228,"about_ca_system_score_gemma":0.00066915987,"threshold_uncertainty_score":0.9999393},"labels":[],"label_agreement":null},{"id":"W3178936237","doi":"10.1142/s1793830922501270","title":"A note on hyperopic cops and robber","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; St. Francis Xavier University; Acadia University","funders":"","keywords":"Cardinality (data modeling); Combinatorics; Mathematics; Cartesian product; Graph; Discrete mathematics; Computer science; Data mining","score_opus":0.023094449330576805,"score_gpt":0.2868035390969812,"score_spread":0.2637090897664044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178936237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066770227,0.00012574153,0.9888294,0.0013476298,0.00004293167,0.00040238164,0.000022547516,0.00008724552,0.0024651082],"genre_scores_gemma":[0.65355796,0.00009817679,0.3430039,0.0007269867,0.000120089855,0.0014091182,0.000012817431,0.000031202526,0.001039727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991723,0.000017215463,0.00018875982,0.0002832292,0.00019508677,0.00014346026],"domain_scores_gemma":[0.99930114,0.00014012978,0.00007253066,0.00039224591,0.000025313744,0.00006863393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015281988,0.00009959205,0.000111631016,0.000053572767,0.00046189644,0.00013371756,0.00033359544,0.000020096848,0.000022846274],"category_scores_gemma":[0.000011762594,0.000090369074,0.00002477151,0.00019971965,0.0000704105,0.00008068725,0.00037382735,0.00012330055,0.000023085973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.21119e-7,0.00009030051,0.000057034697,0.000016595985,0.000008137851,0.000001512603,0.0016881805,0.00018661444,0.00017806854,0.895481,0.00011747864,0.10217447],"study_design_scores_gemma":[0.00011539682,0.00013678885,0.00035135314,0.000012204847,0.00001532135,0.00005138974,0.0010302654,0.65406144,0.00074693584,0.29728368,0.04585053,0.00034471537],"about_ca_topic_score_codex":0.000010205694,"about_ca_topic_score_gemma":0.0000013610492,"teacher_disagreement_score":0.6538748,"about_ca_system_score_codex":0.000019404744,"about_ca_system_score_gemma":0.000015884776,"threshold_uncertainty_score":0.36851442},"labels":[],"label_agreement":null},{"id":"W3185452770","doi":"10.20944/preprints202107.0622.v1","title":"An Extensible and Modular Design and Implementation of Monte Carlo Tree Search for the JVM","year":2021,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Modular design; Implementation; Heuristics; Programming language; Key (lock); Monte Carlo tree search; Theoretical computer science; Software engineering; Monte Carlo method; Operating system","score_opus":0.2388369012259718,"score_gpt":0.42227573608979546,"score_spread":0.18343883486382367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185452770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5994041,0.00037181305,0.39881304,0.00036400423,0.00013918472,0.00085124344,0.000004689222,0.000034654087,0.00001729933],"genre_scores_gemma":[0.9691657,0.00037391577,0.030099573,0.00004671946,0.000050127597,0.00020266327,0.000003070716,0.000017618246,0.000040644583],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99783164,0.00025583443,0.0004201354,0.0009113752,0.00030798512,0.0002730148],"domain_scores_gemma":[0.99753094,0.00038926245,0.0001818343,0.0014156714,0.00038916894,0.00009314388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015909737,0.00020696597,0.00029259516,0.00009645425,0.00015506483,0.00015058715,0.0009665643,0.00012619272,0.000025370642],"category_scores_gemma":[0.00008363217,0.00017949428,0.000080350736,0.00012650675,0.00015907633,0.00030680132,0.0019497148,0.00027151685,0.0000037980492],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103422804,0.00023187284,0.30386737,0.0005629683,0.00046252777,0.000022784652,0.054457847,0.13201033,0.16711956,0.0084787235,0.0000341346,0.33264846],"study_design_scores_gemma":[0.000105579886,0.00006550793,0.14401613,0.000054643297,0.000042031203,0.0000071417558,0.0023732313,0.35422286,0.49520403,0.0036516706,0.000040511994,0.00021667268],"about_ca_topic_score_codex":0.0015708151,"about_ca_topic_score_gemma":0.00017690717,"teacher_disagreement_score":0.3697616,"about_ca_system_score_codex":0.000039479793,"about_ca_system_score_gemma":0.0002042302,"threshold_uncertainty_score":0.7319564},"labels":[],"label_agreement":null},{"id":"W3185733660","doi":"10.1145/3472538.3472601","title":"Toward Co-creative Dungeon Generation via Transfer Learning","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Process (computing); Transfer of learning; Human–computer interaction; Knowledge transfer; Artificial intelligence; Multimedia; Knowledge management","score_opus":0.08011924718319055,"score_gpt":0.31929523162220563,"score_spread":0.23917598443901508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185733660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031859424,0.0003064337,0.9507486,0.0007817398,0.00092074706,0.00026296653,9.1550027e-7,0.0003465942,0.014772537],"genre_scores_gemma":[0.95409495,0.00014338712,0.043804985,0.00025052877,0.0003284462,0.00005721993,0.00006226864,0.000019398738,0.0012387936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977068,0.0002769086,0.00041861166,0.0008933915,0.00041275582,0.00029155563],"domain_scores_gemma":[0.99887234,0.00007492102,0.000069403264,0.0005981517,0.00029061123,0.000094554576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034066933,0.00028915922,0.0003259265,0.00011637429,0.00013971873,0.00068519736,0.0008949682,0.00030277026,0.00069571007],"category_scores_gemma":[0.00006976078,0.00028203463,0.00018455378,0.00017763022,0.00006520083,0.00037851176,0.0005150089,0.0007966117,0.00015635655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012361554,0.00020598166,0.0005718343,0.00010003714,0.0004144525,0.00018407135,0.05277195,0.16425978,0.038955018,0.03326953,0.0011571584,0.7080978],"study_design_scores_gemma":[0.000026750995,0.000055833785,0.000077446806,0.000046547222,0.000019705112,0.000009565657,0.00040606907,0.6027774,0.3936623,0.001474267,0.0010382578,0.00040582908],"about_ca_topic_score_codex":0.00051216397,"about_ca_topic_score_gemma":0.00015170676,"teacher_disagreement_score":0.92223555,"about_ca_system_score_codex":0.000098043885,"about_ca_system_score_gemma":0.00022153545,"threshold_uncertainty_score":0.99996316},"labels":[],"label_agreement":null},{"id":"W3186837011","doi":"10.1145/3472538.3472587","title":"Adversarial Random Forest Classifier for Automated Game Design","year":2021,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adversarial system; Game design; Screening game; Repeated game; Classifier (UML); Sequential game; Game mechanics; Non-cooperative game","score_opus":0.0661949268056911,"score_gpt":0.30921428079782176,"score_spread":0.24301935399213065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186837011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093293574,0.000040095285,0.99253756,0.0012711472,0.0011492094,0.0003502782,0.0000015520486,0.00089841307,0.0028187844],"genre_scores_gemma":[0.51008904,0.000007510739,0.48487237,0.0006726417,0.00022177279,0.000086218926,0.0000048446022,0.000016183276,0.0040294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866945,0.0000997006,0.00028703953,0.00040595164,0.0002023571,0.00033552464],"domain_scores_gemma":[0.9983608,0.00075505755,0.00006016933,0.0004796457,0.00025291863,0.0000914184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003476299,0.00012821317,0.00018839783,0.00005205434,0.00009876197,0.00023506145,0.00057775126,0.00009214371,0.00011652235],"category_scores_gemma":[0.00045465305,0.00011217056,0.00012210822,0.00029880708,0.00005511643,0.00040025293,0.0001545713,0.00006939848,0.00018932637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048702685,0.00038980716,0.00061868416,0.000038872073,0.00018831488,0.00018133847,0.0024580683,0.058159813,0.017106699,0.6693891,0.14342067,0.10756161],"study_design_scores_gemma":[0.0005128538,0.0000576003,0.00008038592,0.000007931925,0.000007820274,0.000011005058,0.000058043228,0.9033523,0.062675655,0.020106869,0.012969684,0.00015982684],"about_ca_topic_score_codex":0.000019376484,"about_ca_topic_score_gemma":0.000058249116,"teacher_disagreement_score":0.8451925,"about_ca_system_score_codex":0.000038820475,"about_ca_system_score_gemma":0.00024961357,"threshold_uncertainty_score":0.45741826},"labels":[],"label_agreement":null},{"id":"W3186929351","doi":"10.48550/arxiv.2107.12524","title":"Ensemble Learning For Mega Man Level Generation","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Variance (accounting); Markov chain; Computer science; Mega-; Ensemble learning; Content (measure theory); Similarity (geometry); Artificial intelligence; Process (computing); Machine learning; Mathematics; Image (mathematics); Programming language","score_opus":0.2615583772019597,"score_gpt":0.2386729315705764,"score_spread":0.022885445631383283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186929351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2018205,0.000047134527,0.79600084,0.00012512834,0.0008100575,0.0002537671,0.000002897646,0.00016406807,0.0007756069],"genre_scores_gemma":[0.975834,0.00007179736,0.018165736,0.00010401798,0.00021103352,0.000003448177,0.000039380848,0.000019394358,0.0055512055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813163,0.00013745933,0.00021269133,0.0010910643,0.000092352486,0.0003347888],"domain_scores_gemma":[0.9983806,0.00013650561,0.00021351012,0.0008130813,0.00034993683,0.0001063575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027825445,0.0002450811,0.00026198104,0.00017100171,0.0002901978,0.00033984022,0.0012188151,0.00026682872,0.000031365795],"category_scores_gemma":[0.00012777593,0.0003127472,0.00023073927,0.0003337179,0.000060122977,0.0004598745,0.0012832539,0.00044962086,0.000040456947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008663835,0.000055518733,0.00055767375,0.000047519618,0.000063194464,0.000108447326,0.0008040406,0.8910611,0.0020126686,0.09678498,0.000536878,0.007959282],"study_design_scores_gemma":[0.00007506195,0.0000434984,0.000086008506,0.00003980639,0.00003200466,0.0000028698444,0.0002249051,0.9671619,0.017334932,0.013258456,0.0013851601,0.0003554286],"about_ca_topic_score_codex":0.00015286417,"about_ca_topic_score_gemma":0.00025747428,"teacher_disagreement_score":0.77783513,"about_ca_system_score_codex":0.00019042671,"about_ca_system_score_gemma":0.00024529692,"threshold_uncertainty_score":0.99993247},"labels":[],"label_agreement":null},{"id":"W3186953399","doi":"","title":"Modelling Recognition in Human Puzzle Solving","year":2021,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Task (project management); Adversarial system; Artificial intelligence; Simple (philosophy); Context (archaeology); Reinforcement learning; Artificial neural network; Machine learning; Epistemology","score_opus":0.047514015375097196,"score_gpt":0.2508875830646463,"score_spread":0.20337356768954912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186953399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5999178,0.00036911483,0.34985748,0.001326624,0.0003277209,0.00023975136,0.00019913036,0.00082896923,0.046933398],"genre_scores_gemma":[0.97505033,0.000017209926,0.023615839,0.00042083257,0.00011251646,0.000017168166,0.00018210807,0.000041082145,0.0005428987],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977991,0.000104269886,0.0005623622,0.00066827773,0.00034860513,0.00051738985],"domain_scores_gemma":[0.99889547,0.00017078368,0.000105899184,0.0005677913,0.00007204388,0.00018802303],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002134941,0.00022817974,0.00022735038,0.00021172834,0.00019942592,0.002796845,0.0008593169,0.00013713284,0.00024327263],"category_scores_gemma":[0.00020231181,0.00025125153,0.0001284885,0.0009457506,0.000056681438,0.008954789,0.00058399513,0.00048376666,0.0018946193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009713458,0.002653187,0.1651242,0.00031788924,0.00013302416,0.003419401,0.0017310499,0.037652954,0.009667814,0.17730641,0.003362966,0.598534],"study_design_scores_gemma":[0.00029264748,0.000064576074,0.00030305036,0.0003966408,0.0000069455587,0.000055564662,0.00015889162,0.2011468,0.16914277,0.5893406,0.038028307,0.001063175],"about_ca_topic_score_codex":0.0000073868605,"about_ca_topic_score_gemma":0.000006768121,"teacher_disagreement_score":0.5974708,"about_ca_system_score_codex":0.00004862992,"about_ca_system_score_gemma":0.00010983601,"threshold_uncertainty_score":0.999994},"labels":[],"label_agreement":null},{"id":"W3186993943","doi":"10.1145/3472538.3472602","title":"Generating Lode Runner Levels by Learning Player Paths with LSTMs","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Path (computing); Controllability; Lode; Artificial intelligence; Coherence (philosophical gambling strategy); Video game; Machine learning; Human–computer interaction; Multimedia; Programming language","score_opus":0.04382845345099001,"score_gpt":0.28252603878956506,"score_spread":0.23869758533857505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186993943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10587274,0.00039358536,0.88764507,0.0006320644,0.0006430053,0.0001927549,0.000003269801,0.00040333765,0.0042141755],"genre_scores_gemma":[0.72209543,0.000025873247,0.27093244,0.0006696181,0.00021999115,0.00005012298,0.000020927202,0.000042047297,0.00594358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690235,0.00019174142,0.0005025403,0.0012515793,0.00061869173,0.0005331097],"domain_scores_gemma":[0.9980102,0.00017841213,0.00028187202,0.0010536062,0.0003278915,0.0001480001],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00044505054,0.00042486264,0.0004196856,0.0000893931,0.00026340556,0.0014397926,0.0015070547,0.00030248085,0.0003985713],"category_scores_gemma":[0.00013389956,0.00034792046,0.00012041127,0.00021312745,0.00008110115,0.00043322713,0.0024169981,0.0012636255,0.00013566492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008281725,0.000183656,0.0029384478,0.00011719228,0.00023910929,0.000338142,0.012705401,0.73647034,0.038809627,0.00859051,0.005946365,0.19365291],"study_design_scores_gemma":[0.000053380387,0.00007854661,0.000073649084,0.00020684862,0.000015755675,0.000031263062,0.0008316089,0.87629575,0.11775718,0.000825922,0.002922019,0.00090808887],"about_ca_topic_score_codex":0.00046358007,"about_ca_topic_score_gemma":0.00016710607,"teacher_disagreement_score":0.6167126,"about_ca_system_score_codex":0.00009546282,"about_ca_system_score_gemma":0.0003501265,"threshold_uncertainty_score":0.9998973},"labels":[],"label_agreement":null},{"id":"W3188608413","doi":"10.1016/j.tcs.2021.07.038","title":"One-visibility cops and robber on trees","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visibility; Computer science; Tree (set theory); Variation (astronomy); Mathematics; Theoretical computer science; Combinatorics; Geography","score_opus":0.027342755584197152,"score_gpt":0.2922411713208605,"score_spread":0.2648984157366634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188608413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17404257,0.000041682153,0.8165608,0.0029319813,0.00047987635,0.000094955605,9.519877e-7,0.00016511387,0.005682085],"genre_scores_gemma":[0.8869108,0.000007912627,0.11161398,0.0013426119,0.00009293426,0.0000032643543,2.6449658e-7,0.0000053980784,0.000022837507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721086,0.00016151469,0.00028489795,0.001079648,0.0007362115,0.0005268711],"domain_scores_gemma":[0.99761486,0.0005832777,0.000047086127,0.0011675941,0.00028288606,0.00030432153],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001199065,0.00016770263,0.00021794817,0.000100977806,0.00038486978,0.00070280005,0.0015525297,0.000055456094,0.00008341425],"category_scores_gemma":[0.000351746,0.00015024125,0.000053373547,0.001013089,0.0033948913,0.00058507564,0.0014331446,0.00022472064,0.00016016903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004208956,0.00009043957,0.00016648814,0.0000028777838,0.000002318215,0.000016965469,0.0003700771,0.00010208425,0.0010622751,0.8732513,0.000023681614,0.124907285],"study_design_scores_gemma":[0.00007588484,0.00024079497,0.007146155,0.0000428116,0.0000037647085,0.00003458333,0.000019398874,0.3458904,0.07934321,0.5667535,0.00017157753,0.00027790244],"about_ca_topic_score_codex":0.000003972682,"about_ca_topic_score_gemma":0.000003958435,"teacher_disagreement_score":0.7128682,"about_ca_system_score_codex":0.000055661174,"about_ca_system_score_gemma":0.00017232126,"threshold_uncertainty_score":0.9993173},"labels":[],"label_agreement":null},{"id":"W3199151886","doi":"","title":"On Bonus-Based Exploration Methods in the Arcade Learning Environment","year":2021,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Pace; Computer science; Suite; Set (abstract data type); Reinforcement learning; Domain (mathematical analysis); Hyperparameter; Artificial intelligence; Machine learning; Operations research; Mathematics","score_opus":0.2048932795810042,"score_gpt":0.2707503069292788,"score_spread":0.06585702734827462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199151886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14213566,0.0000903888,0.8544723,0.00079931493,0.0005847586,0.0005897682,0.0000014481353,0.00007062161,0.0012557367],"genre_scores_gemma":[0.98330575,0.00054383837,0.014836204,0.00049421174,0.00008547022,0.00000847651,0.000016933558,0.000030889332,0.0006782082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914328,0.0045678886,0.00064453395,0.0022781498,0.00035803928,0.0007185986],"domain_scores_gemma":[0.9948223,0.0021786033,0.00060813164,0.0021151442,0.00010567153,0.00017015253],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028518725,0.0006286629,0.0005506204,0.0004989446,0.00052776403,0.00054553035,0.003135331,0.00047934745,0.00033744582],"category_scores_gemma":[0.00042299106,0.0006475613,0.00042642723,0.0013373232,0.00042168965,0.0008368898,0.0013811508,0.00249599,0.00034669848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061797065,0.0003649775,0.00068640534,0.000030560215,0.000033367654,0.00054338697,0.005640216,0.91911155,0.0002806599,0.055955205,0.000012678067,0.01727921],"study_design_scores_gemma":[0.00019078184,0.00028233696,0.00053537334,0.00025026163,0.000062980194,0.0000028127424,0.005290571,0.9514299,0.0075817774,0.032516867,0.0012038788,0.00065248145],"about_ca_topic_score_codex":0.000266092,"about_ca_topic_score_gemma":0.000088648885,"teacher_disagreement_score":0.84117013,"about_ca_system_score_codex":0.0007229391,"about_ca_system_score_gemma":0.00036719747,"threshold_uncertainty_score":0.9998053},"labels":[],"label_agreement":null},{"id":"W3202818103","doi":"10.1007/978-3-030-87626-5_3","title":"Quantified Boolean Solving for Achievement Games","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Quantifier (linguistics); Theoretical computer science; Existentialism; Representation (politics); String (physics); ENCODE; Propositional calculus; Space (punctuation); Algebra over a field; Artificial intelligence; Mathematics; Programming language; Pure mathematics","score_opus":0.04473661279791708,"score_gpt":0.29259626210567397,"score_spread":0.2478596493077569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202818103","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095073876,0.000851364,0.9909264,0.0016935908,0.0035343994,0.0006813749,0.000007199404,0.00020909036,0.0020015452],"genre_scores_gemma":[0.088747606,0.00009896911,0.90467185,0.0029399886,0.0010591233,0.000052798336,0.000013495593,0.00008126704,0.002334914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994894,0.000037935348,0.0008265064,0.0021908781,0.0010696783,0.0009809472],"domain_scores_gemma":[0.99593806,0.0010680049,0.0003768087,0.0019117319,0.0005035252,0.00020184998],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001287486,0.00062761083,0.0006778999,0.0006729999,0.0004192863,0.0011716767,0.004229,0.0003416588,0.000035723944],"category_scores_gemma":[0.00032333832,0.0006098722,0.00028591507,0.00052330707,0.00071055576,0.0006538056,0.001857546,0.0006883569,0.000051442992],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065389854,0.000043518507,0.000034874643,0.000057583406,0.000019999408,0.0000627569,0.000986519,0.015278479,0.0007219615,0.18383916,0.00007827657,0.7988703],"study_design_scores_gemma":[0.00015134457,0.00026186035,0.00003776176,0.00072801945,0.00001538357,0.000035563902,0.00000173416,0.6652141,0.034266375,0.28415513,0.013985873,0.0011468377],"about_ca_topic_score_codex":0.000029264615,"about_ca_topic_score_gemma":0.0002148336,"teacher_disagreement_score":0.7977235,"about_ca_system_score_codex":0.00034654385,"about_ca_system_score_gemma":0.00080325315,"threshold_uncertainty_score":0.9998652},"labels":[],"label_agreement":null},{"id":"W3204113814","doi":"10.29173/iasl8306","title":"Weaving a Storytelling Tapestry Using Computational Thinking","year":2021,"lang":"en","type":"article","venue":"IASL Annual Conference Proceedings","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Museum and Library Services","keywords":"Computational thinking; Storytelling; Context (archaeology); Computer science; Weaving; Sequence (biology); Parallel thinking; Critical thinking; Mathematics education; Critical systems thinking; Artificial intelligence; Narrative; Mathematics; Engineering; Art","score_opus":0.05020557746458108,"score_gpt":0.2955242692936913,"score_spread":0.2453186918291102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204113814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4391059,0.00014398654,0.55837274,0.00063950283,0.00033468576,0.00008276695,0.0000031227655,0.0002723788,0.0010449517],"genre_scores_gemma":[0.8237887,0.000009001682,0.17525344,0.000590306,0.00016665249,0.0000061899887,0.0000024336653,0.000016490769,0.00016677853],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975514,0.000026750666,0.00045322473,0.0007455815,0.00069887406,0.00052421447],"domain_scores_gemma":[0.99736416,0.00013374005,0.00021873545,0.00019484786,0.0019224181,0.00016608916],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043383648,0.0002580875,0.0002687243,0.00014084596,0.00046984028,0.001120118,0.0010819434,0.00013836223,0.00007742907],"category_scores_gemma":[0.00027450532,0.00028235148,0.00009708168,0.0006737239,0.00013258455,0.0020558576,0.00062302727,0.000415533,0.00007936981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025676338,0.0003280543,0.01909143,0.00022165308,0.00012998783,0.00028756945,0.4670333,0.013559779,0.012814744,0.41254225,0.0010812574,0.07288429],"study_design_scores_gemma":[0.00011994282,0.00005999864,0.0006720093,0.00036939626,0.000019733146,0.00030937436,0.034020405,0.800667,0.022750197,0.13881454,0.0014891874,0.0007082324],"about_ca_topic_score_codex":0.000036170084,"about_ca_topic_score_gemma":0.000004574847,"teacher_disagreement_score":0.7871072,"about_ca_system_score_codex":0.00010968577,"about_ca_system_score_gemma":0.00055154186,"threshold_uncertainty_score":0.99996287},"labels":[],"label_agreement":null},{"id":"W3204581412","doi":"10.22215/etd/2012-06709","title":"Learning in pursuit-evasion differential games using reinforcement fuzzy learning","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Evasion (ethics); Differential (mechanical device); Reinforcement learning; Computer science; Mathematics education; Artificial intelligence; Psychology; Engineering; Aerospace engineering; Medicine","score_opus":0.041387633386787415,"score_gpt":0.31413098249928095,"score_spread":0.27274334911249354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204581412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76560736,0.000411867,0.1966787,0.000049725964,0.003531912,0.00053899194,2.1594727e-7,0.0005188471,0.032662384],"genre_scores_gemma":[0.9744237,0.00006132127,0.0033916992,0.000028481234,0.00026789616,0.000025711914,0.00009129028,0.00004534216,0.021664537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969088,0.0001886592,0.0007405866,0.0006413109,0.00079582265,0.00072481995],"domain_scores_gemma":[0.99874425,0.00013880913,0.00045426073,0.0004056516,0.00013746168,0.00011954717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048875454,0.00042176672,0.00043952133,0.0005459407,0.00026496,0.00041487097,0.0010565494,0.00038031707,0.00040768483],"category_scores_gemma":[0.00020441602,0.0004083779,0.00016229112,0.00045110148,0.000031835814,0.0008066703,0.0002927929,0.0011241816,0.00021419383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120640994,0.00023099646,0.0124699185,0.0003289869,0.00010197863,0.00004237627,0.033808984,0.104143545,0.0546474,0.02906791,0.00016664436,0.76487064],"study_design_scores_gemma":[0.00035539008,0.0004672116,0.012359276,0.0013307015,0.00009413432,0.00001642018,0.010732471,0.87888265,0.0840183,0.0024577393,0.006927568,0.0023581262],"about_ca_topic_score_codex":0.0006804527,"about_ca_topic_score_gemma":0.0005055536,"teacher_disagreement_score":0.77473915,"about_ca_system_score_codex":0.00024087784,"about_ca_system_score_gemma":0.00015377345,"threshold_uncertainty_score":0.9998368},"labels":[],"label_agreement":null},{"id":"W3206483379","doi":"10.1145/3450337.3483495","title":"PathOS+: A New Realm in Expert Evaluation","year":2021,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Usability; Interpretation (philosophy); Construct (python library); Field (mathematics); Realm; Data science; Human–computer interaction; Artificial intelligence; Expert system; Population","score_opus":0.10391239183936063,"score_gpt":0.3703895560927099,"score_spread":0.2664771642533493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206483379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029914327,0.0006509803,0.92091113,0.0060837264,0.00055984315,0.00015176671,1.0564433e-7,0.00012634175,0.041601747],"genre_scores_gemma":[0.8008782,0.00007520395,0.19194567,0.0022930158,0.00016195691,0.000027780141,0.000002114525,0.000007686515,0.00460832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990282,0.000089258225,0.0001741587,0.0002695503,0.00029234507,0.00014648942],"domain_scores_gemma":[0.999355,0.000054206168,0.000023002289,0.00040156595,0.00011274515,0.000053446696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003632736,0.00005593035,0.00006973299,0.000048945243,0.000022214586,0.000089635585,0.00030367187,0.000035225305,0.0004287658],"category_scores_gemma":[0.00025219208,0.00005259347,0.000025582869,0.00041758709,0.000010199354,0.0003248082,0.00013133975,0.00005416315,0.00021032404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011521595,0.000045582565,0.000699563,8.710555e-7,0.0000018154428,0.00003678925,0.004142823,0.00030903172,0.004171921,0.07491523,0.0061077243,0.9095675],"study_design_scores_gemma":[0.00010887289,0.000029363471,0.00253011,0.0000279143,0.0000015123987,0.000017345295,0.0006378273,0.72072476,0.17029122,0.095177956,0.010253749,0.00019936815],"about_ca_topic_score_codex":0.0005403732,"about_ca_topic_score_gemma":0.0008240909,"teacher_disagreement_score":0.90936816,"about_ca_system_score_codex":0.00006099058,"about_ca_system_score_gemma":0.00032620516,"threshold_uncertainty_score":0.46946847},"labels":[],"label_agreement":null},{"id":"W3206661964","doi":"10.1609/aiide.v17i1.18904","title":"Arachnophobia Exposure Therapy Using Experience-Driven Procedural Content Generation via Reinforcement Learning (EDPCGRL)","year":2021,"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":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Cisco Systems","keywords":"Computer science; Intuition; Reinforcement learning; Context (archaeology); Artificial intelligence; Human–computer interaction; Psychology","score_opus":0.11681522808872566,"score_gpt":0.3052038007145091,"score_spread":0.18838857262578343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206661964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9094341,0.0000586634,0.086248845,0.001207524,0.0005338434,0.0005838318,0.0000031544882,0.000066682565,0.0018633666],"genre_scores_gemma":[0.99806905,0.00013074276,0.0007352765,0.00044456514,0.00009323479,0.000069331516,0.00000438443,0.000020175343,0.00043322897],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971339,0.000034263096,0.0008906917,0.00079592114,0.00068311644,0.00046210358],"domain_scores_gemma":[0.9977783,0.00008152052,0.0005972602,0.0003047357,0.001098804,0.0001393666],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001529404,0.0003987537,0.00037963592,0.0001359142,0.00035410863,0.0010448447,0.00092266814,0.0001014839,0.00007460056],"category_scores_gemma":[0.0003324448,0.00030894738,0.00020024512,0.00040677728,0.00031426223,0.0019993382,0.0006073712,0.00040054932,0.000024547027],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002535203,0.00061077555,0.0025715365,0.000036156183,0.00012128457,0.0000074228765,0.018011412,0.002870689,0.72945195,0.06598643,0.00004393546,0.1800349],"study_design_scores_gemma":[0.000049533875,0.00049799675,0.000058547867,0.0002074351,0.0000074983536,0.000024974363,0.0071810004,0.25999767,0.7285197,0.003063154,0.00012314979,0.00026937664],"about_ca_topic_score_codex":0.00004024374,"about_ca_topic_score_gemma":0.000007256977,"teacher_disagreement_score":0.257127,"about_ca_system_score_codex":0.00019104681,"about_ca_system_score_gemma":0.00011097074,"threshold_uncertainty_score":0.9999922},"labels":[],"label_agreement":null},{"id":"W3206882088","doi":"10.1145/3472538.3472592","title":"Ensemble Learning For Mega Man Level Generation","year":2021,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Markov chain; Variance (accounting); Ensemble learning; Mega-; Artificial intelligence; Similarity (geometry); Process (computing); Markov process; Machine learning; Content (measure theory); Image (mathematics); Statistics; Programming language; Mathematics","score_opus":0.1598861700626673,"score_gpt":0.329679682718733,"score_spread":0.16979351265606568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206882088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013306952,0.00004257131,0.9789207,0.001652345,0.00035095384,0.00007438751,2.4098262e-7,0.00011088089,0.005540981],"genre_scores_gemma":[0.6907353,0.0000056138465,0.2886902,0.00055940694,0.00016607098,0.000019247154,0.000004487082,0.0000058620644,0.019813811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929845,0.00003338168,0.00013680296,0.00025282663,0.000116326315,0.00016219875],"domain_scores_gemma":[0.9994583,0.00008552565,0.000029753995,0.00021931593,0.0001706418,0.000036421567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015812767,0.000059592312,0.000067657704,0.000027881277,0.00015370283,0.00018879748,0.00022346184,0.0000346905,0.000070998874],"category_scores_gemma":[0.00016070699,0.000057839698,0.000044476463,0.00014315896,0.000011463076,0.0002860245,0.00009790502,0.00005529366,0.00007999272],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015621114,0.000039343893,0.00026403574,0.000007099826,0.000011885938,0.000010370073,0.0009500022,0.0064076036,0.19179966,0.41540045,0.009593236,0.37551475],"study_design_scores_gemma":[0.000019796622,0.000022292137,0.000038725608,0.0000018756394,0.0000012927376,0.0000050610824,0.00007076703,0.41962415,0.55530113,0.004615719,0.020229217,0.000069988324],"about_ca_topic_score_codex":0.000018448669,"about_ca_topic_score_gemma":0.000136663,"teacher_disagreement_score":0.6902305,"about_ca_system_score_codex":0.000020472919,"about_ca_system_score_gemma":0.00006261599,"threshold_uncertainty_score":0.23586345},"labels":[],"label_agreement":null},{"id":"W3207712481","doi":"10.5539/cis.v14n4p47","title":"Six-in-a-Row Artificial Intelligence Design and Its Implementation Based on Java","year":2021,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Java; Table (database); Artificial intelligence; Point (geometry); Programming language; Function (biology); Machine learning; Data mining","score_opus":0.06164345851005447,"score_gpt":0.3321125309987341,"score_spread":0.27046907248867963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207712481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021874648,0.000026269106,0.9759951,0.0011144766,0.00037051388,0.00019765685,0.0000011101955,0.00005041646,0.00036976638],"genre_scores_gemma":[0.91525227,0.000030450323,0.08288983,0.0017809407,0.000029461373,0.000010000941,0.0000020965012,0.0000020689658,0.0000028558632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984495,0.00006323303,0.00043715758,0.00032056193,0.00045009152,0.00027945932],"domain_scores_gemma":[0.9990301,0.00020292673,0.00010308226,0.00025449085,0.00029553653,0.00011385771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010354926,0.00011967695,0.000111922025,0.00037523732,0.00025218262,0.0008767597,0.00046066157,0.000034108027,0.000017866323],"category_scores_gemma":[0.00010264964,0.00011530944,0.000017484092,0.0011938249,0.0001480753,0.006315839,0.0002572363,0.00010043062,0.000056902347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060459083,0.000023010505,0.00016649441,0.000011081255,9.098765e-7,0.0000042871843,0.0024610872,0.021204304,0.0004124993,0.17435594,0.000050141392,0.8013042],"study_design_scores_gemma":[0.000039025836,0.000099522455,0.0023097924,0.000022065376,8.414659e-7,0.000010276045,0.00018411303,0.9223079,0.070921,0.0036240136,0.00034965866,0.00013175518],"about_ca_topic_score_codex":0.000006518306,"about_ca_topic_score_gemma":0.0000045017864,"teacher_disagreement_score":0.9011036,"about_ca_system_score_codex":0.000050362632,"about_ca_system_score_gemma":0.00025904167,"threshold_uncertainty_score":0.8454614},"labels":[],"label_agreement":null},{"id":"W3208098475","doi":"10.32920/ryerson.14649297.v1","title":"Cops and robbers on graphs and hypergraphs","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Generalization; Vertex (graph theory); Graph; Pathwidth; Upper and lower bounds; Discrete mathematics; Line graph","score_opus":0.02848449139006236,"score_gpt":0.2701670735229927,"score_spread":0.2416825821329303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208098475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314633,0.0026927593,0.13402484,0.0038975351,0.0022366017,0.0004856382,0.000003712662,0.0005815556,0.024614105],"genre_scores_gemma":[0.960849,0.0009752832,0.036663588,0.00095578714,0.000023977405,0.000019210584,0.0000029710554,0.000012737935,0.0004974775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998398,0.00006289817,0.00023231158,0.0008440268,0.00023608906,0.00022667268],"domain_scores_gemma":[0.998807,0.00016671645,0.00007634401,0.0007367267,0.00008051573,0.00013271136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018696274,0.00023766288,0.0002627675,0.00017089931,0.000094866235,0.0006180235,0.0005671907,0.00019118305,0.000030523297],"category_scores_gemma":[0.00005449941,0.00021391215,0.00007343535,0.00018414609,0.00017370324,0.0001576759,0.0016567708,0.0003937093,0.000010796158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010064807,0.00012408893,0.007283464,0.00011252946,0.00013929601,0.00013597762,0.004345111,0.00079877203,0.0005133437,0.6952986,0.0026750495,0.2885637],"study_design_scores_gemma":[0.0002519312,0.00047186366,0.012857847,0.00087834476,0.00007969679,0.00015781012,0.0023406546,0.14811948,0.045445833,0.7820694,0.0045493203,0.0027778037],"about_ca_topic_score_codex":0.00027476365,"about_ca_topic_score_gemma":0.00016020896,"teacher_disagreement_score":0.28578588,"about_ca_system_score_codex":0.000015264039,"about_ca_system_score_gemma":0.00006643025,"threshold_uncertainty_score":0.87230843},"labels":[],"label_agreement":null},{"id":"W3208528950","doi":"10.7202/1076755ar","title":"No Such Thing as Just a Game: A Briefing on 3D-Briefing","year":2021,"lang":"en","type":"article","venue":"International Journal for Talent Development and Creativity","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mohawk College","funders":"","keywords":"Political science","score_opus":0.052744951231563524,"score_gpt":0.33944721626566093,"score_spread":0.2867022650340974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208528950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52872765,0.0002046739,0.45570567,0.0041365963,0.0026488232,0.00016312806,0.000005199917,0.000080854006,0.0083273845],"genre_scores_gemma":[0.9280297,0.00013806505,0.06466946,0.0017794867,0.00043150442,0.000026118849,0.000010247746,0.000016762388,0.0048986305],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981947,0.00005888498,0.00041185823,0.00037422866,0.00067242637,0.0002879253],"domain_scores_gemma":[0.998487,0.00037916854,0.00020092221,0.00013798273,0.0006625429,0.0001323668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055952626,0.0001819042,0.00018543997,0.00013921146,0.00038422033,0.0009117806,0.00052462256,0.000060726536,0.00008207774],"category_scores_gemma":[0.0006153658,0.00017186494,0.00009364722,0.000113884365,0.000045309313,0.0007228288,0.00026998023,0.0002588119,0.000060156886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001823175,0.000532366,0.010840147,0.00004349578,0.000541882,0.0009310562,0.01242156,0.00040299786,0.0035604704,0.08006058,0.0034655135,0.8870176],"study_design_scores_gemma":[0.001589275,0.000396785,0.013167375,0.0017923275,0.000046282195,0.0030120162,0.0014288385,0.045402475,0.23690851,0.030052517,0.6646272,0.0015764325],"about_ca_topic_score_codex":0.000027771734,"about_ca_topic_score_gemma":0.000029028453,"teacher_disagreement_score":0.8854412,"about_ca_system_score_codex":0.00020285204,"about_ca_system_score_gemma":0.0003334994,"threshold_uncertainty_score":0.8792321},"labels":[],"label_agreement":null},{"id":"W3209445097","doi":"10.1007/978-3-030-89394-1_25","title":"What Is a Game Mechanic?","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Human–computer interaction; Computer graphics (images)","score_opus":0.0310701420552602,"score_gpt":0.27770099581282276,"score_spread":0.24663085375756255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209445097","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036421363,0.002905418,0.98400253,0.0035057194,0.007105223,0.00033204744,0.000002760795,0.00021848977,0.0018913618],"genre_scores_gemma":[0.09469654,0.002594841,0.8631186,0.027501915,0.002332253,0.000043025622,0.00001055578,0.00018164399,0.009520643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99430925,0.000046523284,0.00072767364,0.0024466172,0.0015342082,0.0009357281],"domain_scores_gemma":[0.99577224,0.0005384908,0.00032697624,0.0025989232,0.0005065831,0.00025676563],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008666144,0.00067526725,0.0006887654,0.0007649722,0.00021829936,0.0026437887,0.0055071907,0.00047591547,0.00023592483],"category_scores_gemma":[0.00011659651,0.000655908,0.00025716313,0.0009615416,0.000709325,0.0021300633,0.0029466976,0.0010507351,0.00035278566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021464764,0.00002487626,0.000003879089,0.000021826963,0.000013050931,0.00025640658,0.0023462432,0.0035105892,0.00025628685,0.0766407,0.000059276288,0.9168647],"study_design_scores_gemma":[0.00006643121,0.00013065129,0.000003990106,0.0009059546,0.00000856428,0.00013472718,0.0000017567137,0.42335182,0.03243177,0.53264683,0.0093889,0.0009286126],"about_ca_topic_score_codex":0.000025046877,"about_ca_topic_score_gemma":0.00010460206,"teacher_disagreement_score":0.9159361,"about_ca_system_score_codex":0.0003850482,"about_ca_system_score_gemma":0.00093289133,"threshold_uncertainty_score":0.9998735},"labels":[],"label_agreement":null},{"id":"W3210132316","doi":"10.1145/3472538.3472543","title":"Towards Disambiguating Quests as a Technical Term","year":2021,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Mitacs","keywords":"Term (time); Computer science; Data science; Work (physics); Management science; Epistemology; Engineering","score_opus":0.03950047637209457,"score_gpt":0.344814077781496,"score_spread":0.3053136014094014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210132316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049215615,0.00008274272,0.81595045,0.0045138346,0.00036741127,0.00007253475,3.1195603e-7,0.00054392655,0.1292532],"genre_scores_gemma":[0.8595376,0.000007333161,0.13758476,0.0009246246,0.00007265662,0.00001057829,6.8590873e-7,0.0000062594536,0.0018554907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988196,0.00004798887,0.00022760002,0.00037514442,0.00028152176,0.00024817852],"domain_scores_gemma":[0.999088,0.00008774517,0.000036294707,0.0005860813,0.000112633155,0.000089274705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019000431,0.00009647926,0.00011503016,0.00003263273,0.000083932624,0.0002416785,0.00068965874,0.00006076316,0.00024344282],"category_scores_gemma":[0.00044439884,0.000085200845,0.000066021545,0.00035907363,0.000056647088,0.00033429044,0.0005774287,0.00012914886,0.00054778357],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013347221,0.00010121488,0.0023390597,0.000006667474,0.0000072178273,0.0002091464,0.0006178878,0.000020070278,0.020990469,0.49299857,0.00088015106,0.4818282],"study_design_scores_gemma":[0.000080529026,0.00013139095,0.007970655,0.00008932936,0.000007685583,0.00056400045,0.00032464834,0.02525233,0.82662046,0.13287337,0.0054868134,0.0005987795],"about_ca_topic_score_codex":0.00009327082,"about_ca_topic_score_gemma":0.00009084229,"teacher_disagreement_score":0.810322,"about_ca_system_score_codex":0.000041993735,"about_ca_system_score_gemma":0.00017701458,"threshold_uncertainty_score":0.7040832},"labels":[],"label_agreement":null},{"id":"W3210590405","doi":"10.1145/3472538.3472541","title":"Leveraging Reinforcement Learning and WaveFunctionCollapse for Improved Procedural Level Generation","year":2021,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence","score_opus":0.07596874726951063,"score_gpt":0.30047813921633554,"score_spread":0.2245093919468249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210590405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011049517,0.00005071645,0.98486,0.00247679,0.00030714946,0.00019724798,1.8109789e-7,0.000097815064,0.00096058164],"genre_scores_gemma":[0.8310971,0.000019996118,0.1550064,0.00086949795,0.00019180868,0.000056497498,0.000009609699,0.0000080778445,0.01274098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919075,0.000019860254,0.00020125225,0.00030833276,0.000095338306,0.00018444033],"domain_scores_gemma":[0.9994525,0.000063146465,0.000054075474,0.00013335206,0.00024614367,0.000050810744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018628371,0.00008706421,0.00008739337,0.000038455255,0.0002599707,0.0002681795,0.000103263876,0.000034741795,0.000031212592],"category_scores_gemma":[0.00020152444,0.00008207581,0.00003217035,0.00014573222,0.000017386832,0.00041556603,0.0001276158,0.00006460911,0.0000073225474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017899496,0.0000464968,0.00043414335,0.000050980827,0.00004810796,0.000004936927,0.0037553257,0.017010761,0.37747598,0.075486995,0.0045582256,0.5211102],"study_design_scores_gemma":[0.00008384933,0.000057266185,0.000027987086,0.0000047906788,0.0000030589138,0.0000111160325,0.00027493952,0.7853811,0.20488705,0.00093169056,0.008235822,0.00010133336],"about_ca_topic_score_codex":0.000022865313,"about_ca_topic_score_gemma":0.00004375938,"teacher_disagreement_score":0.8298536,"about_ca_system_score_codex":0.00004970162,"about_ca_system_score_gemma":0.00012237931,"threshold_uncertainty_score":0.33469543},"labels":[],"label_agreement":null},{"id":"W3212380924","doi":"","title":"Monte Carlo Tree Search With Iteratively Refining State Abstractions","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Refining (metallurgy); Computer science; Monte Carlo method; Tree (set theory); State (computer science); Parallel computing; Theoretical computer science; Algorithm; Mathematics; Statistics","score_opus":0.04253105902072312,"score_gpt":0.2895440876454856,"score_spread":0.2470130286247625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212380924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41202033,0.00042838126,0.56949526,0.0015572289,0.0010536646,0.00031441104,0.000015449801,0.00078893814,0.01432638],"genre_scores_gemma":[0.99483806,0.0000039301235,0.003721611,0.00017140832,0.000048847323,0.000034470995,0.0000050614376,0.000007664425,0.0011689499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983795,0.0000747462,0.0005437549,0.00020500038,0.00050577126,0.00029122405],"domain_scores_gemma":[0.998418,0.00006902464,0.00025930782,0.00028773188,0.0008762775,0.000089712325],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00025441853,0.00014906743,0.00016420281,0.00014423797,0.0003925211,0.0021317387,0.0003424363,0.00004762394,0.0000046971822],"category_scores_gemma":[0.00004911296,0.00012309704,0.000031570242,0.00057807664,0.000051146482,0.0076477756,0.00007972945,0.00024484546,0.00011521058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031655964,0.000053103937,0.001357085,0.0004276021,0.000037086593,0.00007770187,0.042006128,0.40919173,0.0014185976,0.004745458,0.0006016197,0.54005224],"study_design_scores_gemma":[0.00010726374,0.00007130306,0.00093309366,0.00019685352,0.0000041867697,0.00026956227,0.0031652802,0.98265153,0.0069050244,0.00002645117,0.005436707,0.00023276826],"about_ca_topic_score_codex":0.00016124941,"about_ca_topic_score_gemma":0.00005614921,"teacher_disagreement_score":0.58281773,"about_ca_system_score_codex":0.00008136732,"about_ca_system_score_gemma":0.00028762995,"threshold_uncertainty_score":0.99890417},"labels":[],"label_agreement":null},{"id":"W3213405822","doi":"10.1007/978-3-030-87094-2_10","title":"Centralised and Decentralised Control of Video Game Agents","year":2021,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Controller (irrigation); Sandbox (software development); Control (management); Artificial intelligence; Deep neural networks; Artificial neural network; Decentralised system; Game theory; Mathematics; Mathematical economics","score_opus":0.025480134763311842,"score_gpt":0.28093818667151416,"score_spread":0.2554580519082023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213405822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028977573,0.13729498,0.8333021,0.00012256124,0.0032059809,0.0011746184,0.000027068998,0.00012277052,0.021852208],"genre_scores_gemma":[0.97856605,0.014582656,0.001913424,0.00013305798,0.00019835196,0.000009364411,0.000008017516,0.000047001227,0.0045420974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669325,0.00010474709,0.001351862,0.0008992252,0.00045537035,0.0004955212],"domain_scores_gemma":[0.9976948,0.0006019364,0.00075479347,0.00056010793,0.00021641298,0.00017196151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047011173,0.00046802274,0.0009863372,0.0002345082,0.00008159011,0.00021224705,0.0006291786,0.0002448796,0.000022290324],"category_scores_gemma":[0.0000872504,0.00046638082,0.00013046968,0.00011565493,0.00023202936,0.00037689955,0.0003711046,0.00036125112,0.0000068714958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026517177,0.000051222127,0.0023254834,0.0007381509,0.00012185348,0.0001504521,0.0018219717,0.0112230275,0.00006693174,0.8055273,0.0000532786,0.17789376],"study_design_scores_gemma":[0.0010061396,0.00036411485,0.00031310684,0.012807385,0.00012540974,0.00024467966,0.0010843173,0.6817559,0.00252474,0.035062037,0.26240438,0.0023077843],"about_ca_topic_score_codex":0.00008790046,"about_ca_topic_score_gemma":0.000037352303,"teacher_disagreement_score":0.97566825,"about_ca_system_score_codex":0.00009557658,"about_ca_system_score_gemma":0.000070447255,"threshold_uncertainty_score":0.9997788},"labels":[],"label_agreement":null},{"id":"W3217023043","doi":"10.48550/arxiv.2111.10351","title":"All passable games are realizable as monotone set coloring games","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Monotone polygon; Converse; Combinatorics; Mathematics; Set (abstract data type); Class (philosophy); Equivalence (formal languages); Combinatorial game theory; Discrete mathematics; Function (biology); Computer science; Game theory; Sequential game; Artificial intelligence; Mathematical economics","score_opus":0.13502549151371732,"score_gpt":0.2376427271576792,"score_spread":0.10261723564396188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217023043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65731,0.00028013613,0.33008564,0.00043272797,0.0011432103,0.00045349612,0.000020578162,0.0006483556,0.009625887],"genre_scores_gemma":[0.9865206,0.0006747508,0.0025434864,0.00034262476,0.0001257962,0.00000662288,0.00003014465,0.00004283615,0.009713175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961955,0.00027048143,0.000427581,0.0020409469,0.0002455472,0.000819941],"domain_scores_gemma":[0.99611205,0.00021584542,0.0005381428,0.0023591146,0.0004410594,0.00033377417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040032744,0.00055717345,0.00068982976,0.00032300796,0.00024042824,0.0006436441,0.0031437723,0.0005107869,0.00019364992],"category_scores_gemma":[0.00018150613,0.00069162395,0.00035726724,0.0008937114,0.00022014737,0.00096176506,0.0044714543,0.00088659435,0.00039833208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007992172,0.00039310774,0.010478315,0.00031970363,0.0005723828,0.005379797,0.003508409,0.6578081,0.00066969084,0.3132524,0.006248128,0.001290059],"study_design_scores_gemma":[0.00035447918,0.00015317247,0.0008521468,0.0010269232,0.00020727738,0.000038330865,0.0052386182,0.7816857,0.03369198,0.15039392,0.024077749,0.002279686],"about_ca_topic_score_codex":0.0030070795,"about_ca_topic_score_gemma":0.00048437735,"teacher_disagreement_score":0.32921058,"about_ca_system_score_codex":0.00045855297,"about_ca_system_score_gemma":0.00045875646,"threshold_uncertainty_score":0.9995535},"labels":[],"label_agreement":null},{"id":"W32244064","doi":"10.3233/978-1-58603-891-5-545","title":"Using abstraction in Two-Player Games","year":2008,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Abstraction; Computer science; Programming language; Philosophy; Epistemology","score_opus":0.09120023660139707,"score_gpt":0.3326332818332446,"score_spread":0.2414330452318475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32244064","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021358742,0.0016802532,0.9559802,0.00023837447,0.0006022499,0.0008198052,0.000011367738,0.00009657681,0.04035762],"genre_scores_gemma":[0.45602512,0.021604704,0.47247332,0.000997183,0.0026437165,0.0011296017,0.000096121265,0.00035438855,0.044675864],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972706,0.000029105235,0.0010166888,0.0009377694,0.00031961506,0.00042625316],"domain_scores_gemma":[0.9986361,0.000117067975,0.00031483365,0.000706663,0.00010573291,0.00011954827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028412908,0.00039132158,0.00047405084,0.0007991416,0.00020081141,0.00015834243,0.0007969765,0.00029050067,0.000040497172],"category_scores_gemma":[0.000026559532,0.00045134343,0.00010537452,0.00034390867,0.00040112925,0.0004906375,0.00018063089,0.0006970615,0.00015117817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012068571,0.00008936488,0.0002902774,0.000018541105,0.000017255443,0.00003323301,0.0007863377,0.007945085,0.000104585706,0.40421256,0.00059892464,0.5858917],"study_design_scores_gemma":[0.000026881702,0.000033052067,0.000049369675,0.00019952407,0.000018618714,0.000043652595,0.0004251328,0.16088663,0.0035511437,0.7671156,0.0668024,0.00084801717],"about_ca_topic_score_codex":0.00025878125,"about_ca_topic_score_gemma":0.0004898088,"teacher_disagreement_score":0.5850437,"about_ca_system_score_codex":0.00025055112,"about_ca_system_score_gemma":0.00015853958,"threshold_uncertainty_score":0.9997938},"labels":[],"label_agreement":null},{"id":"W331118651","doi":"10.1007/978-3-642-44973-4_41","title":"Using Racing to Automatically Configure Algorithms for Scaling Performance","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scaling; Computer science; Algorithm; Mathematics; Geometry","score_opus":0.06047288991167197,"score_gpt":0.3144251707782464,"score_spread":0.2539522808665744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W331118651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009232372,0.00010764298,0.9934374,0.00060515065,0.0022149002,0.0011953212,0.000004215093,0.00025547374,0.0012566267],"genre_scores_gemma":[0.07273468,0.0000068508366,0.92466223,0.0016197112,0.0006148327,0.00003202757,0.0000016352382,0.000049328934,0.00027872637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537003,0.000025332683,0.0008594704,0.0016822544,0.0010135982,0.0010492859],"domain_scores_gemma":[0.9965932,0.0007916806,0.00031432704,0.0013309825,0.0006530176,0.0003167905],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00116089,0.00060996413,0.00066155486,0.0008358314,0.0004924616,0.0011123262,0.0037782597,0.00036362096,0.00004111999],"category_scores_gemma":[0.00023564966,0.0005691089,0.00016019137,0.00063605857,0.0005276129,0.001004863,0.0011985824,0.0006224301,0.00017748293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003155497,0.000011986166,0.000011655932,0.0000614312,0.000007940731,0.000009506985,0.0010906734,0.18323037,0.00060697924,0.010198499,0.000016100299,0.8047517],"study_design_scores_gemma":[0.000064086635,0.00015171536,0.00001793741,0.0007616855,0.000007866273,0.000040209477,5.2472745e-7,0.9369589,0.011144044,0.049553435,0.0006280443,0.00067153573],"about_ca_topic_score_codex":0.000030209554,"about_ca_topic_score_gemma":0.000012204865,"teacher_disagreement_score":0.8040802,"about_ca_system_score_codex":0.0004282118,"about_ca_system_score_gemma":0.0006239298,"threshold_uncertainty_score":0.9999246},"labels":[],"label_agreement":null},{"id":"W33532729","doi":"10.1609/aiide.v3i1.18798","title":"A Demonstration of ScriptEase Motivational Ambient and Latent Behaviors for Computer RPGs","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Guard (computer science); Computer science; Human–computer interaction; Behavior change; Animal behavior; Mechanism (biology); Generative grammar; Psychology; Artificial intelligence; Social psychology; Programming language","score_opus":0.04693422229450893,"score_gpt":0.2950233241174653,"score_spread":0.24808910182295635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33532729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72355527,0.000009556256,0.27405208,0.000790991,0.0002563353,0.0005699762,0.000018001068,0.000019835818,0.00072797947],"genre_scores_gemma":[0.9972841,0.000012566976,0.0024147579,0.00014069634,0.00003830773,0.000026883441,0.00000234639,0.000008664698,0.00007165637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982035,0.0000077530185,0.0007064526,0.00043688118,0.0003773272,0.0002680954],"domain_scores_gemma":[0.99846613,0.00019874285,0.00044061395,0.00014126141,0.00065028487,0.00010295094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003556014,0.00021634038,0.00024158426,0.00016160248,0.000099168115,0.00027660542,0.0005016889,0.00006153793,0.000007204943],"category_scores_gemma":[0.00014504007,0.00016750945,0.00011349133,0.00018240472,0.00035860154,0.00096273824,0.0003009342,0.0001430085,0.0000030175543],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041201912,0.00072573166,0.0075977985,0.000062446365,0.00005859603,7.3415623e-7,0.004150129,0.000047159385,0.06687048,0.6299285,0.00006257359,0.29008383],"study_design_scores_gemma":[0.00006234253,0.0010749104,0.0034360194,0.00035276567,0.000019003708,0.000008662293,0.002117882,0.044147268,0.9138007,0.034678932,0.0000667338,0.00023476731],"about_ca_topic_score_codex":0.000022380762,"about_ca_topic_score_gemma":0.0000066063676,"teacher_disagreement_score":0.8469302,"about_ca_system_score_codex":0.000063006875,"about_ca_system_score_gemma":0.00003439931,"threshold_uncertainty_score":0.6830838},"labels":[],"label_agreement":null},{"id":"W342532617","doi":"10.1007/978-3-642-40787-1_23","title":"Runtime Monitoring of Temporal Logic Properties in a Platform Game","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Temporal logic; Video game; Context (archaeology); Set (abstract data type); Video game development; Programming language; Human–computer interaction; Game design; Multimedia","score_opus":0.060071991616505886,"score_gpt":0.2713337788102536,"score_spread":0.21126178719374772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W342532617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008355944,0.00074420695,0.98624617,0.00035399658,0.0016610309,0.00059994793,0.0000012892011,0.00012197793,0.0019154516],"genre_scores_gemma":[0.80617416,0.00003680469,0.19302669,0.00013747315,0.00025057004,0.00001687833,5.74313e-7,0.000024834331,0.00033202016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613,0.000024422203,0.0009142683,0.0012094434,0.0010027725,0.00071908685],"domain_scores_gemma":[0.99774116,0.0002689424,0.00041133858,0.0012121241,0.00024592067,0.00012052831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000726785,0.0005092863,0.0006816968,0.0010544622,0.00009049864,0.00036984135,0.0038516975,0.0003407114,0.000032692285],"category_scores_gemma":[0.00012621183,0.00042027212,0.00012506518,0.000686014,0.0010368619,0.0011795281,0.0015030197,0.00080071506,0.00011097955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013865931,0.00011168966,0.004251412,0.00013879158,0.000015828342,0.00012031779,0.006110967,0.057599172,0.0014745687,0.03173971,0.0000082342885,0.89841545],"study_design_scores_gemma":[0.00014120791,0.00034802666,0.0008425454,0.001814954,0.0000053033427,0.00004295102,0.000002858015,0.5530645,0.044400938,0.39805475,0.00026723108,0.0010147139],"about_ca_topic_score_codex":0.00026071927,"about_ca_topic_score_gemma":0.00008201214,"teacher_disagreement_score":0.89740074,"about_ca_system_score_codex":0.00030849368,"about_ca_system_score_gemma":0.00045778617,"threshold_uncertainty_score":0.9998249},"labels":[],"label_agreement":null},{"id":"W36765866","doi":"10.1007/978-3-642-25289-1_45","title":"The Reading Glove: A Non-linear Adaptive Tangible Narrative","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Narrative; Computer science; Reading (process); Human–computer interaction; Multimedia; World Wide Web; Art; Literature; Linguistics","score_opus":0.039695281977111904,"score_gpt":0.28251665902655115,"score_spread":0.24282137704943924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36765866","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000559123,0.0003878012,0.98311806,0.00072573713,0.0025100408,0.0005359701,0.0000028438571,0.00015475949,0.012508868],"genre_scores_gemma":[0.3386822,0.00026560551,0.65071523,0.0022800723,0.0017098465,0.000059421443,0.0000029277633,0.00012413858,0.006160572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955598,0.000058307578,0.0006845604,0.0016453499,0.0010725113,0.0009794786],"domain_scores_gemma":[0.99583817,0.0011117401,0.00045495067,0.0018705215,0.000522984,0.00020162553],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013735023,0.0006307155,0.00053624436,0.0004875195,0.0009536379,0.0006350187,0.0059788916,0.0003426074,0.000025610952],"category_scores_gemma":[0.00021655617,0.0004574891,0.00018407834,0.0008428751,0.0019027295,0.00085975457,0.0019990327,0.001143598,0.00024443652],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028277691,0.000033036027,0.000033728906,0.000011531462,0.000038691545,0.0001439309,0.02644034,0.01337758,0.00014106382,0.13204941,0.00014595625,0.82755643],"study_design_scores_gemma":[0.00007478071,0.0003629603,0.000024856732,0.0003956342,0.000009033128,0.00005887421,0.000007691645,0.527301,0.008484472,0.45887697,0.003569974,0.0008337305],"about_ca_topic_score_codex":0.00010318528,"about_ca_topic_score_gemma":0.0002833808,"teacher_disagreement_score":0.82672274,"about_ca_system_score_codex":0.0003948919,"about_ca_system_score_gemma":0.0007495941,"threshold_uncertainty_score":0.9997877},"labels":[],"label_agreement":null},{"id":"W37506165","doi":"10.3233/978-1-58603-891-5-899","title":"Thinking Too Much: Pathology in Pathfinding","year":2008,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Computer science; Minimax; Artificial intelligence; Space (punctuation); Machine learning; Theoretical computer science; Mathematical economics; Mathematics; Shortest path problem","score_opus":0.056077969787500834,"score_gpt":0.2815865030586567,"score_spread":0.22550853327115583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37506165","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011412219,0.0026118949,0.93648535,0.0008015715,0.0006907189,0.0008905464,0.000016494281,0.00013822076,0.058251068],"genre_scores_gemma":[0.29114634,0.057803188,0.5519824,0.0044200593,0.0029534437,0.0028833402,0.00017366724,0.0005328756,0.088104665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967769,0.00004858183,0.0011216755,0.0011274214,0.00037589343,0.00054954836],"domain_scores_gemma":[0.9984172,0.00019038052,0.0003142353,0.0008612281,0.00009427336,0.00012267653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000541937,0.0004326085,0.0005896921,0.0009116717,0.00029208825,0.00018717154,0.0015340794,0.0005290113,0.000031987816],"category_scores_gemma":[0.000057435736,0.0004908877,0.00011859283,0.0004018623,0.0005205507,0.00036285713,0.0004482648,0.0008828689,0.00017448602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004260382,0.000038835627,0.00017324767,0.000010456307,0.0000067288447,0.00007439202,0.0016428297,0.00019991823,0.000015420328,0.56576884,0.0006177254,0.43144733],"study_design_scores_gemma":[0.000014604673,0.00004270402,0.000037709447,0.00012761974,0.000008457997,0.000039220937,0.0004663906,0.011873499,0.001005538,0.93203884,0.0537701,0.0005753387],"about_ca_topic_score_codex":0.00003925579,"about_ca_topic_score_gemma":0.00019323728,"teacher_disagreement_score":0.430872,"about_ca_system_score_codex":0.00019965647,"about_ca_system_score_gemma":0.00014567292,"threshold_uncertainty_score":0.99975425},"labels":[],"label_agreement":null},{"id":"W38091009","doi":"10.1609/aiide.v2i1.18766","title":"A Demonstration of ScriptEase Ambient and PC-Interactive Behavior Generation for Computer Role-Playing Games","year":2006,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Human–computer interaction; Guard (computer science); Set (abstract data type); Character (mathematics); Code (set theory); Multimedia; Game programming; Game design; Game Developer; Programming language; Game design document","score_opus":0.041771905695404385,"score_gpt":0.28139247581554977,"score_spread":0.23962057012014537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38091009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8592395,0.000027679647,0.13743086,0.00058691815,0.00034210482,0.0009398378,0.000034546094,0.0000307546,0.0013677534],"genre_scores_gemma":[0.9973012,0.000016204502,0.00224781,0.00009820065,0.00009654061,0.00012843333,0.000006131784,0.000012959369,0.00009250258],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99798065,0.000018302959,0.00077002426,0.00058897433,0.00036023112,0.00028180942],"domain_scores_gemma":[0.9982882,0.00015796543,0.00059356855,0.0001806463,0.0007030021,0.00007657424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020593777,0.0002864587,0.00031809276,0.0001743849,0.00014962314,0.0005905736,0.00050406164,0.00007298747,0.000007770516],"category_scores_gemma":[0.00010960665,0.00022875138,0.00014133238,0.0001694782,0.00032308826,0.0015575828,0.00029384502,0.000168471,0.00000397948],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033182884,0.0009449891,0.003692348,0.000058237278,0.00006373598,9.424877e-7,0.0037426723,0.00011685744,0.3770379,0.3612965,0.0001231242,0.25259086],"study_design_scores_gemma":[0.000055485503,0.0007281533,0.0006882323,0.00024503266,0.00002827714,0.000009712169,0.0019589765,0.21536706,0.76492697,0.01572082,0.000047863225,0.00022341403],"about_ca_topic_score_codex":0.00010049102,"about_ca_topic_score_gemma":0.000021496253,"teacher_disagreement_score":0.38788906,"about_ca_system_score_codex":0.00008579757,"about_ca_system_score_gemma":0.00004016306,"threshold_uncertainty_score":0.93282104},"labels":[],"label_agreement":null},{"id":"W4200380366","doi":"10.3233/icg-210195","title":"The algebraic solvability of the novel lamplighter puzzle","year":2021,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Coset; Closing (real estate); Algebraic number; Mathematics; Solvable group; Group (periodic table); Algebra over a field; Pure mathematics; Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.027900079717678817,"score_gpt":0.26939566762589606,"score_spread":0.24149558790821724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200380366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4123789,0.00085119053,0.5487553,0.029458933,0.004388397,0.00013986927,0.0000028413813,0.00003811361,0.003986463],"genre_scores_gemma":[0.99261224,0.0000321811,0.0061442275,0.00033008843,0.00018561468,0.0000020153718,4.9430398e-8,0.0000051757643,0.0006884238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871016,0.00012399761,0.0003610714,0.00016061886,0.00040262265,0.00024154919],"domain_scores_gemma":[0.99833447,0.00035478847,0.00018971147,0.00074066996,0.0003195834,0.00006076593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007632123,0.000080321086,0.00010261275,0.000016446475,0.0005552031,0.00031390518,0.0015243887,0.00003870956,0.0000566071],"category_scores_gemma":[0.00035703022,0.000041057174,0.00016398019,0.00029331588,0.00019048621,0.00025238137,0.00042807587,0.0003237992,0.00002721787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025977542,0.0007138064,0.040051755,0.000026402331,0.00021385847,0.000051207582,0.007921971,0.0012918543,0.08696963,0.64712024,0.014707427,0.20090586],"study_design_scores_gemma":[0.00020795496,0.00006998662,0.059462912,0.00009583842,0.000022945487,0.001299851,0.0008053075,0.013000323,0.5401076,0.25088185,0.1337182,0.00032723154],"about_ca_topic_score_codex":0.0000071979957,"about_ca_topic_score_gemma":0.00007937051,"teacher_disagreement_score":0.58023334,"about_ca_system_score_codex":0.000037938204,"about_ca_system_score_gemma":0.00022277769,"threshold_uncertainty_score":0.42702296},"labels":[],"label_agreement":null},{"id":"W4205189070","doi":"10.1109/cog52621.2021.9619036","title":"Distance-Based Mapping for General Game Playing","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Leverage (statistics); Computer science; Monte Carlo tree search; Baseline (sea); Transfer of learning; Artificial intelligence; Machine learning; Tree (set theory); Field (mathematics); Domain (mathematical analysis); Theoretical computer science; Variety (cybernetics); Monte Carlo method; Mathematics","score_opus":0.08915975512236211,"score_gpt":0.30740029288528287,"score_spread":0.21824053776292074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205189070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035061546,0.0002590852,0.9549861,0.003468989,0.0017849634,0.00044361918,0.000025310108,0.00019283817,0.0037775831],"genre_scores_gemma":[0.9154891,0.00005234963,0.079001546,0.0012251909,0.00046627765,0.0002500427,0.000021180347,0.0000374605,0.0034568498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969303,0.00014060465,0.00056121574,0.0011054431,0.00049607916,0.0007663392],"domain_scores_gemma":[0.99740887,0.0004373454,0.00021323194,0.0011475465,0.000577146,0.0002158758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031084556,0.00037295703,0.00044535825,0.00016134702,0.0002330413,0.00068725273,0.0011817835,0.00016027746,0.00031285873],"category_scores_gemma":[0.0003006057,0.0003829439,0.0002563001,0.00059677777,0.00015096091,0.00040458093,0.00014723011,0.00030416658,0.00024811705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010422656,0.00043256485,0.0012760647,0.00017428496,0.00015981567,0.0002544638,0.003068294,0.0067469333,0.08226391,0.5587771,0.0046512284,0.34209108],"study_design_scores_gemma":[0.00039212717,0.00016631148,0.0005529146,0.00033309648,0.00002405922,0.000010204037,0.00037775649,0.8091862,0.14824541,0.018405128,0.021557966,0.0007488173],"about_ca_topic_score_codex":0.000025821104,"about_ca_topic_score_gemma":0.00009931659,"teacher_disagreement_score":0.88042754,"about_ca_system_score_codex":0.00010234437,"about_ca_system_score_gemma":0.00067292847,"threshold_uncertainty_score":0.99986225},"labels":[],"label_agreement":null},{"id":"W4205202743","doi":"10.1007/s00182-015-0489-3","title":"Building Nim","year":2015,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Security token; Simple (philosophy); State (computer science); Sequential game; Extensive-form game; Repeated game; Stack (abstract data type); Combinatorial game theory","score_opus":0.047897129096536234,"score_gpt":0.3434468646214678,"score_spread":0.2955497355249316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205202743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062272877,0.00028473797,0.9271461,0.0018938518,0.0036088307,0.000023965367,6.120403e-7,0.00003040813,0.0047386177],"genre_scores_gemma":[0.95208913,0.000013772571,0.046499938,0.0004961025,0.00064023974,5.7140795e-7,9.3175714e-8,0.0000064448354,0.00025370784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985396,0.00011917829,0.00040195862,0.000105196785,0.00070471765,0.00012932756],"domain_scores_gemma":[0.99818283,0.00023730696,0.0003247737,0.00016973149,0.00094888255,0.00013646169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015563548,0.00008030967,0.00012114087,0.00023009095,0.000014654467,0.0001626185,0.002097329,0.000034387762,0.000032139793],"category_scores_gemma":[0.00075453904,0.00006696536,0.000098334036,0.00011004183,0.00007259312,0.0008091807,0.00022376684,0.00017645722,0.000103913946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078908626,0.0000588051,0.00025305452,6.45183e-7,0.00007628215,0.00018791128,0.0017448382,0.0012450254,0.0013435986,0.7938213,0.0012692544,0.19992039],"study_design_scores_gemma":[0.00018827744,0.00013696821,0.00014661525,0.000051248986,0.000005869833,0.00062333944,0.0002408506,0.0039411327,0.023769213,0.9477659,0.023015916,0.00011465326],"about_ca_topic_score_codex":0.0000043909217,"about_ca_topic_score_gemma":6.8041936e-7,"teacher_disagreement_score":0.8898163,"about_ca_system_score_codex":0.0001265799,"about_ca_system_score_gemma":0.00016485919,"threshold_uncertainty_score":0.38973936},"labels":[],"label_agreement":null},{"id":"W4205289263","doi":"10.1109/cog52621.2021.9618995","title":"Fast Synthesis of Algebraic Heuristic Functions for Video-game Pathfinding","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Canadian Institute for Advanced Research","keywords":"Pathfinding; Heuristics; Computer science; Heuristic; Theoretical computer science; Artificial intelligence","score_opus":0.05611867388054921,"score_gpt":0.2903794738554877,"score_spread":0.23426079997493848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205289263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039501403,0.00025950276,0.9489037,0.001743973,0.0023071805,0.00054875104,0.00010988807,0.00017088439,0.0064547155],"genre_scores_gemma":[0.98734546,0.00006212419,0.009596846,0.00026291274,0.00019928333,0.00025843593,0.0000075631556,0.000031410145,0.0022359672],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971681,0.0001799896,0.0006810426,0.0009233753,0.0004686312,0.00057882984],"domain_scores_gemma":[0.996135,0.001451244,0.00031840327,0.001163405,0.0007374281,0.00019451979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037822302,0.0003290667,0.0005397651,0.00023207054,0.00017279445,0.0003021188,0.001023233,0.00014626674,0.00057177857],"category_scores_gemma":[0.00159908,0.0003345005,0.00029177213,0.00070337625,0.00020376916,0.00037464066,0.00019506224,0.00026928345,0.00038001387],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085986685,0.00067314727,0.00056907866,0.00023969835,0.00031352422,0.0001401293,0.0029396801,0.0024136147,0.053901516,0.26332316,0.0046927775,0.6707077],"study_design_scores_gemma":[0.00038178245,0.00062483724,0.0009534816,0.0010927896,0.00024440186,0.00005801636,0.0021427714,0.25045228,0.67780703,0.056505572,0.008415046,0.0013220153],"about_ca_topic_score_codex":0.000032270713,"about_ca_topic_score_gemma":0.00008361215,"teacher_disagreement_score":0.947844,"about_ca_system_score_codex":0.00006261675,"about_ca_system_score_gemma":0.00053059065,"threshold_uncertainty_score":0.9999107},"labels":[],"label_agreement":null},{"id":"W4205304251","doi":"10.25071/2291-5796.100","title":"Deceitful Stories","year":2021,"lang":"en","type":"article","venue":"Witness The Canadian Journal of Critical Nursing Discourse","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Geology","score_opus":0.03543860733696044,"score_gpt":0.35315469765591406,"score_spread":0.31771609031895365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205304251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05754844,0.0039715427,0.59336215,0.3309277,0.009102615,0.000080462545,0.0000072027224,0.00002933054,0.0049705673],"genre_scores_gemma":[0.99331534,0.0000040699447,0.0054971385,0.0005994887,0.00042489832,9.956938e-7,2.8778476e-7,0.000011510538,0.0001462669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836653,0.00018723359,0.0003764383,0.00017340852,0.0004082958,0.00048807298],"domain_scores_gemma":[0.9975795,0.0003851944,0.00008591926,0.00045801827,0.0008309943,0.00066032924],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004913183,0.00012942108,0.00021009761,0.00011416246,0.00060074823,0.00053998205,0.001131699,0.000067568995,0.00007882227],"category_scores_gemma":[0.0015071329,0.0000949661,0.00012897007,0.0004074256,0.00370139,0.0007136407,0.000025151396,0.0004037044,0.000021678248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042094493,0.00005705381,0.00020187208,0.0000063068296,0.000013684989,0.0008356203,0.004992564,0.00016928722,0.00008514816,0.9640397,0.0018377939,0.027756805],"study_design_scores_gemma":[0.0001383563,0.00017105929,0.0018472491,0.00069664017,0.00010846405,0.0032525398,0.009439759,0.0029346128,0.01151746,0.96310514,0.006343621,0.0004451196],"about_ca_topic_score_codex":0.0005425335,"about_ca_topic_score_gemma":0.009459401,"teacher_disagreement_score":0.9357669,"about_ca_system_score_codex":0.00022938853,"about_ca_system_score_gemma":0.0030163398,"threshold_uncertainty_score":0.99900997},"labels":[],"label_agreement":null},{"id":"W4205573038","doi":"10.22215/etd/2021-14680","title":"Vector Embedding Techniques for Player Behaviour in DOTA 2","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Embedding; Personalization; Dimension (graph theory); Computer science; Theoretical computer science; Artificial neural network; Algorithm; Mathematics; Machine learning; Artificial intelligence; Combinatorics","score_opus":0.030931677661355638,"score_gpt":0.35880349065564077,"score_spread":0.32787181299428514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205573038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12876746,0.000662835,0.8288332,0.00058994885,0.005285879,0.002388815,0.000021161315,0.0012471712,0.03220349],"genre_scores_gemma":[0.5287079,0.000067117195,0.41875744,0.00028281915,0.00038106303,0.0010388552,0.0003542747,0.00009006599,0.05032043],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985142,0.000028219312,0.00040103536,0.0005536397,0.00021781241,0.00028514487],"domain_scores_gemma":[0.99903804,0.00015436279,0.00012639789,0.00044380597,0.00019311946,0.000044285676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021514403,0.00020873798,0.0002696361,0.0002291158,0.000059622067,0.00024116751,0.0008353529,0.00027752307,0.00009053727],"category_scores_gemma":[0.00013115686,0.00020900377,0.00012290069,0.0002928934,0.0000102917265,0.0002796479,0.00007620682,0.00022887783,0.000018912255],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008199623,0.00063003966,0.0034220808,0.00051257625,0.000070790724,0.00023079847,0.018873924,0.0001138069,0.031060018,0.23164725,0.019431302,0.69392544],"study_design_scores_gemma":[0.00005268776,0.00011193571,0.0014768658,0.0004958405,0.000018485578,0.00000599016,0.0024688717,0.020547861,0.9616188,0.0083606765,0.004037118,0.0008049045],"about_ca_topic_score_codex":0.00026286155,"about_ca_topic_score_gemma":0.0030094585,"teacher_disagreement_score":0.93055874,"about_ca_system_score_codex":0.00008439236,"about_ca_system_score_gemma":0.0001711355,"threshold_uncertainty_score":0.85229266},"labels":[],"label_agreement":null},{"id":"W4205726258","doi":"10.1109/cog52621.2021.9619156","title":"Sneak-Attacks in StarCraft using Influence Maps with Heuristic Search","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Adversary; Computer science; Heuristic; Surprise; Artificial intelligence; Computer security; Communication","score_opus":0.07225577831102707,"score_gpt":0.32365972907347046,"score_spread":0.2514039507624434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205726258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78932387,0.00024766324,0.20382594,0.0015428485,0.00055892376,0.0004883167,0.000020615098,0.00014441933,0.0038474048],"genre_scores_gemma":[0.98178625,0.00009787753,0.016651237,0.00046526256,0.0000937907,0.000037384478,0.0000057297125,0.000032613905,0.0008298522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960501,0.00035548478,0.00058394467,0.0012316131,0.00087557605,0.0009032684],"domain_scores_gemma":[0.99709076,0.00036226705,0.00014039002,0.0013919343,0.00075430557,0.00026033484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044472262,0.0004055506,0.00048772446,0.00030403616,0.00015888659,0.00067180506,0.0014105833,0.00016159784,0.0003489085],"category_scores_gemma":[0.00026057713,0.000382619,0.000084247404,0.001469994,0.00034458152,0.00074792455,0.00037296684,0.0007195782,0.00041268815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005206913,0.002180156,0.066261284,0.00052852504,0.00038814353,0.012160568,0.02369325,0.31908607,0.116580784,0.17780602,0.0013470263,0.27944747],"study_design_scores_gemma":[0.00088885287,0.00089824246,0.009972721,0.0020608276,0.00006019834,0.00024559812,0.0026938336,0.7768161,0.18764246,0.014289349,0.002262153,0.0021696573],"about_ca_topic_score_codex":0.00041718577,"about_ca_topic_score_gemma":0.0007780424,"teacher_disagreement_score":0.45773003,"about_ca_system_score_codex":0.00015984183,"about_ca_system_score_gemma":0.001310329,"threshold_uncertainty_score":0.99986255},"labels":[],"label_agreement":null},{"id":"W4206122739","doi":"10.1109/cog52621.2021.9619054","title":"Skeleton-based multi-agent opponent search","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Adversary; Exploit; Position (finance); Artificial intelligence; Theoretical computer science; Computer security","score_opus":0.12701246810322508,"score_gpt":0.3382705832425499,"score_spread":0.2112581151393248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206122739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04788362,0.0004350751,0.93270236,0.008479133,0.0026563539,0.00060682883,0.000025906396,0.00033208073,0.0068786205],"genre_scores_gemma":[0.96328586,0.00013022716,0.028942086,0.0015133513,0.00021627557,0.000103824,0.000014883687,0.000037067814,0.0057564494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593437,0.00039833307,0.0005747219,0.0012822698,0.000943891,0.0008664135],"domain_scores_gemma":[0.99660635,0.00035352033,0.00013633198,0.0017405594,0.0007634897,0.00039977644],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00048268487,0.00041571032,0.00044212944,0.00021385563,0.00021904784,0.00066914334,0.0016897855,0.00018883079,0.0015701752],"category_scores_gemma":[0.00023917302,0.000409505,0.0002496712,0.0007623745,0.00022514716,0.00032555455,0.00034139925,0.00055291527,0.0028976456],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084729356,0.0022817743,0.0014918437,0.0001433111,0.00023564743,0.0019123874,0.003947945,0.019829813,0.10398214,0.116654195,0.0072531956,0.742183],"study_design_scores_gemma":[0.00034572624,0.00021893656,0.0008015219,0.00020486108,0.00002103282,0.000013700586,0.00042308858,0.60147357,0.38623625,0.0010312073,0.00857878,0.0006513044],"about_ca_topic_score_codex":0.00011894476,"about_ca_topic_score_gemma":0.00015603159,"teacher_disagreement_score":0.91540223,"about_ca_system_score_codex":0.00013607665,"about_ca_system_score_gemma":0.0011893766,"threshold_uncertainty_score":0.99983567},"labels":[],"label_agreement":null},{"id":"W4206548155","doi":"10.1007/978-3-030-92300-6_25","title":"The Applicability of Greimassian Semiotics to Meaningful Procedural Quest Generation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Semiotics; Narrative; Meaning (existential); Sketch; Computer science; Generative grammar; Context (archaeology); Focus (optics); Artificial intelligence; Epistemology; Linguistics; Philosophy; Algorithm; History","score_opus":0.03074043560171967,"score_gpt":0.28154679991902903,"score_spread":0.25080636431730935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206548155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030098224,0.00024304303,0.99168915,0.004208361,0.0014848544,0.0005219388,0.0000026694572,0.000075709155,0.0014732934],"genre_scores_gemma":[0.4560297,0.00004656597,0.54055357,0.0019002564,0.0009774199,0.000027390764,0.000004261416,0.000038522678,0.00042231605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627763,0.00005773353,0.00075264834,0.0013214409,0.0010496274,0.00054093276],"domain_scores_gemma":[0.99645877,0.0006174823,0.00032193167,0.0017631807,0.00067397987,0.0001646743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013352489,0.00038129784,0.00042799357,0.00024381647,0.0003767894,0.0006031896,0.0035263728,0.000221009,0.000007926735],"category_scores_gemma":[0.0005126479,0.00029408495,0.00012140069,0.0007595043,0.0008770134,0.00032526095,0.0015198599,0.0005766213,0.00002164643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004061704,0.000030398056,0.00006225172,0.000035207737,0.0000100138,0.000021102116,0.0017304831,0.04997642,0.0020384328,0.15493366,0.00006670469,0.79109126],"study_design_scores_gemma":[0.00004209678,0.0001903391,0.000065023516,0.00027903492,0.000008231046,0.00004801944,0.0000019491263,0.80366385,0.072964415,0.118998416,0.003131836,0.00060675957],"about_ca_topic_score_codex":0.00002651229,"about_ca_topic_score_gemma":0.00061330805,"teacher_disagreement_score":0.7904845,"about_ca_system_score_codex":0.00030753182,"about_ca_system_score_gemma":0.0008175487,"threshold_uncertainty_score":0.9999511},"labels":[],"label_agreement":null},{"id":"W4206551931","doi":"10.22215/etd/2021-14648","title":"Augmenting AI Creativity: event segmentation and AI planning for quest generation","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Event (particle physics); Segmentation; Context (archaeology); Artificial intelligence; Representation (politics); Architecture; Natural language generation; Generator (circuit theory); Conceptual architecture; Software engineering; Creativity; Narrative; Natural language processing; Natural language","score_opus":0.052704875914263725,"score_gpt":0.38070429003704054,"score_spread":0.32799941412277683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206551931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050151013,0.00046959298,0.94602776,0.0004612931,0.0011819549,0.0004775257,0.000005269372,0.00010278766,0.0011228159],"genre_scores_gemma":[0.76863945,0.0001439245,0.18705504,0.0022898926,0.0013435017,0.0007396176,0.0047198692,0.00009089935,0.034977823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985405,0.00006137942,0.00037999934,0.0005533909,0.00025580046,0.00020892426],"domain_scores_gemma":[0.99911785,0.00011911015,0.0002090419,0.00022181205,0.00028017978,0.00005201319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000302427,0.00020253316,0.00020919979,0.00012642884,0.0002614572,0.00066072354,0.00019427424,0.00014930608,0.000027294085],"category_scores_gemma":[0.00010417735,0.00021074944,0.00006588296,0.00014411866,0.000012292649,0.0006943962,0.000050351126,0.00014396916,0.000005543617],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003320327,0.00017530913,0.0019921744,0.00046962185,0.00017814345,0.000021837399,0.02523837,0.0034882678,0.09020702,0.070188604,0.010536413,0.79747105],"study_design_scores_gemma":[0.00010220847,0.00010781756,0.00042222562,0.0002703243,0.000048494436,0.000004961717,0.0026777813,0.5058204,0.48491836,0.003588085,0.0015881185,0.00045120216],"about_ca_topic_score_codex":0.00014581856,"about_ca_topic_score_gemma":0.00079051655,"teacher_disagreement_score":0.79701984,"about_ca_system_score_codex":0.00007321684,"about_ca_system_score_gemma":0.00014086577,"threshold_uncertainty_score":0.85941124},"labels":[],"label_agreement":null},{"id":"W4206945128","doi":"10.1109/ssci50451.2021.9660157","title":"The Non-Walking Triangle Optimization Representation: Enabling Monte Carlo Tree Search-like Methods for Real Parameter Optimization Problems","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"University of Guelph","keywords":"Monte Carlo method; Algorithm; Mathematics; Tree (set theory); Mathematical optimization; Computer science; Optimization problem; Representation (politics); Statistics; Combinatorics","score_opus":0.060168237930061715,"score_gpt":0.35901118599887527,"score_spread":0.29884294806881356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206945128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002620691,0.0002471553,0.9898751,0.0046416996,0.0028588218,0.0011362374,0.00001568095,0.00017130477,0.0007919399],"genre_scores_gemma":[0.0204341,0.0011679824,0.9750804,0.00037125198,0.00049620797,0.00043516443,0.00009759533,0.00007028221,0.0018470204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490595,0.0008295653,0.001281721,0.001341223,0.000892115,0.00074941333],"domain_scores_gemma":[0.9913189,0.004892383,0.0004726968,0.001006816,0.002102424,0.00020678961],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018373803,0.0004592556,0.00049678114,0.0002748168,0.0013466586,0.0017068792,0.0013223806,0.0002041133,0.000058347698],"category_scores_gemma":[0.0007785651,0.00041932595,0.0003468027,0.0017811497,0.0003170803,0.0016650917,0.000311657,0.00036588512,0.00003301411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098976685,0.00010056195,0.000015362468,0.000029033696,0.00007645498,0.00001180339,0.0023815904,0.8962946,0.0006768522,0.008814505,0.00019809627,0.09130217],"study_design_scores_gemma":[0.00013702681,0.00030882613,0.000009016653,0.00009705353,0.000029926565,0.000034461707,0.0011103338,0.9447196,0.041610304,0.010691349,0.0008165666,0.00043553204],"about_ca_topic_score_codex":0.00010029843,"about_ca_topic_score_gemma":0.00008260313,"teacher_disagreement_score":0.09086664,"about_ca_system_score_codex":0.00027323654,"about_ca_system_score_gemma":0.00058322825,"threshold_uncertainty_score":0.99995345},"labels":[],"label_agreement":null},{"id":"W4224941645","doi":"10.1145/3520273.3520277","title":"ASE4Games 2021 Workshop Summary","year":2022,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université du Québec à Chicoutimi; Centre for Social Innovation","funders":"","keywords":"Software engineering; Computer science; Software; Engineering; Programming language","score_opus":0.023032415526482285,"score_gpt":0.25155134010848534,"score_spread":0.22851892458200307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224941645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09010637,0.0032168783,0.8976934,0.0024843889,0.0036168308,0.000372022,0.000035011257,0.0024449097,0.000030201836],"genre_scores_gemma":[0.8768418,0.0000247282,0.122121446,0.00033324386,0.00018615549,0.0001311481,0.0000156208,0.000045943416,0.0002999071],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997879,0.00005766388,0.00035006224,0.0005945333,0.0005497569,0.00056896184],"domain_scores_gemma":[0.9612654,0.036617916,0.00010352936,0.0017514027,0.00008410367,0.00017767567],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003749051,0.0002802904,0.0002532341,0.00023287428,0.00032853888,0.00018166794,0.0027498652,0.000068471236,0.00049979857],"category_scores_gemma":[0.05802589,0.00032069124,0.00014299204,0.0009175433,0.00003879816,0.0004986632,0.0023938112,0.00052691053,0.0001337651],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022200893,0.00029896322,0.1102512,0.00008657468,0.00013399741,0.00046533564,0.00436602,0.20409396,0.004598443,0.011478658,0.01623579,0.6479688],"study_design_scores_gemma":[0.0012755482,0.0014090445,0.08557745,0.0007019823,0.00016763608,0.00075064827,0.0015908302,0.17450356,0.14291698,0.008986748,0.5717125,0.010407068],"about_ca_topic_score_codex":0.000035158184,"about_ca_topic_score_gemma":0.0000024422327,"teacher_disagreement_score":0.7867354,"about_ca_system_score_codex":0.00014274263,"about_ca_system_score_gemma":0.00009011238,"threshold_uncertainty_score":0.99992454},"labels":[],"label_agreement":null},{"id":"W4226285081","doi":"10.1609/aaai.v36i9.21278","title":"A Novel Approach to Solving Goal-Achieving Problems for Board Games","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Solver; Set (abstract data type); Null (SQL); Relevance (law); Adversary; Theoretical computer science; Programming language; Computer security; Data mining","score_opus":0.09993743544183452,"score_gpt":0.29884306306842945,"score_spread":0.19890562762659492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226285081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04500306,0.000053639003,0.9285732,0.0070188674,0.0012724248,0.00291819,0.000035239686,0.00032666148,0.014798718],"genre_scores_gemma":[0.930199,0.000007310255,0.06735146,0.00073659944,0.00012736671,0.0009553583,0.0000011022972,0.00004138058,0.00058039324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585885,0.00003507231,0.0010418463,0.001163296,0.001061155,0.0008397986],"domain_scores_gemma":[0.99743015,0.0002711964,0.00062783126,0.0006563127,0.0008156034,0.00019890616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015191789,0.00041984307,0.00049532886,0.00034569416,0.0010008703,0.00054016634,0.00536713,0.00008867865,0.00005042255],"category_scores_gemma":[0.0009496804,0.00036258888,0.00030776396,0.0015755197,0.0002711449,0.00058382243,0.0021265172,0.0005730616,0.000040400366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008412477,0.0004895323,0.000090828755,0.00008153879,0.000025949219,1.5746657e-7,0.006338113,0.006691675,0.14382339,0.7877712,0.00057945953,0.05402399],"study_design_scores_gemma":[0.00005523187,0.0009641689,0.000096868695,0.00023637178,0.000031772743,0.00002266314,0.0056055333,0.4438066,0.40363696,0.14103433,0.0036244835,0.00088502024],"about_ca_topic_score_codex":0.00011308384,"about_ca_topic_score_gemma":0.000012430832,"teacher_disagreement_score":0.885196,"about_ca_system_score_codex":0.00019671269,"about_ca_system_score_gemma":0.00021005532,"threshold_uncertainty_score":0.9998826},"labels":[],"label_agreement":null},{"id":"W4229076201","doi":"10.24963/ijcai.2022/538","title":"Learning Curricula for Humans: An Empirical Study with Puzzles from The Witness","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Curriculum; Computer science; Witness; Set (abstract data type); Class (philosophy); Process (computing); Artificial intelligence; Domain (mathematical analysis); Tree (set theory); Machine learning; Human–computer interaction; Programming language; Mathematics; Psychology","score_opus":0.09833545549548467,"score_gpt":0.3364742101218567,"score_spread":0.23813875462637202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229076201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8899853,0.000027402573,0.08644334,0.018216992,0.0015936595,0.0019729803,0.000045898007,0.00024165848,0.0014727677],"genre_scores_gemma":[0.9962023,0.0000088963825,0.0022717246,0.0005111501,0.00026344942,0.0005238403,0.0000064331552,0.000032373002,0.00017984114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586827,0.0001262268,0.000930643,0.0009896646,0.0016389734,0.0004462424],"domain_scores_gemma":[0.99666303,0.00057611585,0.0008100715,0.0005490234,0.0012953082,0.00010645039],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014834832,0.00038482997,0.00038164336,0.00017643806,0.001547519,0.00066684146,0.0055753947,0.000065262946,0.00020917866],"category_scores_gemma":[0.0006977349,0.00024383287,0.00020445662,0.0007077974,0.00052554393,0.0007654819,0.0013614788,0.0008753677,0.000025983982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006760936,0.0021083138,0.028911011,0.000015958127,0.00018881868,0.0000052493438,0.029046033,0.01428005,0.002143863,0.89192575,0.00037798472,0.030320862],"study_design_scores_gemma":[0.00021147596,0.0050723194,0.0074514416,0.00033482493,0.00010512165,0.000029669693,0.082014225,0.37869453,0.08045864,0.44197407,0.00256558,0.0010880877],"about_ca_topic_score_codex":0.00034523223,"about_ca_topic_score_gemma":0.00028833054,"teacher_disagreement_score":0.44995168,"about_ca_system_score_codex":0.00019080975,"about_ca_system_score_gemma":0.0001568271,"threshold_uncertainty_score":0.9998049},"labels":[],"label_agreement":null},{"id":"W4231188542","doi":"10.1109/icec.1994.349992","title":"Fuzzy evolutionary algorithms and automatic robot trajectory generation","year":2002,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Trajectory; Evolutionary algorithm; Fuzzy logic; Computer science; Robot; Inverse kinematics; Algorithm; Kinematics; Artificial intelligence; Fuzzy control system; Genetic algorithm; Machine learning","score_opus":0.059002443855536,"score_gpt":0.2662273808267897,"score_spread":0.20722493697125371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231188542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03286694,0.00097394496,0.9519122,0.0016126144,0.00053490227,0.00015766446,5.5329645e-7,0.00045376093,0.011487416],"genre_scores_gemma":[0.75844604,0.000046956797,0.23934096,0.0003308997,0.00016125246,0.000013356065,7.415324e-7,0.00000571479,0.0016540872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991584,0.000043206226,0.00018447796,0.00026146305,0.00018525832,0.00016723388],"domain_scores_gemma":[0.9995405,0.000054239546,0.000034913504,0.00026136875,0.000042647895,0.00006634806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010312568,0.00008927072,0.00008255081,0.00007322917,0.00013158954,0.00010316972,0.0002561801,0.00004524029,0.00018930588],"category_scores_gemma":[0.00002834468,0.00008047158,0.000025908668,0.00017420322,0.00006030418,0.0005448084,0.00007937275,0.000061689796,0.0002846124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1448104e-7,0.00011300565,0.00040556726,0.000009501871,0.000014930637,0.000014089535,0.0018714532,0.0017361863,0.0060880263,0.05845018,0.01876068,0.9125361],"study_design_scores_gemma":[0.00002408638,0.000037813235,0.001159463,0.000003667663,0.000002077532,0.000024534036,0.000029110766,0.9922331,0.0023429326,0.003657321,0.00037360922,0.000112292364],"about_ca_topic_score_codex":0.000026096162,"about_ca_topic_score_gemma":0.000015147289,"teacher_disagreement_score":0.99049693,"about_ca_system_score_codex":0.00003471562,"about_ca_system_score_gemma":0.000011772922,"threshold_uncertainty_score":0.36582115},"labels":[],"label_agreement":null},{"id":"W4232082794","doi":"10.1145/1595496.1562991","title":"Two novel prolog assignments","year":2009,"lang":"en","type":"article","venue":"ACM SIGCSE Bulletin","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Prolog; Simple (philosophy); Computer science; Recursion (computer science); Chart; Tracing; Graph; Delegate; Family tree; Programming language; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.036016320331605615,"score_gpt":0.2971889069433948,"score_spread":0.26117258661178916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232082794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071929455,0.00019916128,0.7950158,0.09823537,0.0011031762,0.0007267744,0.0000033669655,0.0009748137,0.03181205],"genre_scores_gemma":[0.86049604,0.0000065704703,0.1322412,0.00552891,0.00014550138,0.000016868982,0.0000010768007,0.000008876236,0.0015549408],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983834,0.000047546047,0.0002938737,0.0004896296,0.0003494687,0.0004360743],"domain_scores_gemma":[0.9983494,0.00018594947,0.000105245956,0.0011695889,0.000071331146,0.00011845871],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034677895,0.00017484408,0.00016413926,0.00007252087,0.00012796752,0.00015505601,0.0022233583,0.000071158815,0.0002586642],"category_scores_gemma":[0.0005366316,0.00016026029,0.0000679172,0.00022281392,0.000061435574,0.00013976148,0.00040552128,0.00018713587,0.0025532863],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005937134,0.0012381334,0.0018181244,0.000008560387,0.00004820297,0.00015327141,0.0020740852,0.0009798036,0.05118073,0.1659691,0.10752878,0.66894186],"study_design_scores_gemma":[0.0010023203,0.0012264008,0.007709932,0.00008659622,0.000024278519,0.00010954051,0.00015442012,0.012289054,0.23861504,0.13025668,0.6070333,0.0014924144],"about_ca_topic_score_codex":0.000032804724,"about_ca_topic_score_gemma":0.0000023768275,"teacher_disagreement_score":0.7885666,"about_ca_system_score_codex":0.00004529476,"about_ca_system_score_gemma":0.000038434555,"threshold_uncertainty_score":0.99822336},"labels":[],"label_agreement":null},{"id":"W4232119762","doi":"10.1007/978-3-319-71743-2_8","title":"Beanstalks","year":2017,"lang":"en","type":"book-chapter","venue":"Springer texts in education","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Column (typography); Art; Mathematics; Geology; Geometry","score_opus":0.03150235682981642,"score_gpt":0.306859761666868,"score_spread":0.2753574048370516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232119762","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015005436,0.0012436573,0.0061186184,0.00072155584,0.004989784,0.00027727356,0.0000013986195,0.00010358387,0.98639405],"genre_scores_gemma":[0.052015554,0.00032503775,0.0127104325,0.0002533258,0.00086568174,0.00003988144,0.000008306627,0.000051536048,0.93373024],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998619,0.0000109846615,0.00033272873,0.0005515266,0.00026191538,0.00022383043],"domain_scores_gemma":[0.9979604,0.000048599733,0.00030145468,0.0015093754,0.00010958464,0.000070610804],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022716162,0.00024416015,0.00021886572,0.00029849797,0.00011510443,0.0002624027,0.0015712011,0.00024787194,0.00019560877],"category_scores_gemma":[0.000083038845,0.0002592021,0.00008363555,0.000020253568,0.00010957242,0.0004537651,0.00028504242,0.00037289842,0.0011025904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.666149e-7,0.000027243243,0.00006740973,0.000011534763,0.0000040618584,0.0000031786888,0.00051871437,0.000005207148,0.000011434829,0.44441378,0.0013085133,0.55362827],"study_design_scores_gemma":[0.000017327488,0.00001647367,0.000500122,0.00033283365,0.000005707458,0.0000050757335,0.000014009695,0.000178852,0.00048249526,0.39524382,0.60285044,0.0003528715],"about_ca_topic_score_codex":0.0000780175,"about_ca_topic_score_gemma":0.00019284475,"teacher_disagreement_score":0.6015419,"about_ca_system_score_codex":0.00023772616,"about_ca_system_score_gemma":0.0005799807,"threshold_uncertainty_score":0.999986},"labels":[],"label_agreement":null},{"id":"W4232294892","doi":"10.32920/ryerson.14664981.v1","title":"Cops, robbers, and barricades","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Graph; Path (computing); Combinatorics; Mathematics; Computer science; Set (abstract data type); Discrete mathematics; Computer network; Programming language","score_opus":0.03463256918237982,"score_gpt":0.2892691762613687,"score_spread":0.2546366070789889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232294892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01832271,0.001973524,0.9618067,0.0029274411,0.0011135068,0.00016050773,0.0000010675599,0.0003229699,0.013371562],"genre_scores_gemma":[0.7730237,0.00042066508,0.2239022,0.0007466318,0.0001150692,0.000019183966,0.000003847887,0.000011672645,0.0017570436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862796,0.000058875583,0.00023303623,0.00065881724,0.00021253194,0.00020874973],"domain_scores_gemma":[0.99882513,0.000113403185,0.000072547184,0.00077826297,0.00010106879,0.00010959036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017300846,0.0001764661,0.00022123633,0.00006595441,0.000064183456,0.00074656564,0.00097021234,0.000187726,0.00014837786],"category_scores_gemma":[0.00009155616,0.00016256903,0.00006445413,0.00012561008,0.00008638942,0.00020327698,0.0034965554,0.000373933,0.000045024408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003962059,0.00014274394,0.0055631073,0.0002027026,0.00018230228,0.0002696174,0.011343575,0.0028391099,0.0011149981,0.41807464,0.02048888,0.53977436],"study_design_scores_gemma":[0.00011299262,0.00012172808,0.0038938718,0.000601839,0.000057528912,0.00013544841,0.0027652828,0.6104097,0.12136523,0.22630368,0.0315543,0.0026784455],"about_ca_topic_score_codex":0.0002619837,"about_ca_topic_score_gemma":0.00008644465,"teacher_disagreement_score":0.75470096,"about_ca_system_score_codex":0.000030625655,"about_ca_system_score_gemma":0.00014894982,"threshold_uncertainty_score":0.719915},"labels":[],"label_agreement":null},{"id":"W4234705590","doi":"10.32920/ryerson.14652744","title":"Emotional Immersion Through Interactive Media","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Brock University","funders":"","keywords":"Sadness; Disgust; Anger; Happiness; Interactivity; CLIPS; Immersion (mathematics); Psychology; Variety (cybernetics); Multimedia; Video game; Computer science; Cognitive psychology; Social psychology; Artificial intelligence","score_opus":0.06003857748232906,"score_gpt":0.328067555300594,"score_spread":0.26802897781826496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234705590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011124732,0.00019506252,0.9602288,0.0026444714,0.0052737384,0.00013328466,0.0000037392758,0.00018598691,0.020210158],"genre_scores_gemma":[0.7896682,0.00012708042,0.20832114,0.00088571734,0.00034392186,0.000020057281,0.000047560505,0.000014219842,0.00057208457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799275,0.00010941181,0.0003510479,0.00081785297,0.00048080488,0.0002481126],"domain_scores_gemma":[0.9982103,0.00035971848,0.00016465152,0.00087837206,0.0003169575,0.000069965274],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015774889,0.00023532577,0.0002597978,0.00007556344,0.00007526723,0.0004264904,0.0015067136,0.00022844852,0.0011637061],"category_scores_gemma":[0.00015478762,0.00021817247,0.0001992715,0.00018644976,0.000079583355,0.00068183907,0.0040863086,0.0006690561,0.00046573058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031162712,0.0008915862,0.0008487057,0.00016558428,0.00046471713,0.00047021857,0.086201884,0.008617888,0.002300333,0.41176972,0.037172165,0.45106602],"study_design_scores_gemma":[0.00014358574,0.00009215067,0.00273124,0.0012273296,0.00004322155,0.00009153505,0.011475104,0.27824757,0.33333126,0.36429158,0.006256186,0.0020692172],"about_ca_topic_score_codex":0.00037964716,"about_ca_topic_score_gemma":0.000064971195,"teacher_disagreement_score":0.7785435,"about_ca_system_score_codex":0.0001380065,"about_ca_system_score_gemma":0.00028457667,"threshold_uncertainty_score":0.99974936},"labels":[],"label_agreement":null},{"id":"W4235380641","doi":"10.32920/ryerson.14652744.v1","title":"Emotional Immersion Through Interactive Media","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Brock University","funders":"","keywords":"Sadness; Disgust; Anger; Interactivity; Happiness; CLIPS; Psychology; Immersion (mathematics); Multimedia; Variety (cybernetics); Video game; Computer science; Social psychology; Artificial intelligence","score_opus":0.06003857748232906,"score_gpt":0.328067555300594,"score_spread":0.26802897781826496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235380641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011124732,0.00019506252,0.9602288,0.0026444714,0.0052737384,0.00013328466,0.0000037392758,0.00018598691,0.020210158],"genre_scores_gemma":[0.7896682,0.00012708042,0.20832114,0.00088571734,0.00034392186,0.000020057281,0.000047560505,0.000014219842,0.00057208457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799275,0.00010941181,0.0003510479,0.00081785297,0.00048080488,0.0002481126],"domain_scores_gemma":[0.9982103,0.00035971848,0.00016465152,0.00087837206,0.0003169575,0.000069965274],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015774889,0.00023532577,0.0002597978,0.00007556344,0.00007526723,0.0004264904,0.0015067136,0.00022844852,0.0011637061],"category_scores_gemma":[0.00015478762,0.00021817247,0.0001992715,0.00018644976,0.000079583355,0.00068183907,0.0040863086,0.0006690561,0.00046573058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031162712,0.0008915862,0.0008487057,0.00016558428,0.00046471713,0.00047021857,0.086201884,0.008617888,0.002300333,0.41176972,0.037172165,0.45106602],"study_design_scores_gemma":[0.00014358574,0.00009215067,0.00273124,0.0012273296,0.00004322155,0.00009153505,0.011475104,0.27824757,0.33333126,0.36429158,0.006256186,0.0020692172],"about_ca_topic_score_codex":0.00037964716,"about_ca_topic_score_gemma":0.000064971195,"teacher_disagreement_score":0.7785435,"about_ca_system_score_codex":0.0001380065,"about_ca_system_score_gemma":0.00028457667,"threshold_uncertainty_score":0.99974936},"labels":[],"label_agreement":null},{"id":"W4239635170","doi":"10.1007/978-3-319-08234-9_20-1","title":"Computer Go","year":2015,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Computer Graphics and Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.02931773077817754,"score_gpt":0.25728814994781923,"score_spread":0.2279704191696417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239635170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016267766,0.0061101513,0.6239498,0.000622073,0.0034384392,0.00047401089,0.000033215107,0.00029595138,0.36491367],"genre_scores_gemma":[0.0074383537,0.044035885,0.52120006,0.0034891176,0.00949587,0.00005465343,0.000121191995,0.0004860548,0.4136788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970473,0.00004532273,0.00085796363,0.00091053866,0.00073868217,0.0004002003],"domain_scores_gemma":[0.99729353,0.00030195323,0.0005196338,0.001080139,0.0005015611,0.00030316805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000436829,0.0006064768,0.0008636569,0.00051321666,0.0000889193,0.00017554867,0.0014683205,0.00045826568,0.000035951696],"category_scores_gemma":[0.000012564394,0.00056951406,0.0002800873,0.0001409025,0.00050250615,0.00034915988,0.0011706699,0.0005708867,0.000074867916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040854475,0.000025209056,0.000077979224,0.000050826384,0.0000791108,0.00003339134,0.00056223146,0.000040309365,2.731038e-7,0.75856555,0.034599893,0.20596112],"study_design_scores_gemma":[0.00010513469,0.00032050253,0.00012514491,0.00021027264,0.00003374163,0.000031497937,0.0000023410403,0.025565421,0.0000093636745,0.27780002,0.69520855,0.00058803015],"about_ca_topic_score_codex":0.000021653235,"about_ca_topic_score_gemma":0.00001912434,"teacher_disagreement_score":0.66060865,"about_ca_system_score_codex":0.00002501992,"about_ca_system_score_gemma":0.00017855207,"threshold_uncertainty_score":0.99967563},"labels":[],"label_agreement":null},{"id":"W4240822539","doi":"10.22215/etd/2015-10615","title":"Multi-agent planning for interactive emergent narrative systems","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Narrative; Adventure; Computer science; Domain (mathematical analysis); Narrative structure; Human–computer interaction; Artificial intelligence; Art; Literature","score_opus":0.11248942055939999,"score_gpt":0.4113497945551065,"score_spread":0.29886037399570653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240822539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011443002,0.0010358474,0.962728,0.00009354588,0.016299278,0.0017312234,0.000016518496,0.00031141783,0.0063411603],"genre_scores_gemma":[0.7408089,0.00003384352,0.11527026,0.00017883061,0.0009445756,0.002072504,0.00076685066,0.0001360841,0.13978815],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800044,0.00007576621,0.000551385,0.00065276155,0.0003873486,0.0003323196],"domain_scores_gemma":[0.99790037,0.00016898816,0.00041625678,0.00043841457,0.00093266,0.00014332663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033579476,0.00032684903,0.00037936782,0.00019512481,0.00016253114,0.0002725192,0.0009876811,0.00021111709,0.000028172566],"category_scores_gemma":[0.00024843565,0.00028588518,0.00014385412,0.00017838078,0.000017653865,0.00045577687,0.00008371248,0.0002366921,0.00013059781],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034063493,0.0005373211,0.00008617977,0.00050458626,0.00077139365,0.00006236562,0.759807,0.020261772,0.003152146,0.02086359,0.14942244,0.04419056],"study_design_scores_gemma":[0.00019067444,0.00034699793,0.00006229599,0.00056686683,0.000038778275,0.000006034585,0.20018472,0.7613486,0.013574344,0.0020060684,0.020758683,0.0009159354],"about_ca_topic_score_codex":0.00024787395,"about_ca_topic_score_gemma":0.00023792437,"teacher_disagreement_score":0.84745777,"about_ca_system_score_codex":0.00023809572,"about_ca_system_score_gemma":0.0002497425,"threshold_uncertainty_score":0.99995935},"labels":[],"label_agreement":null},{"id":"W4241555122","doi":"10.32920/ryerson.14649297","title":"Cops and robbers on graphs and hypergraphs","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjecture; Combinatorics; Generalization; Mathematics; Vertex (graph theory); Graph; Upper and lower bounds; Pathwidth; Discrete mathematics; Line graph","score_opus":0.02848449139006236,"score_gpt":0.2701670735229927,"score_spread":0.2416825821329303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241555122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314633,0.0026927593,0.13402484,0.0038975351,0.0022366017,0.0004856382,0.000003712662,0.0005815556,0.024614105],"genre_scores_gemma":[0.960849,0.0009752832,0.036663588,0.00095578714,0.000023977405,0.000019210584,0.0000029710554,0.000012737935,0.0004974775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998398,0.00006289817,0.00023231158,0.0008440268,0.00023608906,0.00022667268],"domain_scores_gemma":[0.998807,0.00016671645,0.00007634401,0.0007367267,0.00008051573,0.00013271136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018696274,0.00023766288,0.0002627675,0.00017089931,0.000094866235,0.0006180235,0.0005671907,0.00019118305,0.000030523297],"category_scores_gemma":[0.00005449941,0.00021391215,0.00007343535,0.00018414609,0.00017370324,0.0001576759,0.0016567708,0.0003937093,0.000010796158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010064807,0.00012408893,0.007283464,0.00011252946,0.00013929601,0.00013597762,0.004345111,0.00079877203,0.0005133437,0.6952986,0.0026750495,0.2885637],"study_design_scores_gemma":[0.0002519312,0.00047186366,0.012857847,0.00087834476,0.00007969679,0.00015781012,0.0023406546,0.14811948,0.045445833,0.7820694,0.0045493203,0.0027778037],"about_ca_topic_score_codex":0.00027476365,"about_ca_topic_score_gemma":0.00016020896,"teacher_disagreement_score":0.28578588,"about_ca_system_score_codex":0.000015264039,"about_ca_system_score_gemma":0.00006643025,"threshold_uncertainty_score":0.87230843},"labels":[],"label_agreement":null},{"id":"W4241715483","doi":"10.1145/1124706.1121510","title":"Poker as a group project for artificial intelligence","year":2006,"lang":"en","type":"article","venue":"ACM SIGCSE Bulletin","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Group (periodic table); Flexibility (engineering); Project-based learning; Computer science; Quarter (Canadian coin); Artificial intelligence; Mathematics education; Psychology; Operations research; Engineering; Management","score_opus":0.04609725248997808,"score_gpt":0.3092880024774703,"score_spread":0.2631907499874922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241715483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016500158,0.00016694551,0.9627379,0.013281996,0.0008424606,0.0011421094,0.0000077084505,0.00052566745,0.0047950316],"genre_scores_gemma":[0.761958,0.000013555263,0.23278925,0.0014161041,0.0008202281,0.0003991758,0.000013217648,0.00004645137,0.0025440336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743307,0.00008731278,0.00062499166,0.0007913129,0.00039828365,0.00066502823],"domain_scores_gemma":[0.99751306,0.00080982107,0.00017625987,0.0012345891,0.00018632815,0.00007993395],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006268915,0.00028393374,0.00026065996,0.00017715039,0.00026244333,0.00036020155,0.0022907911,0.00014389114,0.00022429824],"category_scores_gemma":[0.0010780699,0.00026940563,0.0001869141,0.00046702175,0.00016112841,0.00019222725,0.000565836,0.0001908723,0.0022424483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088587694,0.00038498105,0.00010445356,0.000026253756,0.000020041092,0.000046672627,0.0007059797,0.00028628946,0.0028317114,0.70417696,0.060357694,0.23097035],"study_design_scores_gemma":[0.000060986993,0.00043918155,0.00006412037,0.00003856404,0.000014527573,0.000036247417,0.00026171186,0.009766744,0.0925322,0.5044225,0.39174008,0.0006231569],"about_ca_topic_score_codex":0.0010549066,"about_ca_topic_score_gemma":0.00011304877,"teacher_disagreement_score":0.7454578,"about_ca_system_score_codex":0.00006847168,"about_ca_system_score_gemma":0.000101164704,"threshold_uncertainty_score":0.9999758},"labels":[],"label_agreement":null},{"id":"W4247440864","doi":"10.1353/lac.2015.0019","title":"Playing Checkers with Machines—from Ajeeb to Chinook","year":2015,"lang":"en","type":"article","venue":"Information & Culture","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Champion; Chinook wind; Automaton; History; Operations research; Engineering; Political science; Computer science; Law; Artificial intelligence; Fish <Actinopterygii>; Fishery","score_opus":0.026810139057035012,"score_gpt":0.2662183340392502,"score_spread":0.23940819498221522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247440864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099198036,0.0000370947,0.84814227,0.002349204,0.0006128297,0.00039070207,0.000016477996,0.00049257645,0.048760794],"genre_scores_gemma":[0.81704664,0.0000022889174,0.17777745,0.0045491452,0.00015842359,0.000029551562,0.00004686865,0.0000075966113,0.00038200652],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989932,0.000017217066,0.0002549164,0.00013529714,0.00040697138,0.00019235066],"domain_scores_gemma":[0.99910617,0.000014383895,0.000110421555,0.00034014817,0.00023199785,0.0001968692],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001392939,0.0001358712,0.0001070785,0.00007600158,0.000116995136,0.0003911507,0.00063828455,0.00006789824,0.000024715213],"category_scores_gemma":[0.000090217436,0.000094898314,0.00002685035,0.00038240053,0.000023811537,0.003375932,0.00013294903,0.00014653838,0.0014332421],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014183098,0.000074224976,0.011609333,0.000027751235,0.00009015312,0.000018474819,0.43592843,0.03900134,0.00095437904,0.05607093,0.17210516,0.283978],"study_design_scores_gemma":[0.0007269747,0.00051648193,0.0087035205,0.00016326368,0.000021261905,0.00007343454,0.0101978965,0.37518653,0.013820473,0.0068683564,0.5823802,0.001341627],"about_ca_topic_score_codex":0.00019777643,"about_ca_topic_score_gemma":0.00003473949,"teacher_disagreement_score":0.7178486,"about_ca_system_score_codex":0.00007125276,"about_ca_system_score_gemma":0.00007823451,"threshold_uncertainty_score":0.9993442},"labels":[],"label_agreement":null},{"id":"W4250803509","doi":"10.1109/gas.2015.9","title":"A Game Genre Agnostic Framework for Game-Design","year":2015,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Game design; Process (computing); Video game design; Human–computer interaction; Game mechanics; Game Developer; Order (exchange); Multimedia; Programming language","score_opus":0.15309887846635337,"score_gpt":0.3492299064699055,"score_spread":0.19613102800355212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250803509","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010145542,0.0001585908,0.99363387,0.0016646136,0.0008403215,0.00046491768,0.0000011433425,0.00040381268,0.001818178],"genre_scores_gemma":[0.40061918,0.000005285624,0.59692025,0.0010922352,0.00017762168,0.00007472529,5.9682077e-7,0.000013969446,0.0010961178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850774,0.00006817324,0.0002740918,0.0004278246,0.00030254593,0.00041960922],"domain_scores_gemma":[0.99743617,0.0013062289,0.00007582692,0.00069515157,0.00024531723,0.0002412979],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005339045,0.00015844108,0.00017669231,0.000079897465,0.000047019446,0.00022692597,0.0011785175,0.00012202855,0.000039576385],"category_scores_gemma":[0.0016670645,0.00013580106,0.0000800188,0.000325827,0.000071086244,0.00039167248,0.00019752426,0.00013167424,0.0008900094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027261594,0.00010439576,0.00016922531,0.000011858302,0.000021410357,0.000019500378,0.0041907113,0.006788664,0.00013861907,0.8879389,0.015731275,0.08485814],"study_design_scores_gemma":[0.000067309804,0.0002766444,0.000029485162,0.000030156434,0.000006214345,0.00001026071,0.00019007054,0.25479633,0.014494839,0.720948,0.00890616,0.00024458457],"about_ca_topic_score_codex":0.00003028966,"about_ca_topic_score_gemma":0.0000060479338,"teacher_disagreement_score":0.39960462,"about_ca_system_score_codex":0.000058597183,"about_ca_system_score_gemma":0.00016661381,"threshold_uncertainty_score":0.9998879},"labels":[],"label_agreement":null},{"id":"W4251740850","doi":"10.1017/cbo9780511807251.024","title":"Unsolved problems in Combinatorial Games","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorial game theory; Computer science; Mathematical economics; Mathematics; Game theory; Sequential game","score_opus":0.03454149461052849,"score_gpt":0.25912930120178884,"score_spread":0.22458780659126035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251740850","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000103757875,0.00028179307,0.027720325,0.0006125587,0.001646633,0.00042155347,0.0000011563542,0.00031234758,0.96899325],"genre_scores_gemma":[0.015047558,0.00024333347,0.008486702,0.0006917051,0.00050391065,0.000019199411,0.000007035087,0.000052999072,0.9749476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979194,0.000020017527,0.0005779661,0.0006742289,0.00044891972,0.0003595153],"domain_scores_gemma":[0.9986773,0.000114190705,0.00017829609,0.0008289005,0.000108151566,0.00009313508],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026587895,0.00035152544,0.00042677793,0.00028517275,0.00004164862,0.00018936968,0.0015160459,0.00039854218,0.00028135555],"category_scores_gemma":[0.0000307286,0.00032953153,0.00013461811,0.000086308755,0.00009741784,0.0003030587,0.00027212108,0.00048549077,0.0008002162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016995567,0.00002562075,0.000009799088,0.0000064448327,0.000007002017,0.000023968842,0.00020628601,0.00005661696,0.000010006571,0.90846163,0.0018195153,0.08937142],"study_design_scores_gemma":[0.00007254339,0.00011511783,0.000013524874,0.0001283903,0.000003436724,0.000004003767,0.0000036767926,0.0019526988,0.00034622967,0.7915314,0.20544115,0.00038783517],"about_ca_topic_score_codex":0.00007419721,"about_ca_topic_score_gemma":0.00018228435,"teacher_disagreement_score":0.20362164,"about_ca_system_score_codex":0.00012238584,"about_ca_system_score_gemma":0.00014295822,"threshold_uncertainty_score":0.99997777},"labels":[],"label_agreement":null},{"id":"W4251971431","doi":"10.3233/icg-2014-37402","title":"Computer Chess Endgame Play with Pawns: Then and Now","year":2014,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Chess endgame; Computer science; Artificial intelligence","score_opus":0.01829185725721774,"score_gpt":0.24604199037579785,"score_spread":0.2277501331185801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251971431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10196325,0.0001488109,0.8945684,0.0015289685,0.00041619575,0.000053799962,3.5164038e-7,0.00005528328,0.0012649631],"genre_scores_gemma":[0.91745925,0.00004411147,0.08090134,0.00070221204,0.0006855733,0.0000022966967,1.5029295e-7,0.000011902665,0.00019314101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998877,0.00009283903,0.0002172959,0.00022977893,0.00029283678,0.0002902311],"domain_scores_gemma":[0.99914575,0.00016653124,0.00013409148,0.0002841502,0.000099172124,0.00017033106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048653476,0.00013320349,0.00015998071,0.000080510814,0.00019354219,0.00053929194,0.0006762518,0.00004730988,0.000030454758],"category_scores_gemma":[0.000015856558,0.000091072834,0.000035989367,0.00011760316,0.00011562345,0.00055012846,0.0001580816,0.0002938494,0.00008415597],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003101136,0.00009964552,0.0110174585,0.000012903674,0.00007806629,0.00012441755,0.006993253,0.0016136565,0.00067427097,0.028593633,0.004709813,0.9460519],"study_design_scores_gemma":[0.0010988348,0.0022062843,0.03846663,0.0005024471,0.00004886167,0.00778501,0.00040856746,0.6540679,0.018187607,0.06754153,0.20817132,0.0015150148],"about_ca_topic_score_codex":0.0000057084553,"about_ca_topic_score_gemma":0.000018121262,"teacher_disagreement_score":0.94453686,"about_ca_system_score_codex":0.000019708299,"about_ca_system_score_gemma":0.000042068845,"threshold_uncertainty_score":0.52004045},"labels":[],"label_agreement":null},{"id":"W4253655428","doi":"10.1090/stml/080/11","title":"𝑛-player games","year":2016,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.02868393708640579,"score_gpt":0.2769400705462486,"score_spread":0.2482561334598428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253655428","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010349943,0.00035326628,0.08269846,0.0023358478,0.00042467448,0.00035168589,0.000014585517,0.0006348287,0.9131763],"genre_scores_gemma":[0.00093122415,0.00014116416,0.019454183,0.00078267814,0.00048470605,0.000029034127,0.0000033032925,0.0000977787,0.9780759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730605,0.000026430645,0.0006988697,0.0007114502,0.00083621545,0.00042098394],"domain_scores_gemma":[0.9976325,0.0005624571,0.00022550557,0.001315657,0.000035848872,0.00022802103],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013900311,0.00047195202,0.0005712752,0.00016745627,0.00006503182,0.00041163302,0.0027000392,0.0003109371,0.0054137176],"category_scores_gemma":[0.00003481105,0.00032676957,0.00029019665,0.0000452861,0.00022416445,0.001008474,0.0018717981,0.00034032308,0.01786356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021432065,0.000044312914,0.000008878203,0.00004393273,0.000060644223,0.0000783787,0.0002557254,1.906755e-7,0.000008808521,0.96273744,0.019748934,0.017010622],"study_design_scores_gemma":[0.00003464479,0.000052227286,0.000004416852,0.00041451375,0.000015703245,0.000014597481,0.0000076106935,0.00008991136,0.0004310801,0.8232316,0.17531231,0.0003913899],"about_ca_topic_score_codex":7.779944e-8,"about_ca_topic_score_gemma":1.0381959e-7,"teacher_disagreement_score":0.15556337,"about_ca_system_score_codex":0.000030369136,"about_ca_system_score_gemma":0.000095344374,"threshold_uncertainty_score":0.99991846},"labels":[],"label_agreement":null},{"id":"W4255658877","doi":"10.1090/stml/080/01","title":"Combinatorial games","year":2016,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.023843377949210227,"score_gpt":0.27201494209894383,"score_spread":0.2481715641497336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255658877","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011026192,0.0002446679,0.03700539,0.0017597601,0.0014847354,0.00039838924,0.000013997743,0.0006704452,0.9584116],"genre_scores_gemma":[0.0025275385,0.00012877736,0.009619005,0.00053404155,0.0011870785,0.000037041533,0.000005123984,0.00012541896,0.98583597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972783,0.000032160755,0.0007058244,0.0006760746,0.00090823113,0.0003994305],"domain_scores_gemma":[0.99765617,0.00060977315,0.00024075966,0.0012259546,0.000041195457,0.00022612521],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015149495,0.00045896866,0.0006049289,0.0001499813,0.00007046949,0.0004286166,0.0027602613,0.00033946446,0.0030065295],"category_scores_gemma":[0.000045890607,0.00032977652,0.00029099555,0.000046162408,0.0002542844,0.00092304836,0.00196757,0.00035699547,0.010109096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003489191,0.0000649252,0.0000066031134,0.000042112322,0.000059046273,0.00006652175,0.00022197745,8.0822744e-8,0.0000047064987,0.9777591,0.012255958,0.0095154345],"study_design_scores_gemma":[0.00006657812,0.00007739348,0.0000023895043,0.0003576818,0.00001598134,0.000008941969,0.0000059767904,0.000053105523,0.00030660044,0.86069274,0.13803713,0.00037548714],"about_ca_topic_score_codex":8.622701e-8,"about_ca_topic_score_gemma":4.8872906e-8,"teacher_disagreement_score":0.12578118,"about_ca_system_score_codex":0.000035414178,"about_ca_system_score_gemma":0.00011175179,"threshold_uncertainty_score":0.9999154},"labels":[],"label_agreement":null},{"id":"W4256086850","doi":"10.4169/math.mag.85.4.267","title":"Skunk Redux","year":2012,"lang":"en","type":"article","venue":"Mathematics Magazine","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Redux; Mathematics; Engineering","score_opus":0.04221835009463979,"score_gpt":0.29302932793867437,"score_spread":0.25081097784403455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256086850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0155019425,0.00019435158,0.90123147,0.0009071105,0.00067764864,0.00014291548,8.565017e-7,0.00031469204,0.081029],"genre_scores_gemma":[0.5699775,0.000009334574,0.4248571,0.00024736792,0.00024226811,0.000015601103,7.7538004e-7,0.000017356188,0.004632638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989067,0.000020246229,0.00027318884,0.00014854949,0.00025962328,0.00039173654],"domain_scores_gemma":[0.9989084,0.00012817368,0.000090629976,0.00068071065,0.000057927173,0.00013416458],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042576285,0.00012211953,0.00014772687,0.00006844777,0.00006369129,0.00008914179,0.0007156707,0.0000458632,0.00016317886],"category_scores_gemma":[0.00012804568,0.00010486953,0.00005243401,0.0002668688,0.000049327013,0.0005110212,0.00024593566,0.0000941718,0.006215543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.91092e-7,0.00037194724,0.00044695992,0.00005054469,0.000020715854,0.0000060103657,0.005950149,0.000020870042,0.004788369,0.94428146,0.015046463,0.029015636],"study_design_scores_gemma":[0.00021795134,0.00016396485,0.0024169574,0.00016034045,0.000055929613,0.0002880345,0.00048197928,0.17501175,0.1220519,0.53543776,0.16236272,0.0013506723],"about_ca_topic_score_codex":0.0000017924632,"about_ca_topic_score_gemma":0.0000015519547,"teacher_disagreement_score":0.5544756,"about_ca_system_score_codex":0.000029309445,"about_ca_system_score_gemma":0.000017085236,"threshold_uncertainty_score":0.9945582},"labels":[],"label_agreement":null},{"id":"W4281553483","doi":"10.24963/ijcai.2022/484","title":"Approximate Exploitability: Learning a Best Response","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adversarial system; Computer science; Reinforcement learning; Scalability; Robustness (evolution); Artificial intelligence; Machine learning; Variety (cybernetics); Computation; Deep neural networks; Artificial neural network; Theoretical computer science; Algorithm","score_opus":0.08809639599173266,"score_gpt":0.29736024869521155,"score_spread":0.2092638527034789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281553483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7861026,0.00006615539,0.10857306,0.06501894,0.0054603964,0.0026884635,0.000062243205,0.0008319143,0.031196255],"genre_scores_gemma":[0.99447966,0.000028288041,0.003545207,0.0003784286,0.00011726981,0.00039613227,0.0000017634871,0.000032686636,0.00102058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9950964,0.0001609882,0.0012715063,0.0009944926,0.0018972855,0.00057932537],"domain_scores_gemma":[0.9966922,0.00044402538,0.0009454505,0.0005990957,0.0011711534,0.00014809132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002789881,0.00040250435,0.0004234739,0.00045543688,0.0010812873,0.0005190195,0.0053615696,0.0000935223,0.0006589162],"category_scores_gemma":[0.0023624538,0.0003497649,0.00033876073,0.0010729304,0.00049340434,0.00083329115,0.0028957608,0.0011650118,0.00020807481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007377137,0.00070594513,0.0007355756,0.000030323743,0.000056843215,0.000005430215,0.0061250166,0.0059401644,0.035825714,0.921765,0.00021781663,0.027854422],"study_design_scores_gemma":[0.00005973458,0.0009463301,0.00023239046,0.00027107247,0.000018935101,0.000054185643,0.011046075,0.28184694,0.40183085,0.29768938,0.0053427876,0.0006613152],"about_ca_topic_score_codex":0.00010007639,"about_ca_topic_score_gemma":0.000015301208,"teacher_disagreement_score":0.62407565,"about_ca_system_score_codex":0.00043711803,"about_ca_system_score_gemma":0.00022462505,"threshold_uncertainty_score":0.99989545},"labels":[],"label_agreement":null},{"id":"W4283791892","doi":"10.1609/aaai.v36i7.20744","title":"What Can We Learn Even from the Weakest? Learning Sketches for Programmatic Strategies","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Compute Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canadian Institute for Advanced Research","keywords":"Sketch; Computer science; Cloning (programming); Action (physics); Artificial intelligence; Human–computer interaction; Programming language; Algorithm","score_opus":0.09476838440004962,"score_gpt":0.31058380478221725,"score_spread":0.21581542038216764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283791892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6851063,0.0011975594,0.14894375,0.1460444,0.0070156795,0.006644043,0.00006176534,0.0010446546,0.003941856],"genre_scores_gemma":[0.9952189,0.00016158806,0.0029705344,0.00033346444,0.00017572133,0.000533738,0.0000027915619,0.000033140594,0.0005701202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965463,0.00011991827,0.0008717768,0.0008078082,0.0009924226,0.0006617327],"domain_scores_gemma":[0.9969771,0.0009433899,0.00077307876,0.000570014,0.00063331536,0.000103112514],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011895683,0.00037845163,0.00039870976,0.000112352616,0.0013965025,0.0018719566,0.005161511,0.000089309506,0.0001438024],"category_scores_gemma":[0.00080944016,0.000264559,0.00027715048,0.0009537711,0.00056195987,0.0011608131,0.0012165762,0.00089479086,0.0000436375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072445764,0.00014386693,0.00017966893,0.00003210983,0.000040137806,5.822567e-7,0.019575011,0.002377165,0.0076108878,0.6695335,0.00015495179,0.3002797],"study_design_scores_gemma":[0.00002447584,0.0005131539,0.00005647215,0.0002342382,0.00003155351,0.0000046864875,0.080978155,0.11743479,0.13165025,0.6660032,0.0027059242,0.0003630833],"about_ca_topic_score_codex":0.00030423093,"about_ca_topic_score_gemma":0.00016341326,"teacher_disagreement_score":0.31011263,"about_ca_system_score_codex":0.00013721884,"about_ca_system_score_gemma":0.00033877706,"threshold_uncertainty_score":0.9999807},"labels":[],"label_agreement":null},{"id":"W4283793872","doi":"10.1609/aaai.v36i11.21564","title":"Artificial Intelligence Approaches to Build Ticket to Ride Maps","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Monte Carlo tree search; Computer science; Ticket; Bipartite graph; Graph; Tree (set theory); Focus (optics); Game tree; Theoretical computer science; Artificial intelligence; Monte Carlo method; Game theory; Sequential game; Mathematics; Computer security","score_opus":0.2200438509806717,"score_gpt":0.3086271385962788,"score_spread":0.08858328761560713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283793872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24624833,0.0000820139,0.6184949,0.093155645,0.005444045,0.005603291,0.00015762614,0.0010064224,0.029807724],"genre_scores_gemma":[0.9747518,0.000008665088,0.021664247,0.0020744249,0.0002547947,0.00053710124,0.0000021787228,0.00006176278,0.0006450257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9927795,0.00013291201,0.0018555697,0.0018372544,0.002081603,0.0013131738],"domain_scores_gemma":[0.99630105,0.0003836671,0.00067943713,0.0013338409,0.0007337047,0.0005682924],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022509557,0.00071010634,0.000739477,0.00078495115,0.0011833371,0.00074719405,0.009130608,0.00015247204,0.00047214516],"category_scores_gemma":[0.0014704287,0.0006377406,0.00037129212,0.0041607106,0.00047221975,0.00067979936,0.0044786436,0.00110122,0.00115344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019030689,0.00040686145,0.00008653792,0.00002572705,0.000026455149,0.000003422155,0.0054071173,0.006493753,0.015165369,0.78468573,0.0010421909,0.18646653],"study_design_scores_gemma":[0.0000068078675,0.0007326711,0.00003215445,0.00009601014,0.000018636669,0.000018165798,0.0038612313,0.038496554,0.55636376,0.39769536,0.0020331466,0.00064549013],"about_ca_topic_score_codex":0.00019308875,"about_ca_topic_score_gemma":0.00007557921,"teacher_disagreement_score":0.72850347,"about_ca_system_score_codex":0.00037208485,"about_ca_system_score_gemma":0.00033889388,"threshold_uncertainty_score":0.99962425},"labels":[],"label_agreement":null},{"id":"W4285147175","doi":"10.1090/stml/097/07","title":"Invisible robber games","year":2022,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.031195036092457492,"score_gpt":0.27536215936948655,"score_spread":0.24416712327702905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285147175","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019456109,0.0005890906,0.01620363,0.002196939,0.0004979874,0.00047140536,0.000016363907,0.00069953385,0.97930557],"genre_scores_gemma":[0.00057087117,0.00022424474,0.028503647,0.0014859107,0.00029511531,0.00008152469,0.000022184367,0.00013006998,0.96868646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968986,0.000045457746,0.00074345287,0.000773924,0.001123075,0.00041549487],"domain_scores_gemma":[0.9977026,0.00045854016,0.00024111675,0.0013710045,0.00002389803,0.000202859],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019733101,0.0004617975,0.000595098,0.00022762196,0.00013509857,0.00049086084,0.0031772081,0.00019994045,0.024003835],"category_scores_gemma":[0.000031245603,0.00041432132,0.00031824273,0.00011025426,0.00016899087,0.0011480384,0.004203309,0.00070060045,0.0045049265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021608428,0.00008689649,0.000012647273,0.000058733047,0.00006593128,0.00011287922,0.0005829741,0.000009300695,0.000002235909,0.9601945,0.03380865,0.005063041],"study_design_scores_gemma":[0.000026166344,0.00007095846,0.000003739642,0.000093476854,0.000017226239,0.000015600977,0.000026315567,0.00044524382,0.00010024847,0.63886094,0.35999158,0.00034852602],"about_ca_topic_score_codex":6.6742894e-7,"about_ca_topic_score_gemma":2.5566658e-7,"teacher_disagreement_score":0.32618293,"about_ca_system_score_codex":0.000050998242,"about_ca_system_score_gemma":0.00012632544,"threshold_uncertainty_score":0.99983084},"labels":[],"label_agreement":null},{"id":"W4285181870","doi":"10.1090/stml/097","title":"An Invitation to Pursuit-Evasion Games and Graph Theory","year":2022,"lang":"en","type":"book","venue":"Student mathematical library","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Pursuit-evasion; Mathematical economics; Evasion (ethics); Game theory; Graph; Graph theory; Computer science; Economics; Mathematics; Combinatorics; Artificial intelligence; Theoretical computer science; Biology; Genetics","score_opus":0.02216007991011102,"score_gpt":0.2956742543828874,"score_spread":0.2735141744727764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285181870","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018807175,0.0011223378,0.36901122,0.0050840415,0.0009856842,0.0024809076,0.000055229564,0.001426331,0.61795354],"genre_scores_gemma":[0.0068487627,0.00030686814,0.14963251,0.01055323,0.00077093806,0.00070148625,0.00018714329,0.00032007563,0.830679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720323,0.0002545684,0.00052924186,0.0007696589,0.0009204572,0.00032281896],"domain_scores_gemma":[0.9978221,0.00072719343,0.00015897278,0.0009687597,0.000026168194,0.00029681626],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000571296,0.00034823918,0.0004304474,0.00034309813,0.00016038888,0.0007206033,0.0022741256,0.00015320086,0.001002899],"category_scores_gemma":[0.000081772225,0.00030911065,0.00011582148,0.00024374163,0.00017325,0.0012662953,0.0020910392,0.00039907484,0.00032682542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009655255,0.00015714452,0.000020573143,0.00008440547,0.00003079069,0.0000318906,0.004423263,0.0000134920065,0.000025863217,0.94550633,0.028636433,0.021060178],"study_design_scores_gemma":[0.000035892823,0.0003585311,0.00007222516,0.00013404069,0.000023669161,0.000010991642,0.00040104907,0.00046270748,0.00014272904,0.9724358,0.025551273,0.00037111415],"about_ca_topic_score_codex":3.0354772e-7,"about_ca_topic_score_gemma":3.4685615e-7,"teacher_disagreement_score":0.21937871,"about_ca_system_score_codex":0.00004720138,"about_ca_system_score_gemma":0.00013276971,"threshold_uncertainty_score":0.9999361},"labels":[],"label_agreement":null},{"id":"W4286684878","doi":"10.1016/j.disc.2022.113084","title":"The invertible elements of the monoid of dead-ending misère games","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Modulo; Mathematics; Combinatorics; Combinatorial game theory; Discrete mathematics; Pure mathematics; Sequential game; Game theory; Mathematical economics","score_opus":0.030726916667810515,"score_gpt":0.28141928171152436,"score_spread":0.25069236504371384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286684878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71707517,0.0008187104,0.2608537,0.0032912325,0.001438722,0.0012459765,0.000045795587,0.00013333913,0.015097336],"genre_scores_gemma":[0.98604846,0.000013980264,0.013269172,0.000056714925,0.000011899938,0.000031732983,4.954099e-7,0.000010501421,0.0005570525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984686,0.00009780644,0.00052027544,0.00014565855,0.0005598485,0.00020781627],"domain_scores_gemma":[0.9983298,0.000320534,0.00041448607,0.0008506194,0.000058470265,0.000026067475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006500356,0.00009915353,0.00015774093,0.00003919353,0.00036715087,0.000047436486,0.0020341135,0.000016923059,0.000034707282],"category_scores_gemma":[0.00019714508,0.000058796337,0.000118246615,0.00041469213,0.0001498798,0.0001068094,0.0011635922,0.0001338983,0.000004713352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007878904,0.00017505256,0.0042875945,0.000158945,0.000095901385,0.0000019248196,0.025104018,0.0026831196,0.008402122,0.94039875,0.0021460848,0.016538618],"study_design_scores_gemma":[0.00009805912,0.00013130516,0.00024568988,0.00009588101,0.000032858065,0.000009510065,0.011404056,0.5112083,0.21054178,0.2603307,0.00566054,0.00024130632],"about_ca_topic_score_codex":0.000020437928,"about_ca_topic_score_gemma":0.000009236842,"teacher_disagreement_score":0.680068,"about_ca_system_score_codex":0.000036044927,"about_ca_system_score_gemma":0.000053558193,"threshold_uncertainty_score":0.3779923},"labels":[],"label_agreement":null},{"id":"W4289323664","doi":"10.1007/978-3-031-11488-5_11","title":"BoxOff is NP-Complete","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Colored; Rectangle; Computer science; Boolean satisfiability problem; Satisfiability; NP-complete; Computational complexity theory; Algorithm; Combinatorics; Theoretical computer science; Artificial intelligence; Mathematics; Geometry; Law","score_opus":0.03969446407276851,"score_gpt":0.27460624047377985,"score_spread":0.23491177640101135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289323664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003061454,0.00052035664,0.9746068,0.0041496404,0.00373003,0.00041744148,0.000017933884,0.00030143134,0.016225746],"genre_scores_gemma":[0.08175945,0.0002630405,0.8733921,0.03695103,0.001981977,0.000078206154,0.000017448925,0.00020149423,0.0053552156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938846,0.000058049347,0.000789961,0.0023569772,0.0018897131,0.0010206532],"domain_scores_gemma":[0.99587196,0.00067137805,0.00039042762,0.002579797,0.00024499794,0.00024145607],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011034518,0.00068849727,0.00065652444,0.0010786895,0.000617823,0.000779074,0.008029155,0.00027701797,0.0009193845],"category_scores_gemma":[0.000117177864,0.0006892173,0.0002528234,0.0010287197,0.0010774949,0.0009545197,0.0042873,0.0014426658,0.00044164553],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005817236,0.0000390981,0.000052329084,0.000024629579,0.000017412758,0.00023722224,0.0026172008,0.018104108,0.00020554781,0.1303149,0.00070209446,0.8476796],"study_design_scores_gemma":[0.00007683728,0.00022944412,0.00002087449,0.00010609743,0.000007700212,0.00009726538,3.761063e-7,0.33399498,0.0024489567,0.54638374,0.115594715,0.0010390305],"about_ca_topic_score_codex":0.000097161304,"about_ca_topic_score_gemma":0.00006637443,"teacher_disagreement_score":0.8466406,"about_ca_system_score_codex":0.000565352,"about_ca_system_score_gemma":0.0006961414,"threshold_uncertainty_score":0.9999939},"labels":[],"label_agreement":null},{"id":"W4289356281","doi":"10.1007/978-3-031-11488-5_13","title":"On the Road to Perfection? Evaluating Leela Chess Zero Against Endgame Tablebases","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chess endgame; Heuristics; Computer science; Zero (linguistics); Perfection; Artificial intelligence; Epistemology","score_opus":0.05198616385661934,"score_gpt":0.30933623630099566,"score_spread":0.2573500724443763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289356281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002250707,0.00020642881,0.9799568,0.0034539944,0.0035788207,0.0009447296,0.0000073511073,0.0002491916,0.009351958],"genre_scores_gemma":[0.8154882,0.000050812272,0.15731844,0.02322468,0.0011648195,0.0002610146,0.0000080108,0.00014018337,0.0023438304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99397796,0.00018472598,0.00068719947,0.0020583957,0.0021845163,0.0009072184],"domain_scores_gemma":[0.9944749,0.0024198012,0.00034813254,0.0022345881,0.00031591827,0.00020668616],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002923218,0.0006519624,0.00051207514,0.0008471773,0.0011908384,0.00097646395,0.0058641005,0.00019291052,0.00027789566],"category_scores_gemma":[0.0009263417,0.0005117917,0.00019747278,0.0013408154,0.0006055762,0.00057440303,0.0029148425,0.0015110796,0.00019847817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065967374,0.000028232967,0.00001338231,0.0000081544695,0.0000091452475,0.00003077524,0.0014497666,0.3489779,0.00027512098,0.04200754,0.00011951725,0.60707384],"study_design_scores_gemma":[0.000071950584,0.0006936329,0.00004938601,0.00037992976,0.000010602967,0.000036020094,0.000002124013,0.8542352,0.0062594665,0.13223372,0.0051020184,0.000926004],"about_ca_topic_score_codex":0.00009839445,"about_ca_topic_score_gemma":0.000098094766,"teacher_disagreement_score":0.8226384,"about_ca_system_score_codex":0.00078449305,"about_ca_system_score_gemma":0.0007185711,"threshold_uncertainty_score":0.9997334},"labels":[],"label_agreement":null},{"id":"W4293565893","doi":"10.5281/zenodo.10939686","title":"Circular Nim Games CN(7,4)","year":2021,"lang":"en","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Position (finance); Set (abstract data type); Security token; Mathematics; Combinatorial game theory; Discrete mathematics; Computer science; Game theory; Sequential game; Mathematical economics","score_opus":0.06455875400069923,"score_gpt":0.27822487199467366,"score_spread":0.21366611799397445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293565893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01690017,0.0011042411,0.85342073,0.004219337,0.001479757,0.00091888884,0.00011176016,0.0038598508,0.11798527],"genre_scores_gemma":[0.9781333,0.0005560903,0.014015116,0.0006928889,0.0006854217,2.1909543e-7,0.0016224087,0.00265756,0.0016369885],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99626064,0.0006517115,0.0005031559,0.0012217993,0.0007846377,0.00057803694],"domain_scores_gemma":[0.9961437,0.00004606762,0.0002507359,0.0020480137,0.0012508901,0.00026062285],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0009950794,0.00030827304,0.00032413358,0.0003376756,0.0015795919,0.0049905237,0.00547281,0.00023401233,0.006500294],"category_scores_gemma":[0.0011431825,0.00035497884,0.00018213193,0.00072228117,0.00023703666,0.0004956383,0.014091694,0.00093878567,0.008472328],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018722218,0.00043537948,0.000008067984,0.00040272312,0.00025845805,0.00035538635,0.010914732,0.0037756674,0.005734649,0.04122174,0.2496545,0.68722],"study_design_scores_gemma":[0.000090622285,0.000092614595,0.00017247975,0.0001556118,0.000018658622,0.00015712748,0.0005273325,0.015093335,0.0043025957,0.0043943007,0.97445935,0.0005359627],"about_ca_topic_score_codex":0.000045512297,"about_ca_topic_score_gemma":4.7792975e-7,"teacher_disagreement_score":0.96123314,"about_ca_system_score_codex":0.0002686835,"about_ca_system_score_gemma":0.000025637386,"threshold_uncertainty_score":0.99990803},"labels":[],"label_agreement":null},{"id":"W4294975608","doi":"10.1109/iri54793.2022.00054","title":"A Deep Learning Sequential-based Model for Predicting Victories in Video Games","year":2022,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Feature engineering; Generalization; Artificial intelligence; Adaptability; Deep learning; Convolutional neural network; F1 score; Feature (linguistics); Machine learning; Video game; Artificial neural network; Data mining; Multimedia; Mathematics","score_opus":0.04159013697924415,"score_gpt":0.2936685095913912,"score_spread":0.25207837261214705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294975608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021951566,0.00006075853,0.97577536,0.00062954996,0.00028281036,0.00025729957,0.000001301491,0.00030451626,0.00073685194],"genre_scores_gemma":[0.92043567,0.0000012326976,0.0781547,0.00033433895,0.00003532656,0.00028921093,0.000002889825,0.000013077416,0.0007335891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985316,0.00009786545,0.00031406395,0.00039884684,0.00030668065,0.00035094158],"domain_scores_gemma":[0.99917597,0.0003467564,0.000092102506,0.00026961582,0.00006726977,0.000048313846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006438156,0.00011637903,0.00014139383,0.00016538851,0.0003677817,0.00013503047,0.0007270212,0.000030270288,0.00006548413],"category_scores_gemma":[0.00025404888,0.0001235864,0.00007329387,0.00041758097,0.00003892972,0.00036458988,0.00038896612,0.00023557451,0.000005375312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012768467,0.000032700755,0.004481163,0.000008259241,0.0000039554143,0.0000035703522,0.004402851,0.9604275,0.00045751035,0.0200036,0.00005791314,0.010108216],"study_design_scores_gemma":[0.000087243,0.00008736632,0.000036515507,0.00000598668,0.0000023569528,0.0000017048615,0.0007901416,0.98426205,0.0038349149,0.00947916,0.0012698098,0.0001427746],"about_ca_topic_score_codex":0.00011831506,"about_ca_topic_score_gemma":0.0004374631,"teacher_disagreement_score":0.89848405,"about_ca_system_score_codex":0.00014669017,"about_ca_system_score_gemma":0.00014270288,"threshold_uncertainty_score":0.50397074},"labels":[],"label_agreement":null},{"id":"W4296942682","doi":"10.1609/aaai.v30i1.10180","title":"Factorization Ranking Model for Move Prediction in the Game of Go","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ranking (information retrieval); Computer science; Factorization; Artificial intelligence; Machine learning; Preference; Computation; Process (computing); Algorithm; Mathematics; Statistics","score_opus":0.10763938493795917,"score_gpt":0.3094855580878762,"score_spread":0.20184617314991704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296942682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10074261,0.000011747927,0.893173,0.0032311883,0.00036316807,0.00085771654,0.000020212881,0.000050483573,0.0015498869],"genre_scores_gemma":[0.99677306,0.000031073167,0.0027259951,0.000113235285,0.00006322487,0.00008863713,4.054463e-7,0.000012459704,0.00019191943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997689,0.000031429285,0.0008606298,0.00046377472,0.0006064791,0.00034867],"domain_scores_gemma":[0.9977589,0.00043232366,0.00057174766,0.0003942656,0.0008025002,0.000040218223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061687,0.00021174378,0.00026566186,0.00017937229,0.00011030068,0.000117518284,0.0024264383,0.00011729088,0.000016605198],"category_scores_gemma":[0.0011037244,0.0001166601,0.0001476522,0.00067718205,0.00032095978,0.0007077575,0.00019641126,0.00016715906,0.000018347559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007349858,0.000117267075,0.00064277364,0.00002893165,0.00000772597,6.821291e-8,0.0054170084,0.0010613126,0.09109436,0.8164239,0.000063090665,0.085070044],"study_design_scores_gemma":[0.000019285226,0.000091297,0.0001572415,0.00016900952,0.000005591671,7.041544e-7,0.00028973995,0.33986166,0.3387791,0.3205253,0.000017903063,0.00008317592],"about_ca_topic_score_codex":0.000024465147,"about_ca_topic_score_gemma":0.000021360127,"teacher_disagreement_score":0.8960304,"about_ca_system_score_codex":0.00006953504,"about_ca_system_score_gemma":0.00011108484,"threshold_uncertainty_score":0.4757261},"labels":[],"label_agreement":null},{"id":"W4298280663","doi":"10.1515/9783110755411-016","title":"Recursive comparison tests for dicot and dead-ending games under misère play","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Dalhousie University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Modulo; Test (biology); Argument (complex analysis); Mathematics; Constructive; Combinatorics; Order (exchange); Preference; Position (finance); Mathematical economics; Combinatorial game theory; Computer science; Sequential game; Game theory; Statistics; Economics","score_opus":0.08876298578382887,"score_gpt":0.33403452193959793,"score_spread":0.24527153615576908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298280663","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008483142,0.0021220716,0.5016901,0.0018357133,0.001393851,0.0009934905,0.000045056044,0.00026652112,0.49156836],"genre_scores_gemma":[0.05163331,0.00056134484,0.11058349,0.0016591203,0.00067199266,0.00019668251,0.00008635008,0.00020546008,0.83440226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977947,0.000024731924,0.0005053505,0.0008686676,0.00041445906,0.00039211908],"domain_scores_gemma":[0.99779004,0.0010341597,0.00030872965,0.0006044112,0.000117359836,0.00014530425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024216322,0.00039493653,0.00050158554,0.00023421845,0.00033387693,0.00026391709,0.0009928459,0.0002221882,0.0008878228],"category_scores_gemma":[0.00007237454,0.00038193946,0.00015420941,0.000059032536,0.00017546404,0.0003183264,0.00069403084,0.00042537446,0.00006629921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008697883,0.000016748369,0.00005827176,0.0000196689,0.00005217214,0.000008238157,0.00079218484,0.00012519746,0.000020940597,0.94797885,0.010358243,0.040560793],"study_design_scores_gemma":[0.00009005287,0.00032304908,0.00003201762,0.00012560358,0.0000455823,0.000029187546,0.0003278207,0.008686914,0.00096807175,0.38145006,0.6071918,0.00072985335],"about_ca_topic_score_codex":0.000031184383,"about_ca_topic_score_gemma":0.00014265983,"teacher_disagreement_score":0.5968335,"about_ca_system_score_codex":0.00016185823,"about_ca_system_score_gemma":0.0001054913,"threshold_uncertainty_score":0.99986327},"labels":[],"label_agreement":null},{"id":"W4300847318","doi":"10.1609/aaai.v29i1.9363","title":"TDS+: Improving Temperature Discovery Search","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Game theory; Algorithm; Mathematics; Mathematical optimization; Theoretical computer science; Mathematical economics","score_opus":0.10757399461640049,"score_gpt":0.31572006443464384,"score_spread":0.20814606981824335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300847318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86775386,0.0001722251,0.078902274,0.01505123,0.0032745418,0.0014973704,0.000018555984,0.00054673804,0.032783218],"genre_scores_gemma":[0.993712,0.000018469238,0.004501322,0.00035409207,0.00021005588,0.000030969877,5.623066e-7,0.000025960788,0.0011465369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99633145,0.000049198425,0.0008272731,0.00086399756,0.0012313906,0.00069670466],"domain_scores_gemma":[0.9969113,0.00015048997,0.00038970562,0.0007119905,0.001568577,0.00026793464],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012673736,0.00038658342,0.00039733207,0.00022884742,0.0002867787,0.0011153644,0.0043903356,0.00019621641,0.00002983966],"category_scores_gemma":[0.0011523187,0.0002814541,0.00020186738,0.0013163693,0.00057756266,0.0018629747,0.0011861153,0.00072368473,0.00027598807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067879046,0.00016122553,0.00031647473,0.00003234718,0.000015414682,0.0000019283166,0.0028655296,0.0002426376,0.09310417,0.8409218,0.0004354048,0.06183518],"study_design_scores_gemma":[0.000020242258,0.00027233962,0.00006665943,0.00015109601,0.000009574369,0.0000105393265,0.0022979716,0.04157766,0.80224,0.15291466,0.0001084641,0.00033079623],"about_ca_topic_score_codex":0.00017755723,"about_ca_topic_score_gemma":0.000024502537,"teacher_disagreement_score":0.70913583,"about_ca_system_score_codex":0.00014093025,"about_ca_system_score_gemma":0.00046235145,"threshold_uncertainty_score":0.99996376},"labels":[],"label_agreement":null},{"id":"W4304616973","doi":"10.1145/3561975.3562948","title":"Stealthy path planning against dynamic observers","year":2022,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Pathfinding; Covert; Computer science; Motion planning; Probabilistic logic; Weighting; Path (computing); Plan (archaeology); Virtual reality; Human–computer interaction; Robot; Simulation; Artificial intelligence; Theoretical computer science; Shortest path problem; Computer network","score_opus":0.04277036498558276,"score_gpt":0.29923455228712564,"score_spread":0.25646418730154286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304616973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36766177,0.00023617386,0.60558003,0.002551233,0.0016221601,0.00023280612,0.000004679934,0.0007294541,0.021381686],"genre_scores_gemma":[0.98218423,0.000004706457,0.014191414,0.002131603,0.000016578373,0.000027243177,0.0000030844096,0.000008345915,0.00143278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987275,0.00009007843,0.00020708833,0.00032640557,0.00035195172,0.00029699496],"domain_scores_gemma":[0.9992817,0.00009547555,0.00006816538,0.0004531612,0.000025627396,0.000075847354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033218102,0.00009339531,0.00009691574,0.00008217427,0.00039308536,0.00008633859,0.0011848186,0.000018270894,0.00014013608],"category_scores_gemma":[0.000025850613,0.00009417256,0.000051099163,0.00039239187,0.000027499054,0.00028410985,0.0007484162,0.00020291883,0.000095635434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030188081,0.000298198,0.012065767,0.000026708673,0.000051631563,0.000500217,0.017209636,0.24632983,0.0029573427,0.24066918,0.022714585,0.45714673],"study_design_scores_gemma":[0.00006050022,0.0001591634,0.0012414106,0.000006679868,0.0000016768191,0.000011300265,0.0030615625,0.9572237,0.0006799608,0.0055602756,0.03171936,0.0002743734],"about_ca_topic_score_codex":0.000055647444,"about_ca_topic_score_gemma":0.000007851085,"teacher_disagreement_score":0.7108939,"about_ca_system_score_codex":0.00015102145,"about_ca_system_score_gemma":0.000088524466,"threshold_uncertainty_score":0.38402456},"labels":[],"label_agreement":null},{"id":"W4306679461","doi":"10.1609/aiide.v18i1.21958","title":"Automated Play-Testing through RL Based Human-Like Play-Styles Generation","year":2022,"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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ubisoft (Canada)","funders":"","keywords":"Computer science; Variety (cybernetics); Video game; Reinforcement learning; Human–computer interaction; Production (economics); Order (exchange); Learning styles; Game design; Artificial intelligence; Multimedia; Psychology","score_opus":0.09833239966406118,"score_gpt":0.31644501259127616,"score_spread":0.21811261292721498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306679461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93082637,0.000036861158,0.043253306,0.0028721523,0.0010990615,0.0012553504,0.000070042566,0.00049203594,0.020094832],"genre_scores_gemma":[0.9976612,0.000005304432,0.0011181338,0.0007227917,0.000069114176,0.00015705214,0.000009558661,0.000023984381,0.00023290739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969567,0.000050828814,0.00086252514,0.0008225271,0.0008360966,0.00047132015],"domain_scores_gemma":[0.9981396,0.00024094529,0.00066059676,0.0003380124,0.0005193769,0.00010144603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035773095,0.00038910683,0.00034961328,0.0001879771,0.00081026286,0.0009239943,0.0015997642,0.00006393458,0.00012216279],"category_scores_gemma":[0.00032100975,0.00032655973,0.00016293791,0.0005910253,0.00031940886,0.0017055206,0.0011084741,0.0004731974,0.000031261505],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002925748,0.0018126699,0.0018539997,0.00006496368,0.0001558974,0.000010385338,0.013141838,0.004590512,0.22325261,0.64257234,0.0016697492,0.11058247],"study_design_scores_gemma":[0.000056436453,0.0010764961,0.00013833086,0.00017464164,0.000016284042,0.00001619482,0.0050744643,0.48578945,0.48739362,0.019254338,0.0005878315,0.00042191945],"about_ca_topic_score_codex":0.000083510145,"about_ca_topic_score_gemma":0.0000086017735,"teacher_disagreement_score":0.623318,"about_ca_system_score_codex":0.0002514542,"about_ca_system_score_gemma":0.00010070241,"threshold_uncertainty_score":0.99991864},"labels":[],"label_agreement":null},{"id":"W4306759121","doi":"10.1609/aiide.v18i1.21977","title":"FarmQuest: A Demonstration of an AI Director Video Game Test Bed","year":2022,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Intuition; Computer science; Test (biology); Video game; Artificial intelligence; Operations research; Multimedia; Engineering; Psychology; Cognitive science","score_opus":0.035414651364004866,"score_gpt":0.2905972546056102,"score_spread":0.25518260324160535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306759121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97390085,0.00002531089,0.014427883,0.003195575,0.0005133641,0.00083801674,0.000080360915,0.000088487956,0.006930127],"genre_scores_gemma":[0.9990698,0.00001488698,0.00026143828,0.00033829117,0.000034024146,0.000098287266,0.000003667834,0.000015491914,0.00016411106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974682,0.000038532406,0.0008192961,0.00062657386,0.00071586855,0.0003315605],"domain_scores_gemma":[0.99814075,0.00024760945,0.0006235595,0.00032194506,0.0005450939,0.000121035366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034035958,0.00028970256,0.0003400315,0.00020637465,0.00025139493,0.0004553091,0.0015075288,0.000049549613,0.000098608885],"category_scores_gemma":[0.00039961265,0.00023852654,0.0001547048,0.00045017622,0.00036060097,0.0019103597,0.0008523707,0.00039527085,0.000012780217],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048694704,0.0024724954,0.002782457,0.000048053684,0.00009566733,0.0000035007565,0.013155153,0.00024654772,0.11535924,0.4740688,0.00009712785,0.391184],"study_design_scores_gemma":[0.000041555846,0.002102705,0.00029499206,0.00014221332,0.000016802309,0.000018516592,0.00691029,0.07000529,0.8642655,0.05560493,0.00028965666,0.00030755924],"about_ca_topic_score_codex":0.00007847646,"about_ca_topic_score_gemma":0.0000120116065,"teacher_disagreement_score":0.74890625,"about_ca_system_score_codex":0.00014437319,"about_ca_system_score_gemma":0.00009255787,"threshold_uncertainty_score":0.97268295},"labels":[],"label_agreement":null},{"id":"W4306759267","doi":"10.1609/aiide.v18i1.21949","title":"Adventures of AI Directors Early in the Development of Nightingale","year":2022,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Mitacs","keywords":"Adventure; Theme (computing); Video game; Preference; Management; Domain (mathematical analysis); Psychology; Computer science; Artificial intelligence; Multimedia; Economics; World Wide Web","score_opus":0.04043984844087791,"score_gpt":0.2880413988516435,"score_spread":0.24760155041076556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306759267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899928,0.000024730782,0.0034749312,0.0010010242,0.00023170991,0.0004635769,0.000012506606,0.000013012304,0.0047857147],"genre_scores_gemma":[0.9994364,0.00000590404,0.0002539189,0.00013991528,0.000013265615,0.00007498548,9.036093e-7,0.0000079837455,0.00006675022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99764603,0.000045439272,0.0009272377,0.0003810631,0.00073829654,0.000261931],"domain_scores_gemma":[0.99860364,0.00023692008,0.00059463765,0.00023559225,0.0002884518,0.000040736824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056256045,0.00020992816,0.00029938077,0.00020604656,0.00017294711,0.00015419432,0.0017791424,0.000032609805,0.00003986864],"category_scores_gemma":[0.00022502679,0.00014109327,0.00012968063,0.0005067541,0.00027815482,0.00063532183,0.0008376622,0.00038300807,0.0000037629752],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005301082,0.00213387,0.017558096,0.00010261089,0.00011222421,0.0000019790607,0.12925537,0.00025913288,0.033419356,0.51477623,0.00010027467,0.30175075],"study_design_scores_gemma":[0.000043210403,0.00084147265,0.0032115523,0.0003039388,0.000009586103,0.000004676581,0.026931643,0.005528449,0.92131364,0.041186888,0.00037604466,0.0002488879],"about_ca_topic_score_codex":0.000059679267,"about_ca_topic_score_gemma":0.000016448099,"teacher_disagreement_score":0.8878943,"about_ca_system_score_codex":0.000088681336,"about_ca_system_score_gemma":0.00009263973,"threshold_uncertainty_score":0.57536167},"labels":[],"label_agreement":null},{"id":"W4311072863","doi":"10.1613/jair.1.13769","title":"Asymmetric Action Abstractions for Planning in Real-Time Strategy Games","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; University of Alberta; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Universidade Federal de Viçosa; Canadian Institute for Advanced Research","keywords":"Computer science; Iterative deepening depth-first search; Action (physics); Search algorithm; Set (abstract data type); Context (archaeology); Theoretical computer science; Greedy algorithm; Combinatorial game theory; Tree (set theory); Abstraction; Search tree; Sequential game; Beam search; Game theory; Algorithm; Best-first search; Mathematics; Mathematical economics; Programming language","score_opus":0.33304306061782796,"score_gpt":0.48880815397746014,"score_spread":0.15576509335963218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311072863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34907788,0.00072699884,0.64007336,0.0030496612,0.0020731105,0.00105414,0.000012013303,0.00009857028,0.003834284],"genre_scores_gemma":[0.9891623,0.00024264454,0.009776947,0.000022922248,0.00041375868,0.00007568952,0.0000016638932,0.000022883205,0.0002811395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522185,0.0006281779,0.0013472156,0.0004122528,0.0015975953,0.00079292397],"domain_scores_gemma":[0.99524826,0.0026387284,0.0004883106,0.0004165303,0.0010113138,0.00019683714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008409568,0.000168039,0.00034541165,0.0026948927,0.00073959766,0.00040486793,0.0018241024,0.00009260787,0.0002486211],"category_scores_gemma":[0.0012376743,0.00017120788,0.00020705983,0.0031668085,0.00016857064,0.0011156745,0.00035009254,0.0014790116,0.000103135055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003507275,0.0007060769,0.00022328412,0.000020933214,0.00004014539,0.00018668115,0.0026603106,0.2041996,0.0279524,0.041264404,0.0023066236,0.72008884],"study_design_scores_gemma":[0.00009853886,0.0037916442,0.0009450343,0.00009787666,0.000012307139,0.0003454202,0.024985382,0.4772572,0.16658603,0.3155801,0.0097521385,0.00054834696],"about_ca_topic_score_codex":0.0002541284,"about_ca_topic_score_gemma":0.000049063852,"teacher_disagreement_score":0.7195405,"about_ca_system_score_codex":0.000706525,"about_ca_system_score_gemma":0.00078084436,"threshold_uncertainty_score":0.6981655},"labels":[],"label_agreement":null},{"id":"W4312238204","doi":"10.1609/aiide.v3i1.18791","title":"HPA* Enhancements","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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Smoothing; Computer science; Path (computing); Enhanced Data Rates for GSM Evolution; Artificial intelligence; Shortest path problem; Computer vision; Theoretical computer science; Programming language","score_opus":0.04551482184659383,"score_gpt":0.3038045676735414,"score_spread":0.2582897458269476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312238204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67366534,0.000039864375,0.23551512,0.0030393542,0.0012203533,0.0009567651,0.0000141609,0.0001334038,0.08541564],"genre_scores_gemma":[0.99820304,0.00003334885,0.0006139762,0.00041556268,0.000061520266,0.00002066818,8.735647e-7,0.000014090523,0.0006369033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99741,0.0000103125885,0.0008029841,0.0006320208,0.00063051324,0.0005141802],"domain_scores_gemma":[0.9983665,0.00019291279,0.0004587496,0.00030517622,0.0005186706,0.00015799425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004635248,0.00032296046,0.0002911598,0.00019367416,0.00018605831,0.00063134223,0.0014948712,0.000080640544,0.000062608735],"category_scores_gemma":[0.00034274824,0.0002389412,0.00015695178,0.00040192404,0.0003747823,0.0016082694,0.0007390267,0.00031359008,0.00012009301],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019107395,0.00042919553,0.0008924239,0.000020308818,0.000051214287,0.0000019874108,0.0031154018,0.0000062589656,0.023848493,0.5537784,0.00009580207,0.41756943],"study_design_scores_gemma":[0.00003041094,0.0005557966,0.00039547446,0.00028876882,0.000009089681,0.00000928326,0.003940173,0.005801669,0.9036108,0.08428216,0.00077335635,0.0003029846],"about_ca_topic_score_codex":0.00002146144,"about_ca_topic_score_gemma":0.000008054119,"teacher_disagreement_score":0.87976235,"about_ca_system_score_codex":0.0001245269,"about_ca_system_score_gemma":0.000039108403,"threshold_uncertainty_score":0.97437394},"labels":[],"label_agreement":null},{"id":"W4312307809","doi":"10.1007/978-3-031-22298-6_14","title":"Dramatic Situations for Emergent Narrative System Authorship","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Narrative; Computer science; Construct (python library); Relevance (law); Artifact (error); Process (computing); Heuristic; Space (punctuation); Tracing; Cognitive psychology; Cognitive science; Psychology; Artificial intelligence; Political science; Literature; Art","score_opus":0.04832716144921945,"score_gpt":0.29987093999201453,"score_spread":0.2515437785427951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312307809","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058931066,0.00026522527,0.9895072,0.00195054,0.0046167662,0.0012202228,0.000014999244,0.00030267087,0.0020634173],"genre_scores_gemma":[0.32814497,0.000023163295,0.66854703,0.0008750527,0.0007728917,0.00032302106,0.00002041618,0.000078736404,0.0012147374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955393,0.000088380504,0.0008390646,0.0015899285,0.0012130307,0.00073031377],"domain_scores_gemma":[0.9963419,0.0011198919,0.00047320625,0.0014661,0.00039681423,0.00020212911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016739568,0.0005185182,0.0005662576,0.0008682262,0.0009968518,0.00054011337,0.0042846124,0.00024032578,0.00011611525],"category_scores_gemma":[0.000307073,0.0005052479,0.00023292078,0.0008331511,0.00051633775,0.00066512986,0.0013665771,0.00076636695,0.000058030957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068261606,0.000037251175,0.0000070286087,0.00012272864,0.00002484498,0.000034955538,0.020292405,0.116517305,0.0000741883,0.53836906,0.00011186585,0.32440153],"study_design_scores_gemma":[0.000057417543,0.00019732448,0.000004516375,0.00021464891,0.0000114647555,0.000027689366,0.000010512187,0.6965166,0.00079031166,0.29902536,0.0026240624,0.00052014145],"about_ca_topic_score_codex":0.000033474804,"about_ca_topic_score_gemma":0.00012062465,"teacher_disagreement_score":0.57999927,"about_ca_system_score_codex":0.00095817214,"about_ca_system_score_gemma":0.00079689285,"threshold_uncertainty_score":0.9997399},"labels":[],"label_agreement":null},{"id":"W4312371681","doi":"10.1609/aiide.v10i2.12738","title":"Preface","year":2014,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Presentation (obstetrics); Pleasure; Computer science; Adversarial system; Representation (politics); Term (time); Artificial intelligence; Psychology; Political science","score_opus":0.038918205287640534,"score_gpt":0.2792691293390521,"score_spread":0.2403509240514116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312371681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61972874,0.00003422677,0.2314912,0.01008896,0.001291042,0.0011721606,0.000017616776,0.00023189136,0.13594417],"genre_scores_gemma":[0.99831665,0.000022495873,0.0005454594,0.00043300755,0.000056737314,0.000033065047,6.2249023e-7,0.000013751798,0.00057819724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997868,0.000021288004,0.00060636643,0.00061808777,0.0005058881,0.00038035284],"domain_scores_gemma":[0.9985004,0.00020711312,0.0003876214,0.00033706793,0.00043571726,0.00013209248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029262746,0.00030268828,0.00029796868,0.00013237423,0.00017066883,0.00077556993,0.0015475865,0.000072713265,0.00004257877],"category_scores_gemma":[0.000551913,0.00021652858,0.00015128028,0.00029606195,0.000363354,0.001485581,0.0007337404,0.00029150816,0.000124175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006869545,0.00022112652,0.000433476,0.000018077491,0.000026863618,2.5188805e-7,0.0018710747,0.000024328549,0.0064070905,0.70398873,0.000104236315,0.28683603],"study_design_scores_gemma":[0.0000345306,0.0008177311,0.0002912171,0.00036844914,0.000011763594,0.000010379856,0.0022290815,0.076479204,0.683433,0.23392001,0.002019733,0.00038492607],"about_ca_topic_score_codex":0.0000176706,"about_ca_topic_score_gemma":0.0000034628736,"teacher_disagreement_score":0.6770259,"about_ca_system_score_codex":0.00007124171,"about_ca_system_score_gemma":0.00003108632,"threshold_uncertainty_score":0.8829779},"labels":[],"label_agreement":null},{"id":"W4312381398","doi":"10.1609/aiide.v11i2.12811","title":"StarCraft Unit Motion: Analysis and Search Enhancements","year":2015,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Motion (physics); Focus (optics); Scripting language; Set (abstract data type); Adversary; Unit (ring theory); Artificial intelligence; Motion planning; Robot; Programming language; Computer security; Mathematics","score_opus":0.09385145836623339,"score_gpt":0.3249705460475635,"score_spread":0.2311190876813301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312381398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.836303,0.0000363216,0.14942622,0.0027569463,0.0002930127,0.00052475004,0.000018712502,0.000058810183,0.010582221],"genre_scores_gemma":[0.99873555,0.00004573062,0.00053132314,0.00018753471,0.00003196825,0.000025590934,0.0000022088084,0.00000979226,0.0004303211],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977029,0.00002747281,0.00058433466,0.0006380658,0.00068070006,0.0003665286],"domain_scores_gemma":[0.998305,0.000118726835,0.00027083087,0.0002768422,0.00079628336,0.00023230912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039636483,0.00028305978,0.0003434152,0.00031864582,0.00014482168,0.00087502087,0.0009822866,0.00006468946,0.000037506874],"category_scores_gemma":[0.00027795535,0.00021294356,0.00012785612,0.0007978717,0.00041865718,0.0016408827,0.0008655723,0.00026731467,0.00004387641],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041979973,0.00085431087,0.022095319,0.00004935755,0.00060076144,0.0000035199776,0.017467523,0.0001926787,0.006591066,0.42973566,0.00008503292,0.52190495],"study_design_scores_gemma":[0.000090602094,0.0013371173,0.0020307556,0.0002757249,0.00011544029,0.0000113350825,0.017870221,0.13114084,0.7544125,0.0917712,0.00036087382,0.00058341795],"about_ca_topic_score_codex":0.00008386235,"about_ca_topic_score_gemma":0.000016247768,"teacher_disagreement_score":0.7478214,"about_ca_system_score_codex":0.000093177456,"about_ca_system_score_gemma":0.00005737646,"threshold_uncertainty_score":0.8683587},"labels":[],"label_agreement":null},{"id":"W4312409458","doi":"10.1609/socs.v15i1.21749","title":"Portability and Explainability of Synthesized Formula-based Heuristics","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Pathfinding; Heuristics; Computer science; Parameterized complexity; Heuristic; Simulated annealing; Theoretical computer science; Graph; Mathematical optimization; Fitness function; Algorithm; Genetic algorithm; Artificial intelligence; Machine learning; Mathematics; Shortest path problem","score_opus":0.019961159885410716,"score_gpt":0.2687441206505433,"score_spread":0.2487829607651326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312409458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896816,0.0000086171685,0.0004159002,0.0049770377,0.0019208662,0.0003995861,0.000018523073,0.000036587084,0.0025412627],"genre_scores_gemma":[0.99913955,0.0000021870505,0.00065303565,0.000063138206,0.00005772717,0.000045935863,5.648705e-7,0.000008357522,0.000029521982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975884,0.00004617705,0.00045852026,0.0003594638,0.0013568503,0.0001905979],"domain_scores_gemma":[0.9981289,0.0005591871,0.00026915144,0.00025605396,0.00072892586,0.00005780117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016201203,0.00012128554,0.00020383141,0.0000853092,0.00022769332,0.00006673363,0.0022183293,0.000038942122,0.000034826928],"category_scores_gemma":[0.0008081409,0.00010234698,0.000113841656,0.0003268129,0.00022876252,0.00019140383,0.0012844796,0.00028076576,8.627368e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039997173,0.00073698105,0.037514772,0.00007681951,0.0000328029,6.673131e-7,0.00075515313,0.0005270616,0.031356875,0.927052,0.00018438185,0.0013624856],"study_design_scores_gemma":[0.0005401112,0.00058774935,0.0038267851,0.00004382687,0.000012196312,0.0000057556654,0.00034797058,0.046365958,0.7631292,0.18399605,0.00093064416,0.0002137658],"about_ca_topic_score_codex":0.0001517582,"about_ca_topic_score_gemma":0.0000010498587,"teacher_disagreement_score":0.743056,"about_ca_system_score_codex":0.0002430606,"about_ca_system_score_gemma":0.000119393175,"threshold_uncertainty_score":0.41735888},"labels":[],"label_agreement":null},{"id":"W4312496759","doi":"10.1609/aiide.v17i1.18915","title":"A Tool for Generating Monster Silhouettes with a Word-Conditioned Variational Autoencoder","year":2021,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Autoencoder; Character (mathematics); Monster; Task (project management); Game design; Computer science; Creativity; Word (group theory); Human–computer interaction; Process (computing); Artificial intelligence; Engineering design process; Psychology; Aesthetics; Natural language processing; Linguistics; Engineering; Art; Mathematics; Social psychology; Artificial neural network; Literature","score_opus":0.03727612705984979,"score_gpt":0.2778835742385605,"score_spread":0.24060744717871074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312496759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34717533,0.000023755254,0.6415646,0.0060883346,0.00037510827,0.0008648611,0.000056874975,0.00007680343,0.003774336],"genre_scores_gemma":[0.9863994,0.0000073948527,0.012196761,0.0006913582,0.00007515523,0.00015828696,0.000005749705,0.000015970707,0.00044991187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99795085,0.000017044735,0.00059115875,0.00064603664,0.00045321864,0.00034170755],"domain_scores_gemma":[0.9979101,0.00031847166,0.00037808044,0.0002297553,0.0010847207,0.00007888274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001823381,0.00028337614,0.00028262596,0.000101244565,0.00025099533,0.0010341436,0.00063539,0.00006439181,0.00005791718],"category_scores_gemma":[0.00045850646,0.0002046083,0.00014206991,0.0002958167,0.00022497574,0.0012154832,0.00033374978,0.00020135452,0.000016409445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034289103,0.0006717513,0.0010393109,0.000059092738,0.00018506602,0.0000036350125,0.0050432216,0.0010061014,0.027712954,0.80215937,0.00018588162,0.1615907],"study_design_scores_gemma":[0.00008313699,0.00052608154,0.00026522987,0.00045779874,0.000026895335,0.000029939143,0.0032980018,0.36756998,0.5333583,0.09376686,0.00022387964,0.00039394718],"about_ca_topic_score_codex":0.000006414217,"about_ca_topic_score_gemma":0.000006982577,"teacher_disagreement_score":0.70839256,"about_ca_system_score_codex":0.0000872005,"about_ca_system_score_gemma":0.00013349709,"threshold_uncertainty_score":0.99722713},"labels":[],"label_agreement":null},{"id":"W4312536316","doi":"10.1145/3555858.3555888","title":"The Effects of Human-like Modifications to Heuristic Action Evaluation in Video Game Pathfinding","year":2022,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Heuristic; Action (physics); SAFER; Pathfinding; Video game; Artificial intelligence; Duration (music); Value (mathematics); Human–computer interaction; Mathematical optimization; Machine learning; Theoretical computer science; Multimedia; Mathematics; Computer security","score_opus":0.08312515442176689,"score_gpt":0.3696487390159892,"score_spread":0.28652358459422234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312536316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72628516,0.000076190794,0.27054945,0.00073261524,0.00086160994,0.0007217492,5.4457627e-7,0.000060260052,0.00071244873],"genre_scores_gemma":[0.9984944,0.0000041897483,0.0007346471,0.00008916182,0.000015822683,0.00036783997,0.0000010122163,0.000004388117,0.00028856518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859285,0.00029175665,0.00026395443,0.00022499368,0.00047096293,0.00015548567],"domain_scores_gemma":[0.9987074,0.00064130453,0.00009108793,0.00044030417,0.00008849029,0.000031403433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011377351,0.000060827908,0.00007313953,0.0001546839,0.0003317073,0.0000621489,0.0006240247,0.000015888509,0.00002769417],"category_scores_gemma":[0.0004913499,0.000052217092,0.000029617151,0.00067799236,0.000025907155,0.00016099395,0.00024067074,0.000119481025,0.000023707995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016559305,0.00031907117,0.0015627033,0.00003568877,0.000017690552,0.0000044693343,0.016542455,0.087611295,0.16329734,0.29680434,0.002035471,0.4317529],"study_design_scores_gemma":[0.00013634778,0.0003971137,0.016334303,0.000027925109,0.000013797697,0.0000036527517,0.0013196137,0.7942531,0.108130775,0.077886984,0.0012697582,0.00022663028],"about_ca_topic_score_codex":0.00020216407,"about_ca_topic_score_gemma":0.00021060424,"teacher_disagreement_score":0.7066418,"about_ca_system_score_codex":0.00020262608,"about_ca_system_score_gemma":0.000063851585,"threshold_uncertainty_score":0.2551258},"labels":[],"label_agreement":null},{"id":"W4312571336","doi":"10.1145/3524842.3528438","title":"CLIP meets GamePhysics","year":2022,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Metadata; Event (particle physics); Social media; Video game; Parsing; Multimedia; Shot (pellet); World Wide Web; Code (set theory); Information retrieval; Human–computer interaction; Artificial intelligence; Programming language","score_opus":0.03391585862853445,"score_gpt":0.2791835955461684,"score_spread":0.24526773691763396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312571336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020714065,0.00006235408,0.8932685,0.0058823316,0.0011957579,0.00012987806,0.0000014054781,0.00052497105,0.07822069],"genre_scores_gemma":[0.97629666,0.0000020050036,0.019325366,0.0014994328,0.000049983708,0.000025434947,4.782923e-7,0.000004911174,0.0027956972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914956,0.000049574577,0.00012116864,0.00022114864,0.00028277046,0.0001757545],"domain_scores_gemma":[0.9994076,0.00006420855,0.000032917877,0.00042891287,0.000025010911,0.00004134971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017583037,0.0000577526,0.00006280516,0.00003830516,0.00020407504,0.000063457184,0.0010232843,0.0000090360545,0.00051937636],"category_scores_gemma":[0.000014765923,0.00005638811,0.00004300835,0.00033089286,0.000025312294,0.00021833066,0.0007806437,0.000107561515,0.00031476875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011731145,0.00005277773,0.00020104517,7.6513766e-7,0.000004084845,0.000010622418,0.0007808217,0.0016068633,0.0007360586,0.8714337,0.010286262,0.11488584],"study_design_scores_gemma":[0.000051465326,0.00018513323,0.00028494466,0.0000016081784,0.0000028472741,0.000024215276,0.0005725079,0.2637965,0.037827,0.18622175,0.5106748,0.00035725124],"about_ca_topic_score_codex":0.000044260698,"about_ca_topic_score_gemma":0.000005180141,"teacher_disagreement_score":0.9555826,"about_ca_system_score_codex":0.000037874444,"about_ca_system_score_gemma":0.000036908415,"threshold_uncertainty_score":0.5686807},"labels":[],"label_agreement":null},{"id":"W4312810017","doi":"10.1609/aiide.v9i1.12616","title":"Invited Talks","year":2013,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ubisoft (Canada)","funders":"","keywords":"Political science","score_opus":0.040177245600519926,"score_gpt":0.27290888990188333,"score_spread":0.2327316443013634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312810017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.906649,0.00003570614,0.035265483,0.025253955,0.0008334192,0.0015076526,0.000015684325,0.0001747132,0.030264374],"genre_scores_gemma":[0.997611,0.000028813847,0.00044332547,0.0014257774,0.000044487024,0.000093152914,0.0000010560882,0.00001529117,0.0003371375],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99771386,0.000016104652,0.0006978191,0.00062273355,0.00051779335,0.00043165928],"domain_scores_gemma":[0.9982694,0.00016349646,0.00040872308,0.0003263711,0.00067184045,0.00016018118],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00016077071,0.0003331932,0.0003074436,0.00017920237,0.00016986208,0.0012191646,0.0015556874,0.00008523431,0.00011590891],"category_scores_gemma":[0.0003758062,0.00023653124,0.0001624169,0.00040039196,0.00042180464,0.0025898025,0.0008197441,0.00033156725,0.0002448555],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008181746,0.00057782925,0.0012855399,0.000033971206,0.00007990288,0.0000011728405,0.004517255,0.000019917954,0.032093998,0.4353711,0.0013698867,0.5245676],"study_design_scores_gemma":[0.000037527472,0.0006821011,0.00068204134,0.0003917075,0.000011437933,0.000015030366,0.005559441,0.052778687,0.7067612,0.23178169,0.00083189906,0.00046727643],"about_ca_topic_score_codex":0.00007606088,"about_ca_topic_score_gemma":0.0000036119027,"teacher_disagreement_score":0.6746672,"about_ca_system_score_codex":0.000089206784,"about_ca_system_score_gemma":0.000023079818,"threshold_uncertainty_score":0.99981767},"labels":[],"label_agreement":null},{"id":"W4312834375","doi":"10.1609/aiide.v17i1.18916","title":"A Demonstration of KiaiTime: A Mixed-Initiative PCGML Rhythm Game Editor","year":2021,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Chart; Computer science; Rhythm; Action (physics); Task (project management); Human–computer interaction; Interface (matter); Process (computing); Multimedia; Engineering; Programming language; Art; Systems engineering; Mathematics","score_opus":0.04333418924428952,"score_gpt":0.28235472070639417,"score_spread":0.23902053146210464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312834375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.739068,0.00014278575,0.18995313,0.0109232,0.0045569437,0.0013995001,0.00013127597,0.00015632839,0.05366885],"genre_scores_gemma":[0.9986357,0.00005838094,0.00059992017,0.00021438739,0.00018850625,0.000039189687,0.0000030459507,0.000013493649,0.00024736702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975172,0.000034109635,0.0008644263,0.0006239189,0.0006162654,0.0003440431],"domain_scores_gemma":[0.997274,0.00029198857,0.00064445636,0.00029210167,0.0013806517,0.000116835894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021670999,0.0003084148,0.00040077313,0.00014206335,0.0000911941,0.0004910028,0.0008133353,0.00009610405,0.00006173481],"category_scores_gemma":[0.0006469295,0.0002464402,0.0002097639,0.0004539531,0.0004565747,0.0016996457,0.0005863636,0.00030418285,0.00003789172],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023774574,0.0009598146,0.0007103317,0.00007876029,0.00014820458,0.0000061551423,0.007060504,0.000047019865,0.043946028,0.70191383,0.0005381742,0.24435343],"study_design_scores_gemma":[0.00003698025,0.000500709,0.00020363381,0.0005398921,0.00001757974,0.000023703722,0.006170913,0.019366028,0.9100728,0.062484,0.0003347956,0.0002489642],"about_ca_topic_score_codex":0.000013769655,"about_ca_topic_score_gemma":0.000010499021,"teacher_disagreement_score":0.8661268,"about_ca_system_score_codex":0.000089951216,"about_ca_system_score_gemma":0.00015294421,"threshold_uncertainty_score":0.9999988},"labels":[],"label_agreement":null},{"id":"W4312843895","doi":"10.1609/aiide.v17i1.18886","title":"The Impact of Visualizing Design Gradients for Human Designers","year":2021,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Set (abstract data type); Process (computing); Design process; Human–computer interaction; Engineering design process; Component (thermodynamics); Subject (documents); Software engineering; Data science; World Wide Web; Work in process; Engineering; Programming language; Operations management","score_opus":0.09860487181776681,"score_gpt":0.36187637754006124,"score_spread":0.2632715057222944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312843895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62030697,0.00007700496,0.37304273,0.0010175281,0.00045926255,0.0012441231,0.000026887266,0.000048090853,0.00377743],"genre_scores_gemma":[0.99882513,0.000045711247,0.00075296947,0.00004956336,0.000029627497,0.00006782563,0.0000013831843,0.000014897798,0.0002128883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99790454,0.000036590838,0.00075026945,0.0005046652,0.0003971838,0.00040676267],"domain_scores_gemma":[0.997335,0.0006061759,0.0005757358,0.0002990427,0.0010842121,0.00009981524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043528178,0.00028308833,0.00032108725,0.00009536659,0.00036794573,0.00074357796,0.0010567104,0.00006138934,0.000011449526],"category_scores_gemma":[0.0007780379,0.0001752727,0.00032986412,0.00033623402,0.0004337975,0.0009042094,0.00045939937,0.00018458976,0.000006432672],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038542584,0.0006325843,0.00068088935,0.000037613383,0.00023268917,0.0000015986424,0.004979611,0.0002507606,0.13350303,0.67981035,0.00019831925,0.1792871],"study_design_scores_gemma":[0.000036463152,0.000945469,0.000121867975,0.00023740127,0.00001314522,0.000007583251,0.0030170954,0.027077364,0.81077784,0.15755136,0.00003370034,0.00018068067],"about_ca_topic_score_codex":0.000035964385,"about_ca_topic_score_gemma":0.000004160434,"teacher_disagreement_score":0.6772748,"about_ca_system_score_codex":0.00013310899,"about_ca_system_score_gemma":0.00011646078,"threshold_uncertainty_score":0.7170339},"labels":[],"label_agreement":null},{"id":"W4313017248","doi":"10.1609/aiide.v17i1.18888","title":"Tile Embedding: A General Representation for Level Generation","year":2021,"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":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Embedding; Tile; Computer science; Affordance; Representation (politics); Set (abstract data type); Artificial intelligence; Domain (mathematical analysis); Video game; Machine learning; Natural language processing; Human–computer interaction; Programming language; Multimedia","score_opus":0.1396855995328122,"score_gpt":0.3522903037563287,"score_spread":0.2126047042235165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313017248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49164015,0.000037714584,0.49255887,0.0054385024,0.0011470977,0.0009481269,0.00006350776,0.00007306538,0.008092969],"genre_scores_gemma":[0.9943334,0.000033241846,0.0037353674,0.0003564659,0.00015114139,0.00010292497,0.000009735414,0.000014209289,0.0012635051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979979,0.000017853206,0.00061186665,0.0006652591,0.00039821243,0.00030892462],"domain_scores_gemma":[0.9981183,0.00015269693,0.0003581348,0.00026373612,0.0010161367,0.000091015456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018013752,0.00024333535,0.00026270817,0.00010348994,0.00020198482,0.00091502623,0.00067699,0.0000714186,0.0000372427],"category_scores_gemma":[0.00064434385,0.00019678693,0.0001824225,0.00029444782,0.00016573888,0.0014536032,0.0004133865,0.00016742726,0.000021156011],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115832445,0.00038348374,0.00026458842,0.00002780309,0.00006592911,0.000001342238,0.0032835284,0.00021767397,0.12480935,0.6144062,0.0005704674,0.25585377],"study_design_scores_gemma":[0.000030872685,0.00022357934,0.00005395523,0.000102499056,0.0000101233345,0.000009551624,0.0018960796,0.22027268,0.72757465,0.049259394,0.00039189594,0.00017474768],"about_ca_topic_score_codex":0.000015716225,"about_ca_topic_score_gemma":0.000009472313,"teacher_disagreement_score":0.60276526,"about_ca_system_score_codex":0.00009655173,"about_ca_system_score_gemma":0.00008189165,"threshold_uncertainty_score":0.8823619},"labels":[],"label_agreement":null},{"id":"W4313044972","doi":"10.1609/aiide.v17i1.18890","title":"A Force Dynamic Model of Narrative Agents","year":2021,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Narrative; Mirroring; Computer science; Interpersonal communication; Work (physics); Object (grammar); Narrative network; Cognitive science; Cognitive psychology; Epistemology; Psychology; Narrative criticism; Social psychology; Artificial intelligence; Narrative inquiry; Engineering","score_opus":0.05605247956042577,"score_gpt":0.3067075013652286,"score_spread":0.25065502180480287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313044972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.840544,0.00004290173,0.13598561,0.0030663314,0.00041249325,0.00055712357,0.0000427653,0.00005266079,0.019296138],"genre_scores_gemma":[0.99761003,0.00006207633,0.0009612343,0.00023847482,0.0000126483665,0.00002881182,0.0000018550263,0.000013525212,0.0010713611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977334,0.000019237814,0.00076193135,0.00061096944,0.00054263504,0.0003317948],"domain_scores_gemma":[0.997909,0.000133737,0.0005303065,0.00031976876,0.0010013089,0.00010586771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016954995,0.00029294926,0.0003782834,0.00012529992,0.0001347712,0.0003630307,0.0011025239,0.000076198805,0.000044989814],"category_scores_gemma":[0.00044094934,0.00022824295,0.00020581075,0.00031134795,0.00038475773,0.0013473093,0.0008073092,0.00026377186,0.000017549073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002688975,0.0010590412,0.0003991075,0.000094686,0.00017080104,0.0000034354846,0.03490129,0.0010891535,0.12768193,0.6706768,0.00010011671,0.16355468],"study_design_scores_gemma":[0.000023522623,0.0002318238,0.00003541195,0.00029856354,0.00000954176,0.0000061011783,0.009074638,0.3530787,0.521963,0.11509092,0.000019102528,0.00016867716],"about_ca_topic_score_codex":0.000010511036,"about_ca_topic_score_gemma":0.00001009097,"teacher_disagreement_score":0.5555859,"about_ca_system_score_codex":0.000103506034,"about_ca_system_score_gemma":0.00012101525,"threshold_uncertainty_score":0.93074775},"labels":[],"label_agreement":null},{"id":"W4313117368","doi":"10.1609/aiide.v9i6.12602","title":"Improving Behaviour and Decision Making for Companions in Modern Digital Games","year":2013,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Turns, rounds and time-keeping systems in games; Human–computer interaction; Character (mathematics); Work (physics); Game mechanics; Multimedia; Video game design; Engineering; Mathematics","score_opus":0.03858138850107766,"score_gpt":0.29668496222428553,"score_spread":0.25810357372320786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313117368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81977755,0.000025447704,0.1771217,0.0007276326,0.00019381808,0.00092154834,0.00001925341,0.000035711502,0.0011773445],"genre_scores_gemma":[0.99759525,0.000016152144,0.0020211984,0.0001348012,0.000025814787,0.00013666782,0.0000011768198,0.000015907837,0.00005303471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979369,0.000006793535,0.0006869491,0.0006395128,0.00033088154,0.0003989414],"domain_scores_gemma":[0.9985453,0.0003799032,0.0003483073,0.00020630608,0.00041958032,0.00010064128],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00016289121,0.00029475344,0.00031493267,0.00020900951,0.0001446886,0.0017461237,0.0008383779,0.000075012584,0.000013498263],"category_scores_gemma":[0.00045750712,0.00022552533,0.000113694834,0.00021137863,0.00027251005,0.0029893862,0.0007036897,0.00023908004,0.000014639956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001077423,0.00027439254,0.004956912,0.000026658172,0.000016186988,4.5382038e-7,0.0030356564,0.000032156055,0.0032296788,0.08094884,0.000027526521,0.9073438],"study_design_scores_gemma":[0.000079169615,0.00065252365,0.0024892162,0.00094297633,0.000011149676,0.000013922898,0.010354902,0.49043816,0.059111293,0.43544438,0.000023290711,0.0004390149],"about_ca_topic_score_codex":0.000047107842,"about_ca_topic_score_gemma":0.0000128419615,"teacher_disagreement_score":0.90690476,"about_ca_system_score_codex":0.00009422786,"about_ca_system_score_gemma":0.000033104265,"threshold_uncertainty_score":0.99929017},"labels":[],"label_agreement":null},{"id":"W4313384440","doi":"10.1007/978-3-031-05214-9_17","title":"Working with Intelligent Narrative Technologies","year":2022,"lang":"en","type":"book-chapter","venue":"Human-computer interaction series","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Narrative; Computer science; Variety (cybernetics); Emerging technologies; Authoring system; Multimedia; Human–computer interaction; Artificial intelligence","score_opus":0.08346511182751715,"score_gpt":0.3001242777943157,"score_spread":0.21665916596679857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313384440","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042560385,0.00078670745,0.5389588,0.0029906903,0.009999709,0.0013198025,0.0000096905715,0.005243821,0.44026518],"genre_scores_gemma":[0.13938105,0.000638241,0.098019116,0.0010798131,0.0019343492,0.0005420582,0.00014497105,0.0004391542,0.75782126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966993,0.000060305436,0.00079820293,0.0012505,0.0007343023,0.00045742397],"domain_scores_gemma":[0.9973778,0.00018517264,0.00077999133,0.0013199442,0.0002660686,0.00007101933],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020265036,0.00074045756,0.00065160135,0.0007113719,0.0008438103,0.00079790736,0.002059286,0.00028551932,0.0016057029],"category_scores_gemma":[0.000012544109,0.0006798928,0.00024284844,0.00018798716,0.00042267476,0.0016616924,0.0016551226,0.001500917,0.0002900511],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057879828,0.000046652778,0.000014582025,0.000025119898,0.00024745995,0.00022096296,0.010150142,0.0009109707,0.000035169993,0.82773095,0.004993128,0.155567],"study_design_scores_gemma":[0.00005930769,0.000920857,0.0000038452604,0.00044686196,0.000028397366,0.00045957603,0.0024644288,0.0010574957,0.0036481784,0.051314835,0.9386138,0.0009824451],"about_ca_topic_score_codex":0.00002827738,"about_ca_topic_score_gemma":0.00019711867,"teacher_disagreement_score":0.93362063,"about_ca_system_score_codex":0.0004739422,"about_ca_system_score_gemma":0.000100689045,"threshold_uncertainty_score":0.99956524},"labels":[],"label_agreement":null},{"id":"W4313384467","doi":"10.1007/978-3-031-05214-9_20","title":"Quantitative Analysis of Emergent Narratives","year":2022,"lang":"en","type":"book-chapter","venue":"Human-computer interaction series","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Narrative; Storytelling; Narrative inquiry; Process (computing); Quantitative analysis (chemistry); Computer science; Literature; Art","score_opus":0.09552763073934456,"score_gpt":0.355831546656554,"score_spread":0.2603039159172094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313384467","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030649782,0.00055977,0.6258198,0.0009805687,0.0075186426,0.00068558764,0.00012610405,0.00056875864,0.3606758],"genre_scores_gemma":[0.11439667,0.0008282563,0.1610587,0.0010052518,0.0013276708,0.00025894912,0.0008284621,0.00031875222,0.71997726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969823,0.00011686285,0.0011067863,0.0008668822,0.00067591463,0.00025126923],"domain_scores_gemma":[0.99718994,0.00020019039,0.0011364759,0.0009657821,0.00042813725,0.000079480444],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024761906,0.00047231975,0.00091732165,0.0014513042,0.00034399462,0.00018812643,0.0012484085,0.00014343466,0.0076857572],"category_scores_gemma":[0.000012523013,0.0004955138,0.00072609034,0.00040994867,0.00024540862,0.0014369271,0.0008136427,0.00054707046,0.000115194256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037777256,0.000058067704,0.000015473457,0.000026018532,0.0023314413,0.000024313107,0.014365214,0.003844622,0.0002647678,0.97166854,0.0027447678,0.00461899],"study_design_scores_gemma":[0.000103500184,0.0020167725,0.0002500767,0.00020208379,0.00076368096,0.00003152971,0.0024374402,0.030959675,0.0028310595,0.08266398,0.87619084,0.0015493288],"about_ca_topic_score_codex":0.00007330328,"about_ca_topic_score_gemma":0.0002696131,"teacher_disagreement_score":0.8890046,"about_ca_system_score_codex":0.00017984708,"about_ca_system_score_gemma":0.00006568203,"threshold_uncertainty_score":0.99974966},"labels":[],"label_agreement":null},{"id":"W4315487895","doi":"10.16995/dscn.8085","title":"Part I — Introduction: Social Physics and the VESPACE Project","year":2023,"lang":"en","type":"article","venue":"Digital Studies / Le champ numérique","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Digital humanities; Art; Sociology; Art history","score_opus":0.05799430582733755,"score_gpt":0.30689011280258716,"score_spread":0.2488958069752496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315487895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5491095,0.0025956698,0.10651468,0.31527227,0.0053020595,0.0021005766,0.000038721508,0.002600064,0.016466415],"genre_scores_gemma":[0.99464065,0.00038734035,0.000032359774,0.00021355253,0.0023385705,0.00014451539,0.0000045895426,0.000016025484,0.0022224123],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9987979,0.00007288079,0.00020376823,0.0003975269,0.0002238118,0.00030412446],"domain_scores_gemma":[0.9991799,0.0002775504,0.00008565102,0.00028671292,0.00014381972,0.000026344918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037168624,0.00016530568,0.00024101567,0.00003615737,0.00053304463,0.00037048312,0.00039456933,0.00004009485,6.6955795e-7],"category_scores_gemma":[0.00032250295,0.00011607581,0.00008079922,0.0007100397,0.0006772821,0.00066193106,0.00071616564,0.0001466617,0.00008247606],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004421729,0.000068106514,0.00025882147,0.00004488051,0.00021943658,0.000018451417,0.6969965,0.00016159088,0.000025622938,0.07356568,0.13253051,0.09606619],"study_design_scores_gemma":[0.0004170501,0.00010813397,0.000130964,0.000027081262,4.2738384e-7,0.000023606568,0.49601686,0.005677669,0.002013952,0.20485137,0.2902046,0.000528244],"about_ca_topic_score_codex":0.000018077535,"about_ca_topic_score_gemma":0.000025596188,"teacher_disagreement_score":0.4455311,"about_ca_system_score_codex":0.00003394985,"about_ca_system_score_gemma":0.00005356723,"threshold_uncertainty_score":0.47334343},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10809382493661085,"score_gpt":0.33872681855544784,"score_spread":0.230632993618837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321428174","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054633263,0.04522742,0.12947868,0.70824754,0.0037456977,0.0015637284,0.0000151131835,0.00026090577,0.056827642],"genre_scores_gemma":[0.90087134,0.0005363996,0.098412186,0.00006646548,0.000026909067,0.000009444033,2.4157706e-7,0.0000034548889,0.000073584044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924934,0.0001827741,0.00023942273,0.00006099123,0.00013618046,0.00013130318],"domain_scores_gemma":[0.97295207,0.0009735891,0.00017222023,0.025764083,0.00011368872,0.000024364475],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005569848,0.000052916126,0.00008380159,0.000020723637,0.00028904137,0.000021284255,0.039607406,0.000025740746,0.0000019862912],"category_scores_gemma":[0.0011738124,0.000030457923,0.00007514191,0.00020269514,0.00047598072,0.00018557515,0.021124158,0.000114146555,0.000025602536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033614156,0.0002942333,0.0040195626,0.00001003544,0.000045111843,1.7766189e-8,0.00809179,0.00006869557,0.00034007337,0.83810186,0.02094364,0.12808162],"study_design_scores_gemma":[0.00012029048,0.000078347155,0.01654572,0.000103134,0.00002944457,0.000005205424,0.00031175264,0.01992051,0.024768328,0.72672194,0.21115795,0.00023739865],"about_ca_topic_score_codex":0.000019842402,"about_ca_topic_score_gemma":0.000035886776,"teacher_disagreement_score":0.8462381,"about_ca_system_score_codex":0.000010277382,"about_ca_system_score_gemma":0.000020204727,"threshold_uncertainty_score":0.9867928},"labels":[],"label_agreement":null},{"id":"W4323244241","doi":"10.5220/0011693800003393","title":"Automatically Generating Image Segmentation Datasets for Video Games","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Image segmentation; Artificial intelligence; Computer vision; Segmentation; Image (mathematics); Scale-space segmentation; Computer graphics (images); Video game; Multimedia","score_opus":0.04500764184422271,"score_gpt":0.3471030050575727,"score_spread":0.30209536321334995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323244241","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010852142,0.0000058011155,0.9860049,0.0013175197,0.00026647668,0.00027581275,0.000025980195,0.0007584993,0.00049290876],"genre_scores_gemma":[0.025666319,0.0000030074577,0.97245145,0.0010530304,0.000107264554,0.000124039,0.00010054635,0.0000116353185,0.0004827092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989537,0.000031151387,0.00026550135,0.00029842686,0.0001944641,0.00025673784],"domain_scores_gemma":[0.9991016,0.00034707529,0.000056922745,0.00037403667,0.00006388508,0.000056480778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041317174,0.0000886466,0.000090367335,0.00008446117,0.00014467191,0.0003251407,0.00052174635,0.000023560067,0.00005230473],"category_scores_gemma":[0.00030559697,0.000078249854,0.000040641407,0.00034457375,0.000034813325,0.0007356488,0.00020383949,0.000036927588,0.00067313854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004379164,0.00005300026,0.00013537274,0.00006086044,0.000028127548,0.000022099266,0.0017064397,0.0020955717,0.19790092,0.121236525,0.2550052,0.4217515],"study_design_scores_gemma":[0.000035594603,0.000031480286,0.00006707566,0.0000066384164,0.0000024511621,0.0000021736942,0.00014466667,0.858392,0.13039921,0.008926891,0.0018905428,0.00010127976],"about_ca_topic_score_codex":0.000017312508,"about_ca_topic_score_gemma":0.000019277646,"teacher_disagreement_score":0.8562964,"about_ca_system_score_codex":0.000021804575,"about_ca_system_score_gemma":0.000038608592,"threshold_uncertainty_score":0.8652058},"labels":[],"label_agreement":null},{"id":"W4360605143","doi":"10.1109/icnc57223.2023.10074513","title":"Guiding Interactive Film With Emotion-Profiling Chatbots","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Mitacs","keywords":"Computer science; Scripting language; Conversation; Generative grammar; Profiling (computer programming); Human–computer interaction; Entertainment; Autonomy; Multimedia; Context (archaeology); Artificial intelligence; Psychology; Communication; Visual arts","score_opus":0.06579951181106314,"score_gpt":0.31234985970874724,"score_spread":0.2465503478976841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360605143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1184165,0.000006988434,0.8583796,0.0012493447,0.0005118124,0.00013691817,5.891914e-7,0.00092779024,0.020370463],"genre_scores_gemma":[0.9501496,0.000005984755,0.047074843,0.0002219271,0.000075479285,0.000014857769,0.0000018985737,0.00001027784,0.0024451658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989518,0.00003055164,0.0001700952,0.00033918058,0.00023042722,0.00027793963],"domain_scores_gemma":[0.99921334,0.000195647,0.00005599562,0.00036188948,0.00011221926,0.000060935334],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023037542,0.00010487573,0.00009909332,0.00015561948,0.00013410761,0.00017246089,0.0005720031,0.000031204494,0.00007756943],"category_scores_gemma":[0.00009981088,0.00008107677,0.00003327836,0.0008172392,0.000037204194,0.0007388551,0.00025886035,0.0000721853,0.0013792469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044531796,0.0001218504,0.011823815,0.000039321832,0.00014019453,0.00031604417,0.02024851,0.026854599,0.021236759,0.63719803,0.011650267,0.27032608],"study_design_scores_gemma":[0.000044275715,0.00009551688,0.0008283543,0.000054339795,0.0000026900236,0.00001570792,0.0023560063,0.7316942,0.25586578,0.008017927,0.0007962366,0.00022890866],"about_ca_topic_score_codex":0.00004826517,"about_ca_topic_score_gemma":0.000017625825,"teacher_disagreement_score":0.83173305,"about_ca_system_score_codex":0.000036242767,"about_ca_system_score_gemma":0.000039586575,"threshold_uncertainty_score":0.9993983},"labels":[],"label_agreement":null},{"id":"W4365519871","doi":"10.48550/arxiv.2109.14669","title":"Pursuit-evasion games on latin square graphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Latin square; Combinatorics; Mathematics; Circulant matrix; Upper and lower bounds; Dimension (graph theory); Square (algebra); Discrete mathematics; Graph; Geometry; Mathematical analysis","score_opus":0.12071122648348238,"score_gpt":0.21902235475896567,"score_spread":0.09831112827548329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365519871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69338953,0.00012420124,0.29820067,0.0003695693,0.001625656,0.0003511007,0.000008467443,0.0004905718,0.005440234],"genre_scores_gemma":[0.9953641,0.00020421289,0.0019542153,0.00022478093,0.00007831404,0.0000017958569,0.000018467568,0.000025911559,0.0021281978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705666,0.00024258035,0.00029335154,0.0016731659,0.00025235838,0.0004819035],"domain_scores_gemma":[0.99692154,0.00024699813,0.0002888278,0.0020445606,0.00028632465,0.0002117464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002827597,0.00043081449,0.00041524286,0.00039484995,0.00021498496,0.00042140632,0.0028976204,0.00041365554,0.000121942045],"category_scores_gemma":[0.00012560195,0.00049238955,0.00040285627,0.00093751843,0.00016559436,0.0004331122,0.0027959673,0.0008642367,0.00027287327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039866864,0.00033741596,0.0071429187,0.00011006548,0.00011977359,0.0014994495,0.0015003524,0.25992024,0.00023703085,0.71209866,0.0010709579,0.01592328],"study_design_scores_gemma":[0.00033679494,0.00037227786,0.007322589,0.0010840681,0.0001226114,0.000011922158,0.0014550978,0.6329737,0.015084024,0.3361938,0.0029872907,0.0020558198],"about_ca_topic_score_codex":0.00017227692,"about_ca_topic_score_gemma":0.00016823923,"teacher_disagreement_score":0.37590483,"about_ca_system_score_codex":0.00021647665,"about_ca_system_score_gemma":0.00024428306,"threshold_uncertainty_score":0.99975276},"labels":[],"label_agreement":null},{"id":"W4376460868","doi":"10.1007/978-3-031-29937-7_8","title":"Understanding Players and Play Through Game Analytics","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in big data","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Analytics; Computer science; Game design; Data science; Terabyte; Game Developer; Video game; Video game development; Human–computer interaction; Multimedia","score_opus":0.7617438213432752,"score_gpt":0.4235464866145549,"score_spread":0.3381973347287203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376460868","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029338089,0.014348074,0.5917036,0.0043440806,0.014454803,0.0010298296,0.0010447503,0.00080742,0.3722381],"genre_scores_gemma":[0.10210586,0.26867598,0.039129596,0.003399543,0.0046576965,0.0000604661,0.00069853937,0.0005879682,0.58068436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776536,0.000019509567,0.0004661348,0.0010004574,0.00039721702,0.00035130768],"domain_scores_gemma":[0.9972027,0.00065815554,0.00018525448,0.0018599961,0.000048564798,0.000045346347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047462122,0.00033041486,0.00050319114,0.00022766626,0.00013940525,0.00012283091,0.0020983526,0.00017625585,0.0000041159733],"category_scores_gemma":[0.0002769251,0.0003111768,0.000037732756,0.00017637917,0.00060068484,0.00042025556,0.006330815,0.00040714658,0.00010647732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053953318,0.0000070227147,0.000050886287,0.00008388356,0.00034902678,0.00028651027,0.006326721,0.000091587826,7.6635365e-7,0.9126462,0.07273249,0.0074195587],"study_design_scores_gemma":[0.00009955957,0.00006738582,0.000010094034,0.00077411707,0.00006634684,0.000015025091,0.004161988,0.0077268966,0.000013728604,0.87291586,0.11342316,0.00072582136],"about_ca_topic_score_codex":0.0000423451,"about_ca_topic_score_gemma":0.000968803,"teacher_disagreement_score":0.552574,"about_ca_system_score_codex":0.0002392892,"about_ca_system_score_gemma":0.000081611084,"threshold_uncertainty_score":0.999934},"labels":[],"label_agreement":null},{"id":"W4377091290","doi":"10.3233/icg-230225","title":"The 2022 World Computer Chess Championships","year":2023,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Universität Wien","keywords":"Champion; Computer chess; Championship; World championship; Computer science; Advertising; Visual arts; History; Art; Business; Archaeology","score_opus":0.06565538661359573,"score_gpt":0.30975565195157806,"score_spread":0.24410026533798235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377091290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0625177,0.0012397657,0.8629248,0.051907007,0.01509456,0.00025760938,0.0000021673532,0.0007486482,0.005307728],"genre_scores_gemma":[0.95421976,0.0006962585,0.016660621,0.0019144561,0.0050987653,0.00002924007,0.0000014869839,0.00004759803,0.021331811],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841386,0.00015671721,0.0003210672,0.00019486633,0.00045428876,0.0004592139],"domain_scores_gemma":[0.9985805,0.00059110706,0.00013355775,0.00043687312,0.000113839465,0.00014412556],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014437116,0.00011014183,0.0001056049,0.0001857253,0.0010471352,0.000891772,0.0017277738,0.000032017953,0.000056592693],"category_scores_gemma":[0.00006257596,0.00007333072,0.00010444758,0.0010984766,0.00010245459,0.00038558996,0.00040814202,0.0005372483,0.0013147802],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007756935,0.000032806944,0.0021405432,0.0000031727895,0.000040539984,0.0002248038,0.0020131313,0.0014814313,0.00022967637,0.07824488,0.23099303,0.68458825],"study_design_scores_gemma":[0.00012324635,0.00009476873,0.012347026,0.00006309309,0.0000064288292,0.00049922353,0.00040580347,0.26755023,0.0033469035,0.11201725,0.6031546,0.00039144844],"about_ca_topic_score_codex":0.0000035438925,"about_ca_topic_score_gemma":0.00006772709,"teacher_disagreement_score":0.89170206,"about_ca_system_score_codex":0.000044446024,"about_ca_system_score_gemma":0.0000833459,"threshold_uncertainty_score":0.9994628},"labels":[],"label_agreement":null},{"id":"W4377834324","doi":"10.1007/978-3-031-34017-8_2","title":"Improving Search in Go Using Bounded Static Safety","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bounded function; Static analysis; Set (abstract data type); Greedy algorithm; Algorithm; Mathematics; Programming language","score_opus":0.06005556605165404,"score_gpt":0.3133835597321598,"score_spread":0.2533279936805058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377834324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009209679,0.00010894922,0.9946528,0.0004870554,0.0021840187,0.0005313177,0.000005096442,0.00024325082,0.0008665193],"genre_scores_gemma":[0.15770568,0.000056073222,0.8393166,0.0011773137,0.0005845951,0.00001238516,0.000005312596,0.00012777673,0.0010142544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442065,0.00008598469,0.0009406169,0.0019089525,0.0014428014,0.0012010074],"domain_scores_gemma":[0.99656135,0.001198918,0.000269396,0.0015179493,0.00026102856,0.00019134996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002286484,0.0005532028,0.0006252067,0.0016691491,0.00033003645,0.0009508393,0.004254091,0.000341704,0.000019983374],"category_scores_gemma":[0.00031291455,0.0005524004,0.00012562647,0.0017326183,0.0010151633,0.00092973094,0.0026352075,0.0013232814,0.00018640298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008074873,0.000021623095,0.00012882739,0.00006352187,0.000006639079,0.00028864862,0.002799701,0.2618851,0.00042000457,0.022082457,0.0000034406926,0.71229196],"study_design_scores_gemma":[0.00007237569,0.00007114218,0.000057519253,0.00041212438,0.0000030045226,0.0000270007,0.0000013790817,0.83784264,0.001702268,0.15922062,0.00008131498,0.000508572],"about_ca_topic_score_codex":0.000541552,"about_ca_topic_score_gemma":0.0010407794,"teacher_disagreement_score":0.7117834,"about_ca_system_score_codex":0.0010555974,"about_ca_system_score_gemma":0.0014688775,"threshold_uncertainty_score":0.99969274},"labels":[],"label_agreement":null},{"id":"W4377834561","doi":"10.1007/978-3-031-34017-8_3","title":"An Efficient Chinese Checkers Implementation: Ranking, Bitboards, and BMI2 pext and pdep Instructions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Northern Alberta Institute of Technology; University of Alberta","funders":"","keywords":"Computer science; Rank (graph theory); Representation (politics); Ranking (information retrieval); Function (biology); Programming language; Theoretical computer science; Parallel computing; Artificial intelligence; Mathematics","score_opus":0.02100920896837357,"score_gpt":0.30909100984213955,"score_spread":0.288081800873766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377834561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019503238,0.00023988473,0.9761288,0.0007715096,0.002257826,0.00046502898,0.000010436699,0.00028378,0.00033946437],"genre_scores_gemma":[0.74025834,0.00016713608,0.25784096,0.0007799144,0.00067096204,0.000026568174,0.000011339355,0.000065942775,0.00017887009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963744,0.000043531,0.00055518583,0.0016134612,0.00083408365,0.0005793311],"domain_scores_gemma":[0.99800456,0.00031796226,0.0002431942,0.0009968408,0.00019675416,0.00024070522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085149234,0.0004922271,0.00042180732,0.0009269233,0.0005485617,0.0009483806,0.0016096389,0.00021135986,0.000022906868],"category_scores_gemma":[0.00007020266,0.00044272878,0.000069213245,0.00085895334,0.0012084255,0.0006402906,0.0011379564,0.00054390077,0.000025315194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005073528,0.000021573278,0.0013961551,0.000034064997,0.000015377302,0.000051221414,0.0050812326,0.027872443,0.00020774484,0.028884932,0.000014956244,0.9364152],"study_design_scores_gemma":[0.00022591984,0.0002609463,0.0033711242,0.00016849935,0.000014064952,0.00017022151,0.000010665635,0.8523913,0.0010084282,0.14108457,0.0004309272,0.0008633672],"about_ca_topic_score_codex":0.00012681763,"about_ca_topic_score_gemma":0.0005990098,"teacher_disagreement_score":0.9355519,"about_ca_system_score_codex":0.00014044894,"about_ca_system_score_gemma":0.0002966162,"threshold_uncertainty_score":0.9998025},"labels":[],"label_agreement":null},{"id":"W4378468820","doi":"10.4236/am.2023.145019","title":"Competing Patterns in Bernoulli Sequence of Trials","year":2023,"lang":"en","type":"article","venue":"Applied Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Bernoulli trial; Bernoulli's principle; Sequence (biology); Mathematics; Bernoulli distribution; Combinatorics; Statistics; Random variable; Physics","score_opus":0.17164482281281826,"score_gpt":0.36659523808386796,"score_spread":0.1949504152710497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378468820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41004035,0.00001210126,0.58299565,0.00030119915,0.00018179657,0.00048627015,0.000009113234,0.00029883088,0.005674652],"genre_scores_gemma":[0.8891921,0.000022705579,0.11062948,0.00004307527,0.000027819775,0.000040109837,0.0000025514864,0.000011932241,0.000030221163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983453,0.000039143295,0.0008380855,0.00022112331,0.0002999593,0.0002563693],"domain_scores_gemma":[0.99762666,0.0014745272,0.00032742572,0.00049715367,0.00003695302,0.000037272268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022144236,0.000115062285,0.00042568165,0.00017034235,0.000032314005,0.000043278083,0.00079879747,0.000056782632,0.00002060894],"category_scores_gemma":[0.0004262537,0.000103987186,0.000059403665,0.00068451586,0.000051101277,0.00008985697,0.00027450293,0.00010506876,0.00024989105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029490375,0.00013415197,0.00092886295,0.00029890277,0.000019012004,0.000021361639,0.018585982,0.0016989802,0.04411189,0.8895938,0.00013038944,0.044473715],"study_design_scores_gemma":[0.00023573206,0.0000454573,0.00039580424,0.0003832947,0.000014638254,0.000007767973,0.005442317,0.2812701,0.20351094,0.5080295,0.00020469143,0.0004597625],"about_ca_topic_score_codex":0.000031827258,"about_ca_topic_score_gemma":0.000021439177,"teacher_disagreement_score":0.47915176,"about_ca_system_score_codex":0.000024654557,"about_ca_system_score_gemma":0.000034856857,"threshold_uncertainty_score":0.4240474},"labels":[],"label_agreement":null},{"id":"W4379881933","doi":"10.1007/s00182-023-00862-3","title":"Cheating robot games","year":2023,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Vancouver Island University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorial game theory; Mathematics; Vertex (graph theory); Combinatorics; Bipartite graph; Game tree; Repeated game; Computer science; Discrete mathematics; Graph; Game theory; Mathematical economics","score_opus":0.03239836443435306,"score_gpt":0.3268333627425049,"score_spread":0.29443499830815184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379881933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13261066,0.00023950511,0.8498007,0.0054266816,0.0050105504,0.000060003797,0.0000020769037,0.00018382058,0.0066660065],"genre_scores_gemma":[0.99051356,0.000076371914,0.0074363174,0.0004144087,0.0006345308,0.0000016306545,6.068193e-7,0.000010276405,0.00091228925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998386,0.00012097215,0.0004951316,0.00013764539,0.00067133486,0.0001888819],"domain_scores_gemma":[0.99827784,0.0005744236,0.00034645834,0.00019443169,0.0005297333,0.000077099765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015111355,0.00009712383,0.00014779087,0.0003990001,0.00003415514,0.00018187535,0.0019840947,0.000040480238,0.000089735826],"category_scores_gemma":[0.00072865025,0.00008283969,0.0001450626,0.00030351462,0.000080193015,0.0006679363,0.00027611273,0.00020847222,0.0003806257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068070585,0.00006867126,0.0009066245,0.000003880838,0.00018484105,0.00044588925,0.0046299486,0.0072840834,0.008379752,0.36331022,0.001974443,0.6127436],"study_design_scores_gemma":[0.0003093619,0.00020963633,0.004943174,0.0002266438,0.000014352926,0.00063769566,0.0011197858,0.034774713,0.06066435,0.88427645,0.012510128,0.00031370533],"about_ca_topic_score_codex":0.0000036359413,"about_ca_topic_score_gemma":0.0000010197807,"teacher_disagreement_score":0.8579029,"about_ca_system_score_codex":0.00007353518,"about_ca_system_score_gemma":0.00009292531,"threshold_uncertainty_score":0.48923},"labels":[],"label_agreement":null},{"id":"W4382240209","doi":"10.1609/aaai.v37i4.25626","title":"Show Me the Way! Bilevel Search for Synthesizing Programmatic Strategies","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canadian Institute for Advanced Research","keywords":"Computer science; Space (punctuation); Function (biology); Search algorithm; Set (abstract data type); Differentiable function; Bilevel optimization; Feature (linguistics); Evaluation function; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Optimization problem; Programming language","score_opus":0.18579268984963782,"score_gpt":0.3534989015197543,"score_spread":0.1677062116701165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382240209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43896577,0.00009419926,0.48691097,0.049976397,0.002524413,0.0066534444,0.000035174984,0.0016856239,0.013154021],"genre_scores_gemma":[0.99406576,0.00004662677,0.0047929757,0.00014965568,0.00015143439,0.00034963546,8.216324e-7,0.000033093183,0.00041001348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964231,0.000053650772,0.00089779584,0.00076325145,0.000964882,0.0008973098],"domain_scores_gemma":[0.99659216,0.0010698787,0.0004067876,0.0006930505,0.0011184302,0.00011967401],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001984971,0.00037379176,0.00039203712,0.0002598641,0.0007471006,0.0012568448,0.005078511,0.00014164897,0.000036211408],"category_scores_gemma":[0.0010446426,0.00023094703,0.00028242718,0.0019573239,0.0008201862,0.0008481346,0.00079473155,0.000444128,0.00030499583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032835535,0.00007003419,0.000059096914,0.00008806907,0.000025221965,5.1745036e-7,0.003940901,0.0004962875,0.030896937,0.7988943,0.00021462461,0.16528116],"study_design_scores_gemma":[0.000009166371,0.00015172255,0.00006661949,0.00018063717,0.0000127941785,0.000003067562,0.0064283176,0.24263088,0.44652724,0.30364087,0.00014544847,0.0002032184],"about_ca_topic_score_codex":0.00006576004,"about_ca_topic_score_gemma":0.000029005825,"teacher_disagreement_score":0.55509996,"about_ca_system_score_codex":0.00006752847,"about_ca_system_score_gemma":0.00023395497,"threshold_uncertainty_score":0.99977994},"labels":[],"label_agreement":null},{"id":"W4382567046","doi":"10.1007/978-3-031-36336-8_84","title":"Towards Extracting Adaptation Rules from Neural Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"","keywords":"Adaptation (eye); Computer science; Artificial neural network; Artificial intelligence; Decision tree; Machine learning; Tree (set theory); Adaptive system; Modal; Reading (process); Linguistics; Psychology","score_opus":0.11608820435518728,"score_gpt":0.3293326420590116,"score_spread":0.21324443770382429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382567046","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009443218,0.0002632853,0.9323006,0.000985295,0.00087392627,0.00025939025,0.000012792269,0.00025442653,0.06495584],"genre_scores_gemma":[0.28546137,0.006720491,0.7025621,0.0021827836,0.00038842426,0.00008795998,0.00033441026,0.00004997541,0.0022124825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979998,0.000040040468,0.0008248209,0.0003440088,0.0005160683,0.00027525148],"domain_scores_gemma":[0.9966071,0.000590101,0.00044376886,0.0018745263,0.00038366925,0.000100803765],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010154874,0.00022815248,0.00023365712,0.00075615896,0.00054609816,0.0011426323,0.0038795252,0.00015666874,0.000008360642],"category_scores_gemma":[0.00012042802,0.0002382601,0.000053063915,0.00046977052,0.00069637265,0.008932373,0.0027732335,0.0005726182,0.00015449822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.707406e-7,0.0000039772076,0.0000130455255,0.000003152882,0.0000028477202,4.8865377e-7,0.0021931666,0.0108388,5.6741396e-7,0.33990365,0.000056578665,0.64698285],"study_design_scores_gemma":[0.00004320934,0.00001927212,0.0006478509,0.000107240274,0.0000033547446,0.0000046527057,0.000068971436,0.95595556,0.0000056119343,0.033031948,0.009876714,0.00023559469],"about_ca_topic_score_codex":0.00014593861,"about_ca_topic_score_gemma":0.00006395756,"teacher_disagreement_score":0.94511676,"about_ca_system_score_codex":0.00012596119,"about_ca_system_score_gemma":0.00019789216,"threshold_uncertainty_score":0.99989426},"labels":[],"label_agreement":null},{"id":"W4384111729","doi":"10.48550/arxiv.2307.04893","title":"Choosing Well Your Opponents: How to Guide the Synthesis of Programmatic Strategies","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Compute Canada","keywords":"Oracle; Computer science; Set (abstract data type); Iterated function; Artificial intelligence; SIGNAL (programming language); Machine learning; Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.177534632293631,"score_gpt":0.2509113385233208,"score_spread":0.07337670622968981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384111729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15166165,0.000029000683,0.84194845,0.0021039823,0.0008060503,0.0007584783,0.000009708593,0.00043314206,0.0022495645],"genre_scores_gemma":[0.9916049,0.000074595104,0.0056527406,0.000047439975,0.00007212687,0.0000073955034,0.0000017563636,0.000027521071,0.0025114766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997851,0.00022771244,0.00033686857,0.00092802406,0.00020808926,0.00044830868],"domain_scores_gemma":[0.9968839,0.00050970324,0.00038782935,0.0018029581,0.0002703146,0.00014526625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062659755,0.00032326102,0.00039413988,0.00032028017,0.00018606259,0.00050988107,0.004080039,0.00018651671,0.000014490382],"category_scores_gemma":[0.0003404925,0.00028833863,0.0002540051,0.0009966774,0.00022020414,0.00048308025,0.0028870662,0.00038719698,0.00026983052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003742409,0.00021088941,0.002133007,0.00047478068,0.0004117861,0.0003686968,0.004348332,0.6832443,0.0005106454,0.28641054,0.0027496247,0.019100018],"study_design_scores_gemma":[0.000103271865,0.0001405598,0.0016632956,0.0012918806,0.00027178292,0.0000070159804,0.015106343,0.7640955,0.01532267,0.19725426,0.0034632343,0.0012802042],"about_ca_topic_score_codex":0.0006883761,"about_ca_topic_score_gemma":0.00016530555,"teacher_disagreement_score":0.8399433,"about_ca_system_score_codex":0.00017820712,"about_ca_system_score_gemma":0.00030988661,"threshold_uncertainty_score":0.9999569},"labels":[],"label_agreement":null},{"id":"W4385301065","doi":"10.1109/gas59301.2023.00011","title":"Assessing Video Game Balance using Autonomous Agents","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure","funders":"","keywords":"Game design; Computer science; Video game design; Game testing; Game Developer; Video game; Game mechanics; Game design document; Game art design; Game development tool; Video game development; Multimedia; Human–computer interaction; Level design; Scope (computer science); Balance (ability); Programming language","score_opus":0.13516216428950656,"score_gpt":0.38040724055366965,"score_spread":0.2452450762641631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385301065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27965444,0.000016892662,0.7121137,0.00055453903,0.0008049376,0.000080668025,3.197149e-7,0.00092926866,0.0058452743],"genre_scores_gemma":[0.94946975,0.0000055088817,0.04863308,0.00049019966,0.000092453425,0.0000046154964,7.4821526e-7,0.0000121091525,0.0012915428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859935,0.0000484361,0.00025889906,0.00040245836,0.0002748971,0.00041598818],"domain_scores_gemma":[0.9991297,0.0001288915,0.000074463554,0.0005180672,0.00006164205,0.000087226545],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034070783,0.00012120302,0.00013319362,0.00014377924,0.00013875078,0.0006426329,0.0008542867,0.00005249617,0.00008819832],"category_scores_gemma":[0.00010035821,0.00011510002,0.000056341283,0.00091588055,0.000053105297,0.0013697905,0.0004101704,0.000100599005,0.0013958096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004871605,0.00017307868,0.027679106,0.000056701483,0.000074422525,0.00061162486,0.006482335,0.07708011,0.05475288,0.12678386,0.01514347,0.6911575],"study_design_scores_gemma":[0.00002180911,0.00000912006,0.003425635,0.000019936551,0.0000019093488,0.000009897113,0.00012259521,0.97299045,0.013781781,0.006535785,0.0029191736,0.00016190002],"about_ca_topic_score_codex":0.00010431897,"about_ca_topic_score_gemma":0.000006804414,"teacher_disagreement_score":0.8959103,"about_ca_system_score_codex":0.00007959682,"about_ca_system_score_gemma":0.00009610539,"threshold_uncertainty_score":0.9993817},"labels":[],"label_agreement":null},{"id":"W4385374194","doi":"10.48550/arxiv.2307.14993","title":"Thinker: Learning to Plan and Act","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Science and Technology Facilities Council; Université de Montréal; Dell EMC","keywords":"Plan (archaeology); Computer science; Benchmark (surveying); Reinforcement learning; Artificial intelligence; Action (physics); Interpretation (philosophy); State (computer science); Machine learning; Automated planning and scheduling; Algorithm; Programming language","score_opus":0.15915844662837791,"score_gpt":0.22438709147114516,"score_spread":0.06522864484276725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385374194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45896795,0.000032145435,0.5366115,0.0005261525,0.00082668406,0.0002604629,0.0000042951597,0.0008591577,0.00191165],"genre_scores_gemma":[0.9922762,0.00009604031,0.001932665,0.0001206408,0.00007433477,7.976428e-7,0.000003722334,0.000020033787,0.005475563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823695,0.000109810535,0.00015558199,0.0010626192,0.0000932844,0.00034176695],"domain_scores_gemma":[0.99860066,0.00022262802,0.000118188305,0.00076155504,0.00008217668,0.00021477092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002970322,0.00023540675,0.00024303929,0.0003001754,0.00019760306,0.00022953286,0.0015680329,0.0002075903,0.000016045244],"category_scores_gemma":[0.00013684596,0.00027645,0.000089188565,0.0005147904,0.00007837017,0.00026098872,0.0038451015,0.00066516845,0.00074128044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032221546,0.00004419594,0.029686168,0.00007210447,0.00011867878,0.00093139854,0.006340608,0.7625729,0.000093908944,0.18858783,0.001518571,0.010001404],"study_design_scores_gemma":[0.000083268285,0.00012964784,0.005740905,0.0001786702,0.000039379003,0.0000066550497,0.00076857256,0.86580205,0.0006405044,0.12166448,0.0041530645,0.00079278764],"about_ca_topic_score_codex":0.00034216893,"about_ca_topic_score_gemma":0.00013510259,"teacher_disagreement_score":0.5346788,"about_ca_system_score_codex":0.00009809236,"about_ca_system_score_gemma":0.000098927245,"threshold_uncertainty_score":0.99996877},"labels":[],"label_agreement":null},{"id":"W4385570299","doi":"10.18653/v1/2023.acl-srw.17","title":"The Turing Quest: Can Transformers Make Good NPCs?","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scripting language; Computer science; Software deployment; Variety (cybernetics); Pipeline (software); Human–computer interaction; Turing; Transformer; Artificial intelligence; Programming language; Software engineering; Engineering","score_opus":0.029775366893916848,"score_gpt":0.2817394542453059,"score_spread":0.25196408735138903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385570299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11211942,0.0001858939,0.59757435,0.0652065,0.0035581605,0.00065546023,0.000003927896,0.0033838418,0.21731246],"genre_scores_gemma":[0.9899467,0.0000890974,0.0015257624,0.00037778998,0.00007241072,0.000020598914,5.308205e-7,0.000009349345,0.007957712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998902,0.000031591222,0.00018691224,0.00023633278,0.00024992204,0.0003932396],"domain_scores_gemma":[0.99929637,0.00021653525,0.00002484937,0.00035648645,0.00003471665,0.000071043694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038650475,0.00009307113,0.000071321214,0.00005587745,0.00031912915,0.0002527738,0.00093598716,0.00003430103,0.00001578816],"category_scores_gemma":[0.00003774198,0.000060604805,0.000059788043,0.00054823933,0.0000780594,0.00015565236,0.000113816575,0.00010925443,0.000511242],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018680422,0.000009203042,0.00043288167,0.0000043102505,0.000013581488,0.00001890039,0.0028221265,0.0003062554,0.0006114098,0.33848393,0.0017278988,0.65556765],"study_design_scores_gemma":[0.00013989375,0.00019332887,0.0063552093,0.00005195886,0.000012057115,0.000035743495,0.004927611,0.29967013,0.28690153,0.116914876,0.2838964,0.00090125285],"about_ca_topic_score_codex":0.00029773242,"about_ca_topic_score_gemma":0.0023235867,"teacher_disagreement_score":0.87782735,"about_ca_system_score_codex":0.0000299074,"about_ca_system_score_gemma":0.000053401916,"threshold_uncertainty_score":0.6571152},"labels":[],"label_agreement":null},{"id":"W4385734098","doi":"10.18653/v1/2023.nlp4convai-1.11","title":"Generating Video Game Scripts with Style","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ubisoft (Canada)","funders":"","keywords":"Sass; Computer science; Scripting language; Character (mathematics); Style (visual arts); Video game; Focus (optics); Dialog box; Quality (philosophy); Artificial intelligence; Natural language processing; Multimedia; World Wide Web; Programming language","score_opus":0.04488341716604765,"score_gpt":0.2843054948197612,"score_spread":0.23942207765371354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385734098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16586158,0.000021149915,0.82250303,0.0016474716,0.00032204905,0.00010861476,3.8943796e-7,0.0010926035,0.008443122],"genre_scores_gemma":[0.9154775,0.000004820514,0.076847106,0.00089447567,0.00010874908,0.00001734528,8.8551235e-7,0.0000109219345,0.006638192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989544,0.00002770802,0.00015361205,0.00031195182,0.00025758788,0.0002947397],"domain_scores_gemma":[0.99931717,0.00007620211,0.000035941608,0.00043034818,0.00007023249,0.000070080576],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021720727,0.00009249834,0.000088232126,0.00009189452,0.000101971964,0.0002420655,0.00058582966,0.000027884218,0.000071434246],"category_scores_gemma":[0.0000530537,0.00006895093,0.000024412828,0.000751616,0.000045745397,0.00044208358,0.00021270636,0.00007416793,0.0015965153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012193992,0.00008902113,0.0055111554,0.000025205552,0.00005674641,0.0003218417,0.010790636,0.042776007,0.047648378,0.33411932,0.06476304,0.49388644],"study_design_scores_gemma":[0.000039328217,0.00008595956,0.00041757055,0.0000151597305,0.0000017192239,0.00001145441,0.00032499543,0.93623966,0.05160737,0.0029605047,0.008096668,0.00019962083],"about_ca_topic_score_codex":0.00008863959,"about_ca_topic_score_gemma":0.000104342624,"teacher_disagreement_score":0.8934636,"about_ca_system_score_codex":0.000017456894,"about_ca_system_score_gemma":0.000043823395,"threshold_uncertainty_score":0.99918085},"labels":[],"label_agreement":null},{"id":"W4385767723","doi":"10.24963/ijcai.2023/539","title":"Choosing Well Your Opponents: How to Guide the Synthesis of Programmatic Strategies","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Compute Canada","keywords":"Oracle; Computer science; Set (abstract data type); Iterated function; Artificial intelligence; Machine learning; Theoretical computer science; Algorithm; Programming language; Mathematics","score_opus":0.07164105053924498,"score_gpt":0.32749778551419806,"score_spread":0.2558567349749531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385767723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10890888,0.000034447286,0.83177894,0.033706177,0.00053369737,0.0007386786,0.0000014804463,0.00085529155,0.023442421],"genre_scores_gemma":[0.96106887,0.000010841298,0.036153093,0.0001694869,0.000048688784,0.00006730535,2.598436e-7,0.000010530286,0.0024709401],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873704,0.00007516175,0.00027181685,0.00025373607,0.0003490043,0.00031321592],"domain_scores_gemma":[0.9986682,0.00041264872,0.00008292749,0.0006627696,0.00010597496,0.000067482644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006104683,0.00011340267,0.00014684704,0.00012273692,0.00011330914,0.0004865814,0.0014208856,0.000032273256,0.000030460347],"category_scores_gemma":[0.00038889982,0.00007255054,0.000068422196,0.0009319853,0.0000779489,0.00046608626,0.00036542545,0.000061765735,0.00053498003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074087716,0.00010855627,0.0007852046,0.00010178551,0.00008140027,0.00002543795,0.009241961,0.005357688,0.013635946,0.21190415,0.025261976,0.7334885],"study_design_scores_gemma":[0.000056752007,0.00020902601,0.003067428,0.00031434683,0.00003561325,0.000014377999,0.046453983,0.3103024,0.5543823,0.046950612,0.0375175,0.0006956649],"about_ca_topic_score_codex":0.00018508622,"about_ca_topic_score_gemma":0.00005232495,"teacher_disagreement_score":0.85216,"about_ca_system_score_codex":0.000024369716,"about_ca_system_score_gemma":0.000074484495,"threshold_uncertainty_score":0.6876264},"labels":[],"label_agreement":null},{"id":"W4386173001","doi":"10.54254/2753-8818/5/20230516","title":"Game theory--optimum strategy for drawing cards in 21 points","year":2023,"lang":"en","type":"article","venue":"Theoretical and Natural Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Randomness; Computer science; Game theory; Feeling; Mathematical economics; Artificial intelligence; Mathematics; Psychology; Social psychology; Statistics","score_opus":0.020450205719332704,"score_gpt":0.3143019269728967,"score_spread":0.293851721253564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386173001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86289036,0.00022107823,0.12800604,0.0038025521,0.00084535783,0.00045306285,0.000004362759,0.00031737157,0.0034598368],"genre_scores_gemma":[0.99553895,0.000016806991,0.004053336,0.00022514246,0.000046178575,0.000013818602,5.5624554e-7,0.00000500375,0.00010021527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817634,0.00007102338,0.00021316469,0.00052823644,0.00037874805,0.00063252077],"domain_scores_gemma":[0.9987496,0.00070685305,0.000031811014,0.00027156126,0.000093485934,0.0001466496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002519567,0.00012680217,0.0001554334,0.00019946738,0.00019977945,0.00027376707,0.00107255,0.00005280911,0.000012378624],"category_scores_gemma":[0.0006886508,0.00009187211,0.00004419119,0.0015072834,0.0021979727,0.00059965864,0.0004246975,0.00018780715,0.00004945701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014945901,0.0000074977215,0.00007982419,0.0000046978553,9.629147e-7,0.000006575227,0.000439544,0.0000639433,0.0019525362,0.9124045,0.000011863246,0.08501312],"study_design_scores_gemma":[0.00005724384,0.00006758954,0.0017941928,0.000021929118,0.0000014184119,0.0000057666675,0.00011389777,0.20788012,0.01154174,0.77832717,0.000060767226,0.0001281433],"about_ca_topic_score_codex":0.000010713999,"about_ca_topic_score_gemma":0.000003904072,"teacher_disagreement_score":0.20781618,"about_ca_system_score_codex":0.000038342736,"about_ca_system_score_gemma":0.00011317765,"threshold_uncertainty_score":0.80985224},"labels":[],"label_agreement":null},{"id":"W4386875701","doi":"10.48550/arxiv.2309.09476","title":"Mechanic Maker 2.0: Reinforcement Learning for Evaluating Generated Rules","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"USable; Reinforcement learning; Computer science; Artificial intelligence; Meaning (existential); Machine learning; Reinforcement; Baseline (sea); Psychology; World Wide Web; Social psychology","score_opus":0.26551522550800805,"score_gpt":0.27516309850453674,"score_spread":0.009647872996528695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386875701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1004319,0.00002877659,0.89664894,0.000118193355,0.0011157531,0.00062937464,0.0000040654572,0.0006807426,0.00034228154],"genre_scores_gemma":[0.9779825,0.00009176969,0.011584136,0.00007536048,0.00013447559,0.000012448767,0.00005247121,0.000044131855,0.010022685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743354,0.00018278016,0.00037737217,0.0012757478,0.00018114675,0.0005494356],"domain_scores_gemma":[0.99773675,0.00032611846,0.00040422683,0.00096789445,0.00043285073,0.00013215776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009398928,0.00034833816,0.00034339956,0.00031768432,0.00038307023,0.0002444388,0.0017753065,0.0002908732,0.00004794243],"category_scores_gemma":[0.00033785385,0.0004144158,0.00026632892,0.0005227614,0.00006082192,0.0002932904,0.0024057212,0.00056441233,0.00048133393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016692591,0.000013581778,0.00009635121,0.000048997732,0.0000768954,0.000039120052,0.0002990834,0.87764645,0.00034778344,0.11881241,0.0002031066,0.0023995358],"study_design_scores_gemma":[0.00011624328,0.00011415025,0.000026279466,0.00009971489,0.000052995223,9.698904e-7,0.00015664815,0.89787525,0.002764434,0.09809977,0.00029325654,0.00040027776],"about_ca_topic_score_codex":0.00017777311,"about_ca_topic_score_gemma":0.0000446711,"teacher_disagreement_score":0.8850648,"about_ca_system_score_codex":0.00030338168,"about_ca_system_score_gemma":0.00026805155,"threshold_uncertainty_score":0.9998308},"labels":[],"label_agreement":null},{"id":"W4387074701","doi":"10.48550/arxiv.2309.13071","title":"Tree-Based Reconstructive Partitioning: A Novel Low-Data Level Generation Approach","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Tree (set theory); Artificial intelligence; Machine learning; Quality (philosophy); Development (topology); Training set; Theoretical computer science; Mathematics","score_opus":0.48824679543766164,"score_gpt":0.25406066620381784,"score_spread":0.2341861292338438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387074701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05085565,0.000011157614,0.9455024,0.0001575438,0.0011070676,0.00037870352,0.00018320142,0.00047539352,0.0013288694],"genre_scores_gemma":[0.9392632,0.000020259395,0.059027575,0.00008702888,0.00024093353,0.0000047549756,0.0003715583,0.0000303052,0.0009543557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691904,0.00015127489,0.00034015364,0.0020109497,0.00016748611,0.00041108186],"domain_scores_gemma":[0.99633324,0.00017688076,0.00036641216,0.0026874128,0.00027843358,0.00015759378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050749554,0.00035078943,0.00033614843,0.000366323,0.0002698773,0.0003161655,0.0035569742,0.0003400882,0.000021061434],"category_scores_gemma":[0.00017289157,0.00042924457,0.00015835752,0.0008621297,0.0002567373,0.0007855357,0.0028230874,0.00057679816,0.00021739281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002247951,0.00025944793,0.0016440693,0.000067812376,0.0001269891,0.00008459261,0.0003810439,0.8231552,0.0003582895,0.16844891,0.0011455873,0.004305577],"study_design_scores_gemma":[0.00014955817,0.000023879778,0.00041668038,0.00006872673,0.000042643533,0.000002554592,0.00015953083,0.98133147,0.0018344313,0.015461083,0.0000596123,0.00044984187],"about_ca_topic_score_codex":0.00041290766,"about_ca_topic_score_gemma":0.00041581359,"teacher_disagreement_score":0.8884076,"about_ca_system_score_codex":0.00022765424,"about_ca_system_score_gemma":0.00060070964,"threshold_uncertainty_score":0.99981594},"labels":[],"label_agreement":null},{"id":"W4387394614","doi":"10.1609/aiide.v19i1.27518","title":"Playing Various Strategies in Dominion with Deep Reinforcement Learning","year":2023,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Heuristics; Artificial intelligence; Simple (philosophy); Multiset; Set (abstract data type); Representation (politics); Dominion; Machine learning; Human–computer interaction; Mathematics; Programming language","score_opus":0.03813808714914614,"score_gpt":0.2861923081316865,"score_spread":0.24805422098254037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387394614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88377523,0.000013933096,0.08713484,0.0016394735,0.00031634135,0.0007990789,0.0000018449251,0.00016377938,0.026155466],"genre_scores_gemma":[0.9993362,0.000058180507,0.0001962907,0.00008306726,0.000023350127,0.00006622812,0.0000019730849,0.0000147982,0.00021993718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978177,0.000019154842,0.0006203704,0.0005631302,0.0005247604,0.000454914],"domain_scores_gemma":[0.9988832,0.0002046725,0.0003581661,0.00019282306,0.00027566068,0.000085517706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031068278,0.00029483112,0.00029233127,0.00031408135,0.00019630228,0.00092635304,0.0009028989,0.00006548652,0.000021058167],"category_scores_gemma":[0.0002157746,0.00020913793,0.000081830956,0.00071281416,0.00025825563,0.0019721726,0.00054528593,0.00040453603,0.000068734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006459819,0.0003352977,0.005632865,0.0000783886,0.00008437847,0.000013665109,0.024934784,0.017134594,0.010414755,0.71750075,0.000026163903,0.2231984],"study_design_scores_gemma":[0.000116486015,0.0018100917,0.0017313611,0.0011432754,0.000013106873,0.000019085257,0.042056374,0.69344914,0.18732372,0.07160477,0.00012686226,0.0006057291],"about_ca_topic_score_codex":0.00006580972,"about_ca_topic_score_gemma":0.000030746967,"teacher_disagreement_score":0.67631453,"about_ca_system_score_codex":0.000121245415,"about_ca_system_score_gemma":0.000065488406,"threshold_uncertainty_score":0.8932843},"labels":[],"label_agreement":null},{"id":"W4387394661","doi":"10.1609/aiide.v19i1.27520","title":"Tree-Based Reconstructive Partitioning: A Novel Low-Data Level Generation Approach","year":2023,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Tree (set theory); Artificial intelligence; Machine learning; Quality (philosophy); Theoretical computer science; Mathematics","score_opus":0.20604353261385888,"score_gpt":0.3205882956809046,"score_spread":0.1145447630670457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387394661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47278696,0.000014625511,0.5000393,0.004416767,0.0010512891,0.001327058,0.00025217026,0.00028179178,0.019830052],"genre_scores_gemma":[0.9968106,0.000017509768,0.002467315,0.00023741345,0.000092965165,0.00007968303,0.00003413895,0.000018552542,0.00024180741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726963,0.00002127421,0.00072287925,0.00096113817,0.0005899939,0.00043507147],"domain_scores_gemma":[0.998122,0.00019067875,0.0004709696,0.0005418942,0.00054853596,0.00012595055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042648986,0.00033597898,0.00031863726,0.00026649283,0.0002621045,0.0009839517,0.0019328339,0.00009270869,0.000024645748],"category_scores_gemma":[0.0006042992,0.00026349723,0.00012886003,0.0007279161,0.0004437896,0.0022225229,0.00097148493,0.00030308974,0.000086181164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024134674,0.0010908499,0.0011448874,0.000074854965,0.00013317612,0.0000018248907,0.00444768,0.0005890088,0.050021525,0.5135295,0.0006746283,0.42805073],"study_design_scores_gemma":[0.000046190376,0.00023936603,0.00022763856,0.0002211324,0.000011658638,0.0000055154283,0.0034305227,0.6657569,0.3153313,0.014380743,0.00007958847,0.00026943773],"about_ca_topic_score_codex":0.0000299445,"about_ca_topic_score_gemma":0.000012861497,"teacher_disagreement_score":0.66516787,"about_ca_system_score_codex":0.00009356581,"about_ca_system_score_gemma":0.0001136215,"threshold_uncertainty_score":0.9999817},"labels":[],"label_agreement":null},{"id":"W4387394671","doi":"10.1609/aiide.v19i1.27499","title":"Entropy as a Measure of Puzzle Difficulty","year":2023,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Canadian Institute for Advanced Research","keywords":"Computer science; Exploit; Ranking (information retrieval); Witness; Entropy (arrow of time); Variety (cybernetics); Set (abstract data type); Artificial intelligence; Machine learning; Theoretical computer science","score_opus":0.04936860510762716,"score_gpt":0.29364801598458146,"score_spread":0.2442794108769543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387394671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9660059,0.000023040333,0.0073766527,0.004303342,0.0006296573,0.0007978357,0.000032419583,0.0001574083,0.020673709],"genre_scores_gemma":[0.99907166,0.000060362527,0.000108016364,0.00012445525,0.000036933496,0.00004270102,0.0000019880138,0.000014924544,0.0005389463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974844,0.00001996984,0.0007569676,0.0005872491,0.00073729426,0.00041412094],"domain_scores_gemma":[0.9981575,0.00020908746,0.0005115475,0.0003187179,0.0006769605,0.00012618589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028189152,0.00030631592,0.0003749812,0.00023572225,0.00015701506,0.00040741853,0.0014711004,0.000083042185,0.00004952318],"category_scores_gemma":[0.00072745146,0.00022023574,0.00021598945,0.00072228897,0.00042338087,0.0011481511,0.00079395296,0.00026918875,0.0001928779],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023781476,0.0004456631,0.0007985721,0.000049223916,0.00008607773,0.000002432019,0.005934571,0.000046242025,0.061392084,0.77242726,0.0002595438,0.15832055],"study_design_scores_gemma":[0.000039887494,0.00065077277,0.00037352587,0.00048230207,0.000014131514,0.000008916765,0.0064229295,0.02244488,0.85936695,0.109527335,0.0003906627,0.00027769816],"about_ca_topic_score_codex":0.00004005831,"about_ca_topic_score_gemma":0.0000051763604,"teacher_disagreement_score":0.7979749,"about_ca_system_score_codex":0.000073503325,"about_ca_system_score_gemma":0.000055460343,"threshold_uncertainty_score":0.8980953},"labels":[],"label_agreement":null},{"id":"W4387394743","doi":"10.1609/aiide.v19i1.27512","title":"Investigating the Influence of Behaviors and Dialogs on Player Enjoyment in Stealth Games","year":2023,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dialog box; Perception; Adversary; Simple (philosophy); Computer science; Human–computer interaction; Psychology; Cognitive psychology; World Wide Web; Computer security","score_opus":0.053604364599471856,"score_gpt":0.3093709697479335,"score_spread":0.2557666051484616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387394743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948606,0.000010807028,0.00026912498,0.003026224,0.0001438377,0.0005436002,0.000013108872,0.0000338405,0.0010988447],"genre_scores_gemma":[0.9993594,0.00009198082,0.00006189514,0.0003176621,0.000017312004,0.00006872438,8.894967e-7,0.000011417159,0.00007068189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99776024,0.000033930486,0.0007675138,0.0005334477,0.00053463207,0.00037022325],"domain_scores_gemma":[0.99842733,0.00043004952,0.0004822785,0.00026261175,0.00030218714,0.00009556607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004912301,0.00027263333,0.00031112312,0.00024450978,0.00013995823,0.00034047847,0.001019887,0.00006445575,0.000005098752],"category_scores_gemma":[0.0007533953,0.00017668348,0.00007523032,0.0006825943,0.00055436,0.0008878669,0.0007099775,0.00035679576,0.000019921292],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024560947,0.0007196466,0.038579054,0.00014071398,0.00007319373,0.0000039664,0.045090973,0.0017917491,0.052065693,0.5815025,0.000114716524,0.27967218],"study_design_scores_gemma":[0.00010093878,0.0018023151,0.040518474,0.002486827,0.000019481857,0.000009400321,0.02621053,0.03815336,0.7712664,0.11879078,0.00008644371,0.0005550518],"about_ca_topic_score_codex":0.00014195085,"about_ca_topic_score_gemma":0.000026847594,"teacher_disagreement_score":0.71920073,"about_ca_system_score_codex":0.00007762981,"about_ca_system_score_gemma":0.000060017443,"threshold_uncertainty_score":0.72049433},"labels":[],"label_agreement":null},{"id":"W4387394758","doi":"10.1609/aiide.v19i1.27530","title":"Navigation in Adversarial Environments Guided by PRA* and a Local RL Planner","year":2023,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Adversarial system; Reinforcement learning; Markov decision process; Planner; Artificial intelligence; Pathfinding; Baseline (sea); Delegation; Process (computing); Robotics; Human–computer interaction; Machine learning; Robot; Theoretical computer science; Markov process; Programming language","score_opus":0.039305840315747104,"score_gpt":0.28838839672848593,"score_spread":0.24908255641273883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387394758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96878725,0.00002278904,0.023337029,0.0032868548,0.00040692108,0.0007170596,0.000032240507,0.00006713441,0.003342743],"genre_scores_gemma":[0.99926674,0.00007034532,0.00007690513,0.00016067825,0.000025027222,0.000050670806,0.000006669774,0.000012287005,0.00033068165],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997937,0.000020425106,0.00061197986,0.00060534204,0.0004577168,0.0003675059],"domain_scores_gemma":[0.9991848,0.00015076267,0.00028103078,0.00017674586,0.0001021938,0.00010446109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002793555,0.00026536643,0.00025810115,0.00017898808,0.000110575435,0.00041671743,0.000701583,0.000086784996,0.000015219307],"category_scores_gemma":[0.00021609444,0.00021023604,0.00006929976,0.0003829837,0.00040592704,0.0013939764,0.0006311223,0.0002641239,0.00007403528],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062538596,0.000901888,0.0054672025,0.00008383909,0.00010927378,0.000011569785,0.017507428,0.00038390124,0.055985007,0.26049346,0.0017170206,0.656714],"study_design_scores_gemma":[0.0001634044,0.0009271358,0.0010240502,0.0008443571,0.0000159154,0.000019621768,0.012814048,0.22502786,0.65155643,0.10535762,0.0016165837,0.000632947],"about_ca_topic_score_codex":0.000062179985,"about_ca_topic_score_gemma":0.0000056990502,"teacher_disagreement_score":0.6560811,"about_ca_system_score_codex":0.00012030931,"about_ca_system_score_gemma":0.00002689217,"threshold_uncertainty_score":0.85731775},"labels":[],"label_agreement":null},{"id":"W4387394771","doi":"10.1609/aiide.v19i1.27522","title":"Mechanic Maker 2.0: Reinforcement Learning for Evaluating Generated Rules","year":2023,"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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"USable; Reinforcement learning; Computer science; Artificial intelligence; Meaning (existential); Reinforcement; Machine learning; Human–computer interaction; Psychology; Multimedia; Social psychology","score_opus":0.09860666841973242,"score_gpt":0.33927787337253457,"score_spread":0.24067120495280214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387394771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70063573,0.00002287909,0.28562963,0.0036478222,0.00090897357,0.0018532033,0.000015874857,0.00030796757,0.00697791],"genre_scores_gemma":[0.9976332,0.000047486647,0.00066978333,0.00019190363,0.000054366446,0.00019059364,0.000007671351,0.000021840617,0.0011831068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748325,0.000023178749,0.0007527495,0.0006572337,0.00057807856,0.0005055287],"domain_scores_gemma":[0.9980919,0.00031099422,0.000480948,0.00022500499,0.00078456424,0.00010662266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005987231,0.00031975194,0.0003119543,0.00022927976,0.0003262943,0.0007852196,0.0010214801,0.00007839338,0.000038457674],"category_scores_gemma":[0.0009816274,0.00024454636,0.00018720013,0.00047781056,0.00016652035,0.001093552,0.0006899337,0.00027431425,0.00013145711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002760991,0.00016697287,0.00018428921,0.00007506643,0.00010916854,0.0000010281611,0.0049221613,0.002880764,0.057446387,0.54870945,0.00021611965,0.3850125],"study_design_scores_gemma":[0.000035439378,0.0006795092,0.00003403619,0.00026981867,0.000011716304,0.0000026835073,0.0029510085,0.5432798,0.38502893,0.067279994,0.00020829208,0.00021872479],"about_ca_topic_score_codex":0.0000146165,"about_ca_topic_score_gemma":0.0000021953526,"teacher_disagreement_score":0.5403991,"about_ca_system_score_codex":0.00010990404,"about_ca_system_score_gemma":0.000057154244,"threshold_uncertainty_score":0.9972311},"labels":[],"label_agreement":null},{"id":"W4387410109","doi":"10.1145/3573382.3616030","title":"The Role of Generative AI in Games Research","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generative grammar; Popularity; Computer science; Conversation; Generative model; Artificial intelligence; Data science; Multimedia; Sociology; Psychology; Communication; Social psychology","score_opus":0.10606987086433906,"score_gpt":0.41227180543472725,"score_spread":0.3062019345703882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387410109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7052351,0.0013011633,0.09172523,0.05768407,0.00091558206,0.0009678331,0.0000017912721,0.000572073,0.14159712],"genre_scores_gemma":[0.99547356,0.00006774479,0.0016489188,0.000081927414,0.000028118411,0.000022392034,1.3482132e-7,0.000003048829,0.0026741405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989129,0.00016525816,0.00016800241,0.00016530568,0.0003276995,0.00026086712],"domain_scores_gemma":[0.9987148,0.0007216261,0.000017782186,0.00036842088,0.00015315082,0.000024240697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013739037,0.000039420724,0.000059505808,0.00014397342,0.00010922457,0.00008781023,0.00089819916,0.000024564457,0.0000114628065],"category_scores_gemma":[0.00025732513,0.000024845569,0.000020579477,0.0013303993,0.00016688905,0.0001599297,0.0003886451,0.00014168416,0.0003300604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025862767,0.000015472475,0.0017636323,9.93675e-7,0.0000032292078,0.000003954517,0.0038236699,0.00040601392,0.009541433,0.7336572,0.00488909,0.24589275],"study_design_scores_gemma":[0.000011925913,0.000038642025,0.0018785344,0.0000059105105,1.4072592e-7,3.6601398e-7,0.002355496,0.28939185,0.35594577,0.33676308,0.013563409,0.000044866832],"about_ca_topic_score_codex":0.00029299708,"about_ca_topic_score_gemma":0.00061520556,"teacher_disagreement_score":0.39689407,"about_ca_system_score_codex":0.000018937493,"about_ca_system_score_gemma":0.00007027589,"threshold_uncertainty_score":0.42423686},"labels":[],"label_agreement":null},{"id":"W4387918059","doi":"10.1007/978-3-031-44505-7_37","title":"Learn, Compare, Search: One Sawmill’s Search for the Best Cutting Patterns Across and/or Trees","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"FPInnovations; Université Laval","funders":"","keywords":"Computer science; Monte Carlo tree search; Process (computing); Metric (unit); Tree (set theory); Set (abstract data type); Depth-first search; Computation; Search algorithm; Search tree; Monte Carlo method; Breadth-first search; Algorithm; Mathematics; Statistics; Engineering; Combinatorics; Operations management","score_opus":0.15892187178744166,"score_gpt":0.3648855646293663,"score_spread":0.20596369284192462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387918059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012471316,0.00032163184,0.9922948,0.003140913,0.0014440407,0.0010353647,0.000053062653,0.00024063335,0.00022240703],"genre_scores_gemma":[0.8699223,0.00051205844,0.12341808,0.0019282755,0.0015385678,0.00007948047,0.000009079821,0.00014101085,0.002451175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99447197,0.00008166513,0.0007029896,0.0018723455,0.0014765525,0.0013944821],"domain_scores_gemma":[0.991965,0.0055326945,0.0002029392,0.0015827081,0.00048556406,0.00023110033],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028196138,0.0005821102,0.00063580717,0.00046579525,0.0012270574,0.0016464946,0.00518603,0.0002545978,0.000018220273],"category_scores_gemma":[0.00027271887,0.00042094314,0.00017077301,0.0008173275,0.0018178007,0.0005476315,0.0030863807,0.0012314013,0.000102445985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002069357,0.000031867687,0.0008929744,0.00008451247,0.000030512767,0.000046889825,0.0052460674,0.06711286,0.00005339321,0.0068605435,0.000015492571,0.9196042],"study_design_scores_gemma":[0.00019564792,0.00043548326,0.0009541695,0.00084538414,0.000016202588,0.00005481026,0.0000355465,0.97546226,0.0032077122,0.017219586,0.0007906071,0.00078259106],"about_ca_topic_score_codex":0.00039790297,"about_ca_topic_score_gemma":0.001726947,"teacher_disagreement_score":0.9188216,"about_ca_system_score_codex":0.00020215349,"about_ca_system_score_gemma":0.0004646497,"threshold_uncertainty_score":0.9998242},"labels":[],"label_agreement":null},{"id":"W4387928928","doi":"10.48550/arxiv.2310.14252","title":"Proof of Irvine's Conjecture via Mechanized Guessing","year":2023,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Automated theorem proving; Mathematics; Gas meter prover; Calculus (dental); Discrete mathematics; Computer science; Mathematical economics; Algorithm; Mathematical proof; Geometry","score_opus":0.10695902366177507,"score_gpt":0.32269748117905733,"score_spread":0.21573845751728227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387928928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27463016,0.00023662178,0.71913207,0.001603285,0.0030158598,0.0004983342,0.000008246024,0.00052910164,0.0003463294],"genre_scores_gemma":[0.9825342,0.000021605496,0.01621473,0.00015944654,0.00029375553,0.00005676682,0.000012148,0.000051532585,0.0006557585],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99724734,0.00014394258,0.0007272706,0.00095514464,0.00048336934,0.00044292022],"domain_scores_gemma":[0.99710995,0.0002293104,0.00056201185,0.0016979058,0.0002954095,0.00010542412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057171076,0.00037670438,0.00060477393,0.00023865685,0.00010570362,0.00012267746,0.002498588,0.00041842202,0.00006175316],"category_scores_gemma":[0.0003319026,0.00035311605,0.00023620397,0.00049979554,0.00013447255,0.00021524656,0.0031554296,0.0007515325,0.00027366364],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018416056,0.0013363028,0.194323,0.0041202344,0.0016948183,0.0010680777,0.035592012,0.037625164,0.21163885,0.051181573,0.010968004,0.4502678],"study_design_scores_gemma":[0.0001320054,0.00012253218,0.0046679014,0.0007447026,0.000055999946,0.000013288471,0.00011943404,0.08913471,0.7713709,0.13196172,0.00082002854,0.0008567891],"about_ca_topic_score_codex":0.00029519745,"about_ca_topic_score_gemma":0.000072759794,"teacher_disagreement_score":0.7079041,"about_ca_system_score_codex":0.00008079069,"about_ca_system_score_gemma":0.00025201464,"threshold_uncertainty_score":0.99989206},"labels":[],"label_agreement":null},{"id":"W4388658369","doi":"10.1111/tops.12710","title":"Storytelling as <i>Inverse</i> Inverse Planning","year":2023,"lang":"en","type":"article","venue":"Topics in Cognitive Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Office of Naval Research; National Natural Science Foundation of China; Hertz Foundation; National Science Foundation","keywords":"Storytelling; Inverse; Computer science; Certainty; Narrative; Artificial intelligence; Epistemology; Linguistics; Philosophy","score_opus":0.10741094712564717,"score_gpt":0.3679751134785708,"score_spread":0.2605641663529237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388658369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8372061,0.000052432653,0.101899326,0.0009968979,0.0019871471,0.000312192,0.0000022041181,0.0005260293,0.057017647],"genre_scores_gemma":[0.99048406,0.000036742542,0.006391264,0.0013800584,0.00013904751,0.000020516825,0.0000010731372,0.000008811242,0.0015384243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977443,0.000053525204,0.00025940215,0.0006778632,0.00064632297,0.0006185831],"domain_scores_gemma":[0.9988409,0.00037232268,0.00007800065,0.00034988415,0.00021723747,0.000141645],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013894355,0.00014082277,0.00013944275,0.0005566796,0.00032592707,0.00022926582,0.0014335627,0.000055750403,0.000032976135],"category_scores_gemma":[0.0012190602,0.00014781968,0.000039230694,0.0035694335,0.0007597411,0.0011806954,0.00062791473,0.00027669777,0.0011930563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005608869,0.00024512704,0.077951014,0.000059456917,0.000024458335,0.0022282968,0.07529798,0.018223243,0.013422576,0.28498885,0.004091696,0.5234112],"study_design_scores_gemma":[0.00035996834,0.00028422975,0.009480076,0.00049482397,0.000008301635,0.000035931098,0.010185986,0.6812767,0.14147437,0.14570643,0.009640374,0.0010528362],"about_ca_topic_score_codex":0.000069033405,"about_ca_topic_score_gemma":0.000047381687,"teacher_disagreement_score":0.66305345,"about_ca_system_score_codex":0.000115332754,"about_ca_system_score_gemma":0.0003428417,"threshold_uncertainty_score":0.9995846},"labels":[],"label_agreement":null},{"id":"W4388711601","doi":"10.1126/sciadv.adg3256","title":"Student of Games: A unified learning algorithm for both perfect and imperfect information games","year":2023,"lang":"en","type":"article","venue":"Science Advances","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Google (Canada); Alberta Medical Association","funders":"","keywords":"Perfect information; Computer science; Imperfect; Combinatorial game theory; Turns, rounds and time-keeping systems in games; Game mechanics; Limit (mathematics); Complete information; Artificial intelligence; Sequential game; Game theory; Video game design; Theoretical computer science; Mathematical economics; Mathematics","score_opus":0.01890333554880741,"score_gpt":0.3266653686939193,"score_spread":0.3077620331451119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388711601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42304322,0.0004943106,0.5742783,0.0002015265,0.00063037075,0.00049063895,0.000005409464,0.00029927408,0.0005569703],"genre_scores_gemma":[0.93940663,0.00027581892,0.059990544,0.00006458007,0.000038638824,0.00006225092,0.0000020676023,0.000005649642,0.00015383124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998373,0.000035244662,0.0003140557,0.00034212501,0.00053615717,0.0003994727],"domain_scores_gemma":[0.9989361,0.000309271,0.00018993179,0.00026469064,0.00021685603,0.00008315082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014633199,0.00012408121,0.00017670216,0.00038637992,0.00036258152,0.00026945004,0.00089479564,0.000028261496,0.000002809891],"category_scores_gemma":[0.0004685451,0.00010452854,0.000045527402,0.0016345454,0.0005928113,0.0042023323,0.0003087117,0.00009057048,0.000021692595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031273548,0.000011075496,0.0017666116,0.000025753201,0.0000036334065,6.894072e-7,0.0056235814,0.0020557262,0.004113991,0.0035032264,0.000025665715,0.98286694],"study_design_scores_gemma":[0.000300885,0.001222816,0.012826319,0.0001321271,0.00001181666,0.000013247718,0.014631119,0.7493549,0.19422242,0.008165507,0.018596299,0.0005225506],"about_ca_topic_score_codex":0.00001784732,"about_ca_topic_score_gemma":0.0000062369763,"teacher_disagreement_score":0.9823444,"about_ca_system_score_codex":0.000036999896,"about_ca_system_score_gemma":0.0001506021,"threshold_uncertainty_score":0.426255},"labels":[],"label_agreement":null},{"id":"W4389302453","doi":"10.1109/cog57401.2023.10333170","title":"Weighting Information Sets with Siamese Neural Networks in Reconnaissance Blind Chess","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Set (abstract data type); Perfect information; Context (archaeology); Weighting; Artificial intelligence; Artificial neural network; State (computer science); Game theory; Machine learning; Algorithm; Mathematics; Mathematical economics","score_opus":0.04284191019016925,"score_gpt":0.2879643967164776,"score_spread":0.24512248652630836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389302453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5301654,0.000017978331,0.45943967,0.0020980865,0.00042307627,0.00025611997,4.2534236e-7,0.00055527047,0.0070440024],"genre_scores_gemma":[0.9939881,0.0000050022704,0.0053250385,0.00042013085,0.000039052473,0.000021548341,0.0000026105622,0.0000054395327,0.00019309651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989372,0.000036335612,0.0002996196,0.00019523514,0.0001904441,0.0003411831],"domain_scores_gemma":[0.9993447,0.0001346047,0.000090992784,0.00030858425,0.000065977554,0.000055125653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038397158,0.000107487016,0.00011153381,0.00019157374,0.00007698712,0.00022721224,0.00053865917,0.00005458326,0.000023812998],"category_scores_gemma":[0.000053525546,0.000086247506,0.000020582902,0.001380879,0.000048544196,0.0022210553,0.00015585538,0.00017361237,0.00020158134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046549056,0.000023484537,0.028152645,0.000023350787,0.000009592246,0.000048038997,0.005316856,0.3515919,0.000025767275,0.024652675,0.0021465165,0.5879626],"study_design_scores_gemma":[0.000083950676,0.000033839282,0.004398653,0.000023898145,5.145008e-7,0.000006015924,0.00018645951,0.9927462,0.00074509776,0.00088059943,0.00076280715,0.00013197976],"about_ca_topic_score_codex":0.0000731162,"about_ca_topic_score_gemma":0.00026851078,"teacher_disagreement_score":0.6411543,"about_ca_system_score_codex":0.000028482275,"about_ca_system_score_gemma":0.000024849027,"threshold_uncertainty_score":0.35170713},"labels":[],"label_agreement":null},{"id":"W4389302462","doi":"10.1109/cog57401.2023.10333175","title":"Game-map Pathfinding with Per-Problem Selection of Synthesized Heuristics","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia; University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Computer science; Pathfinding; Selection (genetic algorithm); Software portability; Artificial intelligence; Theoretical computer science","score_opus":0.02910480769633872,"score_gpt":0.27100954323164483,"score_spread":0.24190473553530611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389302462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082213745,0.000011087413,0.9130645,0.0003997781,0.00016696303,0.00015889778,0.0000010117727,0.0005907343,0.0033933364],"genre_scores_gemma":[0.9166002,0.000011906057,0.08211732,0.000033322427,0.000033141157,0.000011662594,8.3511463e-7,0.000010608319,0.0011809648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988951,0.00004528289,0.0002441722,0.0002733335,0.0002880454,0.00025405653],"domain_scores_gemma":[0.99916446,0.00027963062,0.000098061544,0.00026623232,0.00014140035,0.000050210452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031851474,0.00010395431,0.00015103206,0.00015835544,0.00007395393,0.000070892915,0.0004494798,0.00004550203,0.000070162154],"category_scores_gemma":[0.0000641759,0.00008165304,0.000037892616,0.0007634987,0.000063844054,0.00022427992,0.00011783446,0.0000897767,0.00033061317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011038752,0.00032417313,0.040802486,0.00037509992,0.00017862496,0.00008788331,0.013037976,0.021928184,0.07173975,0.5538724,0.0063409964,0.291202],"study_design_scores_gemma":[0.000119130054,0.0003952439,0.0015223928,0.00017965348,0.00001802376,0.000021216825,0.00071772037,0.5837997,0.38354298,0.026764465,0.0024912867,0.00042816508],"about_ca_topic_score_codex":0.000070584894,"about_ca_topic_score_gemma":0.000041587,"teacher_disagreement_score":0.8343865,"about_ca_system_score_codex":0.000028619654,"about_ca_system_score_gemma":0.000063741296,"threshold_uncertainty_score":0.42494735},"labels":[],"label_agreement":null},{"id":"W4389315148","doi":"10.1109/cog57401.2023.10333205","title":"path2level: Constraint-Based Level Generation from Paths","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Constraint (computer-aided design); Path (computing); Generator (circuit theory); Process (computing); Theoretical computer science; Distributed computing; Power (physics); Mathematics; Programming language","score_opus":0.16953607096328893,"score_gpt":0.31380295569862887,"score_spread":0.14426688473533994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389315148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07496194,0.00001066799,0.9191674,0.0026341546,0.00070564623,0.00010121672,0.000022622176,0.00073450373,0.0016618774],"genre_scores_gemma":[0.8996174,0.0000030816589,0.09800664,0.0013009937,0.000164397,0.000017328714,0.000030101555,0.00000918231,0.0008509105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987899,0.00005372342,0.00024313509,0.00037990083,0.00027893475,0.00025440546],"domain_scores_gemma":[0.9991155,0.00019058795,0.000049826383,0.0004753738,0.00008944418,0.00007925357],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025340854,0.00011345835,0.00010456471,0.00009452193,0.000108474655,0.00018388446,0.00057683216,0.00006660313,0.00022064768],"category_scores_gemma":[0.00011044547,0.00010293878,0.00005548111,0.00046013898,0.00006737106,0.0002810264,0.00011780917,0.000078273806,0.0023787648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028346658,0.000069235866,0.0023938564,0.000002853472,0.000019315567,0.000091863054,0.0011338261,0.004415994,0.079571575,0.33305374,0.04424376,0.53500116],"study_design_scores_gemma":[0.000050638027,0.000024124834,0.0023882643,0.0000049151895,0.0000017967618,7.4934314e-7,0.00008620919,0.82670856,0.155838,0.012294772,0.0024327664,0.00016920324],"about_ca_topic_score_codex":0.00023956478,"about_ca_topic_score_gemma":0.0001992527,"teacher_disagreement_score":0.8246554,"about_ca_system_score_codex":0.0000278391,"about_ca_system_score_gemma":0.00012455974,"threshold_uncertainty_score":0.998398},"labels":[],"label_agreement":null},{"id":"W4389315168","doi":"10.1109/cog57401.2023.10333165","title":"Deep Dive on Checkers Endgame Data","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chess endgame; Computer science; Artificial intelligence; Artificial neural network; Machine learning; Transfer of learning; Set (abstract data type); Sample (material)","score_opus":0.1476525840134473,"score_gpt":0.35182522122661053,"score_spread":0.20417263721316323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389315168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011900219,0.00002564061,0.9247845,0.007097509,0.0013490252,0.00019729586,0.00000580415,0.0016476843,0.052992333],"genre_scores_gemma":[0.9534817,0.00004649002,0.03677772,0.0024157236,0.00021836968,0.000015120725,0.00002953906,0.000018577945,0.0069967634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987931,0.000025125848,0.00014914256,0.0004711772,0.00028139327,0.00028005277],"domain_scores_gemma":[0.9981205,0.00016963242,0.000030966345,0.0015746808,0.000030225236,0.00007401431],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029545437,0.00008984315,0.000083138904,0.00009797664,0.000083196144,0.00013153556,0.0026808416,0.00003658718,0.00012324496],"category_scores_gemma":[0.0001852393,0.0000745554,0.000025095365,0.0006049473,0.000050836188,0.0004847435,0.00142788,0.00009195441,0.010135846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062726444,0.00006725603,0.0009886166,0.0000058688947,0.00002994754,0.000098183235,0.0024427774,0.0020154119,0.0005207137,0.35328734,0.09167594,0.5488617],"study_design_scores_gemma":[0.000026758911,0.00005705228,0.0010383738,0.000007712394,0.0000020400028,0.0000023145435,0.00030778474,0.94344115,0.012018912,0.0146793965,0.028237592,0.00018091605],"about_ca_topic_score_codex":0.000056027642,"about_ca_topic_score_gemma":0.00007055145,"teacher_disagreement_score":0.9415815,"about_ca_system_score_codex":0.00001885246,"about_ca_system_score_gemma":0.00002677061,"threshold_uncertainty_score":0.99063486},"labels":[],"label_agreement":null},{"id":"W4389315259","doi":"10.1109/cog57401.2023.10333227","title":"Game Level Blending using a Learned Level Representation","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Representation (politics); Annotation; Cluster analysis; Artificial intelligence; Popularity; Process (computing); Machine learning; Human–computer interaction; Programming language","score_opus":0.49594949110091713,"score_gpt":0.4310482392168456,"score_spread":0.06490125188407153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389315259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14034146,0.0000072087496,0.8547874,0.00086566183,0.00047087518,0.00010262925,0.000001449846,0.00057589554,0.0028474072],"genre_scores_gemma":[0.9291765,0.000009909565,0.06445586,0.00015835765,0.00009117477,0.0000066884772,0.0000025244735,0.000012524097,0.0060864757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998605,0.00006049056,0.00025787423,0.00041498206,0.00032232027,0.00033933535],"domain_scores_gemma":[0.9991231,0.00018568653,0.00007198929,0.00047226335,0.00008000427,0.000066983965],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037649437,0.000103929975,0.00011549392,0.00023551138,0.00013716686,0.00022412302,0.00061174505,0.00005008506,0.000068605674],"category_scores_gemma":[0.00019051103,0.00010085459,0.000060065697,0.0012489846,0.000046111712,0.00075304066,0.0003608013,0.00009763319,0.0010705641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013957397,0.00007520094,0.009776811,0.00003052261,0.00005649719,0.00014208397,0.010143923,0.04993808,0.12521219,0.2541522,0.0045428826,0.5459156],"study_design_scores_gemma":[0.00004212302,0.000016745456,0.0026690273,0.000019760453,0.0000029838434,0.000012107553,0.00056268525,0.8734096,0.09640572,0.026187154,0.0005003771,0.00017169086],"about_ca_topic_score_codex":0.00043021684,"about_ca_topic_score_gemma":0.000044525277,"teacher_disagreement_score":0.82347155,"about_ca_system_score_codex":0.000056931513,"about_ca_system_score_gemma":0.0000622227,"threshold_uncertainty_score":0.9997072},"labels":[],"label_agreement":null},{"id":"W4389315284","doi":"10.1109/cog57401.2023.10333216","title":"Representing Player Behaviour via Graph Embedding Techniques: A Case Study in Dota 2","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Computer science; Curse of dimensionality; Theoretical computer science; Graph; Personalization; Artificial intelligence","score_opus":0.06492931304609657,"score_gpt":0.37940774836138225,"score_spread":0.3144784353152857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389315284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79587084,0.0000068944987,0.20152749,0.00012982836,0.00018175846,0.00044335233,2.6313975e-7,0.00101088,0.00082871807],"genre_scores_gemma":[0.98216325,0.0000033623962,0.017314218,0.000053114865,0.000037918453,0.00010315184,3.4064837e-7,0.00001433338,0.0003102806],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808294,0.00011312553,0.00045208237,0.0006149312,0.00030636232,0.00043057615],"domain_scores_gemma":[0.9987849,0.00020116438,0.00007456325,0.0008035557,0.00006449877,0.00007129196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010760091,0.00014952505,0.0001713719,0.0005564901,0.0001524514,0.00021262965,0.00077309425,0.00006161417,0.000029403958],"category_scores_gemma":[0.00007705707,0.00014060167,0.00006224218,0.001975794,0.000034660112,0.0005452909,0.0008056658,0.00022159466,0.00013533856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006929569,0.0007445798,0.7002613,0.00001257469,0.000023712144,0.05579947,0.032381322,0.0012179272,0.0037159603,0.0030598333,0.0024003389,0.20037608],"study_design_scores_gemma":[0.00041423895,0.00065229693,0.018701116,0.00016652555,0.000025867539,0.0046740063,0.076136544,0.7548053,0.11873721,0.023213038,0.0004903726,0.0019834302],"about_ca_topic_score_codex":0.003945816,"about_ca_topic_score_gemma":0.0012855486,"teacher_disagreement_score":0.7535874,"about_ca_system_score_codex":0.000039198298,"about_ca_system_score_gemma":0.000020731697,"threshold_uncertainty_score":0.596492},"labels":[],"label_agreement":null},{"id":"W4389478499","doi":"10.1007/978-3-031-49614-1_22","title":"Zero-Visibility Cops and Robber Game on Cage Graph","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Monotonic function; Visibility; Cage; Computer science; Zero (linguistics); Graph; Zero-sum game; Visibility graph; Discrete mathematics; Theoretical computer science; Game theory; Combinatorics; Mathematics; Mathematical economics; Physics; Geometry","score_opus":0.035069599507588305,"score_gpt":0.2793457527815197,"score_spread":0.24427615327393137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389478499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010131311,0.00018035632,0.9919426,0.0009408117,0.0025364023,0.0004785121,0.00000843739,0.0004070777,0.002492689],"genre_scores_gemma":[0.82864577,0.00024836086,0.16302833,0.004391628,0.000746822,0.000030812465,0.000007231131,0.00013592918,0.0027651077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476516,0.00006124211,0.0006589573,0.0024601421,0.0012112855,0.0008432154],"domain_scores_gemma":[0.9958375,0.0013015133,0.0002638037,0.0020936131,0.00023945638,0.00026412334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011890283,0.00064394966,0.000615287,0.0009738248,0.00027653342,0.00075863674,0.0032397406,0.00040037205,0.000021024181],"category_scores_gemma":[0.00030535748,0.0005775911,0.00015222149,0.00095230335,0.001592926,0.00056480436,0.0018760676,0.0010904195,0.00026647464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011792152,0.000044697797,0.00022435458,0.000049664755,0.000016343223,0.00021787544,0.0018575385,0.028858837,0.00017238804,0.12272517,0.00012497841,0.8456964],"study_design_scores_gemma":[0.000089595575,0.00030046405,0.0005386053,0.00039353527,0.0000070804804,0.00003769928,4.3113974e-7,0.20396107,0.0027748914,0.790139,0.0009346335,0.00082297856],"about_ca_topic_score_codex":0.0000693434,"about_ca_topic_score_gemma":0.00017586927,"teacher_disagreement_score":0.84487337,"about_ca_system_score_codex":0.00022704016,"about_ca_system_score_gemma":0.00031818423,"threshold_uncertainty_score":0.9996675},"labels":[],"label_agreement":null},{"id":"W4390481472","doi":"10.1109/ssci52147.2023.10371841","title":"Comparing Behaviour Tree and Hierarchical Task Network Planning Methods for their Impact on Player Experience","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Notice; Task (project management); Computer science; Variety (cybernetics); Tree (set theory); Game tree; Artificial intelligence; Machine learning; Game theory; Sequential game; Engineering; Mathematics","score_opus":0.14244565919868402,"score_gpt":0.43753808528327454,"score_spread":0.2950924260845905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390481472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35836214,0.000041250478,0.6399437,0.00018383049,0.00025770112,0.00016671757,9.662928e-7,0.00027279436,0.000770914],"genre_scores_gemma":[0.844848,0.0000043026316,0.15464707,0.00017427174,0.00012282532,0.00006136132,0.0000019674046,0.000012573977,0.0001276744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984344,0.00011591674,0.00026565685,0.00048798686,0.00014385991,0.0005521261],"domain_scores_gemma":[0.9977784,0.0015718702,0.00005883683,0.00039996137,0.000033222295,0.00015769276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007606722,0.00019898,0.0002592689,0.00011140464,0.00027709393,0.00024235835,0.0006790187,0.000069735506,0.000009278794],"category_scores_gemma":[0.000108939916,0.0001367361,0.00009597588,0.00044862187,0.00009592367,0.00027500498,0.00036292753,0.00017973098,0.00001810898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016207837,0.00009756299,0.15562695,0.00001395405,0.000067641435,0.000032748554,0.03223801,0.06631195,0.0037128488,0.08859827,0.0065085916,0.6466294],"study_design_scores_gemma":[0.00007289513,0.00022415112,0.041384175,0.00003597598,0.0000033883748,0.000009246511,0.0004925242,0.9364174,0.0085863415,0.011794108,0.00074356014,0.00023623137],"about_ca_topic_score_codex":0.000041458214,"about_ca_topic_score_gemma":0.000009402684,"teacher_disagreement_score":0.87010545,"about_ca_system_score_codex":0.000024176574,"about_ca_system_score_gemma":0.000028494316,"threshold_uncertainty_score":0.55759364},"labels":[],"label_agreement":null},{"id":"W4390511171","doi":"10.3233/icg-230240","title":"The 2023 Computer Olympiad","year":2024,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Olympiad; Computer science; Mathematics education; Mathematics","score_opus":0.025800123685308138,"score_gpt":0.29734581872689836,"score_spread":0.2715456950415902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390511171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004343464,0.0036877466,0.9702928,0.010437168,0.008254668,0.00004519422,4.9868595e-7,0.00014192608,0.0027965328],"genre_scores_gemma":[0.93114686,0.001087167,0.047290463,0.001575843,0.0076151714,0.000010548353,3.6441998e-7,0.000039802668,0.0112337945],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988894,0.00007033195,0.00025391259,0.0001729096,0.00032034432,0.00029308547],"domain_scores_gemma":[0.99913764,0.00035900116,0.00004343335,0.00028703886,0.000072843926,0.000100051475],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006830267,0.00008987995,0.00007099359,0.00006939899,0.00044145892,0.002322605,0.0012043137,0.00003495745,0.00006728974],"category_scores_gemma":[0.00002428351,0.00005294201,0.00010473803,0.00029475705,0.00007927231,0.00050809124,0.00019703747,0.00036377914,0.0014215751],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000160595,0.0000089983705,0.00005022534,0.0000025810841,0.000029082146,0.00022962665,0.0005988338,0.00028746223,0.00017561526,0.094354816,0.077155106,0.82710606],"study_design_scores_gemma":[0.00002746113,0.00008458949,0.00036593186,0.0000847946,0.0000056350805,0.001476599,0.000072084906,0.31076327,0.0020806817,0.053198278,0.6316692,0.00017147358],"about_ca_topic_score_codex":0.0000058156847,"about_ca_topic_score_gemma":0.000008396806,"teacher_disagreement_score":0.9268034,"about_ca_system_score_codex":0.00004863201,"about_ca_system_score_gemma":0.00011993379,"threshold_uncertainty_score":0.9993559},"labels":[],"label_agreement":null},{"id":"W4390706657","doi":"10.1007/978-3-031-23161-2_20","title":"Computer Go","year":2024,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Computer Graphics and Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.01653806455194633,"score_gpt":0.2437395867107162,"score_spread":0.22720152215876985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390706657","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016213911,0.009889802,0.47186783,0.0010906007,0.0059134737,0.00049653114,0.000044416985,0.0004839321,0.5100513],"genre_scores_gemma":[0.0057867863,0.05941938,0.22550991,0.0028327422,0.007883981,0.00004795912,0.00006854217,0.00043715155,0.69801354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99713296,0.000023971934,0.00084740797,0.0010355663,0.0005755484,0.00038453762],"domain_scores_gemma":[0.9979422,0.0003388316,0.00032676177,0.0009663474,0.00022420687,0.00020163818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002805547,0.0006185379,0.0007767708,0.0006354835,0.000086682376,0.0002885814,0.0012883802,0.00043768913,0.000041536256],"category_scores_gemma":[0.000005452567,0.0005659286,0.00037645508,0.00016922747,0.00046552447,0.00028220337,0.0012712968,0.0007024248,0.00016313013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022303805,0.000016764163,0.000031394004,0.00013039025,0.000114506074,0.000062794716,0.0005423953,0.000020569487,4.4303437e-7,0.8337334,0.013429727,0.15191543],"study_design_scores_gemma":[0.00004478009,0.00020524386,0.00006830363,0.0003994179,0.00004610725,0.000032905587,0.0000017261178,0.034583174,0.000015083626,0.3844732,0.57963544,0.0004946048],"about_ca_topic_score_codex":0.000016626736,"about_ca_topic_score_gemma":0.000017334141,"teacher_disagreement_score":0.56620574,"about_ca_system_score_codex":0.000019290888,"about_ca_system_score_gemma":0.0001008717,"threshold_uncertainty_score":0.9996792},"labels":[],"label_agreement":null},{"id":"W4390905962","doi":"10.1109/aciiw59127.2023.10388150","title":"How (not) to Evaluate Computational Empathy: Testing the Assumptions of the Evaluation Methods in a Use-Case","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Empathy; Computer science; Psychology; Social psychology","score_opus":0.4511124691341144,"score_gpt":0.49471847873654934,"score_spread":0.043606009602434936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390905962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36319128,0.00000451246,0.6269182,0.008829982,0.0002528593,0.0005303955,0.0000022222525,0.000083877036,0.00018666826],"genre_scores_gemma":[0.73763573,2.5657815e-7,0.2617749,0.00031677925,0.000020757887,0.000058029695,7.455257e-7,0.0000051981237,0.00018763822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975391,0.0009975845,0.00031169804,0.0002766152,0.00067428336,0.000200744],"domain_scores_gemma":[0.99507576,0.0036912814,0.00012019709,0.0005372751,0.000538768,0.000036715253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005402465,0.000092768656,0.00010561814,0.00016561768,0.0002126781,0.00026330998,0.0007130554,0.0000328481,0.000012767049],"category_scores_gemma":[0.0060190214,0.000055401782,0.000056541117,0.002411635,0.000071277085,0.0004047432,0.0004337478,0.00012355833,0.00004734217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020370812,0.000025581634,0.002637073,0.0000037511481,0.00001008597,0.000007833869,0.0074414564,0.63634986,0.0023158283,0.018228086,0.0004414346,0.33253697],"study_design_scores_gemma":[0.00003685212,0.000018470706,0.052364748,0.000016475347,0.000008309929,0.000025725101,0.00083349925,0.9128363,0.0034046108,0.03033962,0.000048474772,0.00006687142],"about_ca_topic_score_codex":0.00021519503,"about_ca_topic_score_gemma":0.00025139467,"teacher_disagreement_score":0.37444445,"about_ca_system_score_codex":0.000071379036,"about_ca_system_score_gemma":0.00020156156,"threshold_uncertainty_score":0.7205765},"labels":[],"label_agreement":null},{"id":"W4391096910","doi":"10.1109/gem59776.2023.10389911","title":"Automated Difficulty Assessment Model for Platformer Games: A Comprehensive Approach","year":2023,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Adversary; GRASP; Set (abstract data type); Process (computing); Game mechanics; Human–computer interaction; Video game; Software; Game design; Game theory; Presentation (obstetrics); Artificial intelligence; Software engineering; Programming language; Multimedia; Computer security; Mathematical economics","score_opus":0.11175466362539332,"score_gpt":0.3641007555232612,"score_spread":0.2523460918978679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391096910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026262326,0.000007222662,0.96540207,0.00045330534,0.0002061456,0.0005913994,0.000009517032,0.0035007824,0.0035672043],"genre_scores_gemma":[0.602241,0.000007533056,0.3944246,0.00041622113,0.000036016652,0.0002675733,0.000031709278,0.00001815076,0.002557225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983021,0.000019584275,0.00033007722,0.00052434846,0.00033235853,0.00049150875],"domain_scores_gemma":[0.9988444,0.00022889291,0.000078928686,0.00052895845,0.00021114474,0.00010768077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018019312,0.00019030021,0.00022460124,0.00014857198,0.00018203173,0.00020313043,0.0008548376,0.00008646128,0.000008344077],"category_scores_gemma":[0.000030326548,0.00015105383,0.000120129494,0.0006217044,0.000065130625,0.00046829088,0.0003169859,0.00010399761,0.00017873055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012535918,0.00026227962,0.00011746371,0.00007597414,0.0000856275,0.000006582477,0.0042097904,0.5678809,0.004771989,0.31337687,0.08573978,0.023460144],"study_design_scores_gemma":[0.00010343781,0.000044081185,0.0005032722,0.000007037923,0.0000047999074,0.0000033217736,0.00056306063,0.9894829,0.0010391774,0.007278598,0.00075461704,0.00021574346],"about_ca_topic_score_codex":0.000018295572,"about_ca_topic_score_gemma":0.0000058041173,"teacher_disagreement_score":0.57597864,"about_ca_system_score_codex":0.00006823717,"about_ca_system_score_gemma":0.000110798755,"threshold_uncertainty_score":0.6159796},"labels":[],"label_agreement":null},{"id":"W4391805658","doi":"10.1080/26939169.2024.2319152","title":"Age Guessing: A Game to Introduce Fundamental Statistical Concepts","year":2024,"lang":"en","type":"article","venue":"Journal of Statistics and Data Science Education","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical economics; Psychology; Mathematics","score_opus":0.06707136600625423,"score_gpt":0.42869791295947673,"score_spread":0.3616265469532225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391805658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011771585,0.0003490481,0.9822301,0.0019158169,0.0033590873,0.00007562833,0.00013499452,0.000013939128,0.00014977537],"genre_scores_gemma":[0.5719997,0.00006117927,0.4272944,0.00024442334,0.00031796808,8.6220444e-7,0.000011934985,0.0000040158047,0.00006546785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998365,0.000034310866,0.00040275912,0.0003954942,0.0005873047,0.00021513371],"domain_scores_gemma":[0.99859726,0.00026152498,0.000117580144,0.00044542734,0.0002947775,0.00028343376],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013807868,0.00009275107,0.00013096957,0.00028879844,0.000137103,0.0016726785,0.0013600753,0.000018340581,0.000029407787],"category_scores_gemma":[0.0012011572,0.00007447233,0.000009360558,0.0006239888,0.00044144137,0.0022196542,0.0004582485,0.00015918024,0.000035125828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046316077,0.00009750419,0.00009414258,0.000020815593,0.000005610751,0.00004169711,0.002738711,0.000021808126,0.002579349,0.4955869,0.03591972,0.4628891],"study_design_scores_gemma":[0.00017391889,0.0017692151,0.01763655,0.0008020731,0.000094795854,0.0012739318,0.005837165,0.41513568,0.004022826,0.21666467,0.33568078,0.00090842077],"about_ca_topic_score_codex":0.000032585256,"about_ca_topic_score_gemma":0.000010104437,"teacher_disagreement_score":0.56022817,"about_ca_system_score_codex":0.00010965129,"about_ca_system_score_gemma":0.0021811384,"threshold_uncertainty_score":0.99936366},"labels":[],"label_agreement":null},{"id":"W4392172381","doi":"10.1007/978-3-031-54968-7_4","title":"Solving NoGo on Small Rectangular Boards","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.030673470356791653,"score_gpt":0.26922307152750885,"score_spread":0.2385496011707172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101881466,0.001218011,0.9633063,0.0016455087,0.006061099,0.0003836567,0.000004496664,0.00049828354,0.026780726],"genre_scores_gemma":[0.1593992,0.0002086417,0.8200514,0.0069637913,0.0034679684,0.00004112946,0.0000067758756,0.00023779091,0.009623342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99460477,0.000033728662,0.0006941075,0.0024219893,0.0012891326,0.0009563011],"domain_scores_gemma":[0.99641556,0.0007811773,0.00022322501,0.002101543,0.00024972815,0.00022877168],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011643443,0.00073449843,0.0005970005,0.0012724319,0.00028959961,0.0013385267,0.0051343255,0.00046273004,0.00004892642],"category_scores_gemma":[0.0002172014,0.0006616475,0.00025272454,0.0009032122,0.0008349043,0.00043738683,0.0020755925,0.0015501796,0.0008490491],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005652991,0.000026418556,0.000009610495,0.00005160134,0.000017702288,0.0004811123,0.0015242101,0.024203535,0.00023132983,0.18820637,0.00014373551,0.78509873],"study_design_scores_gemma":[0.000038593334,0.00026112035,0.000007420738,0.0010338186,0.000010018149,0.0000625494,3.5457643e-7,0.45638078,0.008485788,0.5248795,0.00803483,0.00080521574],"about_ca_topic_score_codex":0.00004373063,"about_ca_topic_score_gemma":0.00014024516,"teacher_disagreement_score":0.78429353,"about_ca_system_score_codex":0.00058507425,"about_ca_system_score_gemma":0.0005754214,"threshold_uncertainty_score":0.9999289},"labels":[],"label_agreement":null},{"id":"W4392172476","doi":"10.1007/978-3-031-54968-7_3","title":"Stockfish or Leela Chess Zero? A Comparison Against Endgame Tablebases","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chess endgame; Computer science; Zero (linguistics); Artificial intelligence; Philosophy; Linguistics","score_opus":0.04637551862151267,"score_gpt":0.30243635468588426,"score_spread":0.2560608360643716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172476","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017143824,0.0017283591,0.97977436,0.0012436308,0.004935875,0.0007069662,0.00001868375,0.00068517216,0.010735499],"genre_scores_gemma":[0.43193895,0.0002980848,0.5390119,0.008254617,0.0024901526,0.000115388924,0.000027738077,0.00030680562,0.01755638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929084,0.00005193338,0.0011946678,0.0028118512,0.0017387107,0.0012944229],"domain_scores_gemma":[0.9953273,0.0012186966,0.00043567864,0.002290878,0.00037604745,0.0003514287],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010694074,0.0010155439,0.001095475,0.0013312437,0.00037954442,0.001997678,0.006487866,0.00055847986,0.00008132322],"category_scores_gemma":[0.0002355923,0.00084287225,0.00027571537,0.0014927209,0.0014612727,0.0010849407,0.003130715,0.0017963616,0.0004558395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020117102,0.00008940078,0.00007372199,0.00015083433,0.00004445285,0.00059964246,0.003001931,0.08246739,0.00019902614,0.03827368,0.0008505357,0.87422925],"study_design_scores_gemma":[0.000097447475,0.0003022801,0.000014029778,0.001380614,0.000024570618,0.000085889755,0.0000017567471,0.82663995,0.0071357926,0.14433366,0.018712012,0.0012719829],"about_ca_topic_score_codex":0.00006318882,"about_ca_topic_score_gemma":0.00049114175,"teacher_disagreement_score":0.8729573,"about_ca_system_score_codex":0.0006378861,"about_ca_system_score_gemma":0.0012064239,"threshold_uncertainty_score":0.9994022},"labels":[],"label_agreement":null},{"id":"W4392349727","doi":"10.18280/ts.410137","title":"VADNet: Visual-Based Anti-Cheating Detection Network in FPS Games","year":2024,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Education of the People's Republic of China","keywords":"Cheating; Computer science; Artificial intelligence; Computer vision; Computer security; Psychology; Social psychology","score_opus":0.022497184834071978,"score_gpt":0.2841109539631575,"score_spread":0.2616137691290855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392349727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22159256,0.0003381971,0.7759282,0.0004280024,0.00066837366,0.00022572845,8.075357e-7,0.00036147676,0.00045663893],"genre_scores_gemma":[0.9938455,0.000006580756,0.0053529497,0.00029757954,0.00040145527,0.00004411407,0.0000020031082,0.000016481774,0.000033311466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819756,0.00011086692,0.0004363646,0.00047560633,0.0003480853,0.00043151362],"domain_scores_gemma":[0.9993883,0.0002652701,0.000054719443,0.00018362461,0.00003807938,0.00007002844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071475893,0.00017676788,0.00016701446,0.00019920692,0.00010926937,0.00035830826,0.0003819048,0.000068474124,0.0001258498],"category_scores_gemma":[0.000022987875,0.0001715122,0.00008717574,0.0008371256,0.000049228587,0.00042929294,0.00007424023,0.00021488853,0.00012758562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002084985,0.00019104454,0.0051990873,0.00009314486,0.00003712327,0.00015012937,0.0021099483,0.20653278,0.026282795,0.0069538294,0.00074008043,0.7516892],"study_design_scores_gemma":[0.00007480741,0.00015082896,0.0027765515,0.00017418918,0.000006096919,0.0000041237495,0.000048543738,0.9377482,0.05458266,0.002200126,0.0020294148,0.00020445316],"about_ca_topic_score_codex":0.00008079831,"about_ca_topic_score_gemma":0.00010865407,"teacher_disagreement_score":0.772253,"about_ca_system_score_codex":0.00011327717,"about_ca_system_score_gemma":0.000083810104,"threshold_uncertainty_score":0.6994065},"labels":[],"label_agreement":null},{"id":"W4392370758","doi":"10.54254/2755-2721/44/20230050","title":"Achieving fairness in team-based FPS games: A skill-based matchmaking solution","year":2024,"lang":"en","type":"article","venue":"Applied and Computational Engineering","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Outcome (game theory); Process (computing); Fairness measure; Measure (data warehouse); Degree (music); Human–computer interaction; Data mining; Programming language; Operating system","score_opus":0.009748049752763676,"score_gpt":0.23703693600915074,"score_spread":0.22728888625638707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392370758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05373274,0.0002161696,0.9447859,0.00031019057,0.00020224287,0.00012496438,0.000001110832,0.0003689982,0.00025767495],"genre_scores_gemma":[0.9253886,0.0000010248751,0.07436239,0.00012307444,0.000056281446,0.000042893098,0.0000061845612,0.000014970885,0.000004579701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989263,0.000010875456,0.00024466703,0.00035960943,0.00022192643,0.00023663073],"domain_scores_gemma":[0.99941033,0.00036823115,0.000026470701,0.00011910102,0.000024183193,0.000051668932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022465542,0.0001522497,0.00013181068,0.00028372757,0.00006150944,0.00025694733,0.00021541571,0.000053160293,0.0000036650401],"category_scores_gemma":[0.000017430228,0.00016193496,0.0000364859,0.00048494615,0.000026202275,0.00020382633,0.000064690874,0.00017582474,0.000018016153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021569533,0.00001428359,0.000062203966,0.00007118567,0.0000049249556,0.000009189982,0.00034099293,0.8409181,0.0007922958,0.12962106,0.000009598397,0.028153956],"study_design_scores_gemma":[0.00007591035,0.000011203551,0.0012889433,0.00018191696,0.0000026964958,0.000005845922,0.000031191896,0.99194294,0.00082422665,0.0052212384,0.00023010126,0.00018375929],"about_ca_topic_score_codex":0.000015002197,"about_ca_topic_score_gemma":0.0000027829292,"teacher_disagreement_score":0.8716559,"about_ca_system_score_codex":0.00008819203,"about_ca_system_score_gemma":0.00009282626,"threshold_uncertainty_score":0.66035163},"labels":[],"label_agreement":null},{"id":"W4392381171","doi":"10.4230/lipics.mfcs.2023.13","title":"Rényi-Ulam Games and Online Computation with Imperfect Advice","year":2023,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Advice (programming); Imperfect; Computer science; Computation; Theoretical computer science; Algorithm; Programming language","score_opus":0.0160508259754043,"score_gpt":0.2549638521788162,"score_spread":0.23891302620341187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392381171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4293737,0.00020799995,0.55239445,0.011345576,0.000096471704,0.00022700353,0.000008001376,0.00091662566,0.0054301945],"genre_scores_gemma":[0.8976897,0.00018614078,0.09950577,0.00015847,0.000015909387,0.00001958811,0.000058697147,0.000022423723,0.002343325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971724,0.0013027237,0.000301151,0.0005645291,0.00033519976,0.00032398367],"domain_scores_gemma":[0.9963715,0.0014895751,0.00017748962,0.0008888873,0.0009308994,0.00014163833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021265203,0.00018514253,0.00018707184,0.0002008893,0.00032136004,0.00039029453,0.0008291648,0.00007175866,0.00001582599],"category_scores_gemma":[0.0005580687,0.00017096143,0.000049903825,0.0011287848,0.00022161118,0.00045605042,0.000500135,0.00018847572,0.0000941732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019815874,0.0004922521,0.010699296,0.000077681325,0.00007288691,0.000034451205,0.029383536,0.0012244419,0.007000539,0.1925114,0.0025925245,0.7558912],"study_design_scores_gemma":[0.00039972042,0.000003827826,0.03289098,0.0005707373,0.000020141442,0.000048969672,0.0005850231,0.90200764,0.04660513,0.009639677,0.006678333,0.00054983137],"about_ca_topic_score_codex":0.00045430072,"about_ca_topic_score_gemma":0.0010827587,"teacher_disagreement_score":0.9007832,"about_ca_system_score_codex":0.000037287988,"about_ca_system_score_gemma":0.00010108529,"threshold_uncertainty_score":0.6971605},"labels":[],"label_agreement":null},{"id":"W4392471506","doi":"10.3390/electronics13050985","title":"Deep Reinforcement Learning with Godot Game Engine","year":2024,"lang":"en","type":"article","venue":"Electronics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Python (programming language); Computer science; Reinforcement learning; Human–computer interaction; Game design; Interface (matter); Artificial intelligence; Software engineering; Engineering; Programming language; Operating system","score_opus":0.011778123678559762,"score_gpt":0.2517161449653336,"score_spread":0.23993802128677386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392471506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003909953,0.0073866574,0.98411006,0.0007251957,0.00019492018,0.00009918799,2.8103884e-8,0.000531717,0.0030422932],"genre_scores_gemma":[0.9904942,0.00040639134,0.005882568,0.00012297988,0.00010255617,0.000016836246,0.000001960035,0.000019237885,0.002953253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875337,0.000025074693,0.00016367403,0.0003164694,0.000276308,0.00046513358],"domain_scores_gemma":[0.9994847,0.00008516102,0.000028569379,0.00029606294,0.000044824275,0.000060646045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002139251,0.00013049005,0.00009992124,0.00008876128,0.00007128906,0.00026905292,0.0004713912,0.0000410512,0.000059930582],"category_scores_gemma":[0.000029260056,0.0001071882,0.000040473842,0.00047110833,0.00003148435,0.0003477051,0.0000969404,0.00040545262,0.00036803063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008346779,0.00001534254,0.000048050963,0.000019401998,0.000054467175,0.00006162821,0.0020753588,0.34387472,0.0008899506,0.30473104,0.00032635574,0.34789535],"study_design_scores_gemma":[0.000021362082,0.00034771816,0.0000056808267,0.00002676781,0.0000057532034,0.000026512267,0.000020014892,0.7960138,0.01702113,0.0027523828,0.18361405,0.000144886],"about_ca_topic_score_codex":0.0000052634196,"about_ca_topic_score_gemma":0.000034324526,"teacher_disagreement_score":0.98658425,"about_ca_system_score_codex":0.00016437129,"about_ca_system_score_gemma":0.00017252944,"threshold_uncertainty_score":0.47304118},"labels":[],"label_agreement":null},{"id":"W4393161391","doi":"10.1609/aaai.v38i21.30411","title":"Does Robin Hood Use a Lightsaber?: Automated Planning for Storytelling","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Storytelling; Computer science; Art; Narrative; Literature","score_opus":0.09562430147882751,"score_gpt":0.32947293201672323,"score_spread":0.23384863053789573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24744613,0.00039199885,0.7193622,0.012436351,0.008969807,0.0031511926,0.000063724925,0.0045543667,0.003624248],"genre_scores_gemma":[0.9833746,0.000039174745,0.015216147,0.00019412332,0.00023855406,0.00012384921,0.0000012524338,0.000046490582,0.00076580443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650395,0.000031489046,0.0010135141,0.0010674774,0.0006695849,0.0007139664],"domain_scores_gemma":[0.9973289,0.0007642746,0.00035859464,0.0005250911,0.0008664764,0.00015668824],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008759599,0.00045258127,0.00044191183,0.00037039848,0.00040668793,0.0016842395,0.0028340432,0.00020797751,0.000038519465],"category_scores_gemma":[0.0008894397,0.00027048276,0.00032389554,0.0011573741,0.00038304608,0.0015872299,0.00044779282,0.00049921125,0.00014027534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006529408,0.000121271645,0.00011024848,0.00016230393,0.000060983966,0.0000035145472,0.0051327148,0.0010310292,0.05191536,0.8976905,0.000981738,0.042725064],"study_design_scores_gemma":[0.00000896914,0.00013852924,0.000017990744,0.0006982794,0.000020653182,0.0000041713574,0.00046539863,0.44329995,0.43944108,0.11441878,0.0012160828,0.00027010526],"about_ca_topic_score_codex":0.000058827394,"about_ca_topic_score_gemma":0.000013340495,"teacher_disagreement_score":0.7832717,"about_ca_system_score_codex":0.00012571298,"about_ca_system_score_gemma":0.0002279564,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W4393200490","doi":"10.32384/jeahil20604","title":"Brief Communication – concerning algorithmic indexing in MEDLINE","year":2024,"lang":"en","type":"article","venue":"Journal of EAHIL","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Public Health Agency of Canada; Université de Montréal","funders":"","keywords":"Search engine indexing; MEDLINE; Computer science; Information retrieval; Data science; Political science","score_opus":0.03961256816276703,"score_gpt":0.322039995119935,"score_spread":0.28242742695716794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393200490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13596006,0.0102973385,0.841023,0.008264765,0.0014246813,0.000092099355,6.806301e-7,0.00007924663,0.0028580835],"genre_scores_gemma":[0.96807057,0.0002295719,0.031236937,0.00016755931,0.00018345311,9.042085e-7,2.160584e-7,0.000006556913,0.000104263185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893916,0.00008802482,0.00048389222,0.00010185918,0.00025484985,0.00013219967],"domain_scores_gemma":[0.9991463,0.00030559604,0.00016105034,0.00022422735,0.00011521244,0.00004762421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243611,0.0000672191,0.0001382216,0.00022575946,0.000041195584,0.00021297345,0.0008110282,0.0000446366,0.000021171889],"category_scores_gemma":[0.00016759071,0.000058625898,0.000061047416,0.00040353253,0.000049285754,0.00084660697,0.00013479315,0.00043918975,0.000022564216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012824984,0.00008105594,0.0029655325,0.000035478355,0.000052815674,0.0004834603,0.014556869,0.0070966887,0.003790366,0.063367836,0.0022451542,0.90531194],"study_design_scores_gemma":[0.00019825509,0.00018219417,0.0018396814,0.0013278419,0.000012659125,0.0005392952,0.0006380202,0.88409656,0.013614767,0.050837487,0.046451323,0.0002619055],"about_ca_topic_score_codex":0.00004422017,"about_ca_topic_score_gemma":0.000027038335,"teacher_disagreement_score":0.90505004,"about_ca_system_score_codex":0.000099147685,"about_ca_system_score_gemma":0.0001412912,"threshold_uncertainty_score":0.23906948},"labels":[],"label_agreement":null},{"id":"W4393566062","doi":"10.3233/icg-240243","title":"2024 world computer chess championships: The end of an era 1974–2024","year":2024,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer graphics (images); Computer science; Engineering drawing; Engineering","score_opus":0.055129299046060704,"score_gpt":0.3209927105581281,"score_spread":0.2658634115120674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393566062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14214323,0.005450865,0.796589,0.021481829,0.024863783,0.0003158905,0.000013304738,0.00028257456,0.0088594705],"genre_scores_gemma":[0.96506816,0.00007677419,0.025847346,0.0004828832,0.002840646,0.0000070400197,6.878657e-7,0.000025054102,0.0056513897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809813,0.0001948565,0.00050411205,0.0003147898,0.0005350848,0.00035299614],"domain_scores_gemma":[0.99863327,0.00042161843,0.00011916195,0.0005393609,0.00012379688,0.00016281167],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011891752,0.00017271226,0.00018962617,0.00030220626,0.00024696495,0.0010648428,0.0016269932,0.000054895605,0.0006322256],"category_scores_gemma":[0.000025453963,0.00011200445,0.00016828597,0.0008508045,0.00021865146,0.0008398884,0.00028480063,0.00095226977,0.00024979445],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013350355,0.0001402341,0.00044818642,0.000050833394,0.00013974361,0.0004518959,0.0084181065,0.0019654965,0.00089100207,0.09298081,0.043637075,0.8508633],"study_design_scores_gemma":[0.000102155056,0.0003319403,0.0026040291,0.0006153665,0.000045548804,0.0017991208,0.0005451555,0.64472175,0.013047751,0.09266495,0.24300301,0.0005192188],"about_ca_topic_score_codex":0.000021829723,"about_ca_topic_score_gemma":0.00012794953,"teacher_disagreement_score":0.85034406,"about_ca_system_score_codex":0.000059306534,"about_ca_system_score_gemma":0.00021671155,"threshold_uncertainty_score":0.99997216},"labels":[],"label_agreement":null},{"id":"W4393715428","doi":"10.5281/zenodo.3890314","title":"Historical data of heroes and players of Dota 2","year":2020,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"DOTA; History; Computer science; Chemistry","score_opus":0.11557373121533551,"score_gpt":0.29415556916079655,"score_spread":0.17858183794546104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393715428","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007786436,0.00033804815,0.018828113,0.0008565404,0.00028000525,0.00033423593,0.97782445,0.00024807593,0.0012126555],"genre_scores_gemma":[0.0025437914,0.00086852914,0.0026661258,0.000086899614,0.00018589679,1.9034678e-8,0.99291474,0.00057725195,0.0001567375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809784,0.00022649587,0.000425674,0.00057979475,0.0004719175,0.00019828108],"domain_scores_gemma":[0.9976892,0.000065154454,0.00030716462,0.0014708992,0.00032901875,0.000138549],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049847015,0.00014495548,0.00028608975,0.00019914709,0.0003393557,0.00025405316,0.0052621486,0.00009445708,0.0008159289],"category_scores_gemma":[0.0013423298,0.00014930067,0.000034078796,0.0004800677,0.00021719521,0.00031582863,0.007830944,0.00029907216,0.00094213436],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001430061,0.000056836958,3.2093496e-7,0.00013942458,0.000028656419,0.000009829447,0.00027699294,0.0000057295347,0.00020964703,0.00069903693,0.9685636,0.029995618],"study_design_scores_gemma":[0.000053218246,0.00019957936,0.000007061759,0.00004105946,0.0000148738345,0.000022268117,0.00005913379,0.00075202424,0.000309866,0.0001003757,0.9983155,0.00012505539],"about_ca_topic_score_codex":0.00012860262,"about_ca_topic_score_gemma":9.937592e-7,"teacher_disagreement_score":0.029870562,"about_ca_system_score_codex":0.00009924665,"about_ca_system_score_gemma":0.000010228153,"threshold_uncertainty_score":0.9998357},"labels":[],"label_agreement":null},{"id":"W4393770385","doi":"10.5281/zenodo.3890315","title":"Historical data of heroes and players of Dota 2","year":2020,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Art; Computer science","score_opus":0.11557373121533551,"score_gpt":0.29415556916079655,"score_spread":0.17858183794546104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393770385","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007786436,0.00033804815,0.018828113,0.0008565404,0.00028000525,0.00033423593,0.97782445,0.00024807593,0.0012126555],"genre_scores_gemma":[0.0025437914,0.00086852914,0.0026661258,0.000086899614,0.00018589679,1.9034678e-8,0.99291474,0.00057725195,0.0001567375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809784,0.00022649587,0.000425674,0.00057979475,0.0004719175,0.00019828108],"domain_scores_gemma":[0.9976892,0.000065154454,0.00030716462,0.0014708992,0.00032901875,0.000138549],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049847015,0.00014495548,0.00028608975,0.00019914709,0.0003393557,0.00025405316,0.0052621486,0.00009445708,0.0008159289],"category_scores_gemma":[0.0013423298,0.00014930067,0.000034078796,0.0004800677,0.00021719521,0.00031582863,0.007830944,0.00029907216,0.00094213436],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001430061,0.000056836958,3.2093496e-7,0.00013942458,0.000028656419,0.000009829447,0.00027699294,0.0000057295347,0.00020964703,0.00069903693,0.9685636,0.029995618],"study_design_scores_gemma":[0.000053218246,0.00019957936,0.000007061759,0.00004105946,0.0000148738345,0.000022268117,0.00005913379,0.00075202424,0.000309866,0.0001003757,0.9983155,0.00012505539],"about_ca_topic_score_codex":0.00012860262,"about_ca_topic_score_gemma":9.937592e-7,"teacher_disagreement_score":0.029870562,"about_ca_system_score_codex":0.00009924665,"about_ca_system_score_gemma":0.000010228153,"threshold_uncertainty_score":0.9998357},"labels":[],"label_agreement":null},{"id":"W4398187319","doi":"10.1017/s0140525x2300328x","title":"Exploratory exploitation and exploitative exploration: The phenomenology of play and the computational dynamics of search","year":2024,"lang":"en","type":"article","venue":"Behavioral and Brain Sciences","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Phenomenology (philosophy); Psychology; Cognitive science; Computer science; Epistemology; Philosophy","score_opus":0.10889820405062343,"score_gpt":0.3616668138432515,"score_spread":0.25276860979262805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398187319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88211495,0.0011535061,0.10383467,0.012442563,0.00013980106,0.00020786164,0.000009755868,0.000023350944,0.00007353789],"genre_scores_gemma":[0.99530286,0.000088566514,0.004457376,0.000078860976,0.000015979062,0.000027697424,0.0000013579835,0.0000026344148,0.000024662868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887913,0.00019234951,0.00024347204,0.0002653727,0.0002996226,0.00012006551],"domain_scores_gemma":[0.99848884,0.001207967,0.00006884386,0.000101503385,0.00010305808,0.000029795241],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012177585,0.000083095554,0.00012826645,0.00010479494,0.0002629196,0.00018808828,0.00031675684,0.000027442038,0.000003808073],"category_scores_gemma":[0.000048520476,0.000045245502,0.000020616168,0.00046106716,0.0033151715,0.00096896634,0.00020686781,0.00008520488,0.0000010417299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133216,0.000027260996,0.00082162645,0.000019471907,0.000007455976,0.0000017871976,0.088015884,0.0005927938,0.00035569302,0.8085628,0.00005337495,0.10152849],"study_design_scores_gemma":[0.00024058398,0.000691722,0.0032109814,0.00008522364,0.000021338165,0.000026145532,0.1077998,0.45819607,0.0018834732,0.4275532,0.000095609095,0.00019582934],"about_ca_topic_score_codex":0.000058458536,"about_ca_topic_score_gemma":0.000061619874,"teacher_disagreement_score":0.45760328,"about_ca_system_score_codex":0.000009333843,"about_ca_system_score_gemma":0.00008243927,"threshold_uncertainty_score":0.9993972},"labels":[],"label_agreement":null},{"id":"W4399213446","doi":"10.3233/icg-240247","title":"Los Alamos chess game 2 (after P-K3) is solved; black wins in 21 moves","year":2024,"lang":"en","type":"article","venue":"ICGA Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"","keywords":"National laboratory; Physics; Computer science; Engineering physics","score_opus":0.02348301949334456,"score_gpt":0.2956753399550017,"score_spread":0.27219232046165714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399213446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63262355,0.0027772232,0.34746513,0.010140712,0.0028976218,0.000210204,0.000008505568,0.00019504564,0.0036820206],"genre_scores_gemma":[0.9917078,0.0001535617,0.0037608095,0.0012861445,0.0006663602,0.000009215814,2.4885222e-7,0.00002381772,0.0023920562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979789,0.00008083258,0.00052432163,0.00040575664,0.00047983974,0.0005303259],"domain_scores_gemma":[0.99911356,0.00012634664,0.000084045656,0.00040603417,0.000087479166,0.00018254948],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005118088,0.0002064001,0.00021408052,0.0002905948,0.000067008885,0.0011300392,0.0010668072,0.00014810316,0.000594611],"category_scores_gemma":[0.0000410321,0.00017675475,0.00016876149,0.00054665783,0.0001436355,0.0012958284,0.00025243126,0.000952791,0.0009872093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000170334,0.00097296905,0.02514866,0.00035774914,0.00048447854,0.0144447945,0.14061163,0.0114502525,0.027973292,0.04409615,0.14408292,0.59020674],"study_design_scores_gemma":[0.0003168953,0.0003155911,0.02181502,0.0015727809,0.000040370895,0.0013272087,0.0012987676,0.6608733,0.050274488,0.13448583,0.12632914,0.001350611],"about_ca_topic_score_codex":0.000022018208,"about_ca_topic_score_gemma":0.000050237584,"teacher_disagreement_score":0.64942306,"about_ca_system_score_codex":0.0001424074,"about_ca_system_score_gemma":0.00019485403,"threshold_uncertainty_score":0.9999069},"labels":[],"label_agreement":null},{"id":"W4399563495","doi":"10.1109/3dv62453.2024.00146","title":"Split, Merge, and Refine: Fitting Tight Bounding Boxes via Over-Segmentation and Iterative Search","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"BD; Samsung; KT","keywords":"Bounding overwatch; Merge (version control); Computer science; Segmentation; Artificial intelligence; Algorithm; Pattern recognition (psychology); Information retrieval","score_opus":0.02706269348015687,"score_gpt":0.3295540910564541,"score_spread":0.3024913975762972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399563495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46395075,0.0009312138,0.5304356,0.0012254365,0.00036028025,0.00013239341,0.0000013104639,0.00018254694,0.0027804826],"genre_scores_gemma":[0.9579254,0.0000883366,0.04008369,0.00014101517,0.00008732394,0.000008139938,0.0000013676254,0.000007901249,0.0016568302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989845,0.00005076309,0.000189688,0.0003849785,0.00019547137,0.00019456918],"domain_scores_gemma":[0.999477,0.0002630142,0.000020683083,0.00013712465,0.000037592854,0.00006456483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036199368,0.00010296712,0.00009045234,0.000118756216,0.00018394434,0.00090678583,0.00014367781,0.00003484478,0.00006595382],"category_scores_gemma":[0.00003146177,0.00008502459,0.00001870155,0.00028049524,0.00007759043,0.0009638477,0.00021602758,0.000113420814,0.000030978874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005367147,0.000017183484,0.004961318,0.00009561129,0.00003766434,0.000041156458,0.015881358,0.00003597096,0.026456987,0.30973935,0.0009846675,0.64174336],"study_design_scores_gemma":[0.000038656202,0.000077757635,0.0019261207,0.0001098251,0.000006871717,0.000027229777,0.0005182336,0.89291507,0.088454194,0.013813879,0.0018984188,0.0002137349],"about_ca_topic_score_codex":0.00017605501,"about_ca_topic_score_gemma":0.000055110413,"teacher_disagreement_score":0.8928791,"about_ca_system_score_codex":0.00003607979,"about_ca_system_score_gemma":0.000024933863,"threshold_uncertainty_score":0.87441564},"labels":[],"label_agreement":null},{"id":"W4399695598","doi":"10.48550/arxiv.2406.09083","title":"Simple Chopsticks: Playing with any number of hands and fingers","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Fundação para a Ciência e a Tecnologia; Agence Nationale de la Recherche","keywords":"Simple (philosophy); Generalization; Computer science; Adversary; Focus (optics); Artificial intelligence; Mathematics; Computer security; Physics; Philosophy","score_opus":0.061159235100677355,"score_gpt":0.22044360226964677,"score_spread":0.1592843671689694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399695598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.782655,0.00005934715,0.21234716,0.000042115633,0.00019613575,0.00013026812,0.000008015238,0.00013560393,0.0044263443],"genre_scores_gemma":[0.9968979,0.000072657844,0.0022768201,0.00003069624,0.000039170838,6.3423164e-7,0.0000024256071,0.000016709344,0.00066303223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858284,0.000043751053,0.00018205302,0.0008269614,0.000098369244,0.00026604012],"domain_scores_gemma":[0.9987581,0.00016136654,0.00015933013,0.00068529695,0.000121619014,0.00011432706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000161083,0.00023805515,0.0002859623,0.0001637836,0.00009246599,0.00013726145,0.00086162525,0.0001660724,0.000034861692],"category_scores_gemma":[0.000032825305,0.00023690732,0.000083764884,0.00046392562,0.00025310426,0.00020388485,0.0019760986,0.00044434983,0.000054256772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013795032,0.00014774855,0.12545621,0.000935322,0.00052452146,0.0014242141,0.005503507,0.2424646,0.00025167875,0.6173211,0.00087768125,0.0049555097],"study_design_scores_gemma":[0.00021610573,0.000105699066,0.0011222607,0.00049899885,0.0001461987,0.000021703196,0.00040041696,0.78891104,0.00282905,0.20487244,0.00025576825,0.0006203372],"about_ca_topic_score_codex":0.00032747778,"about_ca_topic_score_gemma":0.00007072283,"teacher_disagreement_score":0.54644644,"about_ca_system_score_codex":0.00007699106,"about_ca_system_score_gemma":0.00016334404,"threshold_uncertainty_score":0.96608},"labels":[],"label_agreement":null},{"id":"W4400361203","doi":"10.1145/3649921.3656983","title":"Toward A Game Citation and Reference Workbench","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Universitas Brawijaya","keywords":"Workbench; Computer science; Citation; Human–computer interaction; World Wide Web; Artificial intelligence; Visualization","score_opus":0.10393006701202658,"score_gpt":0.32268490864675076,"score_spread":0.2187548416347242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400361203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023156172,0.00066853175,0.9492317,0.0027574913,0.00035363866,0.00006679871,3.4510475e-7,0.00040509106,0.023360241],"genre_scores_gemma":[0.9718283,0.000056702735,0.026471177,0.00019442788,0.00003603252,0.000007330347,3.8235186e-7,0.000003430358,0.0014022413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993293,0.000018139974,0.0001173371,0.00027158964,0.00013514137,0.00012848458],"domain_scores_gemma":[0.9995995,0.00013379999,0.000010505109,0.00017287175,0.00003628388,0.000047051522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014370038,0.00006333042,0.000054056774,0.000083349965,0.000024729481,0.00042185842,0.00025336127,0.000034458706,0.00007414824],"category_scores_gemma":[0.00004142097,0.000051259874,0.000014790792,0.00033070834,0.00003930379,0.00051571056,0.00011386965,0.00008314352,0.00035333587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.612978e-7,0.000004067481,0.00006878517,0.000010903218,0.000003404957,0.000011843705,0.0021666721,0.0000131070465,0.00043624296,0.6640506,0.00088278035,0.33235106],"study_design_scores_gemma":[0.000023104283,0.00010482001,0.0015388527,0.000112214686,0.0000054861,0.000039673294,0.0003810605,0.54521173,0.013573469,0.40702778,0.031676773,0.0003050182],"about_ca_topic_score_codex":0.000043755026,"about_ca_topic_score_gemma":0.000015662035,"teacher_disagreement_score":0.9486721,"about_ca_system_score_codex":0.000015019298,"about_ca_system_score_gemma":0.00003344336,"threshold_uncertainty_score":0.45415354},"labels":[],"label_agreement":null},{"id":"W4400526861","doi":"10.1109/gem61861.2024.10585400","title":"Enhancing Stealth Gameplay Through Procedural Generation: An Algorithmic Approach to Dynamic Guard Paths and Placement in Infiltration Games","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Guard (computer science); Computer science; Human–computer interaction; Programming language","score_opus":0.03597634779787502,"score_gpt":0.3190463094609227,"score_spread":0.2830699616630477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400526861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18493265,0.00021886932,0.8117392,0.000883538,0.00032378544,0.00053656957,0.0000014717838,0.00021160713,0.0011522814],"genre_scores_gemma":[0.8053413,0.000035457986,0.19335213,0.0006563449,0.00012403738,0.000117595904,0.00000971595,0.000012325392,0.00035106202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981771,0.0000807072,0.00042733012,0.0007008298,0.0002949062,0.00031913514],"domain_scores_gemma":[0.9994422,0.000049541868,0.00003851765,0.00032012252,0.000054972035,0.0000945969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004636789,0.00018081069,0.00016020809,0.00016689513,0.000093189105,0.00061873946,0.00031904745,0.00006672106,0.000014140963],"category_scores_gemma":[0.00003186632,0.00015986431,0.000023460454,0.0005276083,0.000033562894,0.0015726484,0.00012338806,0.00015562221,0.00003517753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030193143,0.00052451034,0.0005093573,0.00046218172,0.000052470095,0.000048941718,0.16100211,0.039960835,0.09293441,0.26926282,0.0025580553,0.4326541],"study_design_scores_gemma":[0.000043291548,0.00021045384,0.00017039421,0.000052989977,0.0000028540005,0.000029334862,0.001619836,0.9712249,0.024110831,0.0017799347,0.0005199138,0.00023523145],"about_ca_topic_score_codex":0.00019280589,"about_ca_topic_score_gemma":0.0012197568,"teacher_disagreement_score":0.9312641,"about_ca_system_score_codex":0.00017198783,"about_ca_system_score_gemma":0.00018434065,"threshold_uncertainty_score":0.6519078},"labels":[],"label_agreement":null},{"id":"W4401023622","doi":"10.24963/ijcai.2024/774","title":"Accelerating Adversarial Training on Under-Utilized GPU","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Simon Fraser University; University of Alberta","funders":"","keywords":"Proof-of-work system; Work (physics); Computer science; Estimation; Proof of concept; Economics; Computer security; Engineering; Blockchain; Management","score_opus":0.16089281463951924,"score_gpt":0.3474810731522547,"score_spread":0.18658825851273544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401023622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015406999,0.00006174904,0.8765098,0.0044525666,0.0024766922,0.00012011306,5.8688687e-7,0.0010470039,0.099924505],"genre_scores_gemma":[0.9653325,0.000004412707,0.03189977,0.0009543366,0.0003079723,0.000008019927,5.705067e-7,0.000010975775,0.0014814062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875563,0.00004399731,0.0002291559,0.0004223587,0.00026466703,0.00028421698],"domain_scores_gemma":[0.9991671,0.00040485282,0.000021442078,0.00031078976,0.00002704023,0.0000687886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030399798,0.00012377444,0.00011900602,0.00010939246,0.0001273179,0.00062815344,0.0005918751,0.000086436536,0.00028412184],"category_scores_gemma":[0.00007649065,0.00010281428,0.00007822579,0.00036008286,0.0000402617,0.0005252014,0.00013716985,0.00026815847,0.00075135665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033646313,0.0000105598265,0.000003313829,0.0000035635176,0.000011027906,0.000021253185,0.0025554486,0.0009229638,0.0012833277,0.76701766,0.0009812855,0.22718623],"study_design_scores_gemma":[0.00006416241,0.00010077005,0.000045888806,0.00007686445,0.0000045630513,0.000011367828,0.0011439731,0.9070816,0.025219614,0.053727243,0.012268994,0.00025493553],"about_ca_topic_score_codex":0.00003684251,"about_ca_topic_score_gemma":0.000025864409,"teacher_disagreement_score":0.94992554,"about_ca_system_score_codex":0.000051750718,"about_ca_system_score_gemma":0.000119045035,"threshold_uncertainty_score":0.965742},"labels":[],"label_agreement":null},{"id":"W4401023953","doi":"10.24963/ijcai.2024/211","title":"Outstanding Orthodontist: No More Artifactual Teeth in Talking Face","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Alliance de recherche numérique du Canada; University of Waterloo; Deutsche Forschungsgemeinschaft","keywords":"Monte Carlo method; Monte Carlo tree search; Computer science; Tree (set theory); Algorithm; Mathematics; Statistics; Combinatorics","score_opus":0.04196429251923144,"score_gpt":0.3280209087072379,"score_spread":0.28605661618800643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401023953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053694148,0.00023029484,0.92507416,0.0013345287,0.0012190237,0.00013329228,0.0000011425759,0.0005485041,0.017764911],"genre_scores_gemma":[0.9625449,0.000012753969,0.0334041,0.00021163347,0.00008923149,0.000009210078,7.0929127e-7,0.000013164287,0.003714288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998495,0.00004325569,0.0003147937,0.0004861918,0.00028841122,0.00037236002],"domain_scores_gemma":[0.99924666,0.0002659956,0.000026212858,0.0003537812,0.000035959834,0.000071388415],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045157727,0.00014670451,0.0001475942,0.00020783431,0.000062477084,0.00053023576,0.0006112062,0.00006671625,0.00014017436],"category_scores_gemma":[0.0001470735,0.00012452625,0.00006576153,0.0006085307,0.000060256592,0.00083022245,0.00027297268,0.0002351448,0.0011495984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009137709,0.00007123211,0.010826438,0.000081252474,0.00003510411,0.0008968894,0.025074406,0.003195796,0.0057682903,0.41780072,0.004058535,0.5321822],"study_design_scores_gemma":[0.000037894424,0.000055624612,0.0012040392,0.00021660076,0.0000040674904,0.00003461544,0.0013996989,0.93091154,0.034500007,0.008422588,0.022765333,0.0004479679],"about_ca_topic_score_codex":0.00014890973,"about_ca_topic_score_gemma":0.0001836042,"teacher_disagreement_score":0.9277158,"about_ca_system_score_codex":0.000108300745,"about_ca_system_score_gemma":0.0000681035,"threshold_uncertainty_score":0.9996281},"labels":[],"label_agreement":null},{"id":"W4401422732","doi":"10.1145/3643658.3643918","title":"Improving Bug Reproduction through Game Engine State Analysis","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Reproduction; Computer science; Game engine; State (computer science); Human–computer interaction; Ecology; Programming language; Biology","score_opus":0.02572299833677869,"score_gpt":0.293354829567664,"score_spread":0.2676318312308853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401422732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025891721,0.00053988077,0.9686337,0.0015148052,0.00088778074,0.000076368815,8.801292e-7,0.00088543765,0.0015694035],"genre_scores_gemma":[0.9334348,0.00004589103,0.06056574,0.000105444175,0.00016982293,0.000008717764,0.000001594835,0.000009127915,0.005658853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854374,0.000030156742,0.00026467713,0.0006981026,0.00022686864,0.00023646984],"domain_scores_gemma":[0.9990061,0.00007161458,0.00003535562,0.0007703441,0.00007630542,0.000040293315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037810998,0.000110825444,0.0001352624,0.00021237407,0.00005097085,0.00043420418,0.00042717604,0.000029948687,0.00012626701],"category_scores_gemma":[0.000082457285,0.00009246324,0.00012663612,0.002084401,0.000037917558,0.0011371302,0.00016789109,0.00012506606,0.00039071275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029199955,0.000037091282,0.00035962038,0.000028657822,0.00034619472,0.00005295972,0.00538812,0.026431898,0.007507702,0.046055924,0.0013648762,0.912424],"study_design_scores_gemma":[0.00000731599,0.000028617349,0.00014460484,0.000006749081,0.000053348627,0.000006774535,0.000056462643,0.8510383,0.122565314,0.016651433,0.009283173,0.00015790577],"about_ca_topic_score_codex":0.00067139906,"about_ca_topic_score_gemma":0.0000794113,"teacher_disagreement_score":0.91226614,"about_ca_system_score_codex":0.00005449198,"about_ca_system_score_gemma":0.00004268448,"threshold_uncertainty_score":0.50219524},"labels":[],"label_agreement":null},{"id":"W4401453807","doi":"10.1109/hsi61632.2024.10613541","title":"GameMentor: Customized Tutorial for Video Games","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Multimedia; Computer graphics (images); Human–computer interaction","score_opus":0.030795738392327104,"score_gpt":0.3185465055196391,"score_spread":0.28775076712731196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401453807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012305386,0.00035635603,0.9781406,0.0018901624,0.008010774,0.00036194865,0.0000030067258,0.0009227581,0.009083841],"genre_scores_gemma":[0.7258745,0.000032146454,0.24450332,0.0015652202,0.0038687156,0.00041956233,0.000003915265,0.000049665523,0.023682978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871486,0.000026795473,0.00027428765,0.00044492987,0.00023256613,0.00030653467],"domain_scores_gemma":[0.99895906,0.00046257113,0.000026614905,0.00039798114,0.000077013225,0.00007677403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042277024,0.00012854203,0.00014718177,0.00011244413,0.00006993043,0.00063911837,0.0007139983,0.00004689958,0.00020311854],"category_scores_gemma":[0.00015933882,0.00010334951,0.0001459583,0.0002601507,0.000045860572,0.00058811146,0.00015858884,0.00007762524,0.0006623557],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020761257,0.000023891427,0.000009609182,0.000025061552,0.000032424854,0.000008358284,0.0007458165,0.00003871698,0.002275839,0.73778933,0.114163235,0.14486694],"study_design_scores_gemma":[0.00010862606,0.00006581136,0.0000022990425,0.00002221696,0.00000864705,0.0000036574204,0.00005143653,0.21364997,0.043295104,0.05535709,0.6872636,0.00017155739],"about_ca_topic_score_codex":0.000040682695,"about_ca_topic_score_gemma":0.000015893265,"teacher_disagreement_score":0.7336373,"about_ca_system_score_codex":0.00006585954,"about_ca_system_score_gemma":0.00011802129,"threshold_uncertainty_score":0.8513463},"labels":[],"label_agreement":null},{"id":"W4401943397","doi":"10.1109/cog60054.2024.10645612","title":"Formula- and Memory-based Heuristics In Video-game Pathfinding","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Heuristics; Computer science; Video game; Theoretical computer science; Multimedia; Operating system","score_opus":0.026716846577377808,"score_gpt":0.2883175811597092,"score_spread":0.26160073458233135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401943397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08080631,0.0003262864,0.9126262,0.0012925377,0.00044044218,0.000109454864,9.962857e-7,0.00027405928,0.0041236943],"genre_scores_gemma":[0.9709458,0.000010993949,0.027904147,0.00036708819,0.000038213217,0.000007781779,4.1159822e-7,0.000007776665,0.00071781036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907255,0.000025182202,0.0002134019,0.00030391457,0.0001584963,0.00022643148],"domain_scores_gemma":[0.99937016,0.0002983681,0.000016757718,0.00022791057,0.00002195014,0.000064848435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309657,0.00009634498,0.00009869582,0.0001874773,0.00003309697,0.0003386336,0.00030940666,0.000050771785,0.000039290764],"category_scores_gemma":[0.00010110794,0.00008339481,0.000028530647,0.00037985682,0.000046408873,0.00033811192,0.00012813782,0.0001375641,0.00017171395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006470509,0.00006382838,0.0022980233,0.00013329566,0.000011128207,0.00048821425,0.005162928,0.002584894,0.0021954868,0.54423004,0.0024230399,0.44040263],"study_design_scores_gemma":[0.000029643723,0.000026943222,0.00021284838,0.00006474811,0.0000018680959,0.0000068374466,0.000058352514,0.9405622,0.019253088,0.03725967,0.0023889672,0.00013483647],"about_ca_topic_score_codex":0.00007686404,"about_ca_topic_score_gemma":0.00009104583,"teacher_disagreement_score":0.9379773,"about_ca_system_score_codex":0.00004284827,"about_ca_system_score_gemma":0.00006673818,"threshold_uncertainty_score":0.34007415},"labels":[],"label_agreement":null},{"id":"W4401943490","doi":"10.1109/cog60054.2024.10645611","title":"Recording and Describing Poker Hands","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Human–computer interaction; Computer graphics (images)","score_opus":0.07328073368430434,"score_gpt":0.2921461780954834,"score_spread":0.21886544441117906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401943490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04339059,0.00040010666,0.9357068,0.0019401736,0.0005804681,0.000037808757,8.970169e-8,0.00042844968,0.017515492],"genre_scores_gemma":[0.96441865,0.000028158076,0.03321884,0.00017756895,0.00006272887,0.0000025257045,7.3699965e-8,0.0000046019654,0.0020868627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944603,0.000011218528,0.000096382326,0.00022967109,0.00007994662,0.00013672576],"domain_scores_gemma":[0.99968636,0.000099786645,0.000006430415,0.00014873191,0.000016206292,0.000042475738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017532115,0.00005490671,0.000049216396,0.000068781395,0.0000621895,0.000531537,0.00019467204,0.000023173636,0.00005266497],"category_scores_gemma":[0.000029036428,0.00004436209,0.000019849416,0.00020150129,0.000026851465,0.00053420133,0.00015729919,0.00006496494,0.00015513657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.1642306e-7,0.0000026613434,0.00055357086,0.000006357366,0.0000051144348,0.000021753714,0.0008020883,0.000008093615,0.0012364925,0.30979252,0.0031536676,0.68441725],"study_design_scores_gemma":[0.000022712124,0.00006579047,0.00012792909,0.00014053765,0.0000046060327,0.00006249583,0.00018056473,0.863238,0.057339314,0.058905557,0.019669034,0.00024345727],"about_ca_topic_score_codex":0.000060431325,"about_ca_topic_score_gemma":0.000014834011,"teacher_disagreement_score":0.9210281,"about_ca_system_score_codex":0.000014484963,"about_ca_system_score_gemma":0.000017456534,"threshold_uncertainty_score":0.51256233},"labels":[],"label_agreement":null},{"id":"W4401943577","doi":"10.1109/cog60054.2024.10645602","title":"Learning With Generalised Card Representations for “Magic: The Gathering”","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; MAGIC (telescope); Computer security; World Wide Web; Astronomy; Physics","score_opus":0.04153544702102337,"score_gpt":0.3194301552601062,"score_spread":0.27789470823908285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401943577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009022074,0.00011489583,0.97373986,0.0056530414,0.00025866638,0.0002086167,5.2060176e-7,0.00035868402,0.010643651],"genre_scores_gemma":[0.9055949,0.0000118667385,0.074605234,0.00032185885,0.00018376563,0.000092211536,0.0000011152431,0.000015208761,0.019173872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993304,0.000030365483,0.00010543062,0.000249191,0.00013123895,0.00015337762],"domain_scores_gemma":[0.9993172,0.0002845594,0.000016497714,0.0002925351,0.0000614544,0.00002773642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018997255,0.00006684188,0.000053679432,0.00003425147,0.00015835893,0.00044354142,0.0004176448,0.000016540194,0.00002512525],"category_scores_gemma":[0.000044337747,0.00003678733,0.000048120088,0.00026219332,0.000053958396,0.00025639977,0.000071384304,0.000090637506,0.00006575089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000736822,0.000015379535,0.0005149174,0.000020475005,0.00006954309,0.000017931929,0.012121014,0.052560743,0.003308552,0.7531255,0.008998069,0.16924049],"study_design_scores_gemma":[0.00002525002,0.000095840594,0.000082946506,0.00001757278,0.000009560199,0.000014681701,0.0012333051,0.8980119,0.017694646,0.0108903805,0.07179917,0.00012469981],"about_ca_topic_score_codex":0.00011481055,"about_ca_topic_score_gemma":0.000044179025,"teacher_disagreement_score":0.89913464,"about_ca_system_score_codex":0.000015381074,"about_ca_system_score_gemma":0.000046344827,"threshold_uncertainty_score":0.427708},"labels":[],"label_agreement":null},{"id":"W4401943767","doi":"10.1109/cog60054.2024.10645542","title":"Heuristic Knowledge Transfer for General Game Playing","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristic; Knowledge transfer; Game theory; Human–computer interaction; Artificial intelligence; Knowledge management; Mathematical economics; Mathematics","score_opus":0.053929475236702044,"score_gpt":0.332741271912575,"score_spread":0.27881179667587297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401943767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01210454,0.00073288596,0.97517306,0.000768067,0.0013879122,0.00018107468,0.000002645535,0.0005125827,0.009137208],"genre_scores_gemma":[0.94374734,0.000012296679,0.047176637,0.00018634595,0.00032877072,0.00005488961,0.0000011446971,0.000015616628,0.008476932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990532,0.000018642899,0.00019795324,0.00036113002,0.00009840679,0.0002706621],"domain_scores_gemma":[0.9993501,0.00028321912,0.0000044469452,0.00024451583,0.000051172297,0.00006660329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018090468,0.00010843324,0.00010200679,0.00009218616,0.000068675996,0.0003177495,0.00051168026,0.000046034034,0.00007470864],"category_scores_gemma":[0.00003248666,0.00008983871,0.00010106139,0.0002449594,0.000037299942,0.00030401172,0.00005773909,0.000081533304,0.0004994093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021675953,0.000021202015,0.000012402121,0.00004329286,0.00001314489,0.000009424654,0.0019671984,0.000108399814,0.0028172433,0.8561741,0.003548348,0.13528305],"study_design_scores_gemma":[0.000024207166,0.00005373878,0.00002334351,0.000027154387,0.000006212018,0.00000945162,0.000025004372,0.8826953,0.023234839,0.04069937,0.053041395,0.0001599518],"about_ca_topic_score_codex":0.000014515564,"about_ca_topic_score_gemma":0.00003200028,"teacher_disagreement_score":0.93164283,"about_ca_system_score_codex":0.00003290282,"about_ca_system_score_gemma":0.000077536766,"threshold_uncertainty_score":0.6419062},"labels":[],"label_agreement":null},{"id":"W4402007577","doi":"10.1007/978-3-031-70893-0_2","title":"Efficiently Training Neural Networks for Imperfect Information Games by Sampling Information Sets","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Perfect information; Artificial neural network; Training (meteorology); Imperfect; Artificial intelligence; Sampling (signal processing); Machine learning; Computer vision; Mathematics; Mathematical economics","score_opus":0.02881157661154738,"score_gpt":0.2810092525429389,"score_spread":0.25219767593139153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402007577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018242263,0.00042998776,0.9922567,0.00061641843,0.0043625673,0.0008449947,0.000039537623,0.00036096637,0.0009064114],"genre_scores_gemma":[0.6294963,0.0000678611,0.36406422,0.004912417,0.000913885,0.000110776484,0.00020073896,0.00007085114,0.00016296694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964742,0.000018911913,0.0010052584,0.0007763144,0.00085856207,0.0008667197],"domain_scores_gemma":[0.9973661,0.00088086183,0.00042666652,0.00078885304,0.00037297254,0.00016458456],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012467767,0.00056369684,0.00047288722,0.0009883838,0.0003665332,0.0024524166,0.0024084966,0.00038927214,0.000008764109],"category_scores_gemma":[0.00023623403,0.0005223014,0.00020366187,0.0007337032,0.0004269344,0.004155609,0.0007952728,0.0008484066,0.000065243796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046763466,0.000003185619,0.0000024615676,0.00004441462,0.000006024374,0.0000012587399,0.0029088731,0.35343933,0.000008773327,0.0067568887,0.00009221995,0.63673186],"study_design_scores_gemma":[0.000080758626,0.00017205866,0.0000043085565,0.00026659408,0.000009089189,0.000030310528,0.000003439773,0.9486049,0.00038522814,0.040017903,0.009886372,0.0005390659],"about_ca_topic_score_codex":0.000021766227,"about_ca_topic_score_gemma":0.000018564706,"teacher_disagreement_score":0.6361928,"about_ca_system_score_codex":0.0003393166,"about_ca_system_score_gemma":0.0003082488,"threshold_uncertainty_score":0.99972284},"labels":[],"label_agreement":null},{"id":"W4403236745","doi":"10.1007/s10844-024-00896-3","title":"Persuasive explanations for path reasoning recommendations","year":2024,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Path (computing); Artificial intelligence; Data science; Information retrieval; Programming language","score_opus":0.04292240770245533,"score_gpt":0.3238636200771864,"score_spread":0.2809412123747311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403236745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034566433,0.0007472105,0.9896106,0.0018069324,0.0053854445,0.0003016239,0.00002017187,0.00008289527,0.001699445],"genre_scores_gemma":[0.92216116,0.0005914854,0.075403646,0.00035905853,0.00081411237,0.00009241214,0.000033281234,0.00001829183,0.0005265446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980748,0.00005313488,0.0012225533,0.00009045214,0.00038136862,0.00017767023],"domain_scores_gemma":[0.99762803,0.00048470436,0.00053227873,0.00019501081,0.0010626221,0.00009735717],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011760985,0.00011665361,0.00018456293,0.0005975093,0.00015192111,0.0010685286,0.0005642868,0.00006408118,0.000019179748],"category_scores_gemma":[0.00043871655,0.00009554195,0.00018241399,0.0004391504,0.000020177595,0.004568626,0.000045572437,0.00018142155,0.00017832416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000132583,0.000029562809,0.000024308518,0.00015014109,0.00012757954,0.000006234225,0.021301214,0.009954578,0.00004736047,0.73976594,0.056445755,0.17213406],"study_design_scores_gemma":[0.000047407473,0.00016208689,0.000003806192,0.0005479094,0.000016009339,0.00027401894,0.009317123,0.33065113,0.0014013378,0.001312652,0.65613246,0.00013406728],"about_ca_topic_score_codex":0.000012810275,"about_ca_topic_score_gemma":0.0000012132309,"teacher_disagreement_score":0.9218155,"about_ca_system_score_codex":0.00021996806,"about_ca_system_score_gemma":0.00022923674,"threshold_uncertainty_score":0.99996847},"labels":[],"label_agreement":null},{"id":"W4403297183","doi":"10.1080/00150517.2007.12428215","title":"Counting the number of winning binary strings in the 1-dimensional same game","year":2007,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Binary number; Mathematics; Combinatorics; Arithmetic","score_opus":0.021009862593015464,"score_gpt":0.29051107896278716,"score_spread":0.2695012163697717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403297183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9545162,0.00012428919,0.04062057,0.0021424638,0.00039953756,0.00028352684,0.0000011453609,0.00006203827,0.0018502478],"genre_scores_gemma":[0.9968227,0.0000010084501,0.0015777171,0.0012897454,0.00016493969,0.00001226372,8.9132624e-7,0.000013454753,0.000117270356],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9975585,0.00020815358,0.0006299992,0.00034272962,0.0007364511,0.00052419753],"domain_scores_gemma":[0.99699473,0.0016759417,0.00026819174,0.00089199934,0.00012897483,0.000040183382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031894234,0.0001955579,0.00019900785,0.00008246546,0.00025390764,0.00022007228,0.0021799374,0.00007687821,0.00003366783],"category_scores_gemma":[0.000030001322,0.00010608028,0.00011709683,0.00079870806,0.00026437032,0.00048230658,0.00013709831,0.00044688125,0.00015371312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018762617,0.00055402424,0.04927061,0.000055603505,0.00012525139,0.00029839916,0.2951383,0.004070107,0.016082004,0.25709012,0.0042608967,0.37286705],"study_design_scores_gemma":[0.0009943248,0.0015231821,0.31290886,0.00055671635,0.00008875843,0.001011481,0.104256496,0.30331886,0.0057189427,0.23478463,0.032849193,0.0019885558],"about_ca_topic_score_codex":0.0008561324,"about_ca_topic_score_gemma":0.00037470603,"teacher_disagreement_score":0.3708785,"about_ca_system_score_codex":0.000058631103,"about_ca_system_score_gemma":0.00010913205,"threshold_uncertainty_score":0.43258283},"labels":[],"label_agreement":null},{"id":"W4403305248","doi":"10.1017/9781009302180.007","title":"Narrowing the Search Space: Binary Search","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Space (punctuation); Binary number; Computer science; Binary search algorithm; Mathematics; Algorithm; Search algorithm; Arithmetic","score_opus":0.05410468111659684,"score_gpt":0.2560068448036287,"score_spread":0.20190216368703184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305248","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018196473,0.0005714072,0.009643529,0.0006716592,0.0009176599,0.00047606064,0.000043107244,0.0004217725,0.9870728],"genre_scores_gemma":[0.0062371865,0.00009005163,0.0003992578,0.00009279071,0.0002551298,8.889441e-7,0.000005425807,0.000053082073,0.99286616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99744177,0.00009442737,0.00022342542,0.000919966,0.0007696312,0.000550766],"domain_scores_gemma":[0.9977179,0.0002812593,0.00007358665,0.0014817966,0.00024538627,0.00020003616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004592957,0.0004085575,0.00032191427,0.00033282858,0.000522891,0.00041437362,0.0032882076,0.00033742213,0.000008833364],"category_scores_gemma":[0.000010279988,0.00036849573,0.0003185886,0.000048896443,0.0006399876,0.00026040187,0.0032609913,0.0014170359,0.00043107217],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014257709,0.0000051459997,6.379382e-7,0.00006560139,0.000100635676,0.0011140443,0.00070541946,0.000103009595,0.00011250393,0.9741407,0.019898687,0.0037393547],"study_design_scores_gemma":[0.000055195116,0.00007998278,0.0000033252863,0.00032226596,0.00007235,0.00004703017,0.00028664758,0.015330368,0.0032128661,0.00036229615,0.9796952,0.00053245627],"about_ca_topic_score_codex":0.00029501767,"about_ca_topic_score_gemma":0.0000034070172,"teacher_disagreement_score":0.9737784,"about_ca_system_score_codex":0.0003124669,"about_ca_system_score_gemma":0.00031540592,"threshold_uncertainty_score":0.9998767},"labels":[],"label_agreement":null},{"id":"W4403305821","doi":"10.1017/9781009302180.028","title":"Recursive Backtracking","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Backtracking; Computer science; Programming language","score_opus":0.03866918598328792,"score_gpt":0.23339896673039792,"score_spread":0.19472978074711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305821","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008100333,0.00039771426,0.033902492,0.000083759594,0.0012452343,0.0002791013,0.00005523509,0.00050977845,0.96351856],"genre_scores_gemma":[0.00040552625,0.00010334737,0.0014816392,0.0000866382,0.00022138523,5.2031425e-7,0.0000074502204,0.000046220248,0.9976473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812,0.000023689989,0.0002347607,0.0008899252,0.0003703772,0.000361247],"domain_scores_gemma":[0.998303,0.00012762514,0.00017932337,0.0009986588,0.00021290564,0.00017846125],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011985212,0.0004011237,0.00034665962,0.0002804712,0.00017372739,0.0002545353,0.0019415644,0.0003821917,0.000006676479],"category_scores_gemma":[0.00001230615,0.00047627575,0.00029026685,0.000019994397,0.00026254772,0.00026804203,0.0013112865,0.0007333684,0.0004735238],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073514766,0.0000033780884,1.5412985e-7,0.00004373368,0.000084099265,0.0009178258,0.00016620087,0.000006317612,0.000017612683,0.9598508,0.030588198,0.008314322],"study_design_scores_gemma":[0.00003948447,0.000041646894,5.3431535e-7,0.00035730348,0.00008497779,0.00003096426,0.000032366966,0.000971933,0.001570901,0.002309122,0.99404615,0.00051463983],"about_ca_topic_score_codex":0.000067540925,"about_ca_topic_score_gemma":0.0000029187856,"teacher_disagreement_score":0.96345794,"about_ca_system_score_codex":0.00028399494,"about_ca_system_score_gemma":0.00014482887,"threshold_uncertainty_score":0.9997689},"labels":[],"label_agreement":null},{"id":"W4403418439","doi":"10.1016/j.jcta.2024.105964","title":"Indecomposable combinatorial games","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Memorial University of Newfoundland; University of New Brunswick","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Indecomposable module; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.01376293463604206,"score_gpt":0.27344592975974574,"score_spread":0.2596829951237037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403418439","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19095892,0.013049259,0.3240998,0.0083330525,0.425131,0.0008036588,0.000012715162,0.001218865,0.036392715],"genre_scores_gemma":[0.9933227,0.00014520851,0.0031664683,0.00009629751,0.002670382,0.000004535189,4.594326e-7,0.00003083284,0.00056317553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973175,0.00036156364,0.0008963513,0.00028785734,0.00073891593,0.00039782957],"domain_scores_gemma":[0.99771386,0.0008352774,0.00032107142,0.00047799686,0.0004461945,0.00020558444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023798388,0.0002572736,0.00047266198,0.0003340331,0.0001607922,0.0009346543,0.0017256364,0.00016127186,0.00016244147],"category_scores_gemma":[0.0005116262,0.00021223481,0.00031839486,0.0007276798,0.00022629334,0.0027468004,0.00030960946,0.00062447536,0.000100329584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020692725,0.000105566556,0.0000322334,0.000025156929,0.00010784622,0.00024241733,0.0012764771,0.000041351766,0.0007384025,0.9792469,0.0045396946,0.013436997],"study_design_scores_gemma":[0.00023661398,0.00075458694,0.000011985123,0.00013154358,0.000023600316,0.0002979633,0.00021842867,0.00040562416,0.020061191,0.84712625,0.13052455,0.0002076928],"about_ca_topic_score_codex":0.000004619429,"about_ca_topic_score_gemma":4.871732e-7,"teacher_disagreement_score":0.8023637,"about_ca_system_score_codex":0.00014531784,"about_ca_system_score_gemma":0.00047921698,"threshold_uncertainty_score":0.9012893},"labels":[],"label_agreement":null},{"id":"W4403816328","doi":"10.48550/arxiv.2409.20553","title":"Maia-2: A Unified Model for Human-AI Alignment in Chess","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research; John D. and Catherine T. MacArthur Foundation","keywords":"Computer science; Artificial intelligence; Cognitive science; Psychology","score_opus":0.16812047256939258,"score_gpt":0.25857485327273877,"score_spread":0.09045438070334619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403816328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14032932,0.000057383808,0.85541594,0.00047284475,0.0005898469,0.00066569686,0.000023489878,0.00026818848,0.0021772897],"genre_scores_gemma":[0.98995864,0.000029156994,0.0028199353,0.00018698328,0.00006671226,0.000011319592,0.000009989896,0.00002975383,0.0068874843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754953,0.000067107896,0.0003423048,0.0014270185,0.000117980766,0.0004960677],"domain_scores_gemma":[0.9982663,0.00010226698,0.00014573107,0.0012268301,0.00012725069,0.00013166021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003961082,0.0003579893,0.00037613852,0.00044832117,0.00010942707,0.00023940587,0.0023186475,0.000340049,0.0000126185005],"category_scores_gemma":[0.000021788586,0.00042499974,0.0002582303,0.00052843784,0.000120480116,0.0002514014,0.0032166669,0.00066511915,0.00010419556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011021208,0.00006215898,0.000086262335,0.00008943817,0.000030084262,0.00010162538,0.00078371796,0.47583634,0.00008500629,0.52221113,0.00035843445,0.00034475786],"study_design_scores_gemma":[0.00006600306,0.000019039293,0.000011094245,0.00009909839,0.00002141074,5.367679e-7,0.00006207378,0.54964226,0.0008079758,0.44892165,0.00010064397,0.00024822453],"about_ca_topic_score_codex":0.0002556476,"about_ca_topic_score_gemma":0.0005758946,"teacher_disagreement_score":0.852596,"about_ca_system_score_codex":0.0005216472,"about_ca_system_score_gemma":0.00030460503,"threshold_uncertainty_score":0.9998202},"labels":[],"label_agreement":null},{"id":"W4404612850","doi":"10.1007/s43069-024-00375-z","title":"A Behavioral Test and Classification of Solution Concepts in Games","year":2024,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Test (biology); Psychology; Computer science; Artificial intelligence","score_opus":0.16465823937813545,"score_gpt":0.47259736149743303,"score_spread":0.3079391221192976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404612850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69365907,0.0017692924,0.28042495,0.020185778,0.0003036642,0.00086634076,0.000022002068,0.00014325243,0.0026256393],"genre_scores_gemma":[0.9942029,0.000074877884,0.004997416,0.000009362294,0.000016983433,0.00007582094,0.0000038279154,0.0000045814145,0.0006142213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988933,0.000110014,0.00021211062,0.00025419804,0.00029306355,0.00023731487],"domain_scores_gemma":[0.9992705,0.00023913849,0.0000070514097,0.00024656442,0.00019220533,0.0000445222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075116934,0.00005135673,0.0000681862,0.00033727672,0.00013365872,0.00032007162,0.00027560504,0.000047355777,0.000021011541],"category_scores_gemma":[0.00026427818,0.000047589307,0.000017316763,0.00078876986,0.00025376034,0.0007528185,0.00016455824,0.00019656721,0.000061621504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037376453,0.0002476592,0.007498269,0.000031207965,0.000004458995,0.000012717783,0.005276779,0.00043222567,0.16115023,0.505264,0.0025919178,0.31748682],"study_design_scores_gemma":[0.000034583605,0.00019878328,0.00492836,0.00007951116,0.0000010801767,0.0000054271063,0.0009813184,0.967845,0.01941188,0.003533139,0.0029054217,0.00007549926],"about_ca_topic_score_codex":0.0004461789,"about_ca_topic_score_gemma":0.0023008194,"teacher_disagreement_score":0.96741277,"about_ca_system_score_codex":0.00007249587,"about_ca_system_score_gemma":0.00019503754,"threshold_uncertainty_score":0.30864578},"labels":[],"label_agreement":null},{"id":"W4405033613","doi":"10.48550/arxiv.2412.00849","title":"Snort Played on Triangular Grids","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.1083723196688881,"score_gpt":0.2181239406656025,"score_spread":0.1097516209967144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405033613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39292377,0.00023594331,0.56992275,0.0006848314,0.005967289,0.0006586484,0.000035958892,0.0013739561,0.028196882],"genre_scores_gemma":[0.992849,0.000113802525,0.00081091496,0.00020997314,0.0002570552,0.0000016710221,0.000008093058,0.000030007779,0.0057194885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741805,0.00013507396,0.00027770974,0.0015636702,0.00017064423,0.00043485005],"domain_scores_gemma":[0.997563,0.00017608087,0.00015686451,0.001790113,0.000119513454,0.00019444132],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003359873,0.00039972106,0.00036919073,0.00044479902,0.00013072192,0.00028555043,0.002776992,0.00038362903,0.000084880965],"category_scores_gemma":[0.00006854014,0.00043584875,0.0003614548,0.0007772915,0.00014207518,0.00019032488,0.0033591809,0.0010947598,0.0024648171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004772571,0.000109865745,0.00023108238,0.00007424032,0.00015281892,0.0020067608,0.0005470515,0.15193962,0.000049570226,0.83539414,0.004630659,0.004816472],"study_design_scores_gemma":[0.0001132603,0.00013115536,0.000083119354,0.00021417273,0.00007953515,0.0000061709466,0.00008789092,0.53696877,0.0026289881,0.45421767,0.0047946153,0.0006746381],"about_ca_topic_score_codex":0.00016828482,"about_ca_topic_score_gemma":0.00005623438,"teacher_disagreement_score":0.5999252,"about_ca_system_score_codex":0.00030476626,"about_ca_system_score_gemma":0.00028895927,"threshold_uncertainty_score":0.9998093},"labels":[],"label_agreement":null},{"id":"W4405232618","doi":"10.1109/tg.2024.3515807","title":"Goal-Oriented Interactions in Games Using LLMs","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.04022186863348676,"score_gpt":0.32677464727638916,"score_spread":0.2865527786429024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405232618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06600324,0.00021812596,0.9271771,0.00088249135,0.004081147,0.00019665036,0.000010328309,0.00055438274,0.00087653927],"genre_scores_gemma":[0.9860502,0.000050785846,0.012178362,0.00017113911,0.000079007325,0.000053270785,5.912854e-7,0.000027116748,0.0013895327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981587,0.00009318777,0.00043770214,0.0006106804,0.0003011559,0.0003985635],"domain_scores_gemma":[0.9989086,0.0003384475,0.000043212975,0.00053997466,0.00006611417,0.00010365553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020156443,0.00023325812,0.00020450805,0.0007427693,0.00014896177,0.00032680566,0.0004836042,0.00007056808,0.00019263563],"category_scores_gemma":[0.000013878476,0.0002281975,0.00017557821,0.0013980339,0.00011348858,0.001162901,0.0000059521267,0.0005284652,0.00043575326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005316564,0.0008282646,0.00015020736,0.0000955378,0.0001442116,0.00029370442,0.012490133,0.16078739,0.030608779,0.01827268,0.0010149828,0.7752609],"study_design_scores_gemma":[0.000087658715,0.000088741064,0.00009579528,0.0003250803,0.000024764586,0.0000827244,0.0006229093,0.83202887,0.14970782,0.0025619613,0.013977366,0.00039630794],"about_ca_topic_score_codex":0.00034766702,"about_ca_topic_score_gemma":0.0005173693,"teacher_disagreement_score":0.9200469,"about_ca_system_score_codex":0.00024634314,"about_ca_system_score_gemma":0.00013338946,"threshold_uncertainty_score":0.93056244},"labels":[],"label_agreement":null},{"id":"W4405452958","doi":"10.1145/3705013","title":"A Comprehensive Model of Automated Evaluation of Difficulty in Platformer Games","year":2024,"lang":"en","type":"article","venue":"Games Research and Practice","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science","score_opus":0.3253714657586089,"score_gpt":0.4986562545373149,"score_spread":0.17328478877870596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405452958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9555623,0.0072357613,0.025617884,0.0026561986,0.00014856746,0.00072055525,0.000014482022,0.00015975736,0.007884505],"genre_scores_gemma":[0.99028903,0.0005773026,0.008958076,0.00002327574,0.000013499273,0.00002898823,0.0000020046032,0.000006262393,0.00010153709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732727,0.00053321203,0.0003457363,0.00032147366,0.0011969875,0.0002753424],"domain_scores_gemma":[0.9945932,0.003648191,0.00007874928,0.00031061878,0.0013045394,0.00006467916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036529652,0.00008742451,0.00016622954,0.00038676057,0.00004158735,0.00013376547,0.00035237713,0.00006869101,0.000017152026],"category_scores_gemma":[0.0029075404,0.0000733062,0.00002925369,0.00092779985,0.00026367497,0.0013159846,0.00024297135,0.0003139685,0.000019551111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046511216,0.0006793342,0.00023751419,0.0006899044,0.000184925,0.000047274785,0.035624348,0.04749235,0.12324571,0.08938024,0.0046269502,0.69732636],"study_design_scores_gemma":[0.00009044842,0.00015450055,0.000514,0.00012210415,0.000009220952,0.000014328213,0.0015766559,0.97064,0.012299968,0.0134026315,0.0011074032,0.00006876289],"about_ca_topic_score_codex":0.00027645516,"about_ca_topic_score_gemma":0.00003528233,"teacher_disagreement_score":0.9231476,"about_ca_system_score_codex":0.00006067572,"about_ca_system_score_gemma":0.000406037,"threshold_uncertainty_score":0.34808075},"labels":[],"label_agreement":null},{"id":"W4405465361","doi":"10.37236/11997","title":"A Complete Solution for a Nontrivial Ruleset with Entailing Moves","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Axiom; Scope (computer science); Game theory; Affine transformation; Computer science; Mathematics; Combinatorial game theory; Algebra over a field; Calculus (dental); Mathematical economics; Pure mathematics; Sequential game; Programming language","score_opus":0.018145128700296692,"score_gpt":0.27140689401288653,"score_spread":0.2532617653125898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405465361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02207557,0.0041046576,0.9694938,0.003154089,0.00084978004,0.00018156617,0.0000016397356,0.000048258964,0.00009062349],"genre_scores_gemma":[0.9985191,0.00016215497,0.0009317439,0.00005960821,0.00020562632,0.000006947084,5.205592e-7,0.000013917274,0.00010034734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851847,0.00007431656,0.0003496875,0.00014783262,0.00040075422,0.0005089541],"domain_scores_gemma":[0.9987495,0.00051941106,0.0001862253,0.0002353769,0.0002563913,0.000053102976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012543359,0.00012652225,0.00018989781,0.00012585745,0.00017999753,0.00025694,0.0010020743,0.000039530678,0.0000021485628],"category_scores_gemma":[0.000077813434,0.000077454,0.00013072306,0.00045934418,0.00007031076,0.00045356035,0.000072478615,0.00047651315,0.000008858571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055733206,0.000042807365,0.0000147736755,0.000014463002,0.00009070627,0.0000109881985,0.0007583341,0.0002778352,0.0012620273,0.98934793,0.0004148858,0.007709514],"study_design_scores_gemma":[0.0002055282,0.0011744479,0.000010842569,0.0000812494,0.000046480367,0.00029741038,0.000074289856,0.14833531,0.0037202528,0.8316407,0.014288472,0.00012498104],"about_ca_topic_score_codex":0.0000076041856,"about_ca_topic_score_gemma":0.000011747449,"teacher_disagreement_score":0.9764436,"about_ca_system_score_codex":0.00032916642,"about_ca_system_score_gemma":0.0006352692,"threshold_uncertainty_score":0.31584826},"labels":[],"label_agreement":null},{"id":"W4406828593","doi":"10.1007/978-3-031-77941-1_17","title":"Biologically-Inspired Algorithms for Adaptive Non-Player Character Behavior in Video Games","year":2025,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Character (mathematics); Video game; Artificial intelligence; Algorithm; Multimedia; Mathematics","score_opus":0.08307458231393706,"score_gpt":0.33970571898676777,"score_spread":0.2566311366728307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406828593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001743456,0.00020207702,0.94754755,0.0012667574,0.00059728645,0.0014664592,0.000045167446,0.00009968228,0.04860064],"genre_scores_gemma":[0.10497382,0.0029881122,0.88311875,0.0041943425,0.00011306111,0.0010274361,0.00013567232,0.000019709574,0.0034290662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784523,0.000033438617,0.0010110926,0.00045443588,0.0003143771,0.00034144885],"domain_scores_gemma":[0.99660236,0.00057538814,0.00037139896,0.0018078625,0.0005576367,0.000085379776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011547144,0.00028294307,0.00037200373,0.0013632689,0.00033924857,0.0005210543,0.004172246,0.00022793138,0.000006882454],"category_scores_gemma":[0.00010537058,0.0002677624,0.00008158898,0.0005558824,0.0008940516,0.0049247216,0.0023752016,0.0004540745,0.00003923128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073587935,0.000039649745,0.00014934782,0.000015218988,0.000004457967,6.735887e-7,0.0013813825,0.00008584179,0.000011456491,0.36293548,0.0002512919,0.6351178],"study_design_scores_gemma":[0.0002604391,0.00018170262,0.0058453823,0.00038748066,0.000008906252,0.000008388942,0.000048727543,0.88419974,0.00016278225,0.014623917,0.09372404,0.0005484966],"about_ca_topic_score_codex":0.00003381474,"about_ca_topic_score_gemma":0.000034256336,"teacher_disagreement_score":0.8841139,"about_ca_system_score_codex":0.00020918598,"about_ca_system_score_gemma":0.00038087755,"threshold_uncertainty_score":0.99997747},"labels":[],"label_agreement":null},{"id":"W4407278403","doi":"10.1007/s40687-024-00492-5","title":"Complexity of chess domination problems","year":2025,"lang":"en","type":"article","venue":"Research in the Mathematical Sciences","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Max-Planck-Institut für Mathematik in den Naturwissenschaften; Bundesministerium für Bildung und Forschung; École Polytechnique Fédérale de Lausanne; European Commission; HORIZON EUROPE Marie Sklodowska-Curie Actions; Fonds Wetenschappelijk Onderzoek; National Centres of Competence in Research SwissMAP","keywords":"Mathematics; Combinatorics; Mathematical economics; Algebra over a field; Pure mathematics","score_opus":0.432955730121101,"score_gpt":0.49774793756249713,"score_spread":0.06479220744139613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407278403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12760185,0.00017704321,0.5983412,0.04130311,0.0001360797,0.0011414443,6.9490807e-7,0.00005324769,0.23124532],"genre_scores_gemma":[0.9864391,0.0000063059356,0.013348249,0.000045686134,0.000008868963,0.000041516458,5.919982e-8,9.596598e-7,0.00010925826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974944,0.0005217958,0.00031278015,0.00024103154,0.0010784438,0.00035157558],"domain_scores_gemma":[0.9969387,0.0024589582,0.000043706958,0.00039004834,0.00014110836,0.000027478332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01234776,0.00005668816,0.00012945366,0.00028226734,0.00024187494,0.00021091355,0.0029721034,0.00003277447,0.000022002576],"category_scores_gemma":[0.0010131926,0.000032201013,0.00003222135,0.00297611,0.0026055034,0.0002778521,0.0004294678,0.0002031239,0.00004513198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.320862e-7,0.00011834655,0.000116924995,0.000062307365,0.0000011776862,6.1948197e-7,0.0018143395,0.000086680455,0.00035560803,0.98774236,0.00010385287,0.009596859],"study_design_scores_gemma":[0.000019101695,0.000044834407,0.0004410305,0.000120397985,3.8340565e-7,9.3587903e-7,0.000704172,0.12636751,0.008194872,0.863993,0.00008351661,0.000030234194],"about_ca_topic_score_codex":0.000062548796,"about_ca_topic_score_gemma":0.00003752188,"teacher_disagreement_score":0.85883725,"about_ca_system_score_codex":0.000038551003,"about_ca_system_score_gemma":0.0001297854,"threshold_uncertainty_score":0.9600086},"labels":[],"label_agreement":null},{"id":"W4407771356","doi":"10.1145/3641554.3701819","title":"Comparing the Impact of Strict and Flexible Deadline Policies","year":2025,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.059379256356729686,"score_gpt":0.36517776271615465,"score_spread":0.30579850635942496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407771356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6073974,0.00020306485,0.3724754,0.00079224806,0.00005445775,0.000069764435,3.383766e-7,0.00006133716,0.018946014],"genre_scores_gemma":[0.9964536,0.000016939612,0.0027832699,0.000092552866,0.000010923014,0.000001597819,8.902125e-8,0.0000013475964,0.00063968514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950206,0.000030290941,0.00015650378,0.00010884893,0.000075393975,0.00012688688],"domain_scores_gemma":[0.9993389,0.00026058345,0.00003665894,0.0002900204,0.000052601754,0.000021238322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020421701,0.00006076922,0.00010941771,0.00008189914,0.00007287666,0.00008252459,0.0004987931,0.00001759749,0.000009817867],"category_scores_gemma":[0.00006699397,0.000034065,0.00004104595,0.00042844625,0.00009635374,0.00013581036,0.00029263867,0.00005380001,0.0000047923304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010726672,0.000052730047,0.2869664,0.000010012892,0.000053696764,6.128538e-7,0.0015376504,0.0062380843,0.001902433,0.66055113,0.003381533,0.039295007],"study_design_scores_gemma":[0.00007451937,0.000105373314,0.27272725,0.000032741264,0.0000076107794,0.0000061910796,0.0003953082,0.5981332,0.082919545,0.045049597,0.00042012974,0.00012854657],"about_ca_topic_score_codex":0.0028561926,"about_ca_topic_score_gemma":0.00006652229,"teacher_disagreement_score":0.6155015,"about_ca_system_score_codex":0.000017512806,"about_ca_system_score_gemma":0.000053639884,"threshold_uncertainty_score":0.4317728},"labels":[],"label_agreement":null},{"id":"W4408736685","doi":"10.61091/ars162-09","title":"Conflict-free coloring games","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Mathematical economics","score_opus":0.024554731006287345,"score_gpt":0.2856816891758718,"score_spread":0.2611269581695844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6815328,0.0021607585,0.07548838,0.011404636,0.025765128,0.00084455893,0.000003811485,0.0019106854,0.20088926],"genre_scores_gemma":[0.9930934,0.000039570317,0.0035096216,0.0006614236,0.000009335842,0.000034523313,5.057865e-7,0.000008355281,0.00264327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986799,0.000056654488,0.00028549624,0.00039624964,0.00023807214,0.00034366414],"domain_scores_gemma":[0.9981745,0.00029007238,0.00006837387,0.0012515293,0.00014033244,0.00007519666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028662776,0.00014967028,0.00019079543,0.0001483189,0.00016865258,0.00021573843,0.0022832756,0.000084232925,0.000022387241],"category_scores_gemma":[0.00038101146,0.00015514824,0.0000704004,0.00066846045,0.000102362275,0.00039639542,0.0008947786,0.00018042828,0.00019097532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031918958,0.00004361123,0.0014960042,0.0000069365246,0.000017391838,0.000010105834,0.00036836392,0.000017299371,0.0003657229,0.9733765,0.010112129,0.014182716],"study_design_scores_gemma":[0.00018298865,0.00004983781,0.0012826691,0.00004036423,0.000006106848,0.0000020985428,0.00007652459,0.0051282994,0.04110768,0.89418626,0.057756197,0.00018096116],"about_ca_topic_score_codex":0.00006448024,"about_ca_topic_score_gemma":0.000009303064,"teacher_disagreement_score":0.3115606,"about_ca_system_score_codex":0.00007937678,"about_ca_system_score_gemma":0.000114450166,"threshold_uncertainty_score":0.6326762},"labels":[],"label_agreement":null},{"id":"W4409053427","doi":"10.1007/978-3-031-86585-5_4","title":"Analysing KataGo: A Comparative Evaluation Against Perfect Play in the Game of Go","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.060079771502954044,"score_gpt":0.3403553913993017,"score_spread":0.28027561989634764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409053427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026995926,0.00065645156,0.9851147,0.00052215403,0.0007705439,0.0007749279,0.0000043649866,0.000039089733,0.009418182],"genre_scores_gemma":[0.9491544,0.000028910094,0.049707003,0.00085886236,0.00013447713,0.000019825773,0.0000064514356,0.000009425334,0.00008067335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548227,0.0002756604,0.0008464223,0.0012352095,0.0016706579,0.0004897745],"domain_scores_gemma":[0.99559706,0.0018821255,0.0004605694,0.0014962715,0.0005092782,0.000054676053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036563876,0.00043510186,0.000673691,0.0012887793,0.00016260364,0.00040126833,0.0043446748,0.00022012433,0.0000140895445],"category_scores_gemma":[0.00032480666,0.00033199126,0.000172375,0.0018256212,0.00094685843,0.0005535569,0.00080375816,0.0008482387,0.00001935277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008054037,0.00005161327,0.00021295268,0.000028426648,0.000019970475,0.000023392273,0.014997808,0.3474349,0.00027214675,0.015477294,0.00003465274,0.6214388],"study_design_scores_gemma":[0.00009122814,0.00009676372,0.00032100308,0.00055130484,0.000018299655,0.0000069887633,0.0000054525713,0.92517245,0.0036051702,0.0695831,0.00022695836,0.0003212529],"about_ca_topic_score_codex":0.00007138575,"about_ca_topic_score_gemma":0.0006476759,"teacher_disagreement_score":0.94645476,"about_ca_system_score_codex":0.0004040222,"about_ca_system_score_gemma":0.0010054467,"threshold_uncertainty_score":0.9999132},"labels":[],"label_agreement":null},{"id":"W4409053445","doi":"10.1007/978-3-031-86585-5_5","title":"Solving Linear NoGo with Combinatorial Game Theory","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Game theory; Theoretical computer science; Algorithm; Mathematical optimization; Mathematical economics; Mathematics","score_opus":0.015574870468661321,"score_gpt":0.25784878782039067,"score_spread":0.24227391735172935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409053445","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046644567,0.0003438939,0.9796412,0.00057419145,0.0048061,0.0004511015,0.0000033604395,0.00030004504,0.013833437],"genre_scores_gemma":[0.27162644,0.00007671247,0.71928334,0.0034573446,0.002087411,0.000030797804,0.000006172737,0.000097501914,0.0033342894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995281,0.00007609021,0.00063542364,0.0018844852,0.0012552926,0.0008677034],"domain_scores_gemma":[0.99555176,0.0015123425,0.00032568918,0.0019441047,0.00047926308,0.00018686512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013508969,0.00067362055,0.0006647096,0.0009217808,0.0003197725,0.0006825676,0.0052458993,0.00041248265,0.000032034535],"category_scores_gemma":[0.00029853272,0.0005644395,0.00014589274,0.0009297136,0.0014498762,0.0007346126,0.0019902033,0.0012461868,0.000089353365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002323834,0.000034697347,0.00004062759,0.0000338308,0.00001943057,0.0001300597,0.0010642812,0.016203957,0.00003836342,0.44749588,0.000032748994,0.5348829],"study_design_scores_gemma":[0.00015927019,0.00027947332,0.000013369437,0.0007792264,0.000013956563,0.000038489437,5.214996e-7,0.33586818,0.0051555648,0.6542441,0.0026739466,0.00077389716],"about_ca_topic_score_codex":0.000026761807,"about_ca_topic_score_gemma":0.000060556617,"teacher_disagreement_score":0.534109,"about_ca_system_score_codex":0.00035122153,"about_ca_system_score_gemma":0.001309801,"threshold_uncertainty_score":0.9996807},"labels":[],"label_agreement":null},{"id":"W4409094448","doi":"10.31219/osf.io/w9scd_v1","title":"Negative Emotion Places a Boundary on Memory Malleability","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Malleability; Boundary (topology); Cognitive psychology; Psychology; Computer science; Social psychology; Computer security; Mathematics; Ciphertext","score_opus":0.041437914777770535,"score_gpt":0.31553615822614506,"score_spread":0.2740982434483745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409094448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054508798,0.00008252892,0.71474767,0.0059051234,0.0041315705,0.0009425995,0.000020751286,0.000882254,0.2187787],"genre_scores_gemma":[0.86416924,0.00006539715,0.10533846,0.0024298385,0.00035392787,0.00017300325,0.0000121737985,0.000018219713,0.027439762],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974237,0.00026739438,0.00045272848,0.0011184379,0.0004433791,0.00029437314],"domain_scores_gemma":[0.99730486,0.0006547471,0.00018349115,0.0015529821,0.00022334645,0.00008058193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005937059,0.0003195942,0.00033759698,0.00020469772,0.00017766007,0.00046829064,0.0019711002,0.00030389623,0.00020533615],"category_scores_gemma":[0.00045143135,0.00028580098,0.00018503705,0.00024416554,0.00021536039,0.00026450542,0.0025729688,0.0007791245,0.00029572184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013914112,0.00085656653,0.0006156645,0.00059118925,0.00024209285,0.000045751207,0.01898112,0.056542445,0.00005961904,0.2365386,0.024345055,0.66104275],"study_design_scores_gemma":[0.000083327825,0.00019198588,0.0015102358,0.0005114709,0.00001877291,0.0000025187098,0.00085789425,0.30581966,0.037756354,0.64967775,0.0027745506,0.00079549267],"about_ca_topic_score_codex":0.00054024876,"about_ca_topic_score_gemma":0.0002059413,"teacher_disagreement_score":0.80966043,"about_ca_system_score_codex":0.000279114,"about_ca_system_score_gemma":0.00060714944,"threshold_uncertainty_score":0.9999594},"labels":[],"label_agreement":null},{"id":"W4409204999","doi":"10.1134/s1054661824701074","title":"Revealing Personality through Handwriting: A Fusion of Graphology and Machine Learning Techniques","year":2024,"lang":"en","type":"article","venue":"Pattern Recognition and Image Analysis","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Handwriting; Artificial intelligence; Computer science; Pattern recognition (psychology); Personality; Fusion; Machine learning; Natural language processing; Speech recognition; Psychology; Linguistics; Social psychology","score_opus":0.0556077499310159,"score_gpt":0.3090867816996144,"score_spread":0.2534790317685985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409204999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23863143,0.0008701893,0.7595831,0.00045144063,0.000020336016,0.000046953366,0.000013446277,0.00010877118,0.0002743008],"genre_scores_gemma":[0.98133904,0.001008223,0.01736809,0.00018715583,0.0000276859,0.0000073764463,0.000028815697,0.0000055706246,0.000028060096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990263,0.00013037374,0.00025774993,0.00034749534,0.00011661649,0.00012148834],"domain_scores_gemma":[0.9995358,0.00014252169,0.000077118464,0.000112159774,0.00009792892,0.000034484772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041995497,0.00009755167,0.00020791974,0.00027516906,0.000115456176,0.00016632062,0.00009758646,0.00004745812,0.00010447127],"category_scores_gemma":[0.0000639359,0.00008803602,0.00010862255,0.0006371242,0.00010659422,0.00039759037,0.000113057664,0.00014958515,0.000007797382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044458147,0.000028952561,0.019253302,0.00013573687,0.00022357871,0.00003220684,0.0035121734,0.0000010284056,0.025984418,0.00009537859,0.000019540228,0.9507092],"study_design_scores_gemma":[0.00016452475,0.00037877614,0.0093412,0.0006571423,0.0014267717,0.00015102162,0.002066425,0.51781416,0.4288377,0.037087545,0.0012214727,0.0008532588],"about_ca_topic_score_codex":0.00085356325,"about_ca_topic_score_gemma":0.00009465322,"teacher_disagreement_score":0.949856,"about_ca_system_score_codex":0.000007166183,"about_ca_system_score_gemma":0.0000063341254,"threshold_uncertainty_score":0.35900047},"labels":[],"label_agreement":null},{"id":"W4409710701","doi":"10.37256/cm.6220256119","title":"A More Accurate Metaheuristic Approach for the Art Gallery Problem","year":2025,"lang":"en","type":"article","venue":"Contemporary Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Canada West","funders":"Division of Mathematical Sciences; Alzahra University","keywords":"Metaheuristic; Mathematics; Parallel metaheuristic; Mathematical optimization","score_opus":0.09203908360422772,"score_gpt":0.322738223433311,"score_spread":0.23069913982908327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409710701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005567642,0.0006711989,0.94784164,0.0034809583,0.00024605021,0.0013160195,0.0000048977004,0.00021279942,0.04617073],"genre_scores_gemma":[0.26494312,0.000032465814,0.7070936,0.0013932271,0.000097717144,0.0009671163,0.000010644498,0.00003359612,0.025428537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850434,0.000048544007,0.0005760709,0.00036568113,0.0002343004,0.00027107378],"domain_scores_gemma":[0.9971858,0.0013229395,0.00021398606,0.0010453324,0.00018110516,0.000050823473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008368119,0.00021317496,0.00031040676,0.000096706535,0.00024375875,0.00030487232,0.0016939767,0.00007404484,0.0000050932194],"category_scores_gemma":[0.00040580088,0.00014051587,0.0001581598,0.00044066738,0.00015579724,0.00036730597,0.00033779046,0.00015932396,0.000043723492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019078692,0.0004386192,0.000059383427,0.0007316727,0.00029589835,0.000008153491,0.0052457373,0.001238055,0.00017710918,0.71919703,0.26381868,0.008770542],"study_design_scores_gemma":[0.000115035626,0.000036021476,0.000010156109,0.00008733599,0.000033587727,0.000006142032,0.0009336297,0.82060635,0.0013813558,0.13448842,0.042093746,0.00020820099],"about_ca_topic_score_codex":0.0000034414252,"about_ca_topic_score_gemma":0.0000010848717,"teacher_disagreement_score":0.8193683,"about_ca_system_score_codex":0.000026774434,"about_ca_system_score_gemma":0.00023348605,"threshold_uncertainty_score":0.5730071},"labels":[],"label_agreement":null},{"id":"W4410087623","doi":"10.1109/wi-iat62293.2024.00074","title":"Evaluating and Enhancing LLMs Agent Based on Theory of Mind in Guandan: A Multi-Player Cooperative Game Under Imperfect Information","year":2024,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Imperfect; Perfect information; Computer science; Game theory; Mathematical economics; Economics; Philosophy","score_opus":0.0727216316583185,"score_gpt":0.3662076669918495,"score_spread":0.29348603533353096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410087623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34409216,0.000058862403,0.65475,0.00012918991,0.00012932907,0.00018803445,0.0000010991288,0.000027751126,0.0006235721],"genre_scores_gemma":[0.9809992,0.0000037401273,0.018595638,0.00029572187,0.000010730127,0.000016317486,0.0000011774939,0.0000043566347,0.00007315793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988581,0.00016291603,0.00036519626,0.00021459477,0.00023992623,0.00015925629],"domain_scores_gemma":[0.99889,0.0007449895,0.000051379768,0.00019244343,0.000085697524,0.00003552143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013517531,0.000113278635,0.00012962699,0.0002292055,0.00003720125,0.000181793,0.00017069589,0.00004837712,0.000094123556],"category_scores_gemma":[0.00026831214,0.000086615946,0.000031174015,0.00033754035,0.000054266304,0.00075468153,0.00008150222,0.00012675406,0.000059235175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006790926,0.00010697973,0.00030589808,0.00011375996,0.00003072147,0.000010031724,0.04742376,0.1989244,0.041910894,0.06688054,0.000032077216,0.64419305],"study_design_scores_gemma":[0.00008650954,0.00017673415,0.00032364647,0.00015392147,0.000003070623,0.0000014687682,0.0008808976,0.8264179,0.17108281,0.00076349854,0.000020896034,0.000088640045],"about_ca_topic_score_codex":0.000051852367,"about_ca_topic_score_gemma":0.0001087953,"teacher_disagreement_score":0.64410436,"about_ca_system_score_codex":0.000072519746,"about_ca_system_score_gemma":0.00014049513,"threshold_uncertainty_score":0.35320958},"labels":[],"label_agreement":null},{"id":"W4410111257","doi":"10.31219/osf.io/w9scd_v2","title":"Negative Emotion Places a Boundary on Memory Malleability","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Malleability; Boundary (topology); Cognitive psychology; Computer science; Psychology; Social psychology; Computer security; Mathematics; Ciphertext; Encryption","score_opus":0.041437914777770535,"score_gpt":0.31553615822614506,"score_spread":0.2740982434483745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410111257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054508798,0.00008252892,0.71474767,0.0059051234,0.0041315705,0.0009425995,0.000020751286,0.000882254,0.2187787],"genre_scores_gemma":[0.86416924,0.00006539715,0.10533846,0.0024298385,0.00035392787,0.00017300325,0.0000121737985,0.000018219713,0.027439762],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974237,0.00026739438,0.00045272848,0.0011184379,0.0004433791,0.00029437314],"domain_scores_gemma":[0.99730486,0.0006547471,0.00018349115,0.0015529821,0.00022334645,0.00008058193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005937059,0.0003195942,0.00033759698,0.00020469772,0.00017766007,0.00046829064,0.0019711002,0.00030389623,0.00020533615],"category_scores_gemma":[0.00045143135,0.00028580098,0.00018503705,0.00024416554,0.00021536039,0.00026450542,0.0025729688,0.0007791245,0.00029572184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013914112,0.00085656653,0.0006156645,0.00059118925,0.00024209285,0.000045751207,0.01898112,0.056542445,0.00005961904,0.2365386,0.024345055,0.66104275],"study_design_scores_gemma":[0.000083327825,0.00019198588,0.0015102358,0.0005114709,0.00001877291,0.0000025187098,0.00085789425,0.30581966,0.037756354,0.64967775,0.0027745506,0.00079549267],"about_ca_topic_score_codex":0.00054024876,"about_ca_topic_score_gemma":0.0002059413,"teacher_disagreement_score":0.80966043,"about_ca_system_score_codex":0.000279114,"about_ca_system_score_gemma":0.00060714944,"threshold_uncertainty_score":0.9999594},"labels":[],"label_agreement":null},{"id":"W4410236799","doi":"10.1145/3723498.3723748","title":"Game Balance Through Procedural Content Generation","year":2025,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Balance (ability); Computer science; Physical medicine and rehabilitation; Medicine","score_opus":0.09364839810409202,"score_gpt":0.31958764067200324,"score_spread":0.2259392425679112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410236799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022168301,0.00011516443,0.9474865,0.0061588977,0.0006854853,0.00014675883,2.4782074e-7,0.00020672957,0.023031885],"genre_scores_gemma":[0.9452424,0.00001557018,0.040785097,0.0052403826,0.000074611504,0.000024588426,0.0000011035322,0.0000025116062,0.008613753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921995,0.000021223059,0.00019276635,0.00026635776,0.00012842612,0.00017127015],"domain_scores_gemma":[0.99947786,0.00003230445,0.00003365403,0.00031783138,0.00011725464,0.000021108863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008584375,0.000079345635,0.00008588104,0.000031647538,0.000064296,0.00014923183,0.0005019374,0.00003511963,0.000027486738],"category_scores_gemma":[0.000058612437,0.00006525894,0.000034026478,0.00026980857,0.00004145146,0.00055260875,0.00012367623,0.000058919788,0.00015099421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018096359,0.000034052235,0.0011669022,0.0000072953935,0.000008507132,0.00000215583,0.00058188854,0.00021571155,0.012858773,0.9470918,0.012701575,0.0253295],"study_design_scores_gemma":[0.000066382876,0.00003807008,0.000770496,0.000027107848,0.0000029512717,0.0000037654722,0.00012279875,0.51100516,0.4308188,0.038073376,0.018899828,0.0001712696],"about_ca_topic_score_codex":0.00007339499,"about_ca_topic_score_gemma":0.00004755967,"teacher_disagreement_score":0.92307407,"about_ca_system_score_codex":0.00003825971,"about_ca_system_score_gemma":0.00006964854,"threshold_uncertainty_score":0.26611823},"labels":[],"label_agreement":null},{"id":"W4410237443","doi":"10.1145/3723498.3723818","title":"Playing RollerCoaster Tycoon with Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Artificial intelligence","score_opus":0.019946103363299817,"score_gpt":0.2694744740984639,"score_spread":0.2495283707351641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410237443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007785471,0.000016734068,0.7997197,0.00069902925,0.00012220742,0.00008573325,9.8486375e-9,0.00017073366,0.19140036],"genre_scores_gemma":[0.94955194,0.0000038785956,0.023685787,0.0006844404,0.00001524748,0.000011487445,2.6866917e-7,0.0000035309492,0.026043402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918985,0.000023782512,0.00016789303,0.0002367999,0.00017018236,0.00021149903],"domain_scores_gemma":[0.99949944,0.00007845187,0.000037363952,0.00029157026,0.000059634905,0.000033536693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001573604,0.00009099784,0.000091982736,0.00010610718,0.0001785245,0.00016752699,0.0004537767,0.000029422563,0.00009254597],"category_scores_gemma":[0.000029125507,0.000066943736,0.000024595742,0.00034472634,0.000030102932,0.0003408329,0.00024253607,0.000126844,0.00015466317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004480693,0.000040735198,0.021944173,0.000024332612,0.00006966991,0.000025620906,0.002450963,0.17650881,0.0016234893,0.5635844,0.002284109,0.23139888],"study_design_scores_gemma":[0.00015456151,0.00019511052,0.0009640121,0.00010463274,0.0000069931007,0.0000049908526,0.00047867006,0.93951786,0.039185125,0.0022860118,0.016833814,0.0002682366],"about_ca_topic_score_codex":0.00007133979,"about_ca_topic_score_gemma":0.000031818,"teacher_disagreement_score":0.9417665,"about_ca_system_score_codex":0.00003277183,"about_ca_system_score_gemma":0.00005383029,"threshold_uncertainty_score":0.27298865},"labels":[],"label_agreement":null},{"id":"W4410313961","doi":"10.32920/ifmj.v4i1-2.2080","title":"Optional Thinking and Loop Disentanglement Strategies in Films and Videogames","year":2024,"lang":"en","type":"article","venue":"Interactive Film and Media Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Loop (graph theory); Computer science; Psychology; Mathematics","score_opus":0.020421139697679315,"score_gpt":0.3069235482105781,"score_spread":0.28650240851289877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410313961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9371306,0.005825151,0.051953565,0.002513901,0.0016697383,0.00010069327,0.000007251609,0.00003979458,0.00075934245],"genre_scores_gemma":[0.99157554,0.0011770497,0.0069023413,0.00013858186,0.00013672959,0.00000558269,9.818531e-7,0.000005872736,0.000057333622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990774,0.000054535692,0.00023310627,0.00024101263,0.0002132888,0.00018068358],"domain_scores_gemma":[0.99919504,0.00052687956,0.000052831703,0.00006334273,0.0000467012,0.00011518284],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003046444,0.000116870004,0.00012460256,0.000194566,0.00009726911,0.0011323319,0.00015560299,0.0000355848,0.00008117913],"category_scores_gemma":[0.00009069033,0.00009203547,0.00002569491,0.000100215526,0.0001141028,0.0016485981,0.00017749306,0.00035962355,0.0000052895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012475037,0.00016092716,0.019626493,0.00011992005,0.00021683097,0.0019218446,0.1390895,0.00034499675,0.0055141086,0.2758252,0.0032996205,0.5537558],"study_design_scores_gemma":[0.0006850459,0.00058568415,0.06446441,0.0030744404,0.000056836194,0.004669454,0.06783341,0.323446,0.008669518,0.5143588,0.011193966,0.00096244767],"about_ca_topic_score_codex":0.000017662178,"about_ca_topic_score_gemma":0.000059517402,"teacher_disagreement_score":0.5527933,"about_ca_system_score_codex":0.000034721266,"about_ca_system_score_gemma":0.0000832418,"threshold_uncertainty_score":0.9999046},"labels":[],"label_agreement":null},{"id":"W4410845056","doi":"10.1017/9780511820809.022","title":"Combinatorial games: selected short bibliography with a succinct gourmet introduction","year":2015,"lang":"en","type":"other","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bibliography; Computer science; Library science","score_opus":0.015830085919489374,"score_gpt":0.2578221075157953,"score_spread":0.24199202159630595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410845056","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009520948,0.0005262062,0.23266834,0.0008646605,0.006777641,0.00088786293,0.00001483438,0.0032176576,0.7549476],"genre_scores_gemma":[0.018451804,0.0012061832,0.11070304,0.000508126,0.021977026,0.00028262823,0.0003044972,0.0017735484,0.84479314],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99743587,0.00011740542,0.00030721026,0.0009123732,0.0007716905,0.00045547425],"domain_scores_gemma":[0.99796754,0.00003974961,0.00015725834,0.0011368422,0.00050426787,0.00019434255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032869275,0.00042352357,0.00045623168,0.0067198584,0.000054798373,0.0003169324,0.0012399233,0.00032843233,0.0008560099],"category_scores_gemma":[0.000052698135,0.0003231048,0.000076587305,0.01718786,0.00015888535,0.0003066354,0.00018809146,0.00035509435,0.0003380115],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015774944,0.00008785144,0.0005125212,0.000011269165,0.000107583575,0.000011837461,0.00007401217,0.0000064613027,0.000014168974,0.007362951,0.9894632,0.0023323412],"study_design_scores_gemma":[0.00011173411,0.0003957203,0.00005054825,0.00004693232,0.000033747197,0.0000318671,0.000035452387,0.0006765601,0.00080146093,0.0026130052,0.9946504,0.00055257644],"about_ca_topic_score_codex":0.0007233537,"about_ca_topic_score_gemma":0.00068876194,"teacher_disagreement_score":0.1219653,"about_ca_system_score_codex":0.000032684267,"about_ca_system_score_gemma":0.00021276924,"threshold_uncertainty_score":0.9999221},"labels":[],"label_agreement":null},{"id":"W4410845077","doi":"10.1017/9780511820809.021","title":"Unsolved problems in combinatorial games","year":2015,"lang":"en","type":"other","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Mathematical economics; Mathematics","score_opus":0.03704529516589145,"score_gpt":0.28283097752698183,"score_spread":0.24578568236109039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410845077","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035297587,0.00042132047,0.032009117,0.00018050459,0.0032574676,0.0003405364,0.0000023790026,0.00059101364,0.96319413],"genre_scores_gemma":[0.0014335482,0.000047831014,0.008811167,0.0001321578,0.000473415,0.0000383591,0.000006262432,0.00018097098,0.9888763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985421,0.00006201186,0.00027000898,0.00046050453,0.00036079175,0.0003046164],"domain_scores_gemma":[0.99901783,0.000040159037,0.00011986473,0.0006773904,0.000053917272,0.00009085975],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002786156,0.00021826531,0.00029818327,0.00030381585,0.000011010348,0.00011258101,0.0013324773,0.00027718226,0.0007178259],"category_scores_gemma":[0.00006413773,0.00018996437,0.0000403938,0.00041588637,0.00007242419,0.00012112954,0.0002994277,0.00021346196,0.0012324653],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.638802e-7,0.00005819774,0.000084659456,0.000012397965,0.000007574537,0.000008914707,0.0003046182,0.000016802942,0.00000427065,0.07278754,0.92222273,0.004491626],"study_design_scores_gemma":[0.0000956139,0.000045543708,0.000003918534,0.000102272184,0.0000016829739,0.0000013761112,0.000024295909,0.0020362542,0.00011726497,0.048778098,0.94851553,0.0002781587],"about_ca_topic_score_codex":0.0012477754,"about_ca_topic_score_gemma":0.0019013281,"teacher_disagreement_score":0.026292786,"about_ca_system_score_codex":0.000066388835,"about_ca_system_score_gemma":0.00019496889,"threshold_uncertainty_score":0.9995452},"labels":[],"label_agreement":null},{"id":"W4410845492","doi":"10.1017/9780511820809.010","title":"A ruler regularity in hexadecimal games","year":2015,"lang":"en","type":"other","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Ruler; Computer graphics (images); Computer science; Artificial intelligence; Mathematical economics; Mathematics; Physics; Astronomy","score_opus":0.04321549779577269,"score_gpt":0.3003842916583115,"score_spread":0.25716879386253877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410845492","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011714271,0.00059044955,0.060571633,0.0005094237,0.0005649436,0.00017623324,0.0000035083078,0.00046897674,0.9371031],"genre_scores_gemma":[0.00040069944,0.000025982457,0.04425632,0.00029226008,0.00020936374,0.00001368663,0.0000032117996,0.000109112574,0.9546894],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984687,0.000068358415,0.00024599562,0.000514551,0.00038740208,0.00031500316],"domain_scores_gemma":[0.99883777,0.00003485598,0.00009515331,0.00088459096,0.00004486609,0.000102744154],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00032627943,0.00021379619,0.00028780746,0.00033110825,0.000011325775,0.00010986641,0.0013773413,0.00029965074,0.0018010339],"category_scores_gemma":[0.00009072197,0.00018604031,0.000049702383,0.00038208376,0.00009304942,0.00014195112,0.00042082224,0.00024506164,0.0018112736],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010338031,0.000037566726,0.00011011166,0.000006647694,0.000006194287,0.000030211922,0.00019239684,0.0000032361859,0.000002926604,0.027488962,0.9557945,0.016326215],"study_design_scores_gemma":[0.000038504637,0.000020242453,0.000048438276,0.0000719216,0.0000016242209,0.0000055672044,0.000028979479,0.0026257627,0.00013715221,0.013977626,0.98277664,0.00026753795],"about_ca_topic_score_codex":0.0012165918,"about_ca_topic_score_gemma":0.0028486084,"teacher_disagreement_score":0.026982145,"about_ca_system_score_codex":0.00006503729,"about_ca_system_score_gemma":0.00018231386,"threshold_uncertainty_score":0.9991115},"labels":[],"label_agreement":null},{"id":"W4410863956","doi":"10.1007/978-3-031-84756-1_1","title":"Introduction","year":2025,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on games and computational intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Sudbury; University of Alberta","funders":"","keywords":"Computer science","score_opus":0.018823354093474094,"score_gpt":0.2612300088375711,"score_spread":0.24240665474409698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410863956","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000061577675,0.0015961151,0.8086573,0.007265709,0.00087799615,0.0002938093,0.000019902018,0.00024701457,0.18103601],"genre_scores_gemma":[0.11870516,0.0035480135,0.1031588,0.0073650684,0.003576325,0.00020906552,0.00007224643,0.00018659598,0.7631787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733734,0.00005581919,0.00059134554,0.0011518253,0.0005554054,0.00030823468],"domain_scores_gemma":[0.996938,0.0017290717,0.0002718066,0.00064724335,0.00029805998,0.000115834424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002470826,0.0005295941,0.00047788734,0.00048963056,0.00024140796,0.0003556378,0.00097282615,0.0003237447,0.00047533493],"category_scores_gemma":[0.00034782587,0.0004937476,0.00019928147,0.00013277981,0.00028294895,0.0001835296,0.00028473296,0.0005309533,0.0003438592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011844874,0.000014610979,5.878535e-7,0.000023239027,0.000054021897,0.000006259324,0.00007492432,0.0138205895,0.000002271723,0.58150905,0.007503092,0.39697948],"study_design_scores_gemma":[0.0000113200085,0.000116215866,0.000013118479,0.00029170053,0.0000371242,0.000028287832,0.000013293308,0.047215044,0.0029910665,0.76742953,0.18130563,0.000547684],"about_ca_topic_score_codex":0.000011940901,"about_ca_topic_score_gemma":0.000009384582,"teacher_disagreement_score":0.7054985,"about_ca_system_score_codex":0.00011375819,"about_ca_system_score_gemma":0.00018734261,"threshold_uncertainty_score":0.9997514},"labels":[],"label_agreement":null},{"id":"W4411241914","doi":"10.1007/s00199-025-01658-0","title":"Selection through information acquisition in coordination games","year":2025,"lang":"en","type":"article","venue":"Economic Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"York University; New York University; National Science Foundation; University of California-San Diego","keywords":"Public finance; Selection (genetic algorithm); Coordination game; Computer science; Mathematical economics; Economics; Artificial intelligence; Macroeconomics","score_opus":0.008394226594433554,"score_gpt":0.2594698511575263,"score_spread":0.25107562456309274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411241914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11906113,0.00003785437,0.8432798,0.0010374153,0.0007857302,0.00015889751,0.0000010114583,0.0001318104,0.035506368],"genre_scores_gemma":[0.9962442,0.000010015697,0.0026407633,0.0006259832,0.00003197128,0.000022983004,0.0000036443455,0.0000020461418,0.00041841544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993563,0.000078833415,0.00026796933,0.00014089172,0.000033379143,0.00012257324],"domain_scores_gemma":[0.9995883,0.00012865686,0.00008139108,0.00016521636,0.000025862686,0.000010573974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048491242,0.00006804502,0.00008152549,0.00019301557,0.00005901519,0.00012231331,0.00026793004,0.000055356275,0.00008405306],"category_scores_gemma":[0.000044160093,0.000076163575,0.000027039096,0.00017873265,0.000031153366,0.0026160872,0.00006553057,0.000071890376,0.0004028939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098273185,0.000008490424,0.00061417726,0.000004044181,0.0000040101036,1.0294517e-7,0.0009900529,0.0022761973,0.0000904075,0.90524805,0.00081407116,0.08994056],"study_design_scores_gemma":[0.000111206646,0.00002179957,0.0045411233,0.00002485344,0.0000021524274,0.0000017808611,0.0003542496,0.105864644,0.020092707,0.8603805,0.008489728,0.00011527014],"about_ca_topic_score_codex":0.000059274644,"about_ca_topic_score_gemma":0.00003664925,"teacher_disagreement_score":0.8771831,"about_ca_system_score_codex":0.00029060646,"about_ca_system_score_gemma":0.00007084095,"threshold_uncertainty_score":0.51785207},"labels":[],"label_agreement":null},{"id":"W4411922097","doi":"10.1016/j.cognition.2025.106218","title":"Evaluating commercial game design decisions via the scientification of games: Asymmetrical task switching errors predict self-reported fun in Ghost Blitz","year":2025,"lang":"en","type":"article","venue":"Cognition","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Gambling Research Institute, University of Calgary; Natural Sciences and Engineering Research Council of Canada","keywords":"Psychology; Task (project management); Task switching; Cognitive psychology; Social psychology; Cognition; Neuroscience; Management","score_opus":0.1321466791048984,"score_gpt":0.3868159363492263,"score_spread":0.2546692572443279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411922097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19277269,0.00009564841,0.8047404,0.0006205783,0.0005365571,0.0006203442,0.0000026898515,0.000113188966,0.00049789046],"genre_scores_gemma":[0.9760723,0.000017139866,0.023550987,0.00019893853,0.000038412363,0.00008245678,0.000011553843,0.000007877605,0.0000203238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703234,0.00056546775,0.0008951882,0.0005229586,0.00068506674,0.00029899357],"domain_scores_gemma":[0.9959441,0.0023728784,0.00038067583,0.0006483221,0.000596383,0.00005767779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036838101,0.00015429962,0.00021106434,0.0007185517,0.00028153317,0.00018343906,0.000847719,0.000108801076,0.000011970895],"category_scores_gemma":[0.0049250247,0.00012913872,0.00008584037,0.0035306502,0.00013105558,0.00049913063,0.0002498613,0.000294586,0.000036450077],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005393129,0.00047958302,0.0023792193,0.000020176933,0.00006271555,0.000006918451,0.004234884,0.003362411,0.028042747,0.0021519784,0.00044060242,0.95876485],"study_design_scores_gemma":[0.00023377968,0.00011426352,0.026261654,0.0002793604,0.00008843399,0.000007719379,0.0003581201,0.8886009,0.044966403,0.038824998,0.00009740993,0.00016695455],"about_ca_topic_score_codex":0.00005421628,"about_ca_topic_score_gemma":0.00004863286,"teacher_disagreement_score":0.9585979,"about_ca_system_score_codex":0.00012433188,"about_ca_system_score_gemma":0.00029532408,"threshold_uncertainty_score":0.58960706},"labels":[],"label_agreement":null},{"id":"W4412646192","doi":"10.1145/3721239.3734132","title":"Advancing VFX Workflows with Houdini Solaris in House of the Dragon Season 2","year":2025,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rolls-Royce (Canada)","funders":"","keywords":"Workflow; Computer science; Computer graphics (images); Operating system; Database","score_opus":0.009511582092822232,"score_gpt":0.2569861454466753,"score_spread":0.24747456335385307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34629956,0.00009090943,0.64245224,0.0028187209,0.0003543659,0.00024533222,2.8784223e-7,0.00015270471,0.0075858943],"genre_scores_gemma":[0.973871,0.000008511043,0.024901107,0.00040635353,0.000010989247,0.0000082526685,3.3872624e-8,0.0000064697783,0.0007872656],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990509,0.000060967082,0.00021819315,0.00024833952,0.00019336508,0.00022822092],"domain_scores_gemma":[0.9990487,0.00017961134,0.00006661201,0.0006173846,0.00006145122,0.000026217349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027259684,0.00009427434,0.00013701712,0.000090334375,0.000060702576,0.000054862223,0.000916755,0.00004397205,0.000010185573],"category_scores_gemma":[0.000115678704,0.000058328078,0.00004148337,0.0010299742,0.00007656428,0.00028355586,0.00031597484,0.00015523343,0.000010172556],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067935536,0.00031551011,0.4165213,0.000062544976,0.000044724173,0.000020854395,0.0062512383,0.026856858,0.00568528,0.17945188,0.0024447308,0.36227715],"study_design_scores_gemma":[0.0003105347,0.00018009148,0.057775892,0.0008698821,0.000018479823,0.0000057299403,0.0015076986,0.26307178,0.6479942,0.021839676,0.0059288093,0.0004972061],"about_ca_topic_score_codex":0.0003759559,"about_ca_topic_score_gemma":0.0022311057,"teacher_disagreement_score":0.64230895,"about_ca_system_score_codex":0.00005162149,"about_ca_system_score_gemma":0.00013922802,"threshold_uncertainty_score":0.237855},"labels":[],"label_agreement":null},{"id":"W4412861218","doi":"10.5206/mt.v5i3.22789","title":"An Ethnomathematics Approach to the Haida Stick Game","year":2025,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ethnomathematics; Mathematics education; Anthropology; Sociology; Mathematics","score_opus":0.03913797352093416,"score_gpt":0.30753445471954893,"score_spread":0.26839648119861476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412861218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016761427,0.000028620556,0.9846241,0.004421739,0.00040018934,0.00029216468,0.0000044615576,0.00024882835,0.008303788],"genre_scores_gemma":[0.85201687,0.0000031843656,0.14465766,0.0008305171,0.000032817774,0.00010423457,8.166827e-7,0.000007547978,0.0023463678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990164,0.00006569994,0.00022015256,0.00028359363,0.00018392487,0.0002302418],"domain_scores_gemma":[0.9987392,0.00015192849,0.000025305604,0.0009395555,0.00006668814,0.00007735062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026348286,0.00011003552,0.00011140445,0.00011040745,0.00028161192,0.00022411789,0.0012447758,0.000050219453,0.000031631],"category_scores_gemma":[0.00002529885,0.0000834662,0.000065698936,0.00076767296,0.00006259409,0.0002604331,0.000020988597,0.00017430198,0.00017466802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008286206,0.00088157464,0.000036633548,0.000053772124,0.00007637574,0.0000023505775,0.028828394,0.12877133,0.0012094231,0.53690803,0.002800161,0.30042365],"study_design_scores_gemma":[0.000052096504,0.000060006212,0.00025122112,0.000021868178,0.000030927346,0.0000068240643,0.0018493746,0.91637444,0.010026145,0.037498675,0.033604123,0.00022430626],"about_ca_topic_score_codex":0.00009577638,"about_ca_topic_score_gemma":0.00014374894,"teacher_disagreement_score":0.8503407,"about_ca_system_score_codex":0.000037528793,"about_ca_system_score_gemma":0.0000671562,"threshold_uncertainty_score":0.3403653},"labels":[],"label_agreement":null},{"id":"W4413046457","doi":"10.5642/jhummath.fzye2054","title":"Small Number and the Old Game","year":2025,"lang":"en","type":"article","venue":"Journal of Humanistic Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematical economics; Mathematics; Computer science","score_opus":0.037561280546701735,"score_gpt":0.2940454592967535,"score_spread":0.2564841787500518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413046457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01647802,0.00020635569,0.96544755,0.0022116841,0.00042703302,0.00010266302,2.4959886e-7,0.00001721247,0.015109233],"genre_scores_gemma":[0.8667369,0.0000726344,0.12821457,0.00071968476,0.0001226685,0.000002839697,3.580222e-8,0.000007512517,0.004123149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990117,0.000049562597,0.00053798786,0.00007988577,0.00019963286,0.00012120805],"domain_scores_gemma":[0.99818933,0.0009601555,0.00033463407,0.0003013756,0.00017835446,0.000036144673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091725396,0.00008803663,0.00023712701,0.000056460118,0.00009597361,0.00023887379,0.0007732202,0.000031683307,0.000043386954],"category_scores_gemma":[0.0006327104,0.0000514805,0.00007686541,0.0001228967,0.0002026143,0.0001015465,0.00017347184,0.0001842655,0.000026478028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004751405,0.000042330637,0.000041323397,0.00004323636,0.000029237197,0.000013605877,0.0026286398,0.000015567382,0.00002507712,0.9939986,0.0009950928,0.0021625548],"study_design_scores_gemma":[0.00020282115,0.000027091352,0.000065803986,0.00014999021,0.000046402467,0.00018373392,0.000372524,0.03297396,0.00047901904,0.9629882,0.0024426004,0.00006785019],"about_ca_topic_score_codex":0.0000035574622,"about_ca_topic_score_gemma":0.000004359423,"teacher_disagreement_score":0.8502589,"about_ca_system_score_codex":0.000022205943,"about_ca_system_score_gemma":0.00005588745,"threshold_uncertainty_score":0.23034655},"labels":[],"label_agreement":null},{"id":"W4413145426","doi":"10.1109/cvpr52734.2025.02254","title":"Black Swan: Abductive and Defeasible Video Reasoning in Unpredictable Events","year":2025,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Vector Institute; National Research Foundation","keywords":"Abductive reasoning; Computer science; Defeasible estate; Artificial intelligence","score_opus":0.01735586867973281,"score_gpt":0.28862921839710715,"score_spread":0.2712733497173743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413145426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24479128,0.00030432414,0.7010846,0.0016879151,0.00037659408,0.0002530792,6.755006e-7,0.00017448832,0.05132702],"genre_scores_gemma":[0.9646078,0.000039148494,0.031531755,0.00033107804,0.00001836754,0.000011171235,2.888694e-7,0.0000041025714,0.0034563118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894357,0.000051112693,0.00021447145,0.0003846345,0.00014166257,0.00026454745],"domain_scores_gemma":[0.99939066,0.00013900884,0.000034954282,0.00032642283,0.00005750669,0.000051439678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031345966,0.00010212192,0.00013717386,0.00017818873,0.00007073016,0.0000902843,0.00045238968,0.000053834727,0.000024030142],"category_scores_gemma":[0.00018598115,0.000096447766,0.000023387034,0.0006839497,0.00007638848,0.00056882633,0.0003686455,0.00012271089,0.00005421738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016048478,0.00009227474,0.14477837,0.000021988113,0.000022596774,0.00001372224,0.0025948212,0.001371183,0.0005148766,0.81569076,0.0023597304,0.03252362],"study_design_scores_gemma":[0.0003261051,0.0000991932,0.03877041,0.00038920832,0.000011136583,0.00000867427,0.002171888,0.42851195,0.044172663,0.48107263,0.0040156646,0.0004504759],"about_ca_topic_score_codex":0.00045638563,"about_ca_topic_score_gemma":0.00025223984,"teacher_disagreement_score":0.7198165,"about_ca_system_score_codex":0.00006608594,"about_ca_system_score_gemma":0.000086812535,"threshold_uncertainty_score":0.39330256},"labels":[],"label_agreement":null},{"id":"W4413361377","doi":"10.1109/icde65448.2025.00224","title":"TardySketch: A Framework for Cardinality Estimation Adaptable to Sliding Windows","year":2025,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cardinality (data modeling); Computer science; Data mining","score_opus":0.05502976321479812,"score_gpt":0.35680370113919846,"score_spread":0.3017739379244003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413361377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026568165,0.000033700344,0.98547316,0.0047542313,0.0007535758,0.0005196679,0.0000016517789,0.00024547116,0.00556171],"genre_scores_gemma":[0.4594623,6.705004e-7,0.53877586,0.00085846195,0.000034089422,0.00008058692,4.4029719e-7,0.0000032066446,0.0007843658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882376,0.000033832057,0.0002584134,0.00038722614,0.00016736396,0.00032942405],"domain_scores_gemma":[0.99866223,0.0005136161,0.00004130742,0.0005509382,0.00015092877,0.000080977676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005682993,0.0001103884,0.00016635652,0.00011858263,0.0001884859,0.00024535935,0.00068901316,0.00007511753,0.000020599417],"category_scores_gemma":[0.0009868522,0.00010545325,0.00008284928,0.0006409215,0.000014660705,0.00037184995,0.00023265749,0.00008887733,0.00008448562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077715395,0.00001587881,0.0002997164,0.000012751771,0.000011670174,6.5602933e-7,0.00041218213,0.008799191,0.00015408291,0.90050143,0.0027430465,0.087041594],"study_design_scores_gemma":[0.000027836228,0.000042834134,0.00021595736,0.00006424331,0.0000071963773,7.38023e-7,0.00016291435,0.49520823,0.040471606,0.45244458,0.011211679,0.00014218652],"about_ca_topic_score_codex":0.00015794036,"about_ca_topic_score_gemma":0.00003406095,"teacher_disagreement_score":0.48640904,"about_ca_system_score_codex":0.00009762932,"about_ca_system_score_gemma":0.000105570005,"threshold_uncertainty_score":0.43002585},"labels":[],"label_agreement":null},{"id":"W4413514444","doi":"10.24908/cmj.v23i1.19386","title":"From Rowley to Arbour","year":2023,"lang":"en","type":"article","venue":"Canadian Military Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Art","score_opus":0.028183661359438478,"score_gpt":0.2680552422380369,"score_spread":0.23987158087859842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413514444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86785626,0.0011247306,0.068086565,0.051843584,0.006024612,0.00021691697,0.00006479351,0.00028823715,0.004494299],"genre_scores_gemma":[0.97566533,0.000062861895,0.016445471,0.00511524,0.0013826061,0.000006548721,0.0000050387566,0.00002130578,0.0012955806],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985525,0.00006359943,0.00025796972,0.0002714252,0.0002442446,0.0006102736],"domain_scores_gemma":[0.99792075,0.000085992884,0.000022278751,0.0004315682,0.000102754486,0.0014366403],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038237442,0.00011429666,0.00012132861,0.000509138,0.00031060007,0.00011902818,0.0013277299,0.00005601361,0.00033963204],"category_scores_gemma":[0.00021969888,0.00011629713,0.0000790511,0.00080448156,0.000031899697,0.00038540008,0.000097224874,0.00027350045,0.004930745],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063769185,0.00001292182,0.0043886127,0.0000027126646,0.00005631793,0.0027374537,0.014203952,0.0062329285,0.0009691472,0.0041293083,0.6968413,0.27041894],"study_design_scores_gemma":[0.00015770315,0.00024087708,0.05463094,0.00013660983,0.000013684223,0.00032575976,0.003544976,0.09257854,0.002646309,0.20736139,0.6373435,0.0010197],"about_ca_topic_score_codex":0.12543382,"about_ca_topic_score_gemma":0.2539708,"teacher_disagreement_score":0.26939926,"about_ca_system_score_codex":0.00026268352,"about_ca_system_score_gemma":0.00073342945,"threshold_uncertainty_score":0.995844},"labels":[],"label_agreement":null},{"id":"W4414581249","doi":"10.61091/jcmcc127-21","title":"Quasi-static equilibrium of magic squares","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Mount Saint Vincent University","keywords":"Magic square; MAGIC (telescope); Least-squares function approximation; Coulomb; Point (geometry); Random variable","score_opus":0.020490580849937396,"score_gpt":0.29374269817393156,"score_spread":0.2732521173239942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5670914,0.00080083526,0.4026493,0.00079208496,0.025630964,0.00035563693,0.0000017216264,0.00007443577,0.0026036266],"genre_scores_gemma":[0.97642696,0.000023378183,0.023121305,0.00004324739,0.00035042863,8.807292e-7,2.4028395e-7,0.000015444359,0.000018125978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676687,0.0001607823,0.0017477918,0.00025504897,0.0007140527,0.0003554607],"domain_scores_gemma":[0.99550265,0.0015699372,0.0013891576,0.00047419456,0.00092533126,0.00013872747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018206697,0.00027594925,0.0008940316,0.0004211648,0.00012885952,0.0002799766,0.0013422513,0.00014341637,0.0000050866374],"category_scores_gemma":[0.0010571792,0.00024786082,0.00022830711,0.0007550616,0.00017937487,0.00044435702,0.0006107782,0.00041023205,0.000003290532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034876597,0.00073413324,0.00014528686,0.00028123517,0.00009056342,0.000016042903,0.0014559942,0.000089384,0.0014032191,0.99077237,0.0003843218,0.0045925747],"study_design_scores_gemma":[0.0010110771,0.0009296222,0.000040926818,0.0006230241,0.00006149022,0.000034205772,0.0004355736,0.048499227,0.013470665,0.9342622,0.0004133842,0.0002185627],"about_ca_topic_score_codex":0.000014367599,"about_ca_topic_score_gemma":2.6961828e-7,"teacher_disagreement_score":0.40933558,"about_ca_system_score_codex":0.00007479802,"about_ca_system_score_gemma":0.0003246866,"threshold_uncertainty_score":0.9999974},"labels":[],"label_agreement":null},{"id":"W4414606209","doi":"10.33767/osf.io/c6gfe_v1","title":"Input Data Comics: Exploring a Narrative Approach to Input Visualization","year":2025,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Comics; Narrative; Storytelling; Visualization; Citizen journalism; Data visualization; Data collection; Space (punctuation)","score_opus":0.17664285229128818,"score_gpt":0.366032309072401,"score_spread":0.1893894567811128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414606209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023205134,0.000021011849,0.9453637,0.0007971932,0.00037078504,0.00026351117,0.0000017975349,0.00045427715,0.050407223],"genre_scores_gemma":[0.71037275,0.000016396609,0.28148383,0.002646295,0.00009153112,0.00010903851,0.000022154336,0.00002281421,0.005235194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986997,0.00006449272,0.00025161385,0.00058343407,0.00018596507,0.00021475322],"domain_scores_gemma":[0.9984497,0.000078051904,0.000044385826,0.0012801905,0.00007900141,0.000068673675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003122915,0.00012134894,0.00013935061,0.00024787107,0.0001242788,0.00023569225,0.0021110529,0.000041045438,0.000009311739],"category_scores_gemma":[0.00020375085,0.00011461996,0.000018258546,0.001056058,0.000039242703,0.0010246799,0.0017187276,0.00007383646,0.00006807121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005378053,0.00011454469,0.00041175974,0.000014967469,0.000024278617,0.0000011972018,0.014843692,0.0011834545,0.0003582335,0.9124943,0.033458617,0.03708958],"study_design_scores_gemma":[0.00006368904,0.000038109367,0.000089672816,0.00005463452,0.0000047622075,0.0000015342317,0.004399335,0.94030166,0.02178271,0.00713517,0.025854819,0.00027392598],"about_ca_topic_score_codex":0.00020026261,"about_ca_topic_score_gemma":0.000076200755,"teacher_disagreement_score":0.9391182,"about_ca_system_score_codex":0.00004541279,"about_ca_system_score_gemma":0.00007624988,"threshold_uncertainty_score":0.46740663},"labels":[],"label_agreement":null},{"id":"W4414625387","doi":"10.1016/j.bbr.2025.115849","title":"Comparative analysis of tickling and conspecific play in tame mice and golden hamsters","year":2025,"lang":"en","type":"article","venue":"Behavioural Brain Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Precursory Research for Embryonic Science and Technology; Japan Science and Technology Agency; Japan Society for the Promotion of Science; Volkswagen Foundation","keywords":"Comprehension; Social relation; Social behavior; Social behaviour; Social relationship; Cognition; Social dynamics; Social cognition; Social animal","score_opus":0.1719608823420951,"score_gpt":0.43908922985160187,"score_spread":0.26712834750950676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414625387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919942,0.00042509695,0.0042744703,0.0021901925,0.00004228036,0.00024575755,0.0000061601754,0.000017676417,0.0008041623],"genre_scores_gemma":[0.99696004,0.000024343837,0.002409696,0.00005525363,0.000004107608,0.000015171147,0.0000022694273,0.0000024730564,0.000526626],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99817973,0.00036418604,0.00033718318,0.00042405978,0.0003613356,0.0003335301],"domain_scores_gemma":[0.9974555,0.0019113206,0.00004997002,0.0003127689,0.00019421516,0.000076230885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014445019,0.00009983967,0.00033153646,0.0011966043,0.00011246662,0.00017753881,0.0005175254,0.00006593287,0.000013638315],"category_scores_gemma":[0.00021410985,0.00009497742,0.000041406078,0.0024716686,0.0006084271,0.00023125965,0.00047592775,0.00031029538,0.0000041345243],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006627836,0.00016977794,0.8617667,0.000038959242,0.00022849833,0.00006677536,0.021856396,0.0002853587,0.02581479,0.06308669,0.0013489093,0.025270859],"study_design_scores_gemma":[0.00022687549,0.00011996533,0.87710226,0.00012926683,0.000052420266,0.0000032170444,0.0053360146,0.09412516,0.020093251,0.0024040625,0.00019598144,0.0002115018],"about_ca_topic_score_codex":0.0013849263,"about_ca_topic_score_gemma":0.0014630032,"teacher_disagreement_score":0.0938398,"about_ca_system_score_codex":0.0000644958,"about_ca_system_score_gemma":0.00008166688,"threshold_uncertainty_score":0.3873067},"labels":[],"label_agreement":null},{"id":"W4415112137","doi":"10.48550/arxiv.2506.12648","title":"Glocal Smoothness: Line search and adaptive step sizes can help in theory too!","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Lipschitz continuity; Smoothness; Line search; Iterated function; Constant (computer programming); Conjugate gradient method; Gradient descent; Line (geometry)","score_opus":0.07470622997993834,"score_gpt":0.3311479336693621,"score_spread":0.25644170368942376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415112137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.730341,0.0011918014,0.26277804,0.002374702,0.0009718261,0.0005634624,0.000029092706,0.00018254171,0.0015674895],"genre_scores_gemma":[0.9914842,0.00023907934,0.0057069724,0.00057810376,0.00017934674,0.000073045485,0.0000053294257,0.0000168183,0.0017170574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970455,0.00043622925,0.0005194528,0.0011052735,0.00036767725,0.0005258337],"domain_scores_gemma":[0.99770963,0.00076902757,0.000103966675,0.0010730095,0.00020939956,0.00013498493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010430694,0.00036730195,0.00048965897,0.0002915438,0.00011515337,0.00017826942,0.001728512,0.00034316813,0.000024319195],"category_scores_gemma":[0.0003100963,0.00035302454,0.00009819502,0.00045937067,0.00037207428,0.00019130029,0.0038973757,0.0010967624,0.000048193036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025361707,0.00046426564,0.31227815,0.00040967917,0.0002282951,0.000388347,0.0191331,0.014238588,0.00034447436,0.16415146,0.00043922092,0.48767078],"study_design_scores_gemma":[0.00076278916,0.00083112076,0.2032678,0.003121075,0.00010492717,0.000026715114,0.008188455,0.5325625,0.06513555,0.18013068,0.0025673306,0.0033010403],"about_ca_topic_score_codex":0.002375385,"about_ca_topic_score_gemma":0.0019878745,"teacher_disagreement_score":0.5183239,"about_ca_system_score_codex":0.00018195098,"about_ca_system_score_gemma":0.0005782804,"threshold_uncertainty_score":0.9998922},"labels":[],"label_agreement":null},{"id":"W4415667420","doi":"10.55016/ojs/cdm.v20i2.73928","title":"On emulational equivalence of impartial games and the game Hackenforb","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Serbian Academy of Sciences and Arts; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Equivalence (formal languages); Isomorphism (crystallography); Equivalence class (music); Combinatorial game theory; Set (abstract data type); Core (optical fiber); Class (philosophy)","score_opus":0.019741303325044694,"score_gpt":0.3407739352407661,"score_spread":0.3210326319157214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02850515,0.0007526203,0.9504484,0.0154244695,0.0006376877,0.0014465435,0.0003263349,0.000055647524,0.0024031312],"genre_scores_gemma":[0.99295664,0.00007947087,0.0051999134,0.0005189438,0.00008371353,0.0001018262,0.000005435432,0.000012299268,0.0010417799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660575,0.00023950094,0.0013835432,0.0005509417,0.00061788183,0.0006023606],"domain_scores_gemma":[0.99346954,0.0037213962,0.0004576427,0.0012958045,0.0008709058,0.00018469535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015432425,0.0003798019,0.00072753365,0.000274673,0.00048571703,0.00043205413,0.0013498918,0.0001616693,0.00010642315],"category_scores_gemma":[0.0064705894,0.0002764057,0.0002725019,0.0011066751,0.0015655732,0.00030232305,0.0010146302,0.00033019792,0.00011892453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118430915,0.00013894633,0.000035053075,0.00010600651,0.00011040773,0.0000015220968,0.0042523993,0.00558816,0.00015897382,0.9829722,0.00092378975,0.005594118],"study_design_scores_gemma":[0.00054158905,0.00013511056,0.00021303137,0.0007066624,0.00012740883,0.000004663042,0.00033325932,0.50077456,0.005677852,0.49078208,0.0004795803,0.00022417468],"about_ca_topic_score_codex":0.00003215243,"about_ca_topic_score_gemma":0.000014377849,"teacher_disagreement_score":0.9644515,"about_ca_system_score_codex":0.00014677843,"about_ca_system_score_gemma":0.0004031793,"threshold_uncertainty_score":0.9999688},"labels":[],"label_agreement":null},{"id":"W4416013685","doi":"10.1609/aiide.v21i1.36844","title":"A Demonstration of Pathfinding-Based Puzzle Generation with Adaptive Difficulty","year":2025,"lang":"","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mechanism (biology); Repeated game; Genetic algorithm; Adaptive system; Game theory; Complete information","score_opus":0.05232882120266899,"score_gpt":0.2842592576433733,"score_spread":0.2319304364407043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416013685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5794061,0.00008275793,0.39050236,0.0037186274,0.0008964972,0.0020199858,0.00009946194,0.000049352057,0.023224864],"genre_scores_gemma":[0.9986423,0.000049155315,0.0005749462,0.00019808828,0.000053920474,0.00008306096,0.0000051977217,0.000019481458,0.00037385023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960909,0.000045151945,0.0014498145,0.001049348,0.00085069815,0.0005141186],"domain_scores_gemma":[0.99599487,0.00027935105,0.0013469936,0.00040715994,0.0018386922,0.00013291708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003611338,0.0006099428,0.000661343,0.0004038595,0.00030997113,0.00094411767,0.0012840773,0.00018556433,0.00003849452],"category_scores_gemma":[0.0003667802,0.00044418895,0.00026698975,0.0009399147,0.0012295606,0.0017101576,0.0004873765,0.00050439197,0.000014571645],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001741034,0.0020005775,0.0018993273,0.00017424657,0.00028240093,0.0000022455345,0.005201411,0.0012282209,0.0441268,0.6346719,0.00008529603,0.30858648],"study_design_scores_gemma":[0.00007645731,0.0017271613,0.00020325086,0.0019823867,0.00006952654,0.0000037860723,0.0051379674,0.3209452,0.6615914,0.007913908,0.000030254241,0.0003186839],"about_ca_topic_score_codex":0.00007230051,"about_ca_topic_score_gemma":0.000053036667,"teacher_disagreement_score":0.62675804,"about_ca_system_score_codex":0.0002512444,"about_ca_system_score_gemma":0.00031938407,"threshold_uncertainty_score":0.999801},"labels":[],"label_agreement":null},{"id":"W4416013893","doi":"10.1609/aiide.v21i1.36831","title":"From Frustration to Fun: An Adaptive Problem-Solving Puzzle Game Powered by Genetic Algorithm","year":2025,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adaptive system; Genetic algorithm; Adaptive learning; Foundation (evidence); Game theory; Adaptive strategies; Work (physics)","score_opus":0.029780246430615716,"score_gpt":0.28634659467329227,"score_spread":0.25656634824267655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416013893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36224878,0.000071892166,0.61566055,0.005854604,0.0007969186,0.0016360742,0.000111761845,0.00013801464,0.013481386],"genre_scores_gemma":[0.9932154,0.000025223095,0.0055783284,0.0005246458,0.000057234967,0.0000834274,0.0000054779744,0.000015369666,0.00049490324],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973379,0.00003064179,0.00078124687,0.0009272062,0.00049053115,0.00043246787],"domain_scores_gemma":[0.9983477,0.00014872386,0.0003570314,0.00035796684,0.0006070839,0.00018149464],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001752197,0.00038008334,0.00035109028,0.00020494527,0.0001958404,0.0012147047,0.001520429,0.00010443387,0.000047615078],"category_scores_gemma":[0.0001849218,0.00030875512,0.00012108956,0.00048002432,0.00027530492,0.0018904234,0.00065381796,0.0003112806,0.00005432395],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002994807,0.0007050649,0.00020004586,0.000015411153,0.00010257516,0.0000014327794,0.008608251,0.000064383625,0.032202154,0.114663094,0.00051205675,0.84262604],"study_design_scores_gemma":[0.000049899292,0.0013967453,0.0002480712,0.00065083,0.000023838951,0.0000027279311,0.012250183,0.09820138,0.6660918,0.21992959,0.0006954365,0.00045952768],"about_ca_topic_score_codex":0.000258955,"about_ca_topic_score_gemma":0.000025156514,"teacher_disagreement_score":0.84216654,"about_ca_system_score_codex":0.0001688322,"about_ca_system_score_gemma":0.000074780124,"threshold_uncertainty_score":0.99993646},"labels":[],"label_agreement":null},{"id":"W4416013988","doi":"10.1609/aiide.v21i1.36846","title":"FighterDDA: A Simulation Testbed for Evaluating Director-Based Dynamic Balancing","year":2025,"lang":"","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"University of California, Santa Cruz; National Science Foundation","keywords":"Testbed; Key (lock); Visualization","score_opus":0.06346907629870756,"score_gpt":0.3631617434673035,"score_spread":0.29969266716859594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416013988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33884174,0.00018551135,0.6395219,0.0067340657,0.0025866393,0.004256717,0.00015342014,0.00013192583,0.007588071],"genre_scores_gemma":[0.9970687,0.00002708401,0.0010931779,0.0006200839,0.00006160317,0.00023354417,0.0000067640804,0.00003509585,0.0008539155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508864,0.000059023198,0.0018024917,0.0014258098,0.00084199227,0.00078206236],"domain_scores_gemma":[0.99410206,0.0017848719,0.0012599664,0.0004987746,0.002188147,0.0001661695],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008266353,0.00075255753,0.00077745743,0.0004776473,0.0005955035,0.002011027,0.0017587908,0.00021965348,0.000056493325],"category_scores_gemma":[0.0032816855,0.0006200342,0.00048415648,0.0008671183,0.00065756723,0.0017988265,0.0008042532,0.0005430105,0.000029605724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017854909,0.0012804482,0.00094891497,0.0005015219,0.0002710899,9.1525226e-7,0.0040872907,0.008986161,0.027057908,0.13334358,0.000069054324,0.8216676],"study_design_scores_gemma":[0.00009537787,0.0011366154,0.0001614818,0.002904276,0.00007816563,9.800655e-7,0.0022788106,0.7297922,0.21460308,0.048415292,0.00013044525,0.00040329114],"about_ca_topic_score_codex":0.000035232813,"about_ca_topic_score_gemma":0.000014828885,"teacher_disagreement_score":0.8212643,"about_ca_system_score_codex":0.00054449274,"about_ca_system_score_gemma":0.00037179532,"threshold_uncertainty_score":0.9996251},"labels":[],"label_agreement":null},{"id":"W4416014000","doi":"10.1609/aiide.v21i1.36843","title":"Learning Finite State Machines with Gameplay Video","year":2025,"lang":"","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute; Canadian Institute for Advanced Research","keywords":"Video game; State (computer science); Video game development; Finite-state machine; Artificial neural network; Game mechanics; Game design; Turns, rounds and time-keeping systems in games","score_opus":0.027167471201064174,"score_gpt":0.2842584463941619,"score_spread":0.25709097519309776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416014000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7487553,0.00028385394,0.15230724,0.012071046,0.0022594586,0.002859223,0.00009721573,0.00021463097,0.08115205],"genre_scores_gemma":[0.9924586,0.0003429365,0.00023380392,0.0006178455,0.00006209386,0.00008496626,0.000002649166,0.000039030172,0.0061581205],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9948568,0.00007327053,0.0015997002,0.0015388163,0.000993459,0.00093798985],"domain_scores_gemma":[0.99569964,0.0007754195,0.0012125161,0.00052099663,0.001551755,0.00023968761],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00054393243,0.0009231659,0.00086069905,0.0005301957,0.0006007346,0.00291089,0.0022952072,0.00017154175,0.00013230753],"category_scores_gemma":[0.0012477323,0.0006590908,0.00032710598,0.0012012366,0.0014856044,0.0026278726,0.0016448835,0.001274159,0.000114017545],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001995193,0.0010485661,0.0044005997,0.00023520282,0.00043494912,0.000010635477,0.013263947,0.001613505,0.0031692344,0.18501134,0.00013254375,0.7886843],"study_design_scores_gemma":[0.00016414828,0.0043084794,0.0005119325,0.006844753,0.00014131096,0.000030888576,0.014568355,0.40921006,0.45181176,0.1093842,0.0018031334,0.0012209615],"about_ca_topic_score_codex":0.00012255524,"about_ca_topic_score_gemma":0.000034544762,"teacher_disagreement_score":0.7874633,"about_ca_system_score_codex":0.0002581751,"about_ca_system_score_gemma":0.00027085043,"threshold_uncertainty_score":0.99958605},"labels":[],"label_agreement":null},{"id":"W4416014001","doi":"10.1609/aiide.v21i1.36826","title":"From Unstable to Playable: Stabilizing Angry Birds Levels via Object Segmentation","year":2025,"lang":"","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Segmentation; Object (grammar); Stability (learning theory); Image segmentation; Scale-space segmentation; Range (aeronautics); Segmentation-based object categorization","score_opus":0.051387093815825034,"score_gpt":0.3162434175093751,"score_spread":0.2648563236935501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416014001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67672586,0.0001733221,0.28731132,0.007819362,0.0036072969,0.0029398035,0.00032512887,0.00012977503,0.020968147],"genre_scores_gemma":[0.9962081,0.00008665039,0.0009139534,0.0011251578,0.00014605971,0.00013446578,0.000005884517,0.000039300252,0.0013404458],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99420565,0.00007203874,0.0019087302,0.0017661905,0.0010787827,0.00096861843],"domain_scores_gemma":[0.9960365,0.0006375987,0.00092995557,0.00064580364,0.0014302457,0.00031986565],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005892435,0.00087352644,0.00086444704,0.00059702346,0.00054430944,0.0028427178,0.0024276741,0.00023403048,0.00029437957],"category_scores_gemma":[0.000987616,0.00074071914,0.0003365325,0.001529684,0.0006839717,0.003247129,0.0020758305,0.00073682796,0.00019479357],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011376775,0.0013216635,0.0020156994,0.00016557075,0.00040922794,0.0000034064212,0.022544978,0.000425846,0.14805064,0.09324609,0.0004598703,0.7302193],"study_design_scores_gemma":[0.00007380271,0.0009587583,0.00030681584,0.0025390754,0.000075971126,0.0000028181946,0.023223964,0.06206322,0.82796085,0.081747815,0.00041567945,0.0006312301],"about_ca_topic_score_codex":0.00065263326,"about_ca_topic_score_gemma":0.00006450728,"teacher_disagreement_score":0.7295881,"about_ca_system_score_codex":0.0006622413,"about_ca_system_score_gemma":0.0003317129,"threshold_uncertainty_score":0.9995044},"labels":[],"label_agreement":null},{"id":"W4416014026","doi":"10.1609/aiide.v21i1.36835","title":"Designer Difficulties: Visualizing the Possibility Spaces of Dynamic Difficulty Adjustment Systems","year":2025,"lang":"","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Engineering and Physical Sciences Research Council; National Science Foundation","keywords":"Variety (cybernetics); Scope (computer science); Visualization; Range (aeronautics); Video game; Cluster analysis; Diversity (politics)","score_opus":0.04044230509891247,"score_gpt":0.3146537120705299,"score_spread":0.2742114069716174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416014026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9358084,0.0010751379,0.044231508,0.004832988,0.0034648515,0.0034765834,0.00013508686,0.000074186864,0.0069012097],"genre_scores_gemma":[0.9975298,0.00047452524,0.00008568355,0.00019844752,0.000062549145,0.00013354303,0.0000027444746,0.000025771806,0.0014869341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9941273,0.0001397343,0.0023529443,0.0013835317,0.0011776328,0.000818894],"domain_scores_gemma":[0.9944884,0.0009069584,0.0018183338,0.0008093907,0.0018035735,0.00017333622],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00084419444,0.0008620375,0.0010165407,0.00032598915,0.0005507636,0.0020002893,0.0030159347,0.00023140475,0.000044079876],"category_scores_gemma":[0.0011081714,0.0005273674,0.0005261658,0.001021541,0.0022290847,0.0015997071,0.0018932128,0.00075436546,0.00002797666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013757888,0.0032928332,0.0014968131,0.00083406945,0.00078461604,0.0000018073315,0.029330304,0.00064433203,0.03959535,0.5495962,0.00031184818,0.37273604],"study_design_scores_gemma":[0.00014811356,0.0020399322,0.003491831,0.007593615,0.0002629385,0.000013206014,0.10972584,0.4095906,0.43428063,0.031610034,0.00026532874,0.0009779236],"about_ca_topic_score_codex":0.00030563056,"about_ca_topic_score_gemma":0.00003151891,"teacher_disagreement_score":0.5179862,"about_ca_system_score_codex":0.0004947241,"about_ca_system_score_gemma":0.00024869852,"threshold_uncertainty_score":0.9997178},"labels":[],"label_agreement":null},{"id":"W4416014029","doi":"10.1609/aiide.v21i1.36821","title":"Signals of Struggle: Detecting Player Difficulties Using Machine Learning","year":2025,"lang":"","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random forest; Set (abstract data type); Feature (linguistics); Window (computing); Feature extraction; Cognition","score_opus":0.05538629029033634,"score_gpt":0.30826373499632204,"score_spread":0.2528774447059857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416014029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9357463,0.00030793555,0.05426709,0.001067883,0.0011854625,0.0011267469,0.000062309504,0.000056754343,0.0061794817],"genre_scores_gemma":[0.9982834,0.00019768748,0.0004542798,0.00013148658,0.00006013446,0.000025883493,0.0000016381604,0.000030184809,0.0008153239],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99503845,0.00008277575,0.002083939,0.001138324,0.0009060768,0.0007504352],"domain_scores_gemma":[0.99542207,0.0006736821,0.001790834,0.00039320168,0.0015602112,0.00015999512],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006112334,0.0007568703,0.0009576083,0.0005477089,0.00052988896,0.0012537638,0.0019285056,0.00022405035,0.0001159064],"category_scores_gemma":[0.0016897927,0.0006055541,0.00044113243,0.0010254792,0.0011988397,0.0018957104,0.0018857542,0.0010158089,0.000016355996],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018542275,0.0019395404,0.010152436,0.00071482226,0.0008088709,0.0000040286327,0.022588916,0.0050900225,0.29724985,0.16226304,0.00004267688,0.49729156],"study_design_scores_gemma":[0.000049074493,0.00068182976,0.00009516448,0.0026573902,0.00006668135,0.000006125973,0.011632621,0.34431013,0.6277329,0.012367226,0.00005404199,0.0003468267],"about_ca_topic_score_codex":0.00025224718,"about_ca_topic_score_gemma":0.000022212096,"teacher_disagreement_score":0.49694473,"about_ca_system_score_codex":0.00026835236,"about_ca_system_score_gemma":0.00021243363,"threshold_uncertainty_score":0.99978304},"labels":[],"label_agreement":null},{"id":"W4416014030","doi":"10.1609/aiide.v21i1.36852","title":"Embedded Mechanics Generation","year":2025,"lang":"","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Metric (unit); Game design; Game mechanics; Measure (data warehouse); Reinforcement learning; Video game","score_opus":0.058234964383599694,"score_gpt":0.3079348827911407,"score_spread":0.24969991840754097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416014030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3608424,0.00046850237,0.50503594,0.023303995,0.009426116,0.0044384706,0.00015184055,0.00021571269,0.096117035],"genre_scores_gemma":[0.99568176,0.00032526723,0.00029129226,0.0009618672,0.00015094802,0.00008225216,0.000003528134,0.000027303293,0.002475764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99511933,0.000054728054,0.0017402031,0.001420358,0.0009042827,0.0007610702],"domain_scores_gemma":[0.9963239,0.00025503748,0.0010178607,0.00061363925,0.0015894832,0.00020010592],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00055241917,0.0007586369,0.00072060234,0.0004546139,0.00051756244,0.002565349,0.0023601055,0.0002637544,0.0001550153],"category_scores_gemma":[0.0010269475,0.0006127295,0.00040621794,0.0010171258,0.0006591412,0.0024302744,0.0017372107,0.00077321124,0.00012861668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025161263,0.0006736321,0.00009480749,0.00007653884,0.00015842264,0.0000011248219,0.0040290607,0.00009832665,0.020083193,0.6370309,0.00041104108,0.33709133],"study_design_scores_gemma":[0.00004394188,0.0006537851,0.000024279401,0.0011863274,0.000058663678,0.000005276151,0.0058511137,0.34539708,0.51845145,0.12741709,0.0004971035,0.00041388755],"about_ca_topic_score_codex":0.000043369684,"about_ca_topic_score_gemma":0.000016646312,"teacher_disagreement_score":0.63483936,"about_ca_system_score_codex":0.00034232833,"about_ca_system_score_gemma":0.00026687718,"threshold_uncertainty_score":0.9996324},"labels":[],"label_agreement":null},{"id":"W4416014037","doi":"10.1609/aiide.v21i1.36808","title":"Time-based Chart Partitioning: Improving Local Coherency in Rhythm Game Chart Generation","year":2025,"lang":"","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute; Canadian Institute for Advanced Research","keywords":"Chart; Synchronizing; Rhythm; Matching (statistics); Process (computing); Smith chart","score_opus":0.04021008914775195,"score_gpt":0.28501058822491154,"score_spread":0.2448004990771596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416014037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68574446,0.0002672334,0.2723976,0.014275086,0.0028770282,0.0036044118,0.000102460435,0.00014491811,0.02058679],"genre_scores_gemma":[0.997188,0.000081523496,0.00016162307,0.00083688786,0.00013449084,0.00019413503,0.000009520482,0.0000319258,0.001361923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453574,0.00008258923,0.0020319452,0.0015492553,0.0008638005,0.0009366505],"domain_scores_gemma":[0.9967816,0.00030181432,0.0010383382,0.0005326095,0.0011350249,0.00021065433],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00069617963,0.0008020848,0.0008248111,0.0006351155,0.00034444866,0.0018634875,0.0015504595,0.00027906953,0.0002724742],"category_scores_gemma":[0.00077311386,0.00070186384,0.0003463756,0.0011181886,0.0013944034,0.0024385094,0.00092306914,0.0008886146,0.00021292143],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009257239,0.0022921998,0.0013125943,0.0002824686,0.00015500186,0.000008474321,0.0070348918,0.0017717268,0.04557426,0.18145125,0.0003459429,0.75884545],"study_design_scores_gemma":[0.00009019069,0.0006349201,0.0001382203,0.0018381164,0.000031435306,0.0000046798177,0.003155775,0.54748696,0.43475872,0.011230766,0.00019064598,0.0004395661],"about_ca_topic_score_codex":0.00013876386,"about_ca_topic_score_gemma":0.000056617868,"teacher_disagreement_score":0.7584059,"about_ca_system_score_codex":0.0005946012,"about_ca_system_score_gemma":0.0004401232,"threshold_uncertainty_score":0.99954325},"labels":[],"label_agreement":null},{"id":"W4416016662","doi":"10.1016/j.jet.2025.106107","title":"On the timing of moves in two-player games","year":2025,"lang":"en","type":"article","venue":"Journal of Economic Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal; Deutsche Forschungsgemeinschaft; Budapesti Corvinus Egyetem; University of California Berkeley","keywords":"Action (physics); Representation (politics); Scope (computer science); Relation (database); Competition (biology); Product (mathematics)","score_opus":0.02732995534651887,"score_gpt":0.3130850365231852,"score_spread":0.2857550811766663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416016662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9454235,0.00026591378,0.03560741,0.0018079219,0.0007847269,0.00005458403,4.872773e-7,0.000005132458,0.01605037],"genre_scores_gemma":[0.99825644,0.000020654119,0.00089831336,0.0004644917,0.000045523055,8.2202814e-7,1.1579179e-8,0.000002851103,0.0003108631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991416,0.00013221728,0.00047750433,0.00008939733,0.00005230034,0.000106991596],"domain_scores_gemma":[0.99781734,0.0015749075,0.0003092588,0.00025015557,0.000029456975,0.000018910312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015669243,0.00006538275,0.00017291354,0.00020346616,0.000026799158,0.00004082684,0.00083705044,0.000020594047,0.00009434409],"category_scores_gemma":[0.00022179347,0.00004411784,0.000087967856,0.00007545801,0.00007971995,0.00022904052,0.00008762778,0.00017025249,0.000024500854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027996048,0.000024091747,0.00055518694,0.000002471096,0.000022886072,0.0000037332572,0.0008464446,0.011095924,0.000496114,0.96557564,0.0005867485,0.02076274],"study_design_scores_gemma":[0.000092546295,0.0000443914,0.0008720878,0.00012397023,0.0000044079056,0.000007518575,0.0006238748,0.016725317,0.035594247,0.9455179,0.00033724346,0.000056476354],"about_ca_topic_score_codex":0.000010323862,"about_ca_topic_score_gemma":0.000015154622,"teacher_disagreement_score":0.052833013,"about_ca_system_score_codex":0.00007771869,"about_ca_system_score_gemma":0.00011810935,"threshold_uncertainty_score":0.17990734},"labels":[],"label_agreement":null},{"id":"W4416037659","doi":"10.18653/v1/2025.arabicnlp-main.15","title":"Tahdib: A Rhythm-Aware Phrase Insertion for Classical Arabic Poetry Composition","year":2025,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Composition (language); Phrase; Poetry; Arabic; Component (thermodynamics)","score_opus":0.033851280293163165,"score_gpt":0.3232927644636221,"score_spread":0.28944148417045895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416037659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03723441,0.0003397942,0.9334839,0.019874033,0.003721419,0.0013260301,0.000023937333,0.00038601787,0.0036104345],"genre_scores_gemma":[0.97561336,0.00006026545,0.014379398,0.0036221023,0.00042330538,0.00018438838,0.00002380429,0.000026040896,0.005667368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995933,0.00023107865,0.0011560444,0.0012971797,0.0005014191,0.00088125345],"domain_scores_gemma":[0.9972033,0.00055367936,0.0002640735,0.0010778779,0.0006554141,0.00024567777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057061063,0.0004916234,0.00053869805,0.00044373242,0.00072773226,0.0007609142,0.0010947647,0.0004418165,0.00020061675],"category_scores_gemma":[0.00021165403,0.00049842877,0.0004073888,0.0013811154,0.00040823038,0.0011822848,0.00050931063,0.00045444292,0.00044505118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003704794,0.0010965731,0.00068809284,0.00031874908,0.00012961675,0.00003262287,0.0009188749,0.0013436315,0.008686065,0.46670628,0.022343572,0.49736544],"study_design_scores_gemma":[0.0003862867,0.00040775927,0.0007635464,0.0004429006,0.00007565097,0.00002272557,0.0002961072,0.8866651,0.063904576,0.0379602,0.008513184,0.0005619484],"about_ca_topic_score_codex":0.00007669154,"about_ca_topic_score_gemma":0.000096523785,"teacher_disagreement_score":0.93837893,"about_ca_system_score_codex":0.00041892193,"about_ca_system_score_gemma":0.00055385544,"threshold_uncertainty_score":0.99974674},"labels":[],"label_agreement":null},{"id":"W4416675356","doi":"10.22541/au.176405957.77536600/v1","title":"Hybrid Multi-Agent AI/MCTS Systems for Complex Information-Imperfect Games","year":2025,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Selection (genetic algorithm); Perfect information; Imperfect; Complete information; Information system","score_opus":0.05728252792576748,"score_gpt":0.32869936898366586,"score_spread":0.2714168410578984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416675356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019943218,0.0011497337,0.9759298,0.003608887,0.008251228,0.003115529,0.00008729517,0.00037483807,0.005488368],"genre_scores_gemma":[0.96036273,0.00023067495,0.024808433,0.0050738407,0.00021959093,0.00040380878,0.00003550112,0.000022297441,0.008843142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995271,0.0002114336,0.0019621141,0.00081411534,0.0006152199,0.0011261004],"domain_scores_gemma":[0.9956763,0.0008501226,0.00044862236,0.001472692,0.0012732432,0.00027906286],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009908534,0.00061194587,0.0007483709,0.0006228399,0.00078688253,0.0027743606,0.0023486062,0.00018546793,0.00019036878],"category_scores_gemma":[0.0007301484,0.00057713786,0.00041046666,0.00080615067,0.00033400988,0.0031095098,0.0008678286,0.00032468472,0.001259707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008975887,0.00050103257,0.00087212113,0.0014088596,0.00039789214,0.000009616551,0.0043451465,0.04175451,0.00045679614,0.3651724,0.25015196,0.3348399],"study_design_scores_gemma":[0.00031579734,0.00017355429,0.0003053134,0.00024143315,0.000042894433,0.000010627077,0.0006983627,0.7714228,0.00805217,0.0011197702,0.21714234,0.00047492472],"about_ca_topic_score_codex":0.00086122035,"about_ca_topic_score_gemma":0.00005607777,"teacher_disagreement_score":0.95836836,"about_ca_system_score_codex":0.00035438754,"about_ca_system_score_gemma":0.0007662854,"threshold_uncertainty_score":0.999668},"labels":[],"label_agreement":null},{"id":"W4416683196","doi":"10.1016/j.tcs.2025.115656","title":"A tractability gap beyond nim-sums: It’s hard to tell whether a bunch of superstars are losers","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Blackout; Simple (philosophy); Intersection (aeronautics); Game theory; Coin flipping","score_opus":0.027934155587959867,"score_gpt":0.30095544958869885,"score_spread":0.273021294000739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416683196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20986421,0.00002412566,0.7727018,0.010345404,0.0008604476,0.0004084734,0.000007497152,0.00014162512,0.0056464206],"genre_scores_gemma":[0.8861919,0.0000031935642,0.110142015,0.0035126633,0.00005005366,0.000014322373,2.3175501e-7,0.000008836408,0.00007674935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590576,0.00022218606,0.0006926259,0.0012875015,0.0010471501,0.00084476755],"domain_scores_gemma":[0.9963918,0.00075999706,0.0001205239,0.0017586668,0.0005846447,0.0003844016],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0027002126,0.00030407263,0.00046591723,0.00043122855,0.00030474475,0.00031357037,0.0047139265,0.00010806407,0.000121682126],"category_scores_gemma":[0.0006335639,0.0002605144,0.0001644233,0.002890264,0.0044877296,0.00073963945,0.0017028169,0.00031760248,0.00015110322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003597077,0.00023256842,0.00138043,0.00003243114,0.0000111914915,0.000008846326,0.003792936,0.0006294843,0.003776882,0.9569658,0.0011941053,0.031939372],"study_design_scores_gemma":[0.00021201193,0.0006961675,0.0063432325,0.00030688784,0.000022060829,0.000014405317,0.00055585575,0.3009477,0.12311936,0.5653357,0.0016986394,0.0007480231],"about_ca_topic_score_codex":0.000038709542,"about_ca_topic_score_gemma":0.000018556073,"teacher_disagreement_score":0.6763277,"about_ca_system_score_codex":0.00017899573,"about_ca_system_score_gemma":0.00038943248,"threshold_uncertainty_score":0.9999847},"labels":[],"label_agreement":null},{"id":"W4416799927","doi":"10.1109/snpd65828.2025.11253149","title":"Chess Game Outcome Prediction Using Machine Learning","year":2025,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Random forest; Outcome (game theory); Classifier (UML); Training set; Learning classifier system; Deep learning","score_opus":0.07873037848684696,"score_gpt":0.3472816358506216,"score_spread":0.26855125736377466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416799927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07000881,0.00083357847,0.91006607,0.0011821245,0.004507309,0.000344035,0.000004121991,0.00043328464,0.012620699],"genre_scores_gemma":[0.9567322,0.00006419905,0.014021292,0.0005977796,0.00020541136,0.0000075411745,0.0000019435024,0.000021048398,0.028348556],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622375,0.0002871579,0.0012316019,0.0009905236,0.0005165941,0.0007503641],"domain_scores_gemma":[0.99820775,0.00026867221,0.00025091608,0.0008313581,0.00028416308,0.000157135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009969353,0.00040604806,0.00046580945,0.00045671756,0.0005560385,0.00074737787,0.0012835705,0.00026647814,0.0005836991],"category_scores_gemma":[0.00045067587,0.00040956688,0.00022556556,0.0015994302,0.00026209812,0.0010544774,0.001068842,0.0008549209,0.0003006992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004255596,0.00030427097,0.567836,0.00018063231,0.00017283464,0.00003424581,0.0032738515,0.121169195,0.0077620386,0.07501702,0.00017589075,0.22403151],"study_design_scores_gemma":[0.000097638454,0.000085591484,0.0022716497,0.00015479622,0.00005485545,0.0000099203035,0.00022019146,0.96840817,0.020434368,0.0027835036,0.005172383,0.00030692873],"about_ca_topic_score_codex":0.00095409824,"about_ca_topic_score_gemma":0.000085619235,"teacher_disagreement_score":0.89604473,"about_ca_system_score_codex":0.00033336238,"about_ca_system_score_gemma":0.00026050012,"threshold_uncertainty_score":0.9998356},"labels":[],"label_agreement":null},{"id":"W4416830129","doi":"10.1007/978-3-032-12405-0_23","title":"Searching Playtrace Data to Identify and Evaluate Dramatic Arcs in Game Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Narrative; Testbed; Process (computing); Game design; Iterative and incremental development; Arc (geometry); Plot (graphics); Video game; Experiential learning","score_opus":0.08777442122237646,"score_gpt":0.37309092684116757,"score_spread":0.2853165056187911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416830129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013521836,0.0009869187,0.9920611,0.0012550127,0.0020629463,0.0009432934,0.000011024809,0.0001126416,0.0012148742],"genre_scores_gemma":[0.6613089,0.000109229586,0.33482358,0.0017403612,0.00046936,0.000036794216,0.000012726077,0.000056111014,0.0014429378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943899,0.00014485982,0.0008796277,0.0023666732,0.0013853007,0.0008336176],"domain_scores_gemma":[0.9946574,0.0016615737,0.00022428756,0.003017663,0.0002064538,0.00023264135],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0037540249,0.0005120356,0.0006704089,0.0016412523,0.0001895113,0.0019239363,0.007984517,0.0002527176,0.000007900823],"category_scores_gemma":[0.0007947481,0.00049040426,0.000047888014,0.0011320317,0.00054703705,0.0011507754,0.007125532,0.0010884639,0.00008931979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073244646,0.000026624788,0.00013577468,0.00022248179,0.000013547176,0.00017262902,0.0037505063,0.16944818,0.0002966887,0.025054058,0.00007013185,0.80080205],"study_design_scores_gemma":[0.000065975444,0.000064925014,0.00021669384,0.0019279295,0.0000068575505,0.000042112344,0.0000017060411,0.9284091,0.00026640078,0.06781603,0.0007034328,0.00047881858],"about_ca_topic_score_codex":0.00032169733,"about_ca_topic_score_gemma":0.00057090353,"teacher_disagreement_score":0.80032325,"about_ca_system_score_codex":0.0003339227,"about_ca_system_score_gemma":0.00076907105,"threshold_uncertainty_score":0.9997548},"labels":[],"label_agreement":null},{"id":"W4416957038","doi":"10.1145/3774399.3774405","title":"Interpolating Humour — Can Lines Be Funny?","year":2025,"lang":"en","type":"article","venue":"AI Matters","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Point (geometry); Observable; Interpolation (computer graphics); Calculus (dental); Key (lock); Line (geometry); Algebra over a field","score_opus":0.02322144989524311,"score_gpt":0.3081880027466363,"score_spread":0.2849665528513932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416957038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014923753,0.000049120423,0.5817978,0.39962035,0.001378814,0.00011359081,0.000001874022,0.00027387857,0.0018408623],"genre_scores_gemma":[0.8006689,0.000002679789,0.011003407,0.18617937,0.00007149499,0.000012037207,0.0000010456723,0.000008108266,0.002052973],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990752,0.000035127447,0.00023232683,0.0002799147,0.00012664388,0.00025081632],"domain_scores_gemma":[0.99930227,0.00012026812,0.000053572792,0.00042260825,0.000056294444,0.00004497855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013997169,0.00011060115,0.00011599791,0.00013235334,0.00011206682,0.00020883784,0.0008344623,0.000037630372,0.000034782202],"category_scores_gemma":[0.00004841132,0.000107130436,0.000054296484,0.00033222136,0.000060038357,0.00025165515,0.00033692608,0.00013514608,0.0000846329],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009781599,0.000084349456,0.0114220055,0.00007775862,0.00009292954,0.000049990307,0.008902408,0.0007134937,0.016764846,0.16807365,0.558204,0.23560478],"study_design_scores_gemma":[0.00024398012,0.00014091116,0.0037020056,0.00058267417,0.000038623668,0.00002598421,0.00235782,0.3044711,0.18346255,0.07970976,0.42406645,0.0011981234],"about_ca_topic_score_codex":0.00034739744,"about_ca_topic_score_gemma":0.00016776152,"teacher_disagreement_score":0.78574514,"about_ca_system_score_codex":0.00004396171,"about_ca_system_score_gemma":0.000050604052,"threshold_uncertainty_score":0.43686524},"labels":[],"label_agreement":null},{"id":"W4416957059","doi":"10.1145/3774399.3774404","title":"Adapting BERT for 'Apples to Apples' Gameplay","year":2025,"lang":"en","type":"article","venue":"AI Matters","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Focus (optics); Selection (genetic algorithm); Variety (cybernetics); Matching (statistics); Consistency (knowledge bases); Classifier (UML); Word (group theory); Noun","score_opus":0.019943672666975137,"score_gpt":0.3140304022379823,"score_spread":0.2940867295710071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416957059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021810692,0.000024014445,0.8665166,0.12988831,0.00052841986,0.00033505287,0.0000032912292,0.00015128832,0.00037198083],"genre_scores_gemma":[0.502797,0.0000033020697,0.20544241,0.2876562,0.00014629976,0.00033068887,0.0000037039883,0.00002490518,0.0035954611],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888873,0.000020445972,0.00023853662,0.00038024527,0.00013537295,0.0003366497],"domain_scores_gemma":[0.9990764,0.00029599137,0.00004237281,0.00045026632,0.000065728455,0.00006919601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023071782,0.00012345772,0.00014342695,0.00013938549,0.00012798769,0.0001896695,0.0009002932,0.000040625757,0.00001778804],"category_scores_gemma":[0.000057743586,0.00012321532,0.00006957972,0.00034189667,0.00003705154,0.00021529247,0.0002681751,0.00007424983,0.0002213817],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012268309,0.000036576643,0.00066499464,0.00004802351,0.000034641427,0.0000041940084,0.0020036413,0.002026782,0.009532335,0.17189252,0.70017284,0.11357116],"study_design_scores_gemma":[0.00008896193,0.00006493602,0.0003006972,0.00012067834,0.00001124723,0.0000031944664,0.0004120184,0.028652644,0.07447347,0.015797433,0.87973374,0.000340986],"about_ca_topic_score_codex":0.00009774533,"about_ca_topic_score_gemma":0.00006643286,"teacher_disagreement_score":0.66107416,"about_ca_system_score_codex":0.000045798322,"about_ca_system_score_gemma":0.0000470287,"threshold_uncertainty_score":0.50245744},"labels":[],"label_agreement":null},{"id":"W4452397","doi":"","title":"Characterization of Polygons Searchable by a Boundary 1-Searcher.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Polygon (computer graphics); Boundary (topology); Computer science; Schedule; Visibility polygon; Combinatorics; Simple polygon; Mathematics; Monotone polygon; Geometry; Computer network","score_opus":0.031280114097779504,"score_gpt":0.26983664738800195,"score_spread":0.23855653329022244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4452397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41630587,0.000071221024,0.56479937,0.00576793,0.00032742694,0.0003073246,0.00032067334,0.000099310455,0.012000856],"genre_scores_gemma":[0.9944805,0.0000045068036,0.0035556713,0.00051040744,0.000056715857,0.00001173882,0.00021795317,0.000011768723,0.0011507674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998288,0.00007690499,0.00032910728,0.0003725268,0.0004999696,0.00043352362],"domain_scores_gemma":[0.99871945,0.0001582898,0.000112092705,0.00029485658,0.0004355869,0.00027970626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002534605,0.00014876304,0.00017236006,0.00061256386,0.00020459024,0.00023254447,0.00072731456,0.000087912245,0.00030039635],"category_scores_gemma":[0.000058751746,0.00016799694,0.000052198222,0.00097433943,0.00020639856,0.00035583522,0.000064109896,0.00018617968,0.0002041703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013751514,0.00018738671,0.004950182,0.000033066517,0.00003485164,0.000029611781,0.00036615744,0.005665336,0.022022318,0.89949095,0.007946502,0.05925988],"study_design_scores_gemma":[0.00035599095,0.00042965636,0.06345355,0.00014952951,0.0000094287125,0.000027290804,0.00015244614,0.68945986,0.03418998,0.18315795,0.027606156,0.0010081731],"about_ca_topic_score_codex":0.023026716,"about_ca_topic_score_gemma":0.005760689,"teacher_disagreement_score":0.716333,"about_ca_system_score_codex":0.00019481793,"about_ca_system_score_gemma":0.0016916418,"threshold_uncertainty_score":0.983479},"labels":[],"label_agreement":null},{"id":"W45528085","doi":"","title":"Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go.","year":2005,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Divide and conquer algorithms; Decomposition; Computer science; Position (finance); Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.034497045386973894,"score_gpt":0.31569889433962833,"score_spread":0.28120184895265443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45528085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19259489,0.00011549907,0.7934755,0.0112773795,0.00000952264,0.0006694455,7.454786e-7,0.000053665357,0.0018033531],"genre_scores_gemma":[0.9241787,0.000022979804,0.07494827,0.00053466496,0.000017142847,0.000105282845,0.0000014251267,0.0000044383582,0.00018709817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912,0.000058417052,0.00016663283,0.00032334373,0.00015037034,0.0001812463],"domain_scores_gemma":[0.99957925,0.0000692234,0.000024239935,0.00021963136,0.00004329058,0.00006436397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000406811,0.00007833834,0.00007990748,0.00007655432,0.000086860964,0.0001352858,0.00031459212,0.00003576879,0.0000033983194],"category_scores_gemma":[0.000010509596,0.000059036116,0.000009209524,0.00024585525,0.000037035803,0.0003507384,0.00024099852,0.00009545576,0.000070996386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015292457,0.00020357207,0.0024369238,0.000032636362,0.000010875376,7.8397557e-7,0.009764447,0.012772475,0.013476768,0.1961853,0.00014684572,0.7649541],"study_design_scores_gemma":[0.00004383231,0.000033950106,0.00588788,0.0000110373585,0.0000017530197,0.0000053227877,0.00008871912,0.98444843,0.00531395,0.0030247595,0.0010352958,0.000105071136],"about_ca_topic_score_codex":0.00007886784,"about_ca_topic_score_gemma":0.00051682844,"teacher_disagreement_score":0.97167593,"about_ca_system_score_codex":0.000044163447,"about_ca_system_score_gemma":0.000015528361,"threshold_uncertainty_score":0.2407423},"labels":[],"label_agreement":null},{"id":"W4820853","doi":"","title":"Towards a Characterisation of Lottery Set Overlapping Structures.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lottery; Cardinality (data modeling); Mathematics; Combinatorics; Set (abstract data type); Cardinal number (linguistics); Discrete mathematics; Computer science; Statistics","score_opus":0.028602432087535233,"score_gpt":0.28733000976383855,"score_spread":0.25872757767630333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4820853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94087905,0.000050824856,0.054437064,0.00018830823,0.002582375,0.00012873788,0.0000017643106,0.00011017719,0.0016216987],"genre_scores_gemma":[0.9963682,0.0000069120924,0.0034155096,0.00014443426,0.0000193762,0.0000025055263,0.0000027641445,0.000008988206,0.00003127127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866927,0.00003732905,0.0003959921,0.00026525333,0.00035263578,0.0002795113],"domain_scores_gemma":[0.9989742,0.00010993023,0.00020526639,0.0004929381,0.00014386294,0.000073779214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056462165,0.0001258042,0.00018131713,0.00013770843,0.00006478243,0.00006375387,0.00068864744,0.00008556506,0.000028514502],"category_scores_gemma":[0.00011073586,0.0001266186,0.00006446413,0.00038844324,0.00006853814,0.0004784204,0.00019405007,0.00013152268,0.000028561777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010496394,0.000036531677,0.0034481438,0.00001561832,0.000016150461,0.000012329471,0.0026579155,0.000010588009,0.014611636,0.91259027,0.00018014152,0.066410184],"study_design_scores_gemma":[0.00013365639,0.000101247446,0.08144175,0.000031581072,0.0000054167513,0.000010630847,0.00015201126,0.0022751074,0.19408406,0.72051543,0.0010186905,0.0002304417],"about_ca_topic_score_codex":0.000087993176,"about_ca_topic_score_gemma":0.0000054375582,"teacher_disagreement_score":0.19207487,"about_ca_system_score_codex":0.000066110864,"about_ca_system_score_gemma":0.00006252806,"threshold_uncertainty_score":0.51633567},"labels":[],"label_agreement":null},{"id":"W4832415","doi":"","title":"Cognitive Multi-character Systems for Interactive Entertainment","year":2000,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Entertainment; Computer science; Character (mathematics); Context (archaeology); Point (geometry); Process (computing); Field (mathematics); Interactive computing; Human–computer interaction; Data science","score_opus":0.04703542279544361,"score_gpt":0.3253109951816254,"score_spread":0.2782755723861818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4832415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03193236,0.00005401196,0.96160257,0.00033263207,0.0006040573,0.00072206365,0.000009926006,0.00016335017,0.0045790276],"genre_scores_gemma":[0.9800502,0.000021103873,0.008416834,0.00067843666,0.00009759503,0.00023021206,0.0000043022796,0.000010428927,0.010490885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988908,0.00004758533,0.00026115065,0.0003740522,0.00015146223,0.0002749427],"domain_scores_gemma":[0.9991394,0.00034926363,0.000058726277,0.00023479685,0.000140885,0.00007687096],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001517835,0.00013465638,0.00014415306,0.000053969343,0.00008661837,0.00021553089,0.00044246434,0.000043483484,0.00030786055],"category_scores_gemma":[0.00004620526,0.000111721245,0.00008001358,0.000089162575,0.000039983173,0.0005939103,0.00006571958,0.00007588944,0.000866717],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026812736,0.001113701,0.0011061094,0.000047249505,0.00024901706,0.000036440102,0.016564053,0.0005840882,0.0013461413,0.036233462,0.0033552777,0.93909633],"study_design_scores_gemma":[0.000491824,0.0003590642,0.0007728266,0.00015653975,0.000017223476,0.000024701858,0.0020258492,0.9222233,0.03764598,0.00085999916,0.034921344,0.00050132873],"about_ca_topic_score_codex":0.000105259714,"about_ca_topic_score_gemma":0.000012983012,"teacher_disagreement_score":0.95318574,"about_ca_system_score_codex":0.00005745094,"about_ca_system_score_gemma":0.000021308602,"threshold_uncertainty_score":0.99991125},"labels":[],"label_agreement":null},{"id":"W56127215","doi":"","title":"Minimum proof graphs and fastest-cut-first search heuristics","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimax; Heuristics; Game tree; Computer science; Combinatorics; Steiner tree problem; Mathematics; Tree (set theory); Discrete mathematics; Class (philosophy); Theoretical computer science; Algorithm; Mathematical optimization; Game theory; Sequential game; Artificial intelligence","score_opus":0.03385591424483133,"score_gpt":0.28827851419224243,"score_spread":0.2544225999474111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56127215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15595268,0.00025445534,0.80005544,0.010664877,0.00036505313,0.00045438434,0.0000018027631,0.00048154453,0.031769745],"genre_scores_gemma":[0.96833926,0.000028767594,0.029929783,0.00058364915,0.000031435797,0.000003192542,3.7170025e-7,0.0000050308813,0.0010784956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987793,0.000028810831,0.00021592907,0.0003674768,0.0002806258,0.00032788087],"domain_scores_gemma":[0.9991224,0.00015082312,0.000031032694,0.0004479167,0.000110245266,0.00013757472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021402407,0.00012484053,0.00012520698,0.000106287676,0.00015307187,0.00023164507,0.00063432305,0.00005455909,0.0000228851],"category_scores_gemma":[0.00008381968,0.00010652048,0.000033589775,0.00036220174,0.000116504,0.00029566264,0.0001676282,0.00012350944,0.000080579186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009378201,0.00019952892,0.004239871,0.00001873033,0.000010983187,0.000057587964,0.0026795475,0.00018548315,0.00095603574,0.7182653,0.0051523186,0.26822522],"study_design_scores_gemma":[0.00021407896,0.0013841316,0.010572764,0.00007177257,0.000013474677,0.000114938346,0.0005439419,0.4496251,0.13255244,0.39498878,0.008961952,0.0009566269],"about_ca_topic_score_codex":0.000031104137,"about_ca_topic_score_gemma":0.00005234104,"teacher_disagreement_score":0.8123866,"about_ca_system_score_codex":0.00001456881,"about_ca_system_score_gemma":0.00003776845,"threshold_uncertainty_score":0.43437788},"labels":[],"label_agreement":null},{"id":"W57724912","doi":"10.1609/aiide.v5i1.12349","title":"kNN LRTA*: Simple Subgoaling for Real-Time Search","year":2009,"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":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Icelandic Centre for Research","keywords":"Computer science; Heuristic; Artificial intelligence; Constant (computer programming); Domain (mathematical analysis); Video game; Obstacle; Property (philosophy); Machine learning; Mathematics; Multimedia","score_opus":0.053957691179026726,"score_gpt":0.3181157654940366,"score_spread":0.26415807431500987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57724912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8674663,0.000023695273,0.09110737,0.008088204,0.0004778405,0.0020672085,0.00006135009,0.00021472962,0.03049333],"genre_scores_gemma":[0.998049,0.000048613027,0.0009084155,0.0003462384,0.0000811809,0.00004262096,0.0000037855846,0.000015977366,0.00050412054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99747163,0.000017221202,0.0007476028,0.0007315563,0.00047530074,0.0005566866],"domain_scores_gemma":[0.9981223,0.0002992687,0.0003478925,0.0003212733,0.0007504845,0.00015880968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037949876,0.00035187398,0.00038376983,0.0001832387,0.0002581729,0.00095598964,0.0014905201,0.00009163046,0.000044559198],"category_scores_gemma":[0.00040496595,0.00026971332,0.00022932902,0.00033909464,0.00025800627,0.001582747,0.0003779175,0.00025989718,0.00007232755],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035144866,0.00048745263,0.00020616612,0.000028815131,0.000048691967,8.316022e-7,0.0038935838,0.000061438834,0.06867386,0.57358545,0.0002538192,0.35240847],"study_design_scores_gemma":[0.00004778096,0.0013956222,0.00017084285,0.00027620597,0.000014049222,0.0000069845164,0.0025675597,0.09880752,0.71161157,0.18442185,0.00031106189,0.00036895307],"about_ca_topic_score_codex":0.00003192392,"about_ca_topic_score_gemma":0.0000026099376,"teacher_disagreement_score":0.6429377,"about_ca_system_score_codex":0.00012299891,"about_ca_system_score_gemma":0.00006675081,"threshold_uncertainty_score":0.9999755},"labels":[],"label_agreement":null},{"id":"W58552428","doi":"10.1007/978-3-319-09165-5_6","title":"MoHex 2.0: A Pattern-Based MCTS Hex Player","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Olympiad; Softmax function; Computer science; Monte Carlo tree search; Tree (set theory); Artificial intelligence; Monte Carlo method; Artificial neural network; Mathematics education; Mathematics","score_opus":0.02656068726825602,"score_gpt":0.2635465497842492,"score_spread":0.23698586251599316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58552428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011134043,0.0001900137,0.9897604,0.0017976612,0.0028205197,0.00044694674,0.000005200545,0.00033867275,0.00452924],"genre_scores_gemma":[0.7177604,0.000015289359,0.270433,0.0097322,0.001141174,0.000025336036,0.000006861009,0.00009051032,0.00079524954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410766,0.00007217884,0.00083342503,0.0022893113,0.0015986374,0.0010987896],"domain_scores_gemma":[0.99526536,0.001051901,0.00043775025,0.0025704068,0.0003567741,0.00031780198],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010428547,0.00081207394,0.00074892835,0.0010446303,0.0003189679,0.0009166541,0.006205046,0.0005069791,0.000073725394],"category_scores_gemma":[0.00020336946,0.00074797485,0.00024401754,0.0006601436,0.0010907609,0.0004662126,0.0013108585,0.0011086146,0.0004984751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004207153,0.000026153906,0.00012796356,0.00003409606,0.000008014265,0.00010690621,0.00042808833,0.066222206,0.00010908164,0.014888762,0.00008305524,0.9179615],"study_design_scores_gemma":[0.00012087693,0.00021406796,0.000070030874,0.00043881277,0.0000074172153,0.000033239852,1.0129223e-7,0.8928479,0.010089909,0.08747786,0.0077347094,0.0009650582],"about_ca_topic_score_codex":0.00007853975,"about_ca_topic_score_gemma":0.00023866407,"teacher_disagreement_score":0.9169964,"about_ca_system_score_codex":0.00036363228,"about_ca_system_score_gemma":0.0007457788,"threshold_uncertainty_score":0.9994971},"labels":[],"label_agreement":null},{"id":"W66652580","doi":"10.5555/2484920.2485079","title":"Baseline: practical control variates for agent evaluation in zero-sum domains","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Variance reduction; Control variates; Baseline (sea); Variance (accounting); Computer science; Reduction (mathematics); Estimator; Monte Carlo method; Domain (mathematical analysis); Overhead (engineering); Algorithm; Mathematical optimization; Artificial intelligence; Statistics; Mathematics; Hybrid Monte Carlo","score_opus":0.0631569794152325,"score_gpt":0.359566842125435,"score_spread":0.2964098627102025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66652580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008323501,0.000021477064,0.9782416,0.010410526,0.00037298704,0.0012768692,0.0000010653547,0.0000817196,0.0012702171],"genre_scores_gemma":[0.8280344,0.0000027378435,0.17013678,0.001134606,0.00006605867,0.00043366608,0.0000019499282,0.00000603493,0.00018379817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998455,0.00020808201,0.00035875055,0.00033557462,0.00034710907,0.00029551127],"domain_scores_gemma":[0.9978374,0.0012915098,0.00007782939,0.0003586477,0.00035449272,0.000080109174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019417228,0.00010586228,0.0001350039,0.00008644982,0.000059980586,0.0002030383,0.0003429906,0.00006663272,0.0003906233],"category_scores_gemma":[0.0017444838,0.00008690285,0.00005181894,0.00018972157,0.000033646178,0.0008193163,0.000066111796,0.00008504395,0.000522871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038635808,0.0006153382,0.0025204753,0.000016720245,0.00004419709,0.000006526768,0.0013267425,0.0065769795,0.0091777695,0.68829596,0.031844687,0.25953594],"study_design_scores_gemma":[0.00024163822,0.00006741874,0.000863204,0.0000053993554,0.000007687984,0.0000022209888,0.000060098166,0.89166,0.0046822806,0.1010263,0.0012750117,0.00010878835],"about_ca_topic_score_codex":0.00028978597,"about_ca_topic_score_gemma":0.00009996531,"teacher_disagreement_score":0.88508296,"about_ca_system_score_codex":0.00008787192,"about_ca_system_score_gemma":0.00013845948,"threshold_uncertainty_score":0.6720623},"labels":[],"label_agreement":null},{"id":"W67604841","doi":"10.1007/978-3-319-12337-0_26","title":"Appraisal of Emotions from Resources","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Graphics; Character (mathematics); Video game; Simple (philosophy); Resource (disambiguation); Mechanism (biology); Artificial intelligence; Multimedia; Human–computer interaction; Computer graphics (images)","score_opus":0.026034522807125905,"score_gpt":0.2795352534334653,"score_spread":0.2535007306263394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67604841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011099008,0.00021518426,0.98712045,0.0006488105,0.0022036487,0.00018758918,0.000007602914,0.00013860736,0.008368188],"genre_scores_gemma":[0.5808049,0.000026709635,0.41700944,0.000762871,0.0008302983,0.0000052070445,0.0000044311296,0.00003719678,0.00051893975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996367,0.000049759296,0.00069364463,0.001335196,0.00106877,0.00048562986],"domain_scores_gemma":[0.9956641,0.0016966462,0.00043095692,0.0017724258,0.00028051378,0.00015534023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065034884,0.00041795458,0.00056702684,0.00067899394,0.00017383577,0.0003085823,0.004717648,0.00031866008,0.00008038206],"category_scores_gemma":[0.00039572365,0.00038864408,0.00016414208,0.0005034229,0.0013948026,0.00032710333,0.0014683256,0.00061537756,0.00018745229],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000488581,0.000026665075,0.00011003025,0.0000167174,0.000014053424,0.000024478311,0.0028164291,0.021677965,0.00044047539,0.10173265,0.00004324808,0.8730924],"study_design_scores_gemma":[0.00008241932,0.00023865631,0.00022613759,0.00050745404,0.000011355195,0.00002246955,7.7035685e-7,0.3924894,0.010624739,0.58696544,0.008144717,0.0006864383],"about_ca_topic_score_codex":0.0002528862,"about_ca_topic_score_gemma":0.00015245451,"teacher_disagreement_score":0.87240595,"about_ca_system_score_codex":0.0000971927,"about_ca_system_score_gemma":0.00031841113,"threshold_uncertainty_score":0.99985653},"labels":[],"label_agreement":null},{"id":"W6920972376","doi":"10.6084/m9.figshare.26653993.v1","title":"Additional file 1 of Performance analysis of conventional and AI-based variant callers using short and long reads","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Table (database); Precision and recall; File format; Key (lock)","score_opus":0.059866990105609745,"score_gpt":0.29548451290267663,"score_spread":0.23561752279706688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920972376","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096903247,0.00010407138,0.0036345995,0.000026061642,0.000018483188,0.00004899273,0.99503326,0.000022868064,0.00014263466],"genre_scores_gemma":[0.5916979,0.0000020394277,0.009283147,0.00009385161,0.000041478095,0.000077200944,0.39868572,0.000009157694,0.000109552],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933153,0.000015573698,0.00018099858,0.00019951955,0.00018570232,0.00008665854],"domain_scores_gemma":[0.99905926,0.0006171275,0.000043059306,0.00012567056,0.00011753286,0.000037361177],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003770048,0.00006518196,0.00012473909,0.00019710307,0.000038060585,0.00004980795,0.00013928681,0.000037392376,0.7896233],"category_scores_gemma":[0.00021420888,0.000063079766,0.000059461305,0.0005003631,0.000032418917,0.00023409957,0.00008778984,0.000059412207,0.000021979706],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005872317,0.00003385831,0.0002088775,0.00033727777,0.0002943002,0.000035905974,0.00013828915,0.0062205913,0.000050992632,0.00040686663,0.9773344,0.014932795],"study_design_scores_gemma":[0.000008269748,0.000022535809,0.005556412,0.0010881155,0.000029032053,0.000006483673,0.00000602394,0.9719238,0.00050929247,0.00003308494,0.020746833,0.000070060334],"about_ca_topic_score_codex":0.0000038229978,"about_ca_topic_score_gemma":0.000009879391,"teacher_disagreement_score":0.96570325,"about_ca_system_score_codex":0.000014982961,"about_ca_system_score_gemma":0.00012665178,"threshold_uncertainty_score":0.25723183},"labels":[],"label_agreement":null},{"id":"W6925991397","doi":"10.21268/20210921-4","title":"Optimization of hydraulic fracturing in tight gas reservoirs with alternative fluid","year":2021,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hydraulic fracturing; Tight gas; Natural gas; Tight oil; Fossil fuel; Unconventional oil; Permeability (electromagnetism); Produced water; Relative permeability; Well stimulation","score_opus":0.0240244293941724,"score_gpt":0.2683675371084945,"score_spread":0.24434310771432208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925991397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109539405,0.000051077717,0.8775066,0.0011432404,0.0000742713,0.000066918365,1.9075638e-7,0.00003673231,0.01158155],"genre_scores_gemma":[0.85371256,0.000033106546,0.14581175,0.00013789319,0.000018999855,0.0000048123215,9.988826e-7,0.0000053954946,0.00027450675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990759,0.00005611929,0.00021982068,0.0002631039,0.00023439687,0.00015067153],"domain_scores_gemma":[0.9992766,0.0001051264,0.00006899581,0.00035558394,0.00015830499,0.000035428366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012871134,0.000076967364,0.00011824914,0.000096165524,0.00002653113,0.000051616607,0.00040715604,0.000030126985,0.000120506425],"category_scores_gemma":[0.00007741585,0.00006294386,0.00002101455,0.00050558604,0.00004266383,0.0005003603,0.00016779875,0.00007973545,0.00001380177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007946397,0.00005520199,0.001974411,0.0000066057255,0.000008782273,0.00006158938,0.0017947165,0.98033065,0.0008655623,0.01114268,0.000059123013,0.0036927336],"study_design_scores_gemma":[0.000040838728,0.000031103576,0.00026749808,0.00003485049,9.0970457e-7,0.00000481609,0.00013259023,0.56671214,0.43074346,0.0018626376,0.00010423005,0.00006491422],"about_ca_topic_score_codex":0.0003034629,"about_ca_topic_score_gemma":0.00030037345,"teacher_disagreement_score":0.7441731,"about_ca_system_score_codex":0.00003335353,"about_ca_system_score_gemma":0.00007351556,"threshold_uncertainty_score":0.2566776},"labels":[],"label_agreement":null},{"id":"W6926147556","doi":"10.25384/sage.20469401","title":"sj-docx-3-cjo-10.1177_00084174221116638 - Supplemental material for Knowledge Gaps Regarding Indigenous Health in Occupational Therapy: A Delphi Process","year":2022,"lang":"en","type":"article","venue":"Sage Journals Data","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Delphi method; Indigenous; Process (computing); Delphi; Work (physics); Occupational safety and health","score_opus":0.1480463079395292,"score_gpt":0.41735689138934184,"score_spread":0.2693105834498126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926147556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45476934,0.051254053,0.38657406,0.019508157,0.009068356,0.008478428,0.069179475,0.00066751865,0.0005006317],"genre_scores_gemma":[0.96995384,0.0020456538,0.01970841,0.0017897116,0.0012737956,0.0005718406,0.004275238,0.00008919654,0.00029234492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965043,0.000356614,0.0009716195,0.0007571162,0.00062651036,0.0007838186],"domain_scores_gemma":[0.99787986,0.00023948289,0.00050688913,0.0010688299,0.0001319702,0.00017297667],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034032657,0.00025201036,0.00038116556,0.00040258316,0.0010452319,0.0005041475,0.0039923047,0.000049601582,0.008348593],"category_scores_gemma":[0.000111358946,0.0002523072,0.00008085634,0.0007519374,0.000056560842,0.0015738813,0.0016838263,0.00037919503,0.0000310487],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008490266,0.0018180581,0.009411746,0.00012266783,0.00021285372,0.00011451815,0.045355666,0.0014269686,0.0018747152,0.00038018974,0.117955774,0.82047784],"study_design_scores_gemma":[0.006044003,0.003722815,0.00696554,0.0010867614,0.000054819528,0.001280099,0.016279278,0.12119974,0.020498997,0.03321928,0.78644294,0.0032057103],"about_ca_topic_score_codex":0.00020831407,"about_ca_topic_score_gemma":0.0003525398,"teacher_disagreement_score":0.8172721,"about_ca_system_score_codex":0.0004071108,"about_ca_system_score_gemma":0.0012214292,"threshold_uncertainty_score":0.9999929},"labels":[],"label_agreement":null},{"id":"W6929357575","doi":"10.48336/07mg-hf81","title":"Using influence maps with heuristic search to craft sneak-attacks in Starcraft","year":2022,"lang":"en","type":"article","venue":"Memorial University Research Repository (Memorial University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Adversary; Heuristic; Heuristics; Surprise; Variety (cybernetics); Base (topology)","score_opus":0.058386017394310374,"score_gpt":0.3023480352798653,"score_spread":0.24396201788555494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929357575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.957609,0.000014687059,0.027966805,0.0007283138,0.003198137,0.001326783,0.000039164985,0.0002638822,0.008853231],"genre_scores_gemma":[0.98401695,0.000009714423,0.0055429214,0.00003862991,0.0008375284,0.0000017977251,0.000006752308,0.000037041835,0.009508674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9914999,0.0026679516,0.0003591266,0.0015023404,0.00254232,0.0014283408],"domain_scores_gemma":[0.9961579,0.000722608,0.00013086342,0.0013624398,0.00093896495,0.00068723777],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001967962,0.00036008566,0.0004846925,0.002910906,0.002888926,0.00037269073,0.0050986325,0.00016035562,0.00006854588],"category_scores_gemma":[0.00022953603,0.00045069822,0.00013941569,0.0076037105,0.0006310477,0.0017318329,0.0051702675,0.001732087,0.00006637894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017856183,0.0021522215,0.027814059,0.00020427011,0.00037876208,0.077573754,0.023630986,0.66470104,0.0799224,0.09430415,0.0078069963,0.0036551503],"study_design_scores_gemma":[0.012294571,0.011929909,0.0054927794,0.0005833612,0.00022686263,0.00089121924,0.0718436,0.11328764,0.069396384,0.0027655868,0.7051658,0.006122303],"about_ca_topic_score_codex":0.010428902,"about_ca_topic_score_gemma":0.00091540907,"teacher_disagreement_score":0.6973588,"about_ca_system_score_codex":0.003955822,"about_ca_system_score_gemma":0.0024421525,"threshold_uncertainty_score":0.9998678},"labels":[],"label_agreement":null},{"id":"W6929501122","doi":"10.48550/arxiv.1711.03087","title":"Exploration in NetHack With Secret Discovery","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Heuristics; Automation; Point (geometry); Greedy algorithm; Feature (linguistics); Face (sociological concept); Key (lock)","score_opus":0.15230725629917538,"score_gpt":0.22479968675094467,"score_spread":0.07249243045176929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929501122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28584418,0.00002233192,0.7101841,0.00020060863,0.00038194974,0.00022760194,0.0000040840596,0.000104278966,0.0030308953],"genre_scores_gemma":[0.99612564,0.00013451709,0.0014817521,0.000045740217,0.00006928622,0.0000019387037,0.000010170967,0.000014631436,0.0021163404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998274,0.00011092765,0.00018096241,0.0010137524,0.00010945663,0.00031089652],"domain_scores_gemma":[0.9976418,0.00007845275,0.00031316638,0.00177288,0.000106292224,0.000087411405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023342931,0.00026400754,0.00027635673,0.00023810583,0.00014113107,0.0005005529,0.0023865586,0.00022023087,0.0000090871645],"category_scores_gemma":[0.0000470945,0.00027282495,0.0000863036,0.00026797486,0.00019122074,0.0026539648,0.0016003196,0.0005401627,0.000095934585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069059206,0.00009886982,0.016654069,0.000047977384,0.00004108381,0.00089083856,0.0016036859,0.7254314,0.000027091166,0.25251827,0.00017641742,0.0024412686],"study_design_scores_gemma":[0.00019829847,0.00010274319,0.0026199068,0.00032413058,0.000025211679,0.0000039837196,0.0003606859,0.72584176,0.0011298564,0.26822433,0.0004564075,0.00071267376],"about_ca_topic_score_codex":0.0007415262,"about_ca_topic_score_gemma":0.0016021172,"teacher_disagreement_score":0.71028143,"about_ca_system_score_codex":0.00018922013,"about_ca_system_score_gemma":0.0002670228,"threshold_uncertainty_score":0.9999724},"labels":[],"label_agreement":null},{"id":"W6931187863","doi":"10.5281/zenodo.5223061","title":"Krombeinius almokha Darling 2021, n. sp.","year":2021,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Royal Ontario Museum","funders":"","keywords":"Holotype; Dorsum; Vertex (graph theory); Orbit (dynamics); Simple eye in invertebrates; Sulcus","score_opus":0.05183680546818606,"score_gpt":0.27469409002569983,"score_spread":0.22285728455751377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931187863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01865612,0.00046117642,0.6384255,0.0048931953,0.0008005302,0.00036525662,0.000048835755,0.0018797517,0.3344696],"genre_scores_gemma":[0.9793654,0.00022424562,0.01439481,0.00060489465,0.00046547884,4.994392e-8,0.00034730282,0.0011733498,0.0034244335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791884,0.0003136675,0.0002893594,0.0005956615,0.00045390995,0.00042854162],"domain_scores_gemma":[0.9979824,0.000049761176,0.00008615621,0.00089499424,0.0007993018,0.00018739325],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00059915194,0.00013557804,0.00014116582,0.00014199826,0.0016195467,0.001730091,0.0019794693,0.00006142768,0.011019364],"category_scores_gemma":[0.00097621814,0.00015234751,0.00006682311,0.00095373613,0.0001226171,0.0005881799,0.002603582,0.00027142238,0.019082293],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012588656,0.00020772808,0.000011060421,0.000030392719,0.00004921513,0.00025886108,0.0031222957,0.0004215718,0.018286092,0.10270096,0.1175677,0.75733155],"study_design_scores_gemma":[0.0000931841,0.00007927421,0.00013676973,0.00002698895,0.000005102082,0.0001989821,0.0003376043,0.0071575358,0.021645209,0.00258154,0.9675314,0.00020643411],"about_ca_topic_score_codex":0.000011343838,"about_ca_topic_score_gemma":5.3251625e-7,"teacher_disagreement_score":0.96070933,"about_ca_system_score_codex":0.00010639681,"about_ca_system_score_gemma":0.000011990117,"threshold_uncertainty_score":0.9996802},"labels":[],"label_agreement":null},{"id":"W6931351471","doi":"10.5281/zenodo.4221320","title":"Replication as a Way of Knowing in the Digital Humanities","year":2016,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Digital humanities; Replication (statistics); Exposition (narrative); Key (lock); The Internet","score_opus":0.05881326551395506,"score_gpt":0.2852843748545538,"score_spread":0.22647110934059878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931351471","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009779089,0.000092804046,0.01983531,0.00049052684,0.00007190644,0.0003450155,0.000050746858,0.00045568787,0.9785602],"genre_scores_gemma":[0.30392122,0.0004594209,0.0011200171,0.0005283889,0.0008375018,4.849407e-7,0.00068577856,0.0082923295,0.68415487],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985844,0.0001961413,0.0002454726,0.00039760384,0.00036744258,0.00020894021],"domain_scores_gemma":[0.9984396,0.000051968484,0.00018361828,0.0011378045,0.00015658815,0.000030425213],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005529952,0.00011902571,0.00012747728,0.00032317982,0.00033390947,0.0007689792,0.0029091677,0.00007055874,0.0056776865],"category_scores_gemma":[0.00061862956,0.000090520385,0.000043992626,0.00033554484,0.00019579472,0.0002603164,0.0009852216,0.00015973901,0.009776142],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049178084,0.000062700565,0.0000011876516,0.000035274086,0.000015015851,0.000006857512,0.0028499987,0.0000016596105,0.00022676271,0.12503585,0.47984755,0.39191222],"study_design_scores_gemma":[0.0000428575,0.000070294685,0.000019019513,0.00010913743,0.0000021283486,0.000023173108,0.00026520644,0.000075239484,0.00031021688,0.0018053383,0.99717176,0.00010565726],"about_ca_topic_score_codex":0.0000387309,"about_ca_topic_score_gemma":0.000001338617,"teacher_disagreement_score":0.5173242,"about_ca_system_score_codex":0.00006170269,"about_ca_system_score_gemma":0.0000045218712,"threshold_uncertainty_score":0.9952313},"labels":[],"label_agreement":null},{"id":"W6936704530","doi":"10.58079/r2i0","title":"Conference : Replaying Japan 2021 - \"Artificial Intelligence in Japanese Game Culture\" (University of Alberta, online)","year":2021,"lang":"en","type":"article","venue":"Industrias Culturais (Universidade de Coimbra)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Intelligence analysis; Subject (documents)","score_opus":0.054871781175305875,"score_gpt":0.27146922339250285,"score_spread":0.21659744221719696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6936704530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.885071,0.00027190335,0.07766597,0.016149435,0.00077932945,0.0005833163,0.00006910891,0.0001983573,0.019211587],"genre_scores_gemma":[0.98414457,0.00007818335,0.007981894,0.00014199794,0.00009585237,0.0000012025693,0.00004655743,0.000016542583,0.0074932314],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99696803,0.00035790066,0.00051069906,0.0009667821,0.00050423754,0.0006923276],"domain_scores_gemma":[0.99743,0.000358554,0.0003654557,0.00092897913,0.0006274485,0.00028951632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034823784,0.0003491516,0.00053610274,0.0003160548,0.0002120933,0.00019493117,0.0019137048,0.00051939,0.0008511238],"category_scores_gemma":[0.00072385167,0.0004119164,0.00022628113,0.0025662612,0.00036399087,0.0013987519,0.00070593576,0.00088490976,0.00013771086],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027359757,0.0017118197,0.003938391,0.0001017695,0.00030595795,0.0028304388,0.20460573,0.00681136,0.09230631,0.28336272,0.0038422816,0.39990962],"study_design_scores_gemma":[0.0013097293,0.0007209046,0.050554633,0.0014864702,0.00022386119,0.00073233456,0.5253441,0.22470331,0.15220895,0.01811198,0.020782735,0.0038210102],"about_ca_topic_score_codex":0.008346251,"about_ca_topic_score_gemma":0.012401478,"teacher_disagreement_score":0.39608863,"about_ca_system_score_codex":0.00031117283,"about_ca_system_score_gemma":0.0006432616,"threshold_uncertainty_score":0.9998333},"labels":[],"label_agreement":null},{"id":"W6939051231","doi":"10.60692/gbvpv-wmk68","title":"Achieving fairness in team-based FPS games: A skill-based matchmaking solution","year":2024,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Outcome (game theory); Process (computing); Cluster analysis; Measure (data warehouse); Degree (music)","score_opus":0.03557473818781864,"score_gpt":0.2524022020819725,"score_spread":0.21682746389415386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939051231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13366511,0.00001270408,0.86226845,0.00022902696,0.0010081728,0.00037078228,0.000010163273,0.00089434424,0.0015412254],"genre_scores_gemma":[0.99410975,4.134724e-8,0.0054057078,0.00024148598,0.00007107843,0.000115463685,0.000007068638,0.00001367927,0.00003575359],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997697,0.00013027595,0.00090849685,0.00033105566,0.00049993297,0.00043326628],"domain_scores_gemma":[0.99893165,0.00005500472,0.00020814376,0.00059098366,0.00013158919,0.00008264418],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009467124,0.00024683945,0.00024905909,0.00087118795,0.00014442392,0.0011798538,0.0006494159,0.00014271951,0.000010746526],"category_scores_gemma":[0.000048542282,0.0002188679,0.00011659388,0.001021222,0.000043951575,0.0023592827,0.000112782895,0.00021353255,0.001146235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012332822,0.000035272,0.18514086,0.0065819016,0.00009366009,0.0001621873,0.5193966,0.16077602,0.00007817003,0.037427414,0.0006131448,0.089571424],"study_design_scores_gemma":[0.0001633475,0.00003190584,0.0047370526,0.0014782234,0.0000068251925,0.000021145031,0.003951884,0.986487,0.0024216424,0.000016845752,0.0003897027,0.0002944458],"about_ca_topic_score_codex":0.000043061573,"about_ca_topic_score_gemma":0.0000026638295,"teacher_disagreement_score":0.8604446,"about_ca_system_score_codex":0.0004864202,"about_ca_system_score_gemma":0.00020644898,"threshold_uncertainty_score":0.999857},"labels":[],"label_agreement":null},{"id":"W6950211981","doi":"10.5281/zenodo.3883702","title":"Free psn code generator no human verification","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Code (set theory); Favourite; Generator (circuit theory); Order (exchange); Virtual world; Debugging","score_opus":0.08423652253662399,"score_gpt":0.27814615048145414,"score_spread":0.19390962794483013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950211981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02330988,0.0001235817,0.7675892,0.0153107215,0.00047643797,0.0009053293,0.00026201666,0.0050489125,0.18697391],"genre_scores_gemma":[0.98773086,0.00003569919,0.007989194,0.0016448693,0.00062777847,9.4319354e-8,0.00037485323,0.00094389054,0.0006527371],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982897,0.00022621409,0.0002719507,0.0005257487,0.0003903323,0.0002960394],"domain_scores_gemma":[0.99821734,0.000016231721,0.00010218256,0.00082461245,0.0006060335,0.00023361799],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035524848,0.00012360685,0.00011368145,0.00008996076,0.0016391749,0.0011534325,0.003246971,0.00005360121,0.0034858605],"category_scores_gemma":[0.00088715076,0.00013621693,0.00004437679,0.00059297227,0.00012360865,0.00051778025,0.0018100596,0.00021095597,0.02369156],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021635664,0.00010992582,0.0000060714506,0.00003553219,0.000026196827,0.000016686117,0.0037697947,0.0001672238,0.11715603,0.12445135,0.6725179,0.08172168],"study_design_scores_gemma":[0.00011649576,0.00021462055,0.00010255248,0.000007489741,0.0000036003985,0.000011236813,0.000080488135,0.014653381,0.018141147,0.0008699948,0.96562403,0.00017494388],"about_ca_topic_score_codex":0.000008630709,"about_ca_topic_score_gemma":2.8322728e-7,"teacher_disagreement_score":0.964421,"about_ca_system_score_codex":0.000078487996,"about_ca_system_score_gemma":0.000004740491,"threshold_uncertainty_score":0.9998835},"labels":[],"label_agreement":null},{"id":"W6955355664","doi":"10.58079/1ceq","title":"Pour une histoire des milieux universitaires au Québec (XIXe-XXe siècles)","year":2023,"lang":"fr","type":"other","venue":"OpenEdition (OpenEdition)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Relation (database); Professional qualification; Confusion","score_opus":0.03741548061478828,"score_gpt":0.2611638116747676,"score_spread":0.22374833105997932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6955355664","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002819872,0.0032628754,0.12661381,0.27724236,0.019859552,0.0023174442,0.0008305927,0.0026182209,0.56443524],"genre_scores_gemma":[0.08159207,0.0008297899,0.008382082,0.009995377,0.0037651483,0.00030728686,0.00039742113,0.00086579693,0.89386505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933557,0.0005143712,0.0012618721,0.0020443886,0.0013556171,0.0014680647],"domain_scores_gemma":[0.9945468,0.0010972236,0.00095279317,0.001727414,0.00093708705,0.0007387396],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.0006671873,0.0012029808,0.0010749934,0.00080517295,0.0029395246,0.00076848926,0.003209216,0.00088816305,0.024951246],"category_scores_gemma":[0.00075181416,0.0013724348,0.00059786846,0.0018965895,0.0027471774,0.013816611,0.0011685777,0.00083845045,0.052806366],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069863556,0.0005125734,0.0005249589,0.00022577352,0.0002717679,0.00079105265,0.0020847875,0.0015579239,0.00018162996,0.4418351,0.15435264,0.39759195],"study_design_scores_gemma":[0.0006740931,0.00049018284,0.021023424,0.0024579694,0.00029888444,0.00015431095,0.0025174527,0.0051567266,0.0023095992,0.029844742,0.93270314,0.0023694988],"about_ca_topic_score_codex":0.15356843,"about_ca_topic_score_gemma":0.7938285,"teacher_disagreement_score":0.7783505,"about_ca_system_score_codex":0.004808183,"about_ca_system_score_gemma":0.0038837062,"threshold_uncertainty_score":0.99997663},"labels":[],"label_agreement":null},{"id":"W6958358978","doi":"10.6084/m9.figshare.26653993","title":"Additional file 1 of Performance analysis of conventional and AI-based variant callers using short and long reads","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Table (database); Precision and recall; File format; Key (lock)","score_opus":0.059866990105609745,"score_gpt":0.29548451290267663,"score_spread":0.23561752279706688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958358978","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096903247,0.00010407138,0.0036345995,0.000026061642,0.000018483188,0.00004899273,0.99503326,0.000022868064,0.00014263466],"genre_scores_gemma":[0.5916979,0.0000020394277,0.009283147,0.00009385161,0.000041478095,0.000077200944,0.39868572,0.000009157694,0.000109552],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933153,0.000015573698,0.00018099858,0.00019951955,0.00018570232,0.00008665854],"domain_scores_gemma":[0.99905926,0.0006171275,0.000043059306,0.00012567056,0.00011753286,0.000037361177],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003770048,0.00006518196,0.00012473909,0.00019710307,0.000038060585,0.00004980795,0.00013928681,0.000037392376,0.7896233],"category_scores_gemma":[0.00021420888,0.000063079766,0.000059461305,0.0005003631,0.000032418917,0.00023409957,0.00008778984,0.000059412207,0.000021979706],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005872317,0.00003385831,0.0002088775,0.00033727777,0.0002943002,0.000035905974,0.00013828915,0.0062205913,0.000050992632,0.00040686663,0.9773344,0.014932795],"study_design_scores_gemma":[0.000008269748,0.000022535809,0.005556412,0.0010881155,0.000029032053,0.000006483673,0.00000602394,0.9719238,0.00050929247,0.00003308494,0.020746833,0.000070060334],"about_ca_topic_score_codex":0.0000038229978,"about_ca_topic_score_gemma":0.000009879391,"teacher_disagreement_score":0.96570325,"about_ca_system_score_codex":0.000014982961,"about_ca_system_score_gemma":0.00012665178,"threshold_uncertainty_score":0.25723183},"labels":[],"label_agreement":null},{"id":"W6976773402","doi":"10.60692/pkmaf-fbe45","title":"Achieving fairness in team-based FPS games: A skill-based matchmaking solution","year":2024,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Outcome (game theory); Process (computing); Cluster analysis; Measure (data warehouse); Degree (music)","score_opus":0.03557473818781864,"score_gpt":0.2524022020819725,"score_spread":0.21682746389415386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976773402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13366511,0.00001270408,0.86226845,0.00022902696,0.0010081728,0.00037078228,0.000010163273,0.00089434424,0.0015412254],"genre_scores_gemma":[0.99410975,4.134724e-8,0.0054057078,0.00024148598,0.00007107843,0.000115463685,0.000007068638,0.00001367927,0.00003575359],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997697,0.00013027595,0.00090849685,0.00033105566,0.00049993297,0.00043326628],"domain_scores_gemma":[0.99893165,0.00005500472,0.00020814376,0.00059098366,0.00013158919,0.00008264418],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009467124,0.00024683945,0.00024905909,0.00087118795,0.00014442392,0.0011798538,0.0006494159,0.00014271951,0.000010746526],"category_scores_gemma":[0.000048542282,0.0002188679,0.00011659388,0.001021222,0.000043951575,0.0023592827,0.000112782895,0.00021353255,0.001146235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012332822,0.000035272,0.18514086,0.0065819016,0.00009366009,0.0001621873,0.5193966,0.16077602,0.00007817003,0.037427414,0.0006131448,0.089571424],"study_design_scores_gemma":[0.0001633475,0.00003190584,0.0047370526,0.0014782234,0.0000068251925,0.000021145031,0.003951884,0.986487,0.0024216424,0.000016845752,0.0003897027,0.0002944458],"about_ca_topic_score_codex":0.000043061573,"about_ca_topic_score_gemma":0.0000026638295,"teacher_disagreement_score":0.8604446,"about_ca_system_score_codex":0.0004864202,"about_ca_system_score_gemma":0.00020644898,"threshold_uncertainty_score":0.999857},"labels":[],"label_agreement":null},{"id":"W6982198328","doi":"","title":"Halifax School Practices What They Teach","year":2013,"lang":"en","type":"other","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.04739612943900498,"score_gpt":0.32776064550781253,"score_spread":0.2803645160688075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6982198328","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032117457,0.0014702962,0.12923732,0.002279946,0.001639739,0.00034887952,0.0000012948981,0.00083037384,0.86418897],"genre_scores_gemma":[0.00018871538,0.00096225063,0.050450787,0.0010172223,0.0005925149,0.000045190536,0.0000024897422,0.00016243907,0.9465784],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982281,0.00011388556,0.00025317707,0.0006390082,0.00042138385,0.0003444994],"domain_scores_gemma":[0.99760467,0.00016192015,0.00064698723,0.001356092,0.000064431835,0.00016588264],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025489158,0.0002861269,0.0002547227,0.00021659881,0.00005674425,0.0019453797,0.0022837308,0.00029984044,0.013853358],"category_scores_gemma":[0.00035213458,0.00021646642,0.00008242659,0.0001372407,0.00006194131,0.001989797,0.0004490977,0.0003511839,0.036122542],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.3632242e-7,0.000031795258,0.000033946937,0.000010455824,0.000028774082,0.0000060613897,0.00015094086,0.0000017084609,0.000014416605,0.037649415,0.8902335,0.07183863],"study_design_scores_gemma":[0.0000146496595,0.000024606346,0.000004637403,0.00013808827,0.0000072937305,0.00000791176,0.00033159298,0.0025620507,0.00037820474,0.003557315,0.99265,0.00032365145],"about_ca_topic_score_codex":0.007727707,"about_ca_topic_score_gemma":0.0015945751,"teacher_disagreement_score":0.102416486,"about_ca_system_score_codex":0.00003920099,"about_ca_system_score_gemma":0.00012590192,"threshold_uncertainty_score":0.9990907},"labels":[],"label_agreement":null},{"id":"W6983179939","doi":"","title":"L’Isle-sur-la-Sorgue (Vaucluse), chantier de la Tour d’Argent. La céramique du puits 4180 (fin du XIe s.-milieu du XIIIe s.)","year":2025,"lang":"fr","type":"book-chapter","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Integre de Sante et de Services Sociaux de Laval","funders":"","keywords":"Context (archaeology); Tourism; Order (exchange); Natural (archaeology)","score_opus":0.018285030737778298,"score_gpt":0.23195607925509304,"score_spread":0.21367104851731475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6983179939","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006552072,0.0032955632,0.443105,0.03192149,0.0015501877,0.0010163682,0.0001532202,0.00064499746,0.51176107],"genre_scores_gemma":[0.5131983,0.019374672,0.06545003,0.0014548933,0.00057412504,0.00024882148,0.0003055081,0.0003487042,0.3990449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98088896,0.012183713,0.0018704366,0.0023273078,0.0012696234,0.0014599356],"domain_scores_gemma":[0.9752457,0.014295297,0.0012866858,0.0043817717,0.0040728436,0.0007177031],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.015143633,0.0013506153,0.0012390063,0.00074206054,0.001527807,0.0021602025,0.0061787483,0.0015661404,0.0013684636],"category_scores_gemma":[0.008776137,0.0015576553,0.00084549346,0.0009474248,0.0022233801,0.0010297719,0.004058525,0.0021172801,0.00067386957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027171227,0.0007921646,0.0014458763,0.00018659116,0.0002074348,0.00020405235,0.009290573,0.00019381776,0.0010397203,0.84661067,0.0110358065,0.12896611],"study_design_scores_gemma":[0.00049992144,0.0000041889616,0.0010822382,0.0036571291,0.00016524011,0.00026209184,0.0001409922,0.101262055,0.029090619,0.02400267,0.83836263,0.0014702519],"about_ca_topic_score_codex":0.003275182,"about_ca_topic_score_gemma":0.00370574,"teacher_disagreement_score":0.8273268,"about_ca_system_score_codex":0.0005984299,"about_ca_system_score_gemma":0.0019393743,"threshold_uncertainty_score":0.9999245},"labels":[],"label_agreement":null},{"id":"W6990100049","doi":"","title":"A Comparative Analysis of Game Asset Creation Using&#13;\\nConventional and AI Methods","year":2024,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asset (computer security); Field (mathematics); Task (project management); Process (computing); Sample (material); Video game; Rank (graph theory)","score_opus":0.08102446089877664,"score_gpt":0.42043033861919277,"score_spread":0.33940587772041614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990100049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89486915,0.0006316758,0.06440373,0.00021343774,0.0010080801,0.00048402717,0.000027042786,0.00011513229,0.0382477],"genre_scores_gemma":[0.9794594,0.00007983265,0.0022185042,0.000005056654,0.00009428011,0.0000033253862,0.00009534527,0.000016298589,0.018027935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961537,0.0012271234,0.00045527922,0.00095768773,0.0007714426,0.00043474828],"domain_scores_gemma":[0.99736,0.0007159625,0.0003114813,0.0006499681,0.000759642,0.00020292544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010933575,0.00027714402,0.00073888095,0.00432257,0.00031820478,0.0003748233,0.001060698,0.00029969975,0.00004952819],"category_scores_gemma":[0.000086910666,0.00031029203,0.00038604924,0.0053383773,0.0004377645,0.00064006215,0.00034710576,0.0008974283,0.000013756314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014926449,0.0010633378,0.06615778,0.0015203112,0.024189819,0.0021215803,0.044851143,0.0065351143,0.13398813,0.7022821,0.002393006,0.0134050455],"study_design_scores_gemma":[0.00026345285,0.00073179643,0.101574115,0.00044640986,0.002867052,0.000028622526,0.009721762,0.6223146,0.22260605,0.029847715,0.008505867,0.0010926024],"about_ca_topic_score_codex":0.014052869,"about_ca_topic_score_gemma":0.017325932,"teacher_disagreement_score":0.6724344,"about_ca_system_score_codex":0.00051889266,"about_ca_system_score_gemma":0.0010984523,"threshold_uncertainty_score":0.9999349},"labels":[],"label_agreement":null},{"id":"W6991117213","doi":"","title":"Exploring exploitation and exploration algorithms in Ms. Pac-Man","year":2019,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Ideal (ethics); Probabilistic logic; Context (archaeology); Limiting; Simulated annealing","score_opus":0.08578522444509862,"score_gpt":0.2512270715196785,"score_spread":0.16544184707457987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991117213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92369384,0.0001483495,0.07217347,0.00064582843,0.000979368,0.00041015755,0.000003657123,0.000102733866,0.0018426016],"genre_scores_gemma":[0.9791583,0.0013932558,0.01805421,0.000021218999,0.0000682376,0.000005170413,0.0000983783,0.00003213379,0.0011690921],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9986956,0.00007891917,0.0001668505,0.0004896445,0.00035272408,0.00021623386],"domain_scores_gemma":[0.99903345,0.00009485896,0.00027770142,0.000375589,0.00016067972,0.00005772483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021639754,0.00019791552,0.00029272365,0.00052759936,0.00011860967,0.000071771545,0.00056788826,0.0001518898,0.0000031218121],"category_scores_gemma":[0.000036477777,0.00027725645,0.000065289016,0.00041462295,0.000046095407,0.0029512537,0.0001250619,0.00023446063,0.00007450618],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038467004,0.0005317558,0.03406961,0.0015822788,0.00021116118,0.00029285005,0.19560704,0.004325861,0.006907707,0.05196627,0.0017770205,0.70234376],"study_design_scores_gemma":[0.00075805414,0.00054880575,0.25185937,0.0013598439,0.00008832246,0.0000054415395,0.6055674,0.11562933,0.012710125,0.0068409224,0.0030357495,0.0015966368],"about_ca_topic_score_codex":0.0023990755,"about_ca_topic_score_gemma":0.15767936,"teacher_disagreement_score":0.70074713,"about_ca_system_score_codex":0.00012660201,"about_ca_system_score_gemma":0.00006997915,"threshold_uncertainty_score":0.99996793},"labels":[],"label_agreement":null},{"id":"W6998516910","doi":"","title":"Análisis e implementación de un jugador automático de póquer","year":2015,"lang":"en","type":"dissertation","venue":"e-Archivo (Carlos III University of Madrid)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Variety (cybernetics); Process (computing); State (computer science); Competition (biology); Limit (mathematics); Development (topology); Field (mathematics); Complete information","score_opus":0.017653263639648028,"score_gpt":0.26926011357964025,"score_spread":0.2516068499399922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6998516910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72645366,0.00040484194,0.20436989,0.00079318386,0.0015446992,0.001010933,0.00022000071,0.0007262732,0.064476535],"genre_scores_gemma":[0.8248174,0.0003437277,0.1480515,0.00028062693,0.00029187577,0.000004401509,0.00042018472,0.00010038406,0.025689894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972732,0.0002326299,0.0003845842,0.00070149614,0.0006912633,0.0007168006],"domain_scores_gemma":[0.9977963,0.00014750902,0.00044009546,0.0009360797,0.00031291394,0.0003670884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005947801,0.0003849461,0.0005271357,0.0004686042,0.00030469196,0.00009367488,0.002813651,0.0002871232,0.0004793647],"category_scores_gemma":[0.00008511117,0.00048426932,0.00031164568,0.0004422999,0.00017767219,0.00046622168,0.0004961106,0.0005310754,0.00013146448],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012918493,0.0013593762,0.008882251,0.0009592527,0.0015513381,0.0014369157,0.20313852,0.0010512846,0.010415102,0.07915676,0.16473228,0.52602506],"study_design_scores_gemma":[0.005457807,0.0024455416,0.07821204,0.0026556777,0.0020526736,0.00023818838,0.122027636,0.11558425,0.20001097,0.23277742,0.2302262,0.008311601],"about_ca_topic_score_codex":0.0035706998,"about_ca_topic_score_gemma":0.0021442112,"teacher_disagreement_score":0.5177135,"about_ca_system_score_codex":0.0004511562,"about_ca_system_score_gemma":0.0011010134,"threshold_uncertainty_score":0.9997609},"labels":[],"label_agreement":null},{"id":"W7006857119","doi":"","title":"Zelda: A Link to the Past (SNES) - 100% 2:02:34 - Philippe Brisson","year":2005,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Legend; Channel (broadcasting); Shot (pellet); Quality (philosophy); Enhanced Data Rates for GSM Evolution; Mistake","score_opus":0.01022277393412199,"score_gpt":0.21458568637591896,"score_spread":0.20436291244179697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006857119","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008493281,0.0004213418,0.00027221683,0.0076010367,0.0008160226,0.0007147468,0.000042548338,0.00040357173,0.98972005],"genre_scores_gemma":[0.00057726173,0.00020001209,0.006669063,0.0018625701,0.0012437971,0.000034423945,0.000022892118,0.000108164204,0.98928183],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972903,0.000109485125,0.0008885554,0.0004135256,0.0007626676,0.0005354733],"domain_scores_gemma":[0.9975151,0.00020398958,0.0006345984,0.0012296953,0.00021507489,0.00020153988],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00044300922,0.00046556754,0.00046716575,0.0001491855,0.00014968203,0.0002595913,0.0022541005,0.0004299214,0.1712159],"category_scores_gemma":[0.00018916199,0.000380806,0.0002250789,0.00003757134,0.00015310646,8.7288487e-7,0.0005103067,0.00042463635,0.06542325],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015709616,0.000029140494,0.0000010686974,0.000070709735,0.000034356966,0.000010705675,0.00054147525,0.001023993,2.5196485e-7,0.00028719322,0.8982741,0.09971129],"study_design_scores_gemma":[0.000085073734,0.00016627979,0.000006590959,0.0002030471,0.000023264367,0.000059630365,0.00007751558,0.000407461,0.000050541363,0.000022890496,0.9984716,0.0004261012],"about_ca_topic_score_codex":0.0043666176,"about_ca_topic_score_gemma":0.0035347554,"teacher_disagreement_score":0.10579266,"about_ca_system_score_codex":0.00008951799,"about_ca_system_score_gemma":0.000058564834,"threshold_uncertainty_score":0.9998644},"labels":[],"label_agreement":null},{"id":"W7009580742","doi":"","title":"Epic Games PC CD/DVD Image Collection","year":2025,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"EPIC; Software; Cursor (databases); Documentation; Set (abstract data type); Legend","score_opus":0.015558710182779175,"score_gpt":0.2661624378471544,"score_spread":0.2506037276643752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7009580742","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043387223,0.0003006137,0.44016874,0.0002949982,0.002256637,0.00066674716,0.00014967588,0.0008787697,0.55524045],"genre_scores_gemma":[0.0046078824,0.00034072806,0.040320314,0.00064505433,0.0007361451,0.00018936714,0.00014784514,0.0004055103,0.95260715],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99400973,0.0006575577,0.0011533508,0.0022184425,0.0007688207,0.0011920759],"domain_scores_gemma":[0.99597484,0.0008470202,0.0007446953,0.0019406193,0.00011851886,0.00037432465],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033904138,0.0011747607,0.0011286007,0.0019718662,0.00008510437,0.00072777946,0.005077804,0.00035499712,0.0086661335],"category_scores_gemma":[0.00034028155,0.0011633753,0.0007256368,0.00056963135,0.0008289014,0.0003544116,0.0029858362,0.0013434628,0.007059943],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006680064,0.00017800236,0.00022300982,0.00013789797,0.00037252685,0.00018501299,0.002425367,0.000009546348,0.00030266723,0.043165587,0.9482896,0.004643996],"study_design_scores_gemma":[0.00030628702,0.00039389016,0.00024621622,0.0018942276,0.000077819706,0.000068279085,0.000079447585,0.027133383,0.006038964,0.03538741,0.9271309,0.0012431826],"about_ca_topic_score_codex":0.02070159,"about_ca_topic_score_gemma":0.02640033,"teacher_disagreement_score":0.39984843,"about_ca_system_score_codex":0.00017270983,"about_ca_system_score_gemma":0.00040600655,"threshold_uncertainty_score":0.9990816},"labels":[],"label_agreement":null},{"id":"W7010048868","doi":"","title":"Generation of Potential Narratives in Interactive Fiction","year":2023,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Narrative; Verisimilitude; Interactivity; Plot (graphics); Narrative network; Credibility; Agency (philosophy); Transition (genetics); Content creation; Field (mathematics)","score_opus":0.034961438948804824,"score_gpt":0.26363429896479457,"score_spread":0.22867286001598974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010048868","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2917435,0.00014221662,0.16669795,0.0002538212,0.0074749948,0.0010140203,0.000025040628,0.00043528606,0.53221315],"genre_scores_gemma":[0.48435846,0.00007151688,0.0034229534,0.00001633091,0.00016415805,0.0000034958878,0.00016413006,0.000036969177,0.51176196],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9986355,0.0001436181,0.00029510973,0.00047647275,0.0002527253,0.00019658472],"domain_scores_gemma":[0.99917686,0.00004480026,0.00030888835,0.0002549542,0.00017342712,0.000041066145],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000090158486,0.00020634512,0.00025815095,0.0005100401,0.00007384611,0.00006792288,0.00066493166,0.00022074419,0.0031426146],"category_scores_gemma":[0.000022116972,0.0002463273,0.00011234088,0.00097427267,0.000037789116,0.00073981617,0.000116939584,0.00027705482,0.00007006701],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024869895,0.00018502856,0.00036466826,0.00012724864,0.00013438221,0.00022908695,0.04779106,0.005955428,0.022329792,0.008607908,0.0014589784,0.91256773],"study_design_scores_gemma":[0.0017934433,0.001258206,0.015867442,0.0021551447,0.00019415858,0.000017440643,0.31018052,0.29776916,0.2817658,0.008869184,0.07666424,0.0034652865],"about_ca_topic_score_codex":0.00030352286,"about_ca_topic_score_gemma":0.0035104451,"teacher_disagreement_score":0.90910244,"about_ca_system_score_codex":0.00017241295,"about_ca_system_score_gemma":0.000113716764,"threshold_uncertainty_score":0.9999989},"labels":[],"label_agreement":null},{"id":"W7020021691","doi":"","title":"Infinity #432 2017.01.15 Edion Arena Osaka","year":2017,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Block (permutation group theory); Stadium; Quarter (Canadian coin)","score_opus":0.0159067497535518,"score_gpt":0.22681234672257583,"score_spread":0.21090559696902403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020021691","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007742523,0.00037962702,0.00013797596,0.00030960975,0.0014533569,0.0004378336,0.000066640765,0.00043482185,0.9967724],"genre_scores_gemma":[0.00038636124,0.00040280903,0.0053923195,0.00028018357,0.00041742655,0.000017892758,0.000051410407,0.000082144434,0.99296945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974982,0.00010480529,0.0007672276,0.00040468408,0.0007402066,0.0004848605],"domain_scores_gemma":[0.99640787,0.00017276115,0.0013629342,0.0016153954,0.00024564815,0.00019540712],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046929345,0.00046976045,0.00057252194,0.00015071321,0.00019974753,0.00031929932,0.0023220545,0.0005972578,0.111210786],"category_scores_gemma":[0.00048189086,0.00046332667,0.00023580846,0.000010878983,0.00030443666,0.0000014450005,0.00052038976,0.00045573481,0.035297833],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016035076,0.00003634328,0.0000027306708,0.00016413981,0.000040187377,0.000028326906,0.0002131507,0.000118849464,3.8334323e-7,0.00033416564,0.9828689,0.016176807],"study_design_scores_gemma":[0.00012926607,0.000101411024,0.000009120758,0.0003992107,0.000022107493,0.00006136214,0.000029109104,0.00027774298,0.00006596624,0.00015050072,0.998275,0.0004792423],"about_ca_topic_score_codex":0.006291347,"about_ca_topic_score_gemma":0.0024714028,"teacher_disagreement_score":0.07591295,"about_ca_system_score_codex":0.00006491101,"about_ca_system_score_gemma":0.00009514772,"threshold_uncertainty_score":0.99978185},"labels":[],"label_agreement":null},{"id":"W7020959681","doi":"","title":"Modelo para armar : Itinerarios y ámbitos disidentes del Partido Comunista en la formación de uno de los grupos fundadores de las Fuerzas Armadas Revolucionarias (1960-1967)","year":2012,"lang":"es","type":"article","venue":"Orientación y Sociedad","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Yield (engineering); Work (physics); Value (mathematics); Quarter (Canadian coin)","score_opus":0.030407121313946846,"score_gpt":0.32691659910196724,"score_spread":0.2965094777880204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020959681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68966305,0.0033806968,0.29892835,0.0021801412,0.0016746762,0.000919951,0.00018820113,0.0005067181,0.0025582435],"genre_scores_gemma":[0.972818,0.0010217013,0.02018165,0.0020476216,0.001804627,0.00027680738,0.000051485076,0.00015939979,0.0016386755],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99073637,0.0016051978,0.0014995907,0.0012086566,0.0014036706,0.003546528],"domain_scores_gemma":[0.9939692,0.0018663593,0.0007465426,0.001710913,0.000368879,0.0013381123],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003516075,0.0011078051,0.0009482715,0.0002861909,0.0013593488,0.0013559733,0.0028396435,0.0007840938,0.00022491481],"category_scores_gemma":[0.00074419304,0.0011827176,0.00070081325,0.0010325233,0.0009391086,0.0030621793,0.0014797637,0.001551854,0.0006114772],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029720535,0.002405828,0.5218392,0.0005669581,0.000608754,0.00025152875,0.0920681,0.0042033885,0.011392127,0.3190271,0.024783228,0.022556586],"study_design_scores_gemma":[0.0019138865,0.0007609981,0.03314135,0.0014111755,0.0009371004,0.00090951903,0.020473417,0.53208256,0.12391241,0.057784043,0.22164246,0.0050310623],"about_ca_topic_score_codex":0.0012799283,"about_ca_topic_score_gemma":0.00018326988,"teacher_disagreement_score":0.5278792,"about_ca_system_score_codex":0.0015176488,"about_ca_system_score_gemma":0.0013543444,"threshold_uncertainty_score":0.99994075},"labels":[],"label_agreement":null},{"id":"W7022961787","doi":"","title":"Catatonia","year":2024,"lang":"en","type":"article","venue":"UWA Profiles and Research Repository (University of Western Australia)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"","score_opus":0.11276248176649668,"score_gpt":0.35648556794327035,"score_spread":0.24372308617677368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022961787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98585033,0.0005407945,0.010119685,0.0015109923,0.0003160769,0.00020840766,0.0000053963718,0.00013031773,0.00131798],"genre_scores_gemma":[0.97067916,0.00008632279,0.002366881,0.0000033819317,0.000054718592,5.629905e-7,0.000001051604,0.0000055116075,0.026802385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998614,0.00013642185,0.00011566451,0.00039439107,0.0004420064,0.0002975176],"domain_scores_gemma":[0.99919146,0.00013914594,0.000030385536,0.0003484482,0.00015227371,0.00013830316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004667691,0.000084703606,0.00012440818,0.00018816478,0.00029968226,0.00025330565,0.00073156896,0.00008431705,0.000019555111],"category_scores_gemma":[0.000011245623,0.00008604005,0.000055343255,0.00036873747,0.0005183211,0.0006466832,0.00045500215,0.0002924537,0.00011352464],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015057172,0.00045170417,0.098744765,0.0027946169,0.0005072882,0.007786628,0.051250428,0.00009908014,0.27935255,0.3825661,0.038294863,0.13800143],"study_design_scores_gemma":[0.00033684456,0.0012537539,0.08983029,0.001533188,0.000058957114,0.0006300939,0.012113383,0.03837268,0.73529786,0.012057998,0.10744089,0.001074051],"about_ca_topic_score_codex":0.0012886574,"about_ca_topic_score_gemma":0.000018590452,"teacher_disagreement_score":0.45594534,"about_ca_system_score_codex":0.0000423045,"about_ca_system_score_gemma":0.00010275125,"threshold_uncertainty_score":0.35086113},"labels":[],"label_agreement":null},{"id":"W7023709452","doi":"","title":"Physiotherapy practices and third party payers: issues in professional ethics in Ontario","year":2016,"lang":"en","type":"other","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Canadian Institutes of Health Research; Canadian Arthritis Network; Ontario Physiotherapy Association","keywords":"Professional ethics; Rehabilitation; Third party; Research ethics; Health professionals; Ethics committee; MEDLINE","score_opus":0.022363328578927297,"score_gpt":0.27301755351326246,"score_spread":0.25065422493433515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023709452","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10069661,0.047139548,0.0052496935,0.017667731,0.0070698764,0.002334235,0.00004287292,0.0008889677,0.8189105],"genre_scores_gemma":[0.026328009,0.0019775853,0.004379238,0.00036837402,0.00018581195,0.00003326049,0.000007206547,0.000068282054,0.9666522],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782145,0.00026932693,0.00029450026,0.000680729,0.0005763848,0.0003576231],"domain_scores_gemma":[0.9985138,0.00030425692,0.00053491275,0.0004476631,0.000067878726,0.00013150022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003885045,0.0003097632,0.0003399076,0.00041886925,0.00082002964,0.00007906195,0.0007174792,0.00052714214,0.00013988023],"category_scores_gemma":[0.000095859126,0.0002751885,0.00007518538,0.0002005153,0.0003183563,0.0006409278,0.0003936279,0.00083083916,0.000073903044],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007833004,0.001299927,0.33935392,0.00033249904,0.00042207117,0.0068020592,0.27070048,0.00033745466,0.007636935,0.24560092,0.10185804,0.024872389],"study_design_scores_gemma":[0.0005021308,0.000067954374,0.018705431,0.0011510081,0.0000147493965,0.00014353615,0.0032030547,0.0006480634,0.0011432759,0.0037819971,0.97002107,0.0006177279],"about_ca_topic_score_codex":0.5216605,"about_ca_topic_score_gemma":0.76435786,"teacher_disagreement_score":0.86816305,"about_ca_system_score_codex":0.0027676169,"about_ca_system_score_gemma":0.0024511726,"threshold_uncertainty_score":0.99997},"labels":[],"label_agreement":null},{"id":"W7024543828","doi":"","title":"Shallow and deep geothermal resources assessment in northern communities of Québec: preliminary results from Kuujjuaq.","year":2017,"lang":"en","type":"other","venue":"EspaceINRS (National Institute for Scientific Research (Canada))","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geothermal gradient; Resource (disambiguation); Hydrology (agriculture); Permafrost","score_opus":0.05779807413546965,"score_gpt":0.3341904208238659,"score_spread":0.27639234668839624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024543828","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0938016,0.010761219,0.035248477,0.10214319,0.016688861,0.0112339305,0.01637944,0.0005011249,0.7132422],"genre_scores_gemma":[0.6484205,0.00020024896,0.018504648,0.000113256494,0.0005989647,0.00040012784,0.0010854976,0.00024301735,0.33043373],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944851,0.00031830545,0.0006064347,0.0008840395,0.0030390422,0.00066710135],"domain_scores_gemma":[0.9953834,0.0013975608,0.00055389164,0.0014656199,0.0009940015,0.00020555401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030480828,0.00032767234,0.00045946366,0.00085325335,0.00095801096,0.0007287367,0.0035107643,0.00020539682,0.000056180776],"category_scores_gemma":[0.0010908059,0.0003208349,0.00007372558,0.00043543841,0.0020293407,0.0004943473,0.0010232775,0.0006702807,0.0000043876526],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012245477,0.0009726269,0.013496441,0.00080491387,0.00077839853,0.0003107423,0.01498534,0.030373007,0.00028538704,0.08113784,0.77010024,0.08553053],"study_design_scores_gemma":[0.0003614281,0.00013173744,0.0030308573,0.00058224675,0.000006169731,0.0000021747032,0.0007734469,0.05317321,0.00013100573,0.001324767,0.9401167,0.00036624857],"about_ca_topic_score_codex":0.9899466,"about_ca_topic_score_gemma":0.99998194,"teacher_disagreement_score":0.5546189,"about_ca_system_score_codex":0.0010139672,"about_ca_system_score_gemma":0.013726137,"threshold_uncertainty_score":0.99992436},"labels":[],"label_agreement":null},{"id":"W7024994791","doi":"","title":"This Week...Employment Insurance; Consumer Prices; Retail Sales; Family Violence","year":2012,"lang":"en","type":"report","venue":"oURspace (University of Regina)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Public policy; Point (geometry); Policy analysis; Empirical research; Information system","score_opus":0.06477853370627731,"score_gpt":0.25985848767624103,"score_spread":0.19507995396996372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024994791","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049424596,0.035323195,0.28550535,0.51893365,0.0095200315,0.0023226677,0.00023331378,0.0014887694,0.09724841],"genre_scores_gemma":[0.055522263,0.07864829,0.078826085,0.00026272016,0.0007135909,0.0000070961673,0.00007187147,0.0001787323,0.78576934],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99617404,0.00015635225,0.00007843333,0.0009946777,0.0018007775,0.0007957291],"domain_scores_gemma":[0.99525774,0.0002071328,0.0012084526,0.0018615195,0.0011304031,0.00033474213],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010473332,0.00051516236,0.0008931462,0.0004536206,0.0003341036,0.00008367415,0.0031605538,0.00058010273,0.000047834914],"category_scores_gemma":[0.00012733927,0.0006215483,0.00040083865,0.00074840424,0.00074109895,0.0010656455,0.0010936755,0.0007503018,0.0010853882],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024684523,0.00012432518,0.007355924,0.00023830158,0.00020268396,0.00019185772,0.0010665273,0.000019665456,0.00018254622,0.0035857328,0.86473376,0.12227399],"study_design_scores_gemma":[0.000111087815,0.00012764146,0.0025983984,0.000861505,0.00009858643,0.000045218832,0.0007345619,0.00023636715,0.00016862575,0.00003697966,0.99434483,0.0006361936],"about_ca_topic_score_codex":0.0005201746,"about_ca_topic_score_gemma":0.00030565515,"teacher_disagreement_score":0.6885209,"about_ca_system_score_codex":0.00064533204,"about_ca_system_score_gemma":0.0014778086,"threshold_uncertainty_score":0.9996924},"labels":[],"label_agreement":null},{"id":"W7027119678","doi":"","title":"A Call for Emotion Modeling in Interactive Storytelling","year":2013,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Narrative; Interactive storytelling; Plot (graphics); Agency (philosophy); Storytelling; Consistency (knowledge bases)","score_opus":0.06649594404405815,"score_gpt":0.3048978931692155,"score_spread":0.23840194912515736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027119678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12559605,0.000012649581,0.8721616,0.00047775215,0.00021790015,0.0002845152,1.14966774e-7,0.000074632,0.0011747566],"genre_scores_gemma":[0.8814675,0.0000024923472,0.11798126,0.00017886725,0.0000358156,0.00005861231,3.3903345e-7,0.000004837644,0.00027023826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999258,0.000021559967,0.00020355512,0.00023712858,0.000086684726,0.00019309025],"domain_scores_gemma":[0.9994825,0.00013856957,0.000032711003,0.00018582787,0.00012327956,0.000037099904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016316399,0.00007064717,0.00008373877,0.000107788306,0.000038110073,0.00011104635,0.00034643477,0.00003697842,0.000029755569],"category_scores_gemma":[0.000078012235,0.00006436826,0.00003661484,0.00012873743,0.000011447355,0.000944308,0.00007076185,0.00008233571,0.00015918999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012960841,0.00015941476,0.00048063422,0.000019293637,0.000013473892,0.000002584128,0.015288055,0.29643083,0.0048104534,0.060212523,0.00077496894,0.6217948],"study_design_scores_gemma":[0.000028241462,0.000026152113,0.000021880012,0.000015896077,4.869857e-7,7.383734e-7,0.00037431068,0.9665291,0.0045827436,0.02826722,0.00007329729,0.000079950194],"about_ca_topic_score_codex":0.0007181491,"about_ca_topic_score_gemma":0.00012838439,"teacher_disagreement_score":0.7558715,"about_ca_system_score_codex":0.000071913426,"about_ca_system_score_gemma":0.00002177918,"threshold_uncertainty_score":0.26248613},"labels":[],"label_agreement":null},{"id":"W7032955746","doi":"","title":"Obecność tłumacza w tekście : spojrzenie językoznawcy","year":2008,"lang":"pl","type":"other","venue":"Jagiellonian University Repository (Jagiellonian University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health PEI","funders":"","keywords":"Work (physics); Identification (biology); Product (mathematics)","score_opus":0.015194574370477212,"score_gpt":0.19136362349053013,"score_spread":0.1761690491200529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7032955746","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076721758,0.0013108902,0.021290867,0.0017085449,0.0073662885,0.0021661916,0.00016715017,0.002317186,0.9560007],"genre_scores_gemma":[0.033869855,0.004194362,0.006330927,0.00041984647,0.0013045337,7.8148275e-7,0.000050006645,0.00055354484,0.95327616],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98628306,0.0017007883,0.0013869604,0.0051744143,0.0021789486,0.003275829],"domain_scores_gemma":[0.98831266,0.00070199743,0.0022576717,0.0054106116,0.00107408,0.002243003],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0005076702,0.0028103727,0.0025571962,0.004718161,0.0038314983,0.0008482521,0.011165933,0.0031292795,0.002874191],"category_scores_gemma":[0.00013247498,0.0037708292,0.0020940548,0.005768113,0.0036243915,0.0035358986,0.003951531,0.0035216361,0.0077329827],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025638978,0.0064034816,0.03456586,0.0013239085,0.007140973,0.25463635,0.029981894,0.0033432795,0.0062207095,0.12418753,0.46399465,0.065637484],"study_design_scores_gemma":[0.0014220334,0.00062301906,0.0012082381,0.0010095917,0.00075247424,0.0008334112,0.003424234,0.0031731129,0.002979304,0.00007294389,0.98054636,0.0039553028],"about_ca_topic_score_codex":0.007831353,"about_ca_topic_score_gemma":0.0020013228,"teacher_disagreement_score":0.5165517,"about_ca_system_score_codex":0.0038766002,"about_ca_system_score_gemma":0.005062522,"threshold_uncertainty_score":0.99994737},"labels":[],"label_agreement":null},{"id":"W7034099018","doi":"","title":"Study of Low Earth Orbit impact on ORCA2SAT subsystems","year":2019,"lang":"en","type":"dissertation","venue":"UBibliorum repositorio digital da ubi (University of Beira Interior)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Victoria; Universidade da Beira Interior","keywords":"CubeSat; Satellite; Orbit (dynamics); Power (physics); Low earth orbit; Work (physics); Torque; Set (abstract data type); Geocentric orbit","score_opus":0.017576541839716117,"score_gpt":0.2598072621616266,"score_spread":0.24223072032191045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034099018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97940224,0.000060034527,0.00069472985,0.000021699849,0.0041186046,0.00092876743,0.000072252085,0.00014270167,0.014558985],"genre_scores_gemma":[0.98931754,0.000010508429,0.00009861492,0.000006748159,0.00010121117,0.0000014404595,0.000086141044,0.000046501584,0.010331317],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9961925,0.00011785847,0.0008185995,0.0010633789,0.0012879026,0.0005197539],"domain_scores_gemma":[0.9955648,0.0001991489,0.0014463039,0.0017764681,0.00079842925,0.00021482406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023285951,0.00061602896,0.0011983281,0.0032214383,0.00018770587,0.0009632745,0.002927389,0.00054516806,0.00004898807],"category_scores_gemma":[0.00006679712,0.0006472915,0.0006394529,0.003034498,0.00011808695,0.0018975501,0.0005309516,0.0006738949,0.00024857806],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012277796,0.016820457,0.35358518,0.0070192525,0.010270102,0.0055479645,0.30523548,0.004274316,0.07828569,0.014400821,0.027979631,0.16430332],"study_design_scores_gemma":[0.006868958,0.08149448,0.27777663,0.023289712,0.001381804,0.00040129002,0.39210775,0.016520588,0.17658953,0.00084713934,0.010549283,0.012172815],"about_ca_topic_score_codex":0.0016460231,"about_ca_topic_score_gemma":0.0003074282,"teacher_disagreement_score":0.1521305,"about_ca_system_score_codex":0.00021871197,"about_ca_system_score_gemma":0.00034245223,"threshold_uncertainty_score":0.99959785},"labels":[],"label_agreement":null},{"id":"W7035007745","doi":"","title":"Why the two BC murder suspects may never be found","year":2019,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Homicide; Period (music); George (robot)","score_opus":0.012689091131987932,"score_gpt":0.2247861521960417,"score_spread":0.21209706106405377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035007745","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006962593,0.00024743026,0.0001225059,0.0034525138,0.0012119266,0.0006645653,0.000021984053,0.00028451643,0.9939876],"genre_scores_gemma":[0.00032814723,0.000089267334,0.0029429854,0.004551139,0.000280062,0.000017720517,0.000018722225,0.00010160112,0.99167037],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997623,0.00012869966,0.0006795417,0.00035678054,0.0007516957,0.0004602826],"domain_scores_gemma":[0.9974563,0.00031451197,0.0006646907,0.0012443387,0.00021614553,0.000103995364],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035608228,0.00042052224,0.0004141415,0.00009917268,0.000116171504,0.0002725151,0.001873477,0.00031484963,0.18738487],"category_scores_gemma":[0.00013146242,0.00032875926,0.0002099476,0.000023566408,0.00025533498,0.0000013377035,0.00042715034,0.00040095398,0.03755707],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011859173,0.000024893432,0.0000014381516,0.00009361598,0.00005077222,0.000012928424,0.0003580763,0.0008500272,1.8884312e-7,0.0025516239,0.9933064,0.002738152],"study_design_scores_gemma":[0.0001529518,0.00007777256,0.0000017971948,0.00012359067,0.000024345112,0.00005326957,0.000104135564,0.00062912947,0.000030138099,0.00013663131,0.998281,0.00038521198],"about_ca_topic_score_codex":0.0143606,"about_ca_topic_score_gemma":0.0033407202,"teacher_disagreement_score":0.14982781,"about_ca_system_score_codex":0.000066147906,"about_ca_system_score_gemma":0.00006977586,"threshold_uncertainty_score":0.99991643},"labels":[],"label_agreement":null},{"id":"W7035763062","doi":"","title":"Air Canada Aims to Decarbonize Using Electric-Hybrid Aircraft and Sustainable Aviation Fuels","year":2022,"lang":"en","type":"other","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Aviation; Sustainability; Sustainable energy; Sustainable development; Work (physics)","score_opus":0.011636293477870348,"score_gpt":0.2421758478763785,"score_spread":0.23053955439850815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035763062","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013842982,0.0010600527,0.6754477,0.0015788308,0.0009572454,0.0010722913,0.000009448453,0.00052867155,0.31796145],"genre_scores_gemma":[0.04672684,0.00004092639,0.025885597,0.0030700257,0.00028687017,0.00005852948,0.000007736528,0.0002627447,0.92366076],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979448,0.000079297344,0.00024410088,0.0006193968,0.00049421494,0.0006182369],"domain_scores_gemma":[0.9989609,0.000088308,0.00013228484,0.0005727081,0.000080706384,0.00016510421],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024310513,0.0002516489,0.000260993,0.0003540382,0.00019481812,0.0001378026,0.00079930114,0.00006881008,0.0012481101],"category_scores_gemma":[0.00008763625,0.0002634166,0.00003352174,0.00069798785,0.0000163538,0.00014653514,0.000659942,0.00019737928,0.000014220497],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056997787,0.000035513076,0.0005443091,0.00008850922,0.000062393774,0.00037538368,0.00030816547,0.00123713,0.00020389761,0.047962457,0.9250561,0.024120431],"study_design_scores_gemma":[0.00004568691,0.00007999084,0.00004093971,0.000024275796,0.000016983506,0.000038430822,0.000332452,0.026145246,0.0038887083,0.0040654936,0.96462554,0.00069627835],"about_ca_topic_score_codex":0.7455688,"about_ca_topic_score_gemma":0.38508373,"teacher_disagreement_score":0.6495621,"about_ca_system_score_codex":0.0007996434,"about_ca_system_score_gemma":0.0013044047,"threshold_uncertainty_score":0.9999818},"labels":[],"label_agreement":null},{"id":"W7039303894","doi":"","title":"Maine should spurn proposal for natural gas pipeline from Quebec","year":2017,"lang":"en","type":"other","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pipeline (software); Natural gas; Pipeline transport; Natural (archaeology); Gas pipeline; Petroleum","score_opus":0.04283665668513758,"score_gpt":0.32138360415309974,"score_spread":0.27854694746796216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039303894","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031175557,0.0006954484,0.74267036,0.0038605768,0.0033706478,0.0007221054,0.000055182918,0.00064858387,0.247974],"genre_scores_gemma":[0.00036108878,0.00002848622,0.20076975,0.00036779224,0.0017838342,0.000038446367,0.000048000526,0.0001626883,0.7964399],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981037,0.000032170177,0.0002832137,0.00077642425,0.0003602843,0.00044425097],"domain_scores_gemma":[0.99779165,0.0001293213,0.0003220819,0.0015455863,0.000103267164,0.00010810842],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017564539,0.00037524808,0.00042381854,0.00015562664,0.000119863354,0.00043343822,0.0027957982,0.00035132407,0.0010747812],"category_scores_gemma":[0.00018060824,0.00028880357,0.00018121458,0.00006382204,0.00017503153,0.00023441447,0.00044934344,0.00029865163,0.00060344586],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006512788,0.00002569471,0.000010623508,0.000013226088,0.000026635618,0.000011957032,0.00005745345,0.0000011148448,0.00007190781,0.02728841,0.80943924,0.16304721],"study_design_scores_gemma":[0.000086173044,0.000034238907,0.000003962161,0.00014538046,0.000016527296,0.0000028086033,0.000012424687,0.030880949,0.0035332756,0.018730111,0.94610465,0.00044950037],"about_ca_topic_score_codex":0.032811813,"about_ca_topic_score_gemma":0.18679464,"teacher_disagreement_score":0.5484659,"about_ca_system_score_codex":0.00006513287,"about_ca_system_score_gemma":0.0003683115,"threshold_uncertainty_score":0.9999564},"labels":[],"label_agreement":null},{"id":"W7039572326","doi":"","title":"Methes Energies Canada Inc. Receives U.S. EPA Approval as Foreign Renewable Fuel Producer\\n| Reuters","year":2012,"lang":"en","type":"other","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Renewable energy; Subsidy; Government (linguistics); Energy policy","score_opus":0.023077913657670104,"score_gpt":0.24899010633591273,"score_spread":0.22591219267824264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039572326","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019092242,0.0023964068,0.02023813,0.00086396653,0.0021601159,0.00046024678,0.00001273595,0.00046174167,0.97338754],"genre_scores_gemma":[0.002259051,0.00046327576,0.08705826,0.00053178094,0.00088800763,0.000087782864,0.000017275159,0.0002708814,0.90842366],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968213,0.00015282063,0.00046569342,0.0010077395,0.00072000624,0.0008324428],"domain_scores_gemma":[0.9973637,0.0001754371,0.00036849393,0.0017424226,0.00010862664,0.00024132952],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041606236,0.00054930954,0.00054890214,0.0003073399,0.00010949429,0.00022195755,0.0025133234,0.0003149991,0.0029957793],"category_scores_gemma":[0.00018081316,0.00045623866,0.00009991123,0.0004230162,0.00019434323,0.00041206164,0.0006289057,0.00025665542,0.00036352428],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051882425,0.000042184165,0.000044447264,0.00008641981,0.0001264254,0.000021406127,0.00053262495,0.0001638699,0.00008671673,0.052271772,0.9022108,0.044408165],"study_design_scores_gemma":[0.000029206478,0.000041112864,0.0000038852627,0.00009414188,0.000018573606,0.000017622224,0.00042183237,0.00046472717,0.018251069,0.009451382,0.9705518,0.0006546656],"about_ca_topic_score_codex":0.8386765,"about_ca_topic_score_gemma":0.69067466,"teacher_disagreement_score":0.14800183,"about_ca_system_score_codex":0.00021016544,"about_ca_system_score_gemma":0.0012225065,"threshold_uncertainty_score":0.99978894},"labels":[],"label_agreement":null},{"id":"W7042975143","doi":"","title":"Reviewing, Creativity, and Algorithmic Information Theory","year":2023,"lang":"en","type":"article","venue":"Kent Academic Repository (University of Kent)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Creativity; Process (computing); Task (project management); Computational creativity; Contextualization; Information theory","score_opus":0.022461344046970047,"score_gpt":0.24580940996608142,"score_spread":0.22334806591911138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042975143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67112666,0.0013611999,0.31302282,0.001722203,0.0009193448,0.00061342557,0.000005330123,0.0006744719,0.010554512],"genre_scores_gemma":[0.98978245,0.0026574903,0.0038684683,0.00011570022,0.000075450866,0.0000011790066,0.0000060624443,0.0000070462856,0.0034861623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989468,0.000139687,0.00021944259,0.00021295573,0.00029282994,0.00018830858],"domain_scores_gemma":[0.9991235,0.00016593504,0.00024079846,0.00029960982,0.00008363394,0.000086489796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064322335,0.000102647835,0.00017157882,0.00017788213,0.00024306677,0.000037028414,0.0007467442,0.00012185404,0.000011774169],"category_scores_gemma":[0.000070979346,0.00011724205,0.000067479195,0.0004337494,0.00018132752,0.001789104,0.00043494385,0.00024033416,0.00012695666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007926886,0.00007964178,0.054998085,0.00055591046,0.00020013737,0.00014368784,0.070097916,0.0005664945,0.0124856755,0.15650044,0.039593652,0.6646991],"study_design_scores_gemma":[0.0013923795,0.00067767414,0.18466635,0.0020929964,0.0003139549,0.00034458464,0.024560522,0.37975985,0.051949684,0.110250555,0.24165319,0.0023382795],"about_ca_topic_score_codex":0.00006668741,"about_ca_topic_score_gemma":0.0000011739899,"teacher_disagreement_score":0.6623608,"about_ca_system_score_codex":0.00006209945,"about_ca_system_score_gemma":0.000052946252,"threshold_uncertainty_score":0.4780992},"labels":[],"label_agreement":null},{"id":"W7095312522","doi":"","title":"Championship-Level Play of Domineering","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tournament; Notation; Square (algebra); Algebraic number","score_opus":0.11947996208085095,"score_gpt":0.28809482310830475,"score_spread":0.16861486102745382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095312522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15033104,0.00002939729,0.84174865,0.00020786763,0.00018674674,0.000045244164,5.655428e-7,0.000092532304,0.0073579475],"genre_scores_gemma":[0.91056657,0.000009293497,0.088326715,0.00006264076,0.000024843586,0.0000029275504,1.0803405e-7,0.0000031692516,0.0010037556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993682,0.000011753304,0.00018443906,0.00014324811,0.00015503468,0.00013734543],"domain_scores_gemma":[0.9993972,0.0001454442,0.000038048885,0.0003246117,0.000051219075,0.000043458862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010449856,0.000060230024,0.00009285329,0.00006512504,0.0000527036,0.000010008045,0.00052401284,0.000028581613,0.00005324779],"category_scores_gemma":[0.000101894,0.00005195347,0.00003797172,0.0002077782,0.000063617685,0.00021672435,0.00013231859,0.000050835035,0.000105927706],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009889275,0.00019777761,0.018119253,0.00002216202,0.000034251774,0.000078924764,0.013898932,0.0028585682,0.055923663,0.8331619,0.0066314563,0.06906324],"study_design_scores_gemma":[0.00006285452,0.00007461743,0.016517056,0.00002546685,0.000001618271,0.0000931921,0.0001253682,0.06683872,0.90738565,0.006271049,0.0023358217,0.0002685745],"about_ca_topic_score_codex":0.000054830914,"about_ca_topic_score_gemma":0.0000078605,"teacher_disagreement_score":0.851462,"about_ca_system_score_codex":0.000009957253,"about_ca_system_score_gemma":0.00003265222,"threshold_uncertainty_score":0.21186009},"labels":[],"label_agreement":null},{"id":"W7096122742","doi":"","title":"Game Research at McGill Analyzing Modern Computer Game Narratives","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Narrative; Game design; Reachability; Video game design; Game Developer; Variety (cybernetics); Computer game; Game studies; Scalability; Core (optical fiber)","score_opus":0.09886086236875094,"score_gpt":0.3745853324179841,"score_spread":0.2757244700492332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096122742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41642213,0.000029559742,0.5678245,0.0019536915,0.0006897658,0.00018020622,0.0000018848021,0.0002966566,0.012601618],"genre_scores_gemma":[0.9090093,0.000006227923,0.086737506,0.00027886848,0.00022656714,0.000014286123,0.000001085301,0.000015541897,0.0037106532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737304,0.00019238658,0.00034611125,0.0007482684,0.0006584084,0.0006817948],"domain_scores_gemma":[0.99782276,0.00042017302,0.00006616703,0.0010590485,0.00041406363,0.00021780797],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011112198,0.00018291565,0.00020596164,0.00028171303,0.00038334867,0.00026815708,0.00174922,0.00012650268,0.00036577924],"category_scores_gemma":[0.00008113141,0.00015395798,0.00009490199,0.0006717417,0.00035605524,0.0007465273,0.0013348823,0.0006657656,0.0015452898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025417037,0.00027143263,0.0032515218,0.000023329621,0.000066095694,0.000093751914,0.021052642,0.0026310226,0.15149903,0.44531628,0.008165694,0.36760378],"study_design_scores_gemma":[0.00006300192,0.000117242875,0.0007229454,0.000018003908,0.0000014826891,0.000028055743,0.00013477856,0.79924357,0.07800175,0.089008294,0.03231869,0.00034217388],"about_ca_topic_score_codex":0.00009856476,"about_ca_topic_score_gemma":0.00061526697,"teacher_disagreement_score":0.79661256,"about_ca_system_score_codex":0.0000739762,"about_ca_system_score_gemma":0.00005097092,"threshold_uncertainty_score":0.9992321},"labels":[],"label_agreement":null},{"id":"W7096248838","doi":"","title":"Game Research at McGill Path-finding for Large Scale Multiplayer Computer Games","year":2006,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Exploit; Variety (cybernetics); Scale (ratio); Context (archaeology); Computer game; Computation; Video game design","score_opus":0.09871329846140439,"score_gpt":0.36663798849539614,"score_spread":0.2679246900339918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096248838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11095018,0.000066333836,0.87983906,0.00090164656,0.0006444009,0.0006047121,0.000027809017,0.00035183827,0.0066139884],"genre_scores_gemma":[0.8194895,0.0000048484158,0.17068599,0.00033015243,0.00038175797,0.0000828954,0.000008202628,0.000024921552,0.008991747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970231,0.00012965626,0.0004207293,0.0007771743,0.000607276,0.0010420808],"domain_scores_gemma":[0.99782485,0.0008836593,0.00007409452,0.0007203581,0.00037081612,0.00012624417],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013375815,0.00019580498,0.00022594327,0.00023755351,0.00060146244,0.000223024,0.001176708,0.00012992296,0.00011226856],"category_scores_gemma":[0.00005590718,0.00017157519,0.0001416093,0.00048399897,0.000104145714,0.0004913754,0.00091637584,0.00020519276,0.00087818975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007947659,0.0009626947,0.015360136,0.00010741097,0.000044824857,0.000066944456,0.0028399136,0.0029627744,0.015695127,0.6544666,0.20235418,0.105059914],"study_design_scores_gemma":[0.00027250004,0.00017243408,0.001578681,0.000046151705,0.0000031744512,0.000013669223,0.00011444897,0.69659084,0.106503196,0.017271738,0.17705053,0.00038263976],"about_ca_topic_score_codex":0.00019292111,"about_ca_topic_score_gemma":0.0005506508,"teacher_disagreement_score":0.7091531,"about_ca_system_score_codex":0.00018556703,"about_ca_system_score_gemma":0.000031695705,"threshold_uncertainty_score":0.99989974},"labels":[],"label_agreement":null},{"id":"W7096806676","doi":"","title":"SORTS: INTEGRATING SOAR WITH A REAL-TIME STRATEGY GAME Investigators","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Soar; Scripting language; Interface (matter); Adversary; Variety (cybernetics); Simple (philosophy); State (computer science); Architecture","score_opus":0.024375693467973195,"score_gpt":0.2761349436355481,"score_spread":0.2517592501675749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096806676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32355818,0.000012287602,0.61198276,0.00027864386,0.00009253007,0.00014935661,3.2643487e-7,0.0005478652,0.06337801],"genre_scores_gemma":[0.8610796,0.000004307091,0.13654976,0.00038887392,0.000082796905,0.0000056404797,9.339968e-7,0.000016863189,0.0018712551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982415,0.00003981488,0.00039339534,0.00045804365,0.00036046322,0.00050676934],"domain_scores_gemma":[0.99872124,0.00021225848,0.00012250601,0.00056067656,0.00013972257,0.0002435928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000668855,0.00020219316,0.00018386639,0.0001412422,0.000099727,0.00024679347,0.0008075915,0.00007899385,0.0001266236],"category_scores_gemma":[0.000097410855,0.00014580373,0.00004502424,0.00063679565,0.00021906615,0.00070729473,0.00013991194,0.00019167374,0.00037890984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002768463,0.00013247554,0.008639578,0.000016278378,0.00005110353,0.00026714505,0.0063988813,0.0010004542,0.03913508,0.74324846,0.0022161205,0.19886672],"study_design_scores_gemma":[0.00027747586,0.0015104192,0.004467154,0.00025464347,0.000025387773,0.00021580362,0.006218896,0.27740216,0.61409837,0.090488106,0.003212168,0.0018294364],"about_ca_topic_score_codex":0.00077434507,"about_ca_topic_score_gemma":0.00059256254,"teacher_disagreement_score":0.6527604,"about_ca_system_score_codex":0.000061668856,"about_ca_system_score_gemma":0.00018546988,"threshold_uncertainty_score":0.59457034},"labels":[],"label_agreement":null},{"id":"W7097522467","doi":"","title":"Date: University of Alberta Transposition Table Driven Scheduling for Two-Player Games","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Transposition (logic); Scheduling (production processes); Table (database); Task (project management); Order (exchange)","score_opus":0.032440207727081435,"score_gpt":0.255511716271153,"score_spread":0.22307150854407154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097522467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16608587,0.000017621202,0.83045506,0.00043844184,0.0000886697,0.00013227118,0.000002947408,0.00004863151,0.0027304932],"genre_scores_gemma":[0.8241955,0.000014551861,0.17406543,0.00006356862,0.000018886585,8.409371e-7,0.000003615796,0.0000040806235,0.0016335447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993207,0.00001981274,0.0001325968,0.00023469102,0.000116470954,0.00017576614],"domain_scores_gemma":[0.99935955,0.00015316898,0.000056119774,0.0002654042,0.000116858755,0.000048889753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007668552,0.000074930846,0.000120141114,0.000052963016,0.00015773618,0.000014088668,0.0005224805,0.00004008184,0.0000806031],"category_scores_gemma":[0.000017712968,0.00007796209,0.000060664566,0.00019431842,0.00008556933,0.00055037887,0.000047601447,0.000046566525,0.000038254584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022910484,0.00062179414,0.01681166,0.000107722786,0.00017510219,0.00005224439,0.03028488,0.13453527,0.12740432,0.64668095,0.0043517575,0.038745172],"study_design_scores_gemma":[0.00027758954,0.00013327696,0.0006128596,0.000031384043,0.000015879263,0.000014783565,0.00045602987,0.7041683,0.28688458,0.0020248087,0.005134329,0.00024616724],"about_ca_topic_score_codex":0.001367907,"about_ca_topic_score_gemma":0.0006384129,"teacher_disagreement_score":0.6581096,"about_ca_system_score_codex":0.000014847631,"about_ca_system_score_gemma":0.000063695385,"threshold_uncertainty_score":0.31792015},"labels":[],"label_agreement":null},{"id":"W7097801551","doi":"","title":"University of Alberta Playing and Solving Havannah","year":2014,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Heuristic; Permission; Tree (set theory); Association (psychology); Scheme (mathematics); Editorial board","score_opus":0.01906467585663277,"score_gpt":0.22654863476729734,"score_spread":0.20748395891066457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097801551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11745105,0.000010679005,0.8509896,0.0004184407,0.00005875366,0.00002313362,4.430144e-8,0.000029022925,0.031019304],"genre_scores_gemma":[0.95817316,0.0000036641152,0.040214226,0.000057437992,0.0000074618742,2.8443386e-8,4.4404544e-8,0.0000013344576,0.0015426676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964935,0.000019197592,0.000057734436,0.00012755094,0.00006112563,0.00008501696],"domain_scores_gemma":[0.9995564,0.0001760971,0.000029450171,0.00017559461,0.000027445087,0.000034966983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011237074,0.000035648598,0.000059077433,0.000028100592,0.00006762138,0.00002113276,0.00028818188,0.000019323306,0.00003360813],"category_scores_gemma":[0.000058796344,0.000035493093,0.000014223714,0.00006344361,0.00005509378,0.00022656587,0.00019143887,0.000028858489,0.00002658404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005865021,0.000037436545,0.04471003,0.000021552923,0.000015074522,0.0000035453293,0.0083532855,0.0002615696,0.006720002,0.6750159,0.002064492,0.2627912],"study_design_scores_gemma":[0.000060428032,0.000064433756,0.006630637,0.00002448547,0.0000042518805,0.0000047521735,0.0005688162,0.9577368,0.01658422,0.008836268,0.00931155,0.00017338723],"about_ca_topic_score_codex":0.0013321993,"about_ca_topic_score_gemma":0.00059222966,"teacher_disagreement_score":0.9574752,"about_ca_system_score_codex":0.0000045766456,"about_ca_system_score_gemma":0.000009189381,"threshold_uncertainty_score":0.20138958},"labels":[],"label_agreement":null},{"id":"W7099882816","doi":"","title":"THE TELEHEALTH INDUSTRY IN CANADA: INDUSTRY PROFILE AND CAPABILITY ANALYSIS","year":2000,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Telehealth; Telemedicine; Industry 4.0; eHealth","score_opus":0.02038592766462208,"score_gpt":0.2686823361306488,"score_spread":0.2482964084660267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099882816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889086,0.00006705672,0.00060893403,0.0045274375,0.000056432396,0.00014299712,0.0000021408894,0.00003045131,0.005655942],"genre_scores_gemma":[0.9972641,0.00001635512,0.0007945636,0.0005818063,0.000019372756,0.00001534673,3.7197808e-7,0.0000026520333,0.0013054732],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986394,0.00011675735,0.0003168984,0.00033621906,0.00024554445,0.00034520356],"domain_scores_gemma":[0.9989859,0.00024632755,0.00004378987,0.00055359636,0.000037818354,0.00013260705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049975066,0.00009784008,0.00015829816,0.000057447647,0.00016838076,0.000095957876,0.0006021854,0.00024766946,0.0004634664],"category_scores_gemma":[0.000065802,0.000067078065,0.000023596627,0.0012469601,0.00010161052,0.00019135866,0.00009351058,0.001056469,0.000010974818],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003317409,0.000020495621,0.6645845,0.0000026582677,0.00002462237,0.000008215598,0.00032832008,0.0010333298,0.000003030036,0.002217063,0.0010588344,0.33071563],"study_design_scores_gemma":[0.000046952126,0.000026338892,0.82600874,0.0000065922254,0.0000152715,0.0000056687522,0.0012511488,0.16387904,0.0015256841,0.002251169,0.004738111,0.00024528906],"about_ca_topic_score_codex":0.9255297,"about_ca_topic_score_gemma":0.98160905,"teacher_disagreement_score":0.33047032,"about_ca_system_score_codex":0.00030214156,"about_ca_system_score_gemma":0.0012408638,"threshold_uncertainty_score":0.5074632},"labels":[],"label_agreement":null},{"id":"W7100084560","doi":"","title":"Edmonton","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Turing; Focus (optics); Test (biology); Computer chess; Wish","score_opus":0.05531128643604556,"score_gpt":0.2785658207367446,"score_spread":0.22325453430069903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100084560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029974692,0.000031486346,0.84749925,0.0008473778,0.00018438729,0.000030231051,3.44814e-8,0.0002498774,0.12118269],"genre_scores_gemma":[0.93676287,0.000012406821,0.057099003,0.00048744847,0.00004013484,0.0000023101613,5.4532332e-8,0.0000019336771,0.0055938605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995584,0.000008839908,0.000078706275,0.00012867819,0.00011071638,0.00011468047],"domain_scores_gemma":[0.9996164,0.00002854263,0.000012521956,0.0002756927,0.000028598964,0.00003827608],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000453722,0.00003807546,0.000039968185,0.000025585246,0.000072053685,0.000019549867,0.00045694096,0.00001693114,0.00009609643],"category_scores_gemma":[0.00002045654,0.00003128228,0.00002194892,0.00012881703,0.00003695605,0.00026905088,0.000087656284,0.00003256958,0.0010732395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000138296,0.000063022395,0.0045134695,0.0000011999398,0.000005184848,0.00008719511,0.0021782483,0.00010201097,0.0023863018,0.81130856,0.03407535,0.14527807],"study_design_scores_gemma":[0.00009286592,0.00018500237,0.020140963,0.000008485875,0.000001910018,0.00032328244,0.00012693673,0.20160559,0.49119928,0.08432869,0.20132144,0.0006655501],"about_ca_topic_score_codex":0.000060897415,"about_ca_topic_score_gemma":0.000012322099,"teacher_disagreement_score":0.9067882,"about_ca_system_score_codex":0.000009001122,"about_ca_system_score_gemma":0.000020847481,"threshold_uncertainty_score":0.99970454},"labels":[],"label_agreement":null},{"id":"W7100116940","doi":"","title":"University of Alberta Move Groups as a General Enhancement for Monte Carlo Tree Search","year":2016,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Monte Carlo tree search; Tree (set theory); Permission; Game tree; Monte Carlo method; Field (mathematics); Group (periodic table)","score_opus":0.029400798988733837,"score_gpt":0.26997169824279754,"score_spread":0.24057089925406372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100116940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29631793,0.000011416913,0.69578046,0.0016493571,0.00010771458,0.0001816057,0.0000016770258,0.000022673894,0.005927139],"genre_scores_gemma":[0.92071754,0.000019798119,0.036269482,0.000081527636,0.00003464566,0.000002424991,1.975209e-7,0.000004661279,0.042869724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990959,0.000030608695,0.00013622796,0.0002914381,0.00019838815,0.0002474074],"domain_scores_gemma":[0.99910676,0.00022662946,0.000044927863,0.00040259617,0.00014390574,0.00007519165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015187972,0.00008246348,0.00011958886,0.00005198404,0.0000636615,0.00001855616,0.00076194573,0.000039250586,0.00016813062],"category_scores_gemma":[0.000037785754,0.000060955503,0.00008161057,0.00011643605,0.00008728159,0.00029139983,0.000257108,0.000027310964,0.00012885098],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011470392,0.00017856702,0.00092857785,0.000016549091,0.00007101959,0.000008284359,0.0057299994,0.0001671181,0.096550114,0.45355353,0.0041665137,0.43851504],"study_design_scores_gemma":[0.00036038482,0.0005157659,0.0004579504,0.00003313949,0.000009524143,0.0000025730933,0.0005206855,0.088422604,0.89047265,0.0097020045,0.009221961,0.0002807459],"about_ca_topic_score_codex":0.00410525,"about_ca_topic_score_gemma":0.0022924552,"teacher_disagreement_score":0.79392254,"about_ca_system_score_codex":0.000064009306,"about_ca_system_score_gemma":0.00007337972,"threshold_uncertainty_score":0.6205937},"labels":[],"label_agreement":null},{"id":"W7100262269","doi":"","title":"Abstract University of Alberta expert poker agent: A survey","year":2008,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Adversary; Artificial neural network; Table (database); Action (physics); Domain (mathematical analysis); Quality (philosophy); Backpropagation; Domain knowledge","score_opus":0.07503747154932862,"score_gpt":0.2702524622867508,"score_spread":0.1952149907374222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100262269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67545223,0.00006908097,0.27242884,0.0004951711,0.000286949,0.00010382513,0.0000017458925,0.00009417097,0.05106801],"genre_scores_gemma":[0.9888735,0.000048869206,0.0064993766,0.00010097334,0.00000998716,1.06488514e-7,8.72397e-7,0.0000029288701,0.0044633993],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993333,0.00003838908,0.0001207461,0.00020100134,0.00016015611,0.00014638405],"domain_scores_gemma":[0.99918336,0.00022473745,0.00005183976,0.0003893801,0.00008878392,0.000061876395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014277847,0.0000669448,0.0001009019,0.000042633896,0.00008259032,0.000010015009,0.00071047014,0.000039531587,0.00048803625],"category_scores_gemma":[0.00006183243,0.00006500404,0.000050026305,0.00020208485,0.000109538,0.0002922536,0.00016002242,0.000048713882,0.00039861654],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018618592,0.0019568556,0.34722126,0.00003852334,0.0002575176,0.00076347933,0.114227735,0.001435296,0.017011704,0.10293363,0.23039846,0.18356934],"study_design_scores_gemma":[0.00019212329,0.00011824505,0.85978657,0.000025672414,0.0000030766957,0.000037714053,0.0006419882,0.023310123,0.0769592,0.0011408594,0.037163116,0.00062128203],"about_ca_topic_score_codex":0.034501575,"about_ca_topic_score_gemma":0.005107172,"teacher_disagreement_score":0.5125653,"about_ca_system_score_codex":0.000017933762,"about_ca_system_score_gemma":0.00005923054,"threshold_uncertainty_score":0.97192776},"labels":[],"label_agreement":null},{"id":"W7100408523","doi":"","title":"AIPaint: A Sketch-Based Behavior Tree Authoring Tool","year":2011,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Interface (matter); Tree (set theory); Code (set theory); Simple (philosophy); User interface; Design tool; Authoring system; Program code","score_opus":0.09795581354597743,"score_gpt":0.2944840901339308,"score_spread":0.19652827658795335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100408523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084837854,0.000012662119,0.8864102,0.00025399265,0.0004694136,0.00018812767,4.577166e-7,0.000555238,0.027272072],"genre_scores_gemma":[0.8227619,6.013047e-7,0.17587046,0.0003817615,0.000042799627,0.00005476077,2.673435e-7,0.000009430513,0.00087801716],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871576,0.000045829394,0.00027164147,0.0003802504,0.00024065371,0.00034585083],"domain_scores_gemma":[0.99898154,0.0000721287,0.000056626675,0.0007152359,0.00007678944,0.00009770085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031524306,0.00013883365,0.00012340429,0.00010894299,0.00010208592,0.00010164815,0.0010795209,0.00006558417,0.000530009],"category_scores_gemma":[0.000069875045,0.00012224414,0.00008995375,0.00028736604,0.000074295574,0.00043540166,0.00018171381,0.00011701871,0.0007121152],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009684653,0.00033548608,0.015219529,0.0000070793244,0.000009277001,0.0001116224,0.0030649898,0.000030224748,0.0021008993,0.26713774,0.0008991639,0.7110743],"study_design_scores_gemma":[0.00019169973,0.00042535414,0.041105166,0.000044132306,0.000030854004,0.000019931282,0.00034885982,0.22767925,0.69911367,0.024697738,0.0053305333,0.0010127855],"about_ca_topic_score_codex":0.00019223284,"about_ca_topic_score_gemma":0.00013202509,"teacher_disagreement_score":0.73792404,"about_ca_system_score_codex":0.000039183615,"about_ca_system_score_gemma":0.00006973486,"threshold_uncertainty_score":0.91530377},"labels":[],"label_agreement":null},{"id":"W7105823618","doi":"10.33423/jabe.v27i6.7948","title":"The Games AIs Play - A Comprehensive Review","year":2025,"lang":"","type":"article","venue":"Journal of Applied Business and Economics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key (lock); Strategic management; Strategic planning; Business management; Business model","score_opus":0.024614341806654713,"score_gpt":0.26514613171448004,"score_spread":0.2405317899078253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105823618","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17773828,0.59079826,0.10074861,0.09379627,0.013855658,0.0017454841,0.000016300191,0.00004024875,0.021260913],"genre_scores_gemma":[0.21619238,0.7746612,0.0022387232,0.006119614,0.00046520113,0.000010245921,4.3582486e-7,0.000018193927,0.00029405334],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975679,0.000037974263,0.0015704861,0.0003263507,0.00012702387,0.00037026234],"domain_scores_gemma":[0.9966686,0.0006300544,0.0013376826,0.0005153885,0.00072966627,0.00011865701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084382173,0.00029773553,0.0008053486,0.00020560373,0.0005164596,0.0008285448,0.0012399177,0.000116498784,0.000022585813],"category_scores_gemma":[0.00009492762,0.00021426116,0.0001686462,0.000652559,0.00047210947,0.0004713596,0.00051320647,0.00040654853,0.000023609748],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013544796,0.00006162614,0.00006051049,0.0006983499,0.00023095298,0.000009483357,0.00044942088,0.002429821,0.000044414588,0.11612005,0.008884999,0.87087494],"study_design_scores_gemma":[0.0003635873,0.00007791815,0.0023248857,0.0031361224,0.000249209,0.00012737839,0.00073340995,0.016231617,0.0007388,0.050014406,0.92556435,0.00043831038],"about_ca_topic_score_codex":0.0000128197125,"about_ca_topic_score_gemma":0.0000137790175,"teacher_disagreement_score":0.9166794,"about_ca_system_score_codex":0.00010002457,"about_ca_system_score_gemma":0.0005763614,"threshold_uncertainty_score":0.8737317},"labels":[],"label_agreement":null},{"id":"W7106260558","doi":"10.2139/ssrn.5784417","title":"Hybrid Multi-Agent AI/MCTS Systems for Complex Information-Imperfect Games","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Perfect information; Adversary; Modular design; Reinforcement learning; Set (abstract data type); Monte Carlo tree search; Adaptation (eye); Imperfect","score_opus":0.03813081852907227,"score_gpt":0.315057956466393,"score_spread":0.2769271379373207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106260558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002926062,0.01103922,0.9680925,0.002672168,0.011081649,0.0033156688,0.00018985204,0.0002127836,0.0004700651],"genre_scores_gemma":[0.94675153,0.033241194,0.008924166,0.0013775653,0.00210567,0.00058280304,0.00013948974,0.00008942613,0.006788142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98492455,0.0007661642,0.0036995597,0.0013220715,0.0014812204,0.0078064105],"domain_scores_gemma":[0.9916888,0.00080996286,0.0025788622,0.0018318244,0.0025740413,0.0005165119],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0073121875,0.0013877391,0.0016481862,0.0012357722,0.0017689505,0.004041019,0.0060942676,0.00057397276,0.000051937288],"category_scores_gemma":[0.0010321753,0.0013733917,0.0013783596,0.0006338119,0.00035097467,0.0027865055,0.0019357301,0.008607822,0.000406067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00028082335,0.00053173554,0.00032440506,0.0010588166,0.0023366278,0.00001536651,0.004260046,0.17352226,0.00010853565,0.46095,0.0071725836,0.34943882],"study_design_scores_gemma":[0.0007984711,0.00083292404,0.00006691094,0.00091709493,0.00024831112,0.00097057695,0.0025444634,0.8077934,0.0006556948,0.104332805,0.07949232,0.0013470452],"about_ca_topic_score_codex":0.0008384355,"about_ca_topic_score_gemma":0.00042005518,"teacher_disagreement_score":0.9591684,"about_ca_system_score_codex":0.006700885,"about_ca_system_score_gemma":0.025192786,"threshold_uncertainty_score":0.9998873},"labels":[],"label_agreement":null},{"id":"W7113193296","doi":"","title":"ArtsIT, Interactivity and Game Creation:13th EAI International Conference, ArtsIT 2024, Abu Dhabi, United Arab Emirates, November 13–15, 2024, Proceedings, Part I","year":2025,"lang":"en","type":"article","venue":"VBN Forskningsportal (Aalborg Universitet)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Julius-Maximilians-Universität Würzburg; Università degli Studi di Udine; University of Tsukuba; Universidad Carlos III de Madrid; Universitat de Barcelona; Mittuniversitetet; RMIT University; National University of Singapore; Universitat Politècnica de Catalunya; Universitat Oberta de Catalunya; National and Kapodistrian University of Athens; University of Cyprus; Universidade do Porto; New York University Abu Dhabi; University of Wollongong; York University; University of Hull; Middlesex University; King's College London; University of Portsmouth; Nanyang Technological University; Cyprus University of Technology","keywords":"Interactivity; The Internet; Foreign policy; Field (mathematics)","score_opus":0.018790229939292375,"score_gpt":0.26184005446757586,"score_spread":0.24304982452828347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7113193296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6912571,0.00013215088,0.031451453,0.0028882385,0.0027840906,0.0006560675,0.00005940764,0.0005020526,0.27026942],"genre_scores_gemma":[0.9196652,0.00012237998,0.0016058612,0.00066026277,0.00016809207,0.000013055133,0.00008844183,0.000024527502,0.07765216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972576,0.000037771915,0.00057136494,0.0010271707,0.0005346189,0.0005714824],"domain_scores_gemma":[0.99790335,0.00016926549,0.00041823677,0.000446659,0.0008058771,0.00025663892],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033170026,0.00046275454,0.000437319,0.0010529512,0.00033768,0.00065751607,0.0011758606,0.00023233949,0.0016138447],"category_scores_gemma":[0.00015028947,0.0004964364,0.00015113209,0.0016794244,0.0003702413,0.0025303636,0.00074908277,0.0005793704,0.00016065247],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037675662,0.0007159329,0.2155786,0.00013698748,0.00072900293,0.00041379765,0.009594204,0.00047153866,0.0022044282,0.57784796,0.17427532,0.01765547],"study_design_scores_gemma":[0.001085011,0.00030078518,0.016475454,0.0009020304,0.00018710841,0.00010212884,0.0071347435,0.11094907,0.009017211,0.012454053,0.839838,0.0015543476],"about_ca_topic_score_codex":0.0005057245,"about_ca_topic_score_gemma":0.00030181973,"teacher_disagreement_score":0.66556275,"about_ca_system_score_codex":0.00025894318,"about_ca_system_score_gemma":0.0002706909,"threshold_uncertainty_score":0.9997487},"labels":[],"label_agreement":null},{"id":"W7113672235","doi":"","title":"Proceedings of the Fourteenth International Conference on Computational Creativity, ICCC 2023","year":2023,"lang":"en","type":"book","venue":"Discovery Research Portal (University of Dundee)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exposition (narrative); Government (linguistics); Context (archaeology)","score_opus":0.1349542432743247,"score_gpt":0.34632212755350766,"score_spread":0.21136788427918296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7113672235","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069039576,0.000022839024,0.0061657587,0.0022456294,0.0005694418,0.00060647225,0.00031725294,0.00006636511,0.98310226],"genre_scores_gemma":[0.24403591,0.00014098341,0.000525432,0.000015786152,0.00008476706,0.0000011626421,0.00005579412,0.000020373094,0.7551198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963771,0.000063512955,0.00026816074,0.0005710545,0.0023894208,0.00033075988],"domain_scores_gemma":[0.9974656,0.0004528674,0.0004212786,0.00037272627,0.0011965367,0.00009097184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079450407,0.0001975007,0.0003347357,0.0005114061,0.00024316458,0.00015320069,0.0034563788,0.00018633151,0.00030528038],"category_scores_gemma":[0.00015274674,0.0001913269,0.00027692667,0.00049299415,0.0011727103,0.00098767,0.0021249193,0.0007280716,0.0001500215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004666663,0.00013321498,0.00054042204,0.00007403673,0.00015698791,0.000040496103,0.0011316567,0.0002454393,0.00007582177,0.9390456,0.056663424,0.0018462436],"study_design_scores_gemma":[0.0004570656,0.00078477245,0.01589098,0.0023866359,0.00005279971,0.00001838499,0.010952831,0.04886715,0.0007972232,0.9128225,0.0061499625,0.0008197276],"about_ca_topic_score_codex":0.0002652404,"about_ca_topic_score_gemma":0.00031695626,"teacher_disagreement_score":0.23713195,"about_ca_system_score_codex":0.00014422424,"about_ca_system_score_gemma":0.0011548592,"threshold_uncertainty_score":0.78020847},"labels":[],"label_agreement":null},{"id":"W7115721531","doi":"10.1080/15295036.2025.2599286","title":"Containing games","year":2025,"lang":"en","type":"article","venue":"Critical Studies in Media Communication","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Premise; Containment (computer programming); Key (lock); Digital media","score_opus":0.1261917732847177,"score_gpt":0.4385473836910488,"score_spread":0.3123556104063311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115721531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04918975,0.09007543,0.6758152,0.110309064,0.0039021277,0.00061830226,0.0000018106238,0.00071935874,0.06936893],"genre_scores_gemma":[0.9630172,0.0016335353,0.034296732,0.0009278866,0.000019294646,0.000072804505,7.6876336e-7,0.0000029347307,0.000028798071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988511,0.00023478564,0.00033785394,0.00020852084,0.00014550277,0.00022219167],"domain_scores_gemma":[0.99316984,0.005688213,0.00002636554,0.0008667026,0.00021710379,0.000031799194],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0007010951,0.000089912144,0.00019136896,0.00011841372,0.0001819148,0.00006224501,0.0013000364,0.00005121438,0.0000053434296],"category_scores_gemma":[0.009749237,0.00008618883,0.000030331297,0.00048249585,0.00072097185,0.00028605928,0.0010225198,0.00024334762,0.000029477766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003415873,0.000041755546,0.0015544664,0.000017698396,0.000010075288,0.0000030394688,0.005971045,0.000010281903,0.000029813742,0.9100326,0.0006559785,0.08166988],"study_design_scores_gemma":[0.00014527045,0.00004098803,0.0039104973,0.0006139037,0.000012043056,0.0000021653534,0.014483936,0.02212447,0.002759793,0.94685614,0.008813814,0.00023695498],"about_ca_topic_score_codex":0.000024513094,"about_ca_topic_score_gemma":0.00014352083,"teacher_disagreement_score":0.9138275,"about_ca_system_score_codex":0.000116379786,"about_ca_system_score_gemma":0.00003740016,"threshold_uncertainty_score":0.9985921},"labels":[],"label_agreement":null},{"id":"W7115936304","doi":"10.1109/tg.2025.3646029","title":"Drafting “magic: The Gathering” With High-Dimensional Card Embeddings","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Embedding; Context (archaeology); Space (punctuation); Semantics (computer science); Similarity (geometry); Selection (genetic algorithm); Key (lock); Credit card","score_opus":0.01573454778033104,"score_gpt":0.26376566633596127,"score_spread":0.24803111855563023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115936304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05538792,0.00041145703,0.92717516,0.00848104,0.0041781086,0.0006512424,0.000021358836,0.0003065365,0.0033871722],"genre_scores_gemma":[0.9804362,0.0000783624,0.0072841346,0.0016881366,0.00013511814,0.00008703192,4.5851874e-7,0.00004676071,0.010243813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959089,0.0002685938,0.00079733226,0.0012082828,0.0009075578,0.0009093412],"domain_scores_gemma":[0.99674356,0.00095819315,0.00024408968,0.0014692098,0.00040934776,0.00017557535],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006158787,0.0006440045,0.00052489486,0.00038872636,0.0013993232,0.00077924057,0.0016331924,0.00022956695,0.0003046254],"category_scores_gemma":[0.000025013986,0.0004632881,0.00033895948,0.0017431855,0.0009701683,0.000666247,0.000020835592,0.0011808579,0.00041477196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002941356,0.0005939393,0.000059776637,0.000082489416,0.0005411438,0.000066642715,0.010246589,0.4414785,0.0025925385,0.008784927,0.0008832678,0.5343761],"study_design_scores_gemma":[0.00074543676,0.0010642782,0.00041600384,0.001634411,0.0005745193,0.00011904702,0.0023465536,0.5203979,0.45219135,0.004925356,0.013991383,0.0015937764],"about_ca_topic_score_codex":0.00066350395,"about_ca_topic_score_gemma":0.00024804115,"teacher_disagreement_score":0.9250483,"about_ca_system_score_codex":0.0002452626,"about_ca_system_score_gemma":0.00055577466,"threshold_uncertainty_score":0.9999007},"labels":[],"label_agreement":null},{"id":"W7118009751","doi":"10.1007/979-8-8688-1778-6_1","title":"A Quarter Century of GameMaker","year":2025,"lang":"en","type":"book-chapter","venue":"Apress eBooks","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Software; Quarter (Canadian coin); Cover (algebra); Globe","score_opus":0.024559373023109204,"score_gpt":0.2560692571330485,"score_spread":0.2315098841099393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118009751","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008470494,0.0005405675,0.045975946,0.00009965323,0.00088221574,0.00027216287,0.000015031847,0.00013152002,0.9520744],"genre_scores_gemma":[0.009537319,0.000054097196,0.0048226067,0.00044963503,0.00015942236,0.00002318546,0.0000034735476,0.000031974934,0.9849183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982666,0.000022087674,0.00053063704,0.00053607946,0.00038370845,0.00026093438],"domain_scores_gemma":[0.99798745,0.0001799133,0.00028338082,0.0012967733,0.00018118697,0.00007130191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011723954,0.0003090959,0.00043273473,0.00020884816,0.000048049256,0.00007304574,0.0013637131,0.0003114321,0.00009674723],"category_scores_gemma":[0.000019120389,0.00029716306,0.00023782499,0.00001625282,0.00019654809,0.00008024224,0.0005320925,0.00032677766,0.00013431895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056561676,0.000008250256,0.0000014156205,0.00006246232,0.00005851119,0.000018234521,0.0007067185,0.0000027579988,0.00014305902,0.8873097,0.0075042774,0.10417899],"study_design_scores_gemma":[0.00005570222,0.00006814522,0.000002770354,0.0006132098,0.00004293724,0.0000059004765,0.000016595479,0.0007253152,0.012178361,0.1765216,0.80932945,0.00044000783],"about_ca_topic_score_codex":0.000032021464,"about_ca_topic_score_gemma":0.000014847821,"teacher_disagreement_score":0.80182517,"about_ca_system_score_codex":0.00003235364,"about_ca_system_score_gemma":0.0001318606,"threshold_uncertainty_score":0.999948},"labels":[],"label_agreement":null},{"id":"W7123450846","doi":"10.1109/icet66147.2025.11321426","title":"Exhaustive Search, Heuristics, and Metaheuristics: A Unified Framework for N-Queens","year":2025,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Benchmarking; Robustness (evolution); Scalability; Novelty; Benchmark (surveying); Simulated annealing; Metaheuristic; Hill climbing","score_opus":0.05363530486804607,"score_gpt":0.3545752546578342,"score_spread":0.3009399497897881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123450846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097074587,0.0015212868,0.97939885,0.006327401,0.0026824959,0.0015064985,0.000061204664,0.00020072128,0.0073307953],"genre_scores_gemma":[0.5477752,0.0006172273,0.43849033,0.0016142402,0.0002873301,0.00006850758,0.0000034870243,0.00003133403,0.01111232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955182,0.00019986535,0.0010794939,0.001555773,0.0004895119,0.0011571466],"domain_scores_gemma":[0.9924317,0.0044299434,0.00020170934,0.0013225055,0.0012340918,0.00038007888],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012023468,0.00058442616,0.0007751554,0.00045996212,0.0007492563,0.0010899726,0.0015421426,0.000479053,0.00015573433],"category_scores_gemma":[0.003822168,0.00058058137,0.00022812998,0.0011749244,0.0011729507,0.00038167293,0.0013599095,0.0007734259,0.00011272164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009862854,0.00015502554,0.00043133256,0.00021062918,0.00021478589,0.0000193059,0.002076279,0.00025398712,0.000034022825,0.90128565,0.0031777837,0.092042595],"study_design_scores_gemma":[0.00016651335,0.0003492986,0.00037576925,0.0003634124,0.00019348499,0.0000040529835,0.001489761,0.3694223,0.0115990285,0.60601205,0.009482872,0.000541445],"about_ca_topic_score_codex":0.0002838064,"about_ca_topic_score_gemma":0.000048797883,"teacher_disagreement_score":0.5468045,"about_ca_system_score_codex":0.00014578209,"about_ca_system_score_gemma":0.0006897043,"threshold_uncertainty_score":0.999947},"labels":[],"label_agreement":null},{"id":"W7124132313","doi":"10.65109/rxps5681","title":"State of the Art Control of Atari Games Using Shallow Reinforcement Learning","year":2016,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Representation (politics); Set (abstract data type); Benchmark (surveying); Strengths and weaknesses; Control (management); Key (lock)","score_opus":0.037318631797922414,"score_gpt":0.27763514052342075,"score_spread":0.24031650872549834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124132313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08820091,0.0001469306,0.90721446,0.0010831673,0.0007023141,0.00044180593,0.000003650981,0.000028676397,0.0021781097],"genre_scores_gemma":[0.98899966,0.00008330243,0.0025479728,0.0001527773,0.000044775654,0.000004012653,1.07096696e-7,0.000016242788,0.008151135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963696,0.0003008253,0.0013729362,0.00049740134,0.0008754749,0.0005837789],"domain_scores_gemma":[0.99661344,0.0005785078,0.0010621422,0.0010959845,0.0005397067,0.00011021876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010596802,0.00028800173,0.00050792657,0.00012168563,0.00017723239,0.000067729765,0.0016499843,0.00007967429,0.0005519686],"category_scores_gemma":[0.0005103743,0.00016012903,0.00030605064,0.00044880155,0.00078207284,0.00065948337,0.00078184495,0.00020343506,0.00010088997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011884867,0.00011746116,0.026986703,0.00007577734,0.00022146346,0.000003952791,0.0042260885,0.3909723,0.15152714,0.022041798,0.00009701517,0.40361148],"study_design_scores_gemma":[0.00022654017,0.00025777498,0.0006441232,0.00042618535,0.000035285673,0.0000033140343,0.0001262085,0.7462312,0.24828942,0.0017313444,0.0018170917,0.00021152868],"about_ca_topic_score_codex":0.00038250675,"about_ca_topic_score_gemma":0.0001287552,"teacher_disagreement_score":0.9046665,"about_ca_system_score_codex":0.00011117913,"about_ca_system_score_gemma":0.00035828902,"threshold_uncertainty_score":0.6529872},"labels":[],"label_agreement":null},{"id":"W7124139285","doi":"10.65109/iylh7767","title":"Evaluating state-space abstractions in extensive-form games","year":2013,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Abstraction; Metric (unit); Focus (optics); Task (project management); Domain (mathematical analysis); Quality (philosophy); Perfect information; Imperfect","score_opus":0.10005970540252161,"score_gpt":0.37634042297198517,"score_spread":0.27628071756946354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124139285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75843227,0.0005247205,0.20368001,0.012873587,0.002436674,0.001605585,0.0000032010803,0.00026465853,0.020179266],"genre_scores_gemma":[0.9354064,0.00019316378,0.04942231,0.0009032084,0.00013857431,0.00013015066,8.767908e-7,0.000032200373,0.013773105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951501,0.00021818762,0.0013390937,0.0011394325,0.0009092342,0.001243941],"domain_scores_gemma":[0.99598473,0.00093136646,0.00040700653,0.0012406018,0.0010992923,0.00033702838],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011442641,0.00046644846,0.00046123716,0.00044537982,0.00034162938,0.0012485647,0.0013062038,0.0001880755,0.006576268],"category_scores_gemma":[0.00088816,0.00045263485,0.00016906671,0.0010563933,0.0003463175,0.005134211,0.0006150203,0.00073845725,0.01486658],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008880572,0.00031014095,0.0022822672,0.000028666298,0.00003018046,0.000029027513,0.009192925,0.024611304,0.006563473,0.013137727,0.0028046628,0.94100076],"study_design_scores_gemma":[0.00012465582,0.00028221318,0.02800628,0.0001306977,0.000010351322,0.000023086066,0.004373988,0.9066535,0.018333258,0.04046155,0.0009569183,0.0006434658],"about_ca_topic_score_codex":0.0077039446,"about_ca_topic_score_gemma":0.0013989838,"teacher_disagreement_score":0.94035727,"about_ca_system_score_codex":0.00031443118,"about_ca_system_score_gemma":0.0004672659,"threshold_uncertainty_score":0.9997925},"labels":[],"label_agreement":null},{"id":"W7124140261","doi":"10.65109/kzph7176","title":"Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms","year":2004,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmarking; Suite; Generator (circuit theory); Nash equilibrium; Test suite; Variation (astronomy)","score_opus":0.0996519275771312,"score_gpt":0.35129792755185135,"score_spread":0.25164599997472015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124140261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027729828,0.00084963633,0.937174,0.006371932,0.0017809827,0.0022657146,0.0000050090266,0.0002872917,0.023535596],"genre_scores_gemma":[0.75399154,0.000057370165,0.23897357,0.0050246166,0.000521885,0.00016521478,0.0000016415893,0.00005795674,0.001206223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925736,0.0006426141,0.0013654155,0.0018881694,0.0019072288,0.0016229517],"domain_scores_gemma":[0.99465775,0.00068896404,0.0003632436,0.0026390883,0.0010791597,0.0005718069],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00185459,0.00078834663,0.0006822694,0.00026120644,0.0009132283,0.0014705105,0.004662029,0.00024696635,0.0002545105],"category_scores_gemma":[0.00062026066,0.00056649966,0.00038788238,0.0023599328,0.0012028401,0.00063444546,0.00207661,0.0008542755,0.0033464401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003129306,0.00045191345,0.000018352408,0.00004446998,0.00008574929,0.000015013869,0.04213098,0.20564616,0.0007774143,0.4868153,0.00025732533,0.26372603],"study_design_scores_gemma":[0.0002876362,0.0008391622,0.00016198032,0.00017587251,0.00007388628,0.00011387826,0.007286435,0.85450166,0.011210831,0.122989856,0.0014554895,0.00090331904],"about_ca_topic_score_codex":0.000550162,"about_ca_topic_score_gemma":0.000029973306,"teacher_disagreement_score":0.7262617,"about_ca_system_score_codex":0.0003970107,"about_ca_system_score_gemma":0.0006900922,"threshold_uncertainty_score":0.9996787},"labels":[],"label_agreement":null},{"id":"W7124146486","doi":"10.65109/brgu5963","title":"Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization","year":2012,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Counterfactual thinking; Nash equilibrium; Tree traversal; Regret; Outcome (game theory); Minification; Game tree; Sampling (signal processing); Perfect information","score_opus":0.05229019621391458,"score_gpt":0.295960230657099,"score_spread":0.2436700344431844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124146486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23691794,0.0015739476,0.74245703,0.0011248081,0.005622158,0.0008940649,0.000014854032,0.0003356181,0.011059544],"genre_scores_gemma":[0.96366477,0.000049355956,0.031937264,0.00062521576,0.00089643773,0.00004051885,0.0000073651895,0.000056472785,0.0027226012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99405634,0.00037509855,0.0014368589,0.0010729576,0.0014264757,0.0016322553],"domain_scores_gemma":[0.99648905,0.00035386384,0.00063142,0.0015151019,0.00062369247,0.00038687917],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010953781,0.0006750023,0.000561337,0.00019504914,0.00037385034,0.0008117477,0.0015093092,0.00041406,0.00080347253],"category_scores_gemma":[0.00039830751,0.0006471507,0.0003095615,0.0011214613,0.0004670679,0.00270629,0.00090929976,0.00041089705,0.0018045873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022170244,0.0027188207,0.004793817,0.00031058447,0.0002938923,0.000013510517,0.18991733,0.5881649,0.0033370529,0.097086154,0.018730693,0.09441153],"study_design_scores_gemma":[0.00015884657,0.00018436716,0.00030713354,0.000104712126,0.00005789366,0.000027820304,0.0018991536,0.95207983,0.040051483,0.00038430767,0.00401259,0.0007318485],"about_ca_topic_score_codex":0.00031858747,"about_ca_topic_score_gemma":0.00002047783,"teacher_disagreement_score":0.7267468,"about_ca_system_score_codex":0.00042409118,"about_ca_system_score_gemma":0.00023512723,"threshold_uncertainty_score":0.99959797},"labels":[],"label_agreement":null},{"id":"W7124154598","doi":"10.65109/mwwb2216","title":"Baseline: practical control variates for agent evaluation in zero-sum domains","year":2013,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Variance reduction; Control variates; Baseline (sea); Variance (accounting); Estimator; Reduction (mathematics); Monte Carlo method; Overhead (engineering)","score_opus":0.07526867023720975,"score_gpt":0.3682046070428567,"score_spread":0.29293593680564695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124154598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008943833,0.00019459837,0.95717824,0.024581103,0.0020954586,0.0053002355,0.0000083705045,0.00008696602,0.0016111713],"genre_scores_gemma":[0.8757948,0.000037373906,0.11989698,0.0021719972,0.00031656123,0.001124803,0.000005752085,0.000025984447,0.0006257259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941453,0.0010919351,0.0014762663,0.0011407381,0.0011101686,0.0010355947],"domain_scores_gemma":[0.9924518,0.004303102,0.00038231385,0.00097513833,0.0015667522,0.00032087974],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006982667,0.00041666787,0.00050111755,0.00026642898,0.00024017315,0.0009496989,0.000862264,0.00030029073,0.00357529],"category_scores_gemma":[0.006748942,0.00037974145,0.00021613715,0.00062256155,0.00020364615,0.002184865,0.00023526645,0.0003515248,0.002197919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001965059,0.0021778822,0.0023163338,0.0000779931,0.0001705334,0.000018084058,0.0038579102,0.019062182,0.006162828,0.3077568,0.029762859,0.6284401],"study_design_scores_gemma":[0.0008029004,0.00034808303,0.0009687483,0.000046222143,0.000077726974,0.000007535964,0.00028566073,0.8928628,0.005156446,0.09710406,0.0019322049,0.00040759938],"about_ca_topic_score_codex":0.0010654934,"about_ca_topic_score_gemma":0.00030438058,"teacher_disagreement_score":0.87380064,"about_ca_system_score_codex":0.0003849747,"about_ca_system_score_gemma":0.0008592218,"threshold_uncertainty_score":0.9998655},"labels":[],"label_agreement":null},{"id":"W7124160341","doi":"10.65109/sfps9972","title":"Using counterfactual regret minimization to create competitive multiplayer poker agents","year":2010,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Perfect information; Counterfactual thinking; Regret; Nash equilibrium; Event (particle physics); Complete information; Extensive-form game; Imperfect","score_opus":0.09120569337096288,"score_gpt":0.35040027638990245,"score_spread":0.2591945830189396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124160341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3817541,0.000015131498,0.6017688,0.0008453612,0.004844194,0.00069555425,0.000027813085,0.00013411252,0.009914923],"genre_scores_gemma":[0.86995953,0.0000112339985,0.12440295,0.0018937996,0.00041491643,0.000010696331,0.0000049316486,0.000046623903,0.0032553344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956215,0.00018465548,0.0009847624,0.0013378069,0.000887228,0.0009840325],"domain_scores_gemma":[0.996581,0.00034380826,0.0003174287,0.0012330986,0.00094511133,0.00057952414],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052634766,0.0005796394,0.00048469048,0.00034974492,0.00053222786,0.0010492551,0.0015914496,0.00035984794,0.004959637],"category_scores_gemma":[0.00057573774,0.00057321414,0.00020724951,0.00085856847,0.00037555402,0.0013815678,0.0009684319,0.0006265548,0.0028647943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094906084,0.0029370352,0.043055713,0.00014832395,0.00087705953,0.0004791102,0.1379246,0.120550476,0.20998408,0.21904051,0.01808415,0.24596989],"study_design_scores_gemma":[0.0001762341,0.0001872699,0.0018273566,0.00011540609,0.0000412741,0.000036053527,0.0010106299,0.87688476,0.10753359,0.0002861139,0.011156018,0.000745319],"about_ca_topic_score_codex":0.0007929762,"about_ca_topic_score_gemma":0.0008677529,"teacher_disagreement_score":0.75633425,"about_ca_system_score_codex":0.00015806555,"about_ca_system_score_gemma":0.00029136342,"threshold_uncertainty_score":0.9999878},"labels":[],"label_agreement":null},{"id":"W7124161579","doi":"10.65109/pbvx6138","title":"Decision-theoretic Clustering of Strategies","year":2015,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Cluster analysis; Correlation clustering; Constrained clustering; Function (biology); Cluster (spacecraft); Greedy algorithm","score_opus":0.07367144056478175,"score_gpt":0.33406971203690244,"score_spread":0.2603982714721207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124161579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02514772,0.00059139566,0.90820026,0.00030053037,0.0025761141,0.00018295286,0.0000013399585,0.00007907083,0.06292059],"genre_scores_gemma":[0.8796642,0.00006205859,0.119416855,0.000077536926,0.00010433232,0.0000033297708,1.682507e-7,0.000014254051,0.00065725774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997021,0.00012920251,0.0009770608,0.00055804907,0.0008215875,0.00049309246],"domain_scores_gemma":[0.99710304,0.0005063677,0.0002611393,0.001127459,0.00066615286,0.00033582133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011496403,0.00027084374,0.0003922673,0.00019555536,0.00007809141,0.0005176553,0.0019402103,0.00014626051,0.00048975734],"category_scores_gemma":[0.0005331196,0.00024001749,0.00013396099,0.000693523,0.0006718784,0.0012901723,0.0011246386,0.00018488041,0.00065542466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000556953,0.000119192286,0.00018363545,0.000035141642,0.000021852584,0.000022533379,0.009367794,0.04053282,0.0002085212,0.5931081,0.0009629962,0.3553817],"study_design_scores_gemma":[0.00008189053,0.00033692122,0.00003876115,0.00012999114,0.00001022316,0.000018124658,0.005700574,0.6719533,0.0118194595,0.30906788,0.00060179626,0.00024105622],"about_ca_topic_score_codex":0.00024160655,"about_ca_topic_score_gemma":0.00016716485,"teacher_disagreement_score":0.8545165,"about_ca_system_score_codex":0.000070389266,"about_ca_system_score_gemma":0.00075514417,"threshold_uncertainty_score":0.9787629},"labels":[],"label_agreement":null},{"id":"W7124164008","doi":"10.65109/svvd7775","title":"Online implicit agent modelling","year":2013,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Limit (mathematics); Variance (accounting); Event (particle physics); Action (physics); Domain (mathematical analysis); Range (aeronautics); Outcome (game theory); Portfolio","score_opus":0.08703343898338213,"score_gpt":0.30929230914120864,"score_spread":0.22225887015782653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124164008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088284254,0.0004467346,0.89474523,0.0043635503,0.0015254276,0.00060888147,0.0000041270546,0.00024430075,0.009777481],"genre_scores_gemma":[0.83648443,0.00027693354,0.15032797,0.0020255346,0.00044791316,0.000029615861,0.0000021471024,0.00003134722,0.010374082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613047,0.000096044794,0.0010349184,0.0010477107,0.00061740226,0.0010734331],"domain_scores_gemma":[0.99719113,0.00018324258,0.0001877242,0.0014650563,0.0005113983,0.00046142962],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027474677,0.00043597314,0.00038886679,0.00017956864,0.00030629983,0.0010822555,0.0021961725,0.0002034348,0.005604275],"category_scores_gemma":[0.000044495097,0.00039832454,0.00023345288,0.00067297625,0.00019683702,0.0015788871,0.0009901085,0.00041012693,0.015102534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029640785,0.0007547185,0.00026113528,0.0000257749,0.00005740963,0.00001575319,0.0028840504,0.21955384,0.0013899966,0.09242367,0.0068489527,0.6757817],"study_design_scores_gemma":[0.000037496968,0.000118261974,0.00011620355,0.00004441434,0.000010915201,0.000011354019,0.00040763075,0.9512343,0.0071756872,0.03646956,0.0038990143,0.00047518863],"about_ca_topic_score_codex":0.0040468653,"about_ca_topic_score_gemma":0.000079203135,"teacher_disagreement_score":0.7482002,"about_ca_system_score_codex":0.00012254453,"about_ca_system_score_gemma":0.00015734145,"threshold_uncertainty_score":0.9999547},"labels":[],"label_agreement":null},{"id":"W7124164643","doi":"10.65109/xesw2404","title":"Asymmetric abstractions for adversarial settings","year":2014,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Abstraction; Adversarial system; Action (physics); Ideal (ethics); Domain (mathematical analysis); State space; Limit (mathematics); Expressive power","score_opus":0.0313780597559723,"score_gpt":0.3005814524195727,"score_spread":0.2692033926636004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124164643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053420465,0.00007097345,0.9263878,0.0062776697,0.00722508,0.00062268786,0.000008769248,0.00022433623,0.05864851],"genre_scores_gemma":[0.84711725,0.000025029414,0.14178215,0.0014945013,0.0019691228,0.00005423376,0.0000030447175,0.000029693132,0.007524989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687564,0.000100373196,0.0008131458,0.00092323805,0.00046997672,0.0008176206],"domain_scores_gemma":[0.99592024,0.0020627717,0.00033424876,0.000918621,0.00048552168,0.00027862334],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013855888,0.00031921442,0.00033752192,0.00041582226,0.000658506,0.0006720187,0.0014028196,0.00025009565,0.000455398],"category_scores_gemma":[0.0019774847,0.00032590533,0.0003352103,0.0009798541,0.00019307941,0.001035853,0.00029912154,0.00029908452,0.00235849],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001986902,0.00014941739,0.000058360292,0.000028062937,0.00003583259,7.700159e-7,0.00047095152,0.001049303,0.00020811996,0.22751513,0.028937668,0.7415265],"study_design_scores_gemma":[0.00017328319,0.00035459077,0.00020100127,0.000020127902,0.000039862338,0.0000073024157,0.00013909618,0.6164928,0.016045792,0.024624372,0.34150597,0.00039575656],"about_ca_topic_score_codex":0.0002133926,"about_ca_topic_score_gemma":0.000053867156,"teacher_disagreement_score":0.846583,"about_ca_system_score_codex":0.000110062705,"about_ca_system_score_gemma":0.00019370003,"threshold_uncertainty_score":0.9999193},"labels":[],"label_agreement":null},{"id":"W7124220798","doi":"10.65109/qfxi4541","title":"Online Monte Carlo Counterfactual Regret Minimization for Search in Imperfect Information Games","year":2015,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Counterfactual thinking; Monte Carlo tree search; Regret; Perfect information; Monte Carlo method; Outcome (game theory); Set (abstract data type); Search algorithm; Convergence (economics)","score_opus":0.08296548613523219,"score_gpt":0.3356971728778488,"score_spread":0.2527316867426166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124220798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3388202,0.0003224456,0.65440625,0.0023423033,0.0015550504,0.0014820796,0.00009185945,0.00012567168,0.000854161],"genre_scores_gemma":[0.9785088,0.00012141494,0.01949225,0.00062930066,0.00022926884,0.0000524172,0.00004414284,0.000021544343,0.00090089877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617577,0.00021417101,0.0013413733,0.00055974827,0.00088408863,0.00082486024],"domain_scores_gemma":[0.99676263,0.00044031462,0.00027522992,0.00074016955,0.0014648422,0.00031679426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015622148,0.00038791617,0.00044808123,0.0005781228,0.00012674373,0.0007976882,0.0011549024,0.00029339,0.00006937507],"category_scores_gemma":[0.0012052301,0.0003722505,0.00015760797,0.00097362016,0.0002093982,0.0051768427,0.0004108556,0.00033546152,0.00021368897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059847324,0.0006231791,0.005736744,0.00016859414,0.00006791821,0.000008679254,0.09717531,0.28886127,0.000056282814,0.0049495674,0.015802968,0.58595103],"study_design_scores_gemma":[0.0005593721,0.00086252956,0.0005354714,0.000104182625,0.000013958091,0.000010542871,0.008022631,0.97681636,0.0051568397,0.00048266712,0.007014523,0.0004209409],"about_ca_topic_score_codex":0.0017791914,"about_ca_topic_score_gemma":0.0015371738,"teacher_disagreement_score":0.6879551,"about_ca_system_score_codex":0.00052235514,"about_ca_system_score_gemma":0.0010042078,"threshold_uncertainty_score":0.9998729},"labels":[],"label_agreement":null},{"id":"W7124249354","doi":"10.65109/horc5194","title":"Presenting Multiagent Challenges in Team Sports Analytics","year":2023,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Analytics; Key (lock); Big data; Data analysis","score_opus":0.1713746874309061,"score_gpt":0.3487974385028897,"score_spread":0.1774227510719836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124249354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6403422,0.007046103,0.091047145,0.02555512,0.0102686,0.0026359567,0.000007000858,0.0024072342,0.22069065],"genre_scores_gemma":[0.9811182,0.007874005,0.0031437238,0.000089298635,0.00025983437,0.000021112839,0.000001278374,0.000031324562,0.0074612303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951349,0.00016354593,0.0011529715,0.0012542157,0.0010455252,0.001248826],"domain_scores_gemma":[0.99761695,0.00042680887,0.00024214303,0.0012963973,0.0001713153,0.00024637472],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018877734,0.00037996244,0.00044748213,0.0008071276,0.00017932843,0.00032464677,0.0015692236,0.00021633673,0.00032524785],"category_scores_gemma":[0.00049505424,0.00038935046,0.00018450194,0.0024279254,0.00018002385,0.0007362557,0.0015749097,0.0004302301,0.0016533126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008946905,0.00035949724,0.03209426,0.000118995995,0.00004066803,0.00073122827,0.023802813,0.03227882,0.00010179567,0.021272564,0.0015935475,0.88759685],"study_design_scores_gemma":[0.00007493458,0.000043730965,0.024234578,0.00014411978,0.000010440485,0.000007660672,0.0051258523,0.9542916,0.004195263,0.005538886,0.0058890115,0.00044395094],"about_ca_topic_score_codex":0.00023175919,"about_ca_topic_score_gemma":0.0007421311,"teacher_disagreement_score":0.92201275,"about_ca_system_score_codex":0.00011430577,"about_ca_system_score_gemma":0.00016485204,"threshold_uncertainty_score":0.9998558},"labels":[],"label_agreement":null},{"id":"W7124296281","doi":"10.65109/fkdg1872","title":"Minimax Exploiter: A Data Efficient Approach for Competitive Self-Play","year":2024,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ubisoft (Canada); McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Minimax; Key (lock); Reinforcement learning; Core (optical fiber); Stability (learning theory); Simple (philosophy); Component (thermodynamics); Game theory","score_opus":0.09681424090509325,"score_gpt":0.3333619045821295,"score_spread":0.23654766367703625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124296281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007590996,0.0032634956,0.9553727,0.0015592393,0.004050538,0.0019646543,0.00040090052,0.00072817015,0.031901207],"genre_scores_gemma":[0.5008324,0.00015928083,0.4932428,0.00041829076,0.0009679249,0.00020243233,0.0001516737,0.0000831639,0.003942083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933067,0.00019895226,0.001172167,0.003191633,0.00087961234,0.0012509233],"domain_scores_gemma":[0.99429566,0.0014577106,0.00014998562,0.0033710392,0.0003536685,0.00037193665],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018774684,0.00066626095,0.0006036515,0.0003866528,0.0004343779,0.0028001913,0.0058129136,0.00025301395,0.0004987252],"category_scores_gemma":[0.00021613986,0.0005965166,0.00029906197,0.0013481125,0.00040368913,0.0013012462,0.0035611754,0.00045138266,0.0015597898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007090274,0.002059598,0.000033503682,0.0009160797,0.0006307957,0.0001125198,0.036958825,0.0051491493,0.0004336942,0.6511857,0.030495515,0.2719537],"study_design_scores_gemma":[0.00009476469,0.00030724207,0.0000054588395,0.00020691699,0.0001144771,0.000048689028,0.0025776592,0.8857225,0.004804777,0.0009358839,0.10450159,0.00068001566],"about_ca_topic_score_codex":0.000043008007,"about_ca_topic_score_gemma":0.000014268138,"teacher_disagreement_score":0.8805734,"about_ca_system_score_codex":0.0002175895,"about_ca_system_score_gemma":0.00068128464,"threshold_uncertainty_score":0.99964863},"labels":[],"label_agreement":null},{"id":"W7124312491","doi":"10.65109/octa6133","title":"Targeted Search Control in AlphaZero for Effective Policy Improvement","year":2023,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Sample (material); Limiting; Control (management); Value (mathematics); State (computer science); Train; Function (biology)","score_opus":0.030651582168612298,"score_gpt":0.3479757694916265,"score_spread":0.3173241873230142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124312491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054788288,0.00012704435,0.91937566,0.015615007,0.0015391955,0.006942523,0.000055562392,0.00037680982,0.0011799335],"genre_scores_gemma":[0.9910416,0.000058410402,0.0023162505,0.0018113782,0.00049772917,0.0010817772,0.0000054033662,0.000041414227,0.0031460463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950825,0.00030004515,0.00092079444,0.0012257287,0.00066288863,0.0018080617],"domain_scores_gemma":[0.9962775,0.001996422,0.00013282457,0.0008507835,0.00044249342,0.0002999845],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025551945,0.00042261728,0.0005677376,0.0011494318,0.0002823004,0.00040867136,0.0015116078,0.00022519438,0.000120532306],"category_scores_gemma":[0.00093002233,0.00041101474,0.00027283933,0.0036942298,0.0002606674,0.0005937385,0.00063653867,0.00036345806,0.0012577208],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020497848,0.00027751256,0.00087098265,0.00010731717,0.00010990286,0.00003324606,0.006457514,0.01006593,0.028967906,0.067493886,0.0026388506,0.88277197],"study_design_scores_gemma":[0.00085816067,0.0013439754,0.001856926,0.000052598592,0.000009621046,0.0000010303569,0.0006003485,0.84698313,0.12925519,0.017263854,0.0013702695,0.00040485748],"about_ca_topic_score_codex":0.0035113797,"about_ca_topic_score_gemma":0.0005094403,"teacher_disagreement_score":0.9362533,"about_ca_system_score_codex":0.0005770975,"about_ca_system_score_gemma":0.0007084569,"threshold_uncertainty_score":0.9998342},"labels":[],"label_agreement":null},{"id":"W7124937367","doi":"10.1109/aeeca65693.2025.00156","title":"Research on Improving the AlphaZero Algorithm for Dots and Boxes Strategy Based on the Transformer Framework","year":2025,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Reinforcement learning; Monte Carlo tree search; Transformer; Encoder; Artificial neural network; Game theory; Potential game; Sequential game; Game complexity","score_opus":0.10172245168122494,"score_gpt":0.39778932178150495,"score_spread":0.29606687010028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124937367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021527756,0.0004179027,0.93560755,0.047678374,0.0009457306,0.00239116,0.000019934738,0.00006664096,0.0107199345],"genre_scores_gemma":[0.9709024,0.00012499517,0.018481962,0.0064227926,0.00029059235,0.00037947955,8.809007e-7,0.000028877319,0.0033680105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951368,0.0007323773,0.000663844,0.001168433,0.0010762749,0.0012222603],"domain_scores_gemma":[0.98128706,0.016423529,0.000096282645,0.0015356465,0.00051428593,0.00014319111],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0056615523,0.00042186092,0.00031903095,0.00032864514,0.002542193,0.0020758791,0.0024660674,0.00034383513,0.0002274398],"category_scores_gemma":[0.0006846945,0.00022599679,0.00021156868,0.0016081544,0.0012479739,0.00033327835,0.00019707064,0.0016196348,0.00006529016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006003773,0.00011925206,0.000006718616,0.000027482047,0.000027540464,0.0000021361548,0.00079676404,0.00071494933,0.00011366207,0.3114381,0.0016547595,0.68503857],"study_design_scores_gemma":[0.00010694419,0.0011283404,0.000097376265,0.00031705387,0.000019652685,7.268706e-7,0.0030883912,0.8354262,0.049944337,0.10660224,0.003033894,0.00023483636],"about_ca_topic_score_codex":0.00044153957,"about_ca_topic_score_gemma":0.0001260303,"teacher_disagreement_score":0.96874964,"about_ca_system_score_codex":0.00011976933,"about_ca_system_score_gemma":0.00074597326,"threshold_uncertainty_score":0.9989601},"labels":[],"label_agreement":null},{"id":"W7125897131","doi":"10.1109/smc58881.2025.11343571","title":"Can AlphaZero Master Human Concepts in Tic-Tac-Toe?","year":2025,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hierarchy; Simple (philosophy); Key (lock); Training (meteorology)","score_opus":0.05443323962019618,"score_gpt":0.35066400053408725,"score_spread":0.29623076091389106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125897131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26981616,0.0012990499,0.3551834,0.032107018,0.0077546616,0.0018306561,0.000011970761,0.0004292412,0.33156785],"genre_scores_gemma":[0.9251836,0.000032007694,0.0026779743,0.0041040606,0.00013148869,0.000034923705,0.0000017385246,0.000019880517,0.06781433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952756,0.0003154672,0.001369248,0.0013292815,0.0005369347,0.0011734595],"domain_scores_gemma":[0.99748576,0.00031659793,0.00019334033,0.0015340257,0.00024674574,0.00022353971],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007161097,0.0005101999,0.00060038496,0.0005847222,0.0003353998,0.00077596173,0.0025824392,0.00030818983,0.002141643],"category_scores_gemma":[0.00016252845,0.0005230013,0.0001875682,0.0017626721,0.0006779387,0.000678448,0.0012999083,0.0006031118,0.000809653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002228004,0.00047273355,0.024381187,0.00008906163,0.000074268886,0.0001706513,0.011536951,0.0006478578,0.0025393725,0.6292341,0.010886328,0.31994525],"study_design_scores_gemma":[0.0013560174,0.0008960294,0.021281067,0.0018510139,0.000105042236,0.000021935222,0.0060880715,0.43287933,0.22016144,0.2476238,0.06454504,0.003191228],"about_ca_topic_score_codex":0.0026221368,"about_ca_topic_score_gemma":0.008321395,"teacher_disagreement_score":0.65536743,"about_ca_system_score_codex":0.00033731086,"about_ca_system_score_gemma":0.00050769234,"threshold_uncertainty_score":0.99996835},"labels":[],"label_agreement":null},{"id":"W7126418054","doi":"10.21428/594757db.38e0bde0","title":"Detecting Aimbot Usage in Minecraft Using a Long Short-Term Memory Model","year":2025,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cheating; Flagging; Lock (firearm); Enhanced Data Rates for GSM Evolution; Server; Liveness; Reputation; Base (topology)","score_opus":0.06543545160495917,"score_gpt":0.33850329073125723,"score_spread":0.27306783912629806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126418054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42944655,0.000042702733,0.5651337,0.00010467681,0.00016090386,0.000100952944,1.15020796e-7,0.00009741,0.0049129743],"genre_scores_gemma":[0.9129829,0.0000024461365,0.085614994,0.00028995928,0.00002223241,0.0000083947925,1.1992032e-7,0.000007187243,0.0010717653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851424,0.000049408125,0.0003922975,0.00046524027,0.0001929193,0.00038590995],"domain_scores_gemma":[0.99915814,0.00015888984,0.000037577956,0.0005342964,0.000057107234,0.00005398936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000422608,0.00015231385,0.00018353443,0.00030919252,0.00011179244,0.00018228803,0.00086934835,0.000079537174,0.000015771151],"category_scores_gemma":[0.0001098739,0.0001502095,0.0000635808,0.0007081445,0.000054041826,0.00056994,0.0005106574,0.00019017197,0.000015361431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014421049,0.0002051759,0.049865205,0.00006886844,0.000030593987,0.00018627134,0.004333463,0.3637352,0.086773045,0.013045622,0.00009737887,0.48164475],"study_design_scores_gemma":[0.000027199294,0.000007842022,0.00063515035,0.00006704437,0.0000032062007,0.0000050663402,0.00012515644,0.9055577,0.090132415,0.0032911524,0.0000032274972,0.00014481747],"about_ca_topic_score_codex":0.00024699155,"about_ca_topic_score_gemma":0.0012346694,"teacher_disagreement_score":0.5418225,"about_ca_system_score_codex":0.00012786034,"about_ca_system_score_gemma":0.00013330237,"threshold_uncertainty_score":0.61253655},"labels":[],"label_agreement":null},{"id":"W7128902773","doi":"10.26503/dl.v2023i2.2006","title":"Finding the GaaP - Data, Dashboards, and Independent Games","year":2023,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Arts and Humanities Research Council; York University","keywords":"Payment; Component (thermodynamics); Term (time); Relation (database)","score_opus":0.1335843503321477,"score_gpt":0.3535721166153703,"score_spread":0.2199877662832226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128902773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25074866,0.005823592,0.6095174,0.076074414,0.015086132,0.002685662,0.0001741532,0.0021489926,0.03774101],"genre_scores_gemma":[0.98093337,0.0015095996,0.0020458428,0.00092021463,0.0004587145,0.000017810527,0.000012833262,0.00003023328,0.014071406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957377,0.00025510605,0.0006856796,0.0014196725,0.00096680375,0.0009350916],"domain_scores_gemma":[0.9951202,0.0010847017,0.00019843195,0.0032663648,0.00010749886,0.00022278365],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027158668,0.00036198337,0.00031381173,0.00023472031,0.00086640066,0.0018415204,0.005248105,0.00016574704,0.00050485],"category_scores_gemma":[0.00054302614,0.00025412327,0.0000717579,0.0015065692,0.0006339125,0.0015341163,0.00881506,0.0005296701,0.0027562997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010286883,0.000060021965,0.005931072,0.000039997343,0.00010298123,0.00011134261,0.010344526,0.0004982575,0.00029135137,0.075038485,0.06974346,0.8378282],"study_design_scores_gemma":[0.00008170652,0.00009190182,0.008282943,0.00008946171,0.00003858366,0.00004601156,0.0051147854,0.9120281,0.003237856,0.012905728,0.05755283,0.0005301402],"about_ca_topic_score_codex":0.0005084999,"about_ca_topic_score_gemma":0.00040747254,"teacher_disagreement_score":0.9115298,"about_ca_system_score_codex":0.000045096935,"about_ca_system_score_gemma":0.00022849446,"threshold_uncertainty_score":0.9999911},"labels":[],"label_agreement":null},{"id":"W7135582763","doi":"","title":"HEX:The Full Story","year":2019,"lang":"en","type":"book","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Newspaper; Identity (music); Set (abstract data type); Danish; Computer game","score_opus":0.04107550856654685,"score_gpt":0.25398693646135206,"score_spread":0.21291142789480522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135582763","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0405931,0.0018305208,0.024604354,0.0020406712,0.0007712594,0.0027916187,0.002709218,0.00028480386,0.92437446],"genre_scores_gemma":[0.034272615,0.00030585818,0.001937457,0.000029081932,0.00014510652,1.9317315e-7,0.000052013547,0.00008893568,0.96316874],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9929045,0.0010089178,0.00046339404,0.001434512,0.0030319295,0.0011567584],"domain_scores_gemma":[0.992714,0.0013006909,0.0011235209,0.0028149416,0.0015993195,0.0004475118],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003395827,0.0006412037,0.0011059421,0.0012214598,0.0012480917,0.00009731713,0.009096485,0.00095841096,0.009775084],"category_scores_gemma":[0.00017010966,0.0007256709,0.00095869333,0.00095863576,0.003944266,0.00047119023,0.0035950847,0.0025800248,0.018251479],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002733774,0.0012445434,0.0032612274,0.0020123508,0.0040048836,0.0050601647,0.21583395,0.00064413255,0.0019492058,0.033076223,0.65646636,0.07371318],"study_design_scores_gemma":[0.0015915032,0.0010672788,0.00017641707,0.0015790426,0.00045563496,0.00008985426,0.43635693,0.0042139655,0.00014102214,0.013104049,0.53885573,0.0023685624],"about_ca_topic_score_codex":0.0019580917,"about_ca_topic_score_gemma":0.003264819,"teacher_disagreement_score":0.22052297,"about_ca_system_score_codex":0.00040365462,"about_ca_system_score_gemma":0.0024078742,"threshold_uncertainty_score":0.99972105},"labels":[],"label_agreement":null},{"id":"W7153988330","doi":"10.1145/3772318.3808902","title":"10.1145/3772318.3808902","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Creativity; Research design; Design methods; Teaching method","score_opus":0.01430065475079304,"score_gpt":0.21794255016895697,"score_spread":0.20364189541816394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7153988330","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007036236,0.000040594954,0.0010042834,0.0011181703,0.000011155583,0.00014797114,0.0000018809297,0.00035200454,0.9966203],"genre_scores_gemma":[0.0010631934,3.3716324e-7,0.0042980085,0.00022890899,0.00011822222,0.000014113283,0.0000010296449,0.000012374083,0.9942638],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878985,0.00004118366,0.00021194777,0.00035797388,0.00025381608,0.0003452573],"domain_scores_gemma":[0.9990071,0.00007640492,0.00002700534,0.0006663029,0.000056861965,0.00016634619],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001737734,0.00013327078,0.00013506225,0.00007941741,0.00009827215,0.00015584247,0.0011415216,0.000052521325,0.9714377],"category_scores_gemma":[0.00004503674,0.00013097106,0.00005750443,0.00041713112,0.00004408072,0.00032905478,0.00014875567,0.00009046885,0.9932153],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007218279,0.000027481845,1.8324016e-7,9.859855e-7,0.0000043177934,0.0000085542615,0.00007376858,0.0005219659,0.00006379567,0.00011600131,0.10998481,0.8891909],"study_design_scores_gemma":[0.000022292903,0.0000983732,0.000011127291,0.000008390595,0.0000023109437,0.000008171484,8.004878e-7,0.016485529,0.001987448,0.00026436057,0.98093724,0.00017393347],"about_ca_topic_score_codex":0.000031630607,"about_ca_topic_score_gemma":3.1143134e-7,"teacher_disagreement_score":0.889017,"about_ca_system_score_codex":0.00003362472,"about_ca_system_score_gemma":0.00003552381,"threshold_uncertainty_score":0.5340845},"labels":[],"label_agreement":null},{"id":"W7154024853","doi":"10.1145/3772318.3808888","title":"10.1145/3772318.3808888","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"","score_opus":0.014170830310014168,"score_gpt":0.2184871316893748,"score_spread":0.20431630137936063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7154024853","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065771415,0.00003912065,0.0014589861,0.0010821177,0.0000111622485,0.00014742839,0.0000018867245,0.00037539582,0.9962262],"genre_scores_gemma":[0.0011178209,3.3231152e-7,0.0043747346,0.00023254997,0.00011609231,0.0000143695,0.0000010395986,0.000012577298,0.9941305],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987746,0.0000418308,0.00021503495,0.00036287153,0.00025618912,0.00034947818],"domain_scores_gemma":[0.99899566,0.00007757286,0.000027421076,0.00067305437,0.000057747202,0.00016856128],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017780297,0.00013514602,0.00013736101,0.00008049901,0.000099476645,0.00015760184,0.001154975,0.00005326536,0.9700874],"category_scores_gemma":[0.000045751556,0.00013275382,0.000058702306,0.0004256103,0.000044652057,0.00033490654,0.0001511322,0.000091704176,0.9929904],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075358353,0.000027925278,2.4301275e-7,0.000001029136,0.0000044700064,0.00000868651,0.000073414914,0.00039710687,0.000074933654,0.00012299849,0.07073349,0.92854816],"study_design_scores_gemma":[0.000023003395,0.0001001899,0.00001517384,0.000008729726,0.0000024000842,0.000008436079,8.426131e-7,0.01294078,0.0017809251,0.0002951101,0.98464733,0.00017707677],"about_ca_topic_score_codex":0.000032461852,"about_ca_topic_score_gemma":3.2944524e-7,"teacher_disagreement_score":0.9283711,"about_ca_system_score_codex":0.00003429247,"about_ca_system_score_gemma":0.000037293983,"threshold_uncertainty_score":0.54135436},"labels":[],"label_agreement":null},{"id":"W7154091200","doi":"10.1145/3772318.3809072","title":"10.1145/3772318.3809072","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Creativity; Component (thermodynamics)","score_opus":0.014109978818911031,"score_gpt":0.2183923641918962,"score_spread":0.20428238537298515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7154091200","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064292643,0.000039075014,0.0014510914,0.0010812831,0.000011062464,0.00014599736,0.0000018578984,0.00037199384,0.99625474],"genre_scores_gemma":[0.0010762296,3.297923e-7,0.0043547107,0.0002328081,0.000115137984,0.000014135107,0.0000010496742,0.000012440928,0.99419314],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987858,0.00004158709,0.0002127739,0.0003597922,0.000253717,0.0003463252],"domain_scores_gemma":[0.9990036,0.00007681208,0.000027102435,0.000668723,0.0000571197,0.00016667061],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017621282,0.00013365019,0.00013600614,0.00007961015,0.00009865824,0.00015588733,0.0011462712,0.000052682975,0.96969944],"category_scores_gemma":[0.000045361518,0.00013121605,0.000057999696,0.00041861716,0.000044212145,0.00032951983,0.00014985702,0.0000907176,0.9932503],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007442754,0.000027462693,2.3531662e-7,0.0000010293925,0.0000044129324,0.000008597899,0.0000744376,0.0003955779,0.0000745354,0.00012304909,0.0704021,0.9288811],"study_design_scores_gemma":[0.000022546536,0.00009919175,0.000014531812,0.00000865675,0.0000023607265,0.000008299643,8.3047183e-7,0.013119369,0.0017808751,0.00030424405,0.984464,0.00017511501],"about_ca_topic_score_codex":0.00003288944,"about_ca_topic_score_gemma":3.2701973e-7,"teacher_disagreement_score":0.928706,"about_ca_system_score_codex":0.000033830052,"about_ca_system_score_gemma":0.000036873294,"threshold_uncertainty_score":0.53508353},"labels":[],"label_agreement":null},{"id":"W7154179098","doi":"10.1145/3772318.3808895","title":"10.1145/3772318.3808895","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); The arts; Component (thermodynamics); Focus (optics)","score_opus":0.014116768747370159,"score_gpt":0.2184151820051727,"score_spread":0.20429841325780254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7154179098","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006284609,0.000040334624,0.0014098672,0.001075891,0.000011045774,0.00014583665,0.0000018556531,0.00037950862,0.9963072],"genre_scores_gemma":[0.0010503257,3.409796e-7,0.0044053947,0.00023240119,0.000115232724,0.000014133254,0.0000010516501,0.000012407156,0.9941687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987865,0.000041339437,0.00021271409,0.000359658,0.0002536081,0.00034617522],"domain_scores_gemma":[0.9990039,0.00007680862,0.000027080936,0.0006685027,0.000057096117,0.00016660648],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017626093,0.00013361903,0.0001359251,0.00007823981,0.00009837948,0.00015603604,0.0011459192,0.00005265132,0.9699074],"category_scores_gemma":[0.00004530597,0.00013118112,0.000057967474,0.0004183062,0.000044170967,0.0003294076,0.00014987196,0.00009068884,0.9929955],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074153886,0.0000274117,2.3319272e-7,0.0000010122147,0.000004397413,0.000008558934,0.000073304494,0.00039516517,0.000074600124,0.0001219228,0.072408006,0.926878],"study_design_scores_gemma":[0.000022543212,0.000098959295,0.00001412616,0.00000862187,0.0000023593252,0.000008185418,8.2513463e-7,0.013612429,0.0017675895,0.0003002526,0.9839892,0.00017492501],"about_ca_topic_score_codex":0.000033104694,"about_ca_topic_score_gemma":3.268762e-7,"teacher_disagreement_score":0.92670304,"about_ca_system_score_codex":0.000033925226,"about_ca_system_score_gemma":0.0000368643,"threshold_uncertainty_score":0.5349411},"labels":[],"label_agreement":null},{"id":"W74151279","doi":"","title":"Lookahead pathologies for single agent search","year":2003,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Heuristic; Beam search; Action (physics); Mathematical optimization; Consistent heuristic; Computer science; Combinatorial search; Bidirectional search; Function (biology); Search algorithm; Best-first search; Space (punctuation); Null-move heuristic; Mathematics; Algorithm","score_opus":0.1444823188447444,"score_gpt":0.341990576317308,"score_spread":0.1975082574725636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74151279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013871982,0.00007885034,0.9521549,0.00060530193,0.0003689388,0.00020100772,6.114809e-7,0.00020716953,0.032511245],"genre_scores_gemma":[0.7706672,0.000005250695,0.22652644,0.00034203546,0.000022652464,0.000024699026,2.9398896e-7,0.0000057042826,0.0024056977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906975,0.00004943804,0.00015310195,0.0002758285,0.00015001284,0.00030186315],"domain_scores_gemma":[0.9992293,0.00020680913,0.000020659189,0.00039347523,0.00009772032,0.000052014682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036729855,0.00007920354,0.00008624064,0.000050332324,0.00009757904,0.00013449791,0.0005074256,0.000040501574,0.00005433887],"category_scores_gemma":[0.0002439367,0.000065138775,0.00005543786,0.00015768831,0.00006545399,0.00021637203,0.000092374554,0.00004954055,0.00022912202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002680926,0.00012921027,0.00044528753,0.000009219249,0.000005891307,0.000013382776,0.001054887,0.00037025157,0.017112596,0.8528564,0.0028381252,0.1251621],"study_design_scores_gemma":[0.000050892293,0.00024815637,0.00006734909,0.0000058100563,0.0000018679312,0.000018632005,0.00048109906,0.010466419,0.8953219,0.06060301,0.03254101,0.0001938161],"about_ca_topic_score_codex":0.000010097025,"about_ca_topic_score_gemma":0.000009767574,"teacher_disagreement_score":0.87820935,"about_ca_system_score_codex":0.000033643122,"about_ca_system_score_gemma":0.000041834388,"threshold_uncertainty_score":0.29449764},"labels":[],"label_agreement":null},{"id":"W790901608","doi":"","title":"A world record at an Atlantic City casino and the distribution of the length of the crapshooter's hand","year":2009,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Las vegas; Dice; History; Event (particle physics); Distribution (mathematics); Genealogy; Geography; Operations research; Archaeology; Statistics; Engineering; Mathematics; Physics","score_opus":0.054777339805537874,"score_gpt":0.1931072656510646,"score_spread":0.13832992584552672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W790901608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96224844,0.000016902128,0.036371794,0.0006622343,0.0001403997,0.00017142922,0.0000039144766,0.000014823128,0.00037004074],"genre_scores_gemma":[0.99940085,0.00001971356,0.000039323928,0.00008366027,0.000015849371,1.199652e-7,5.4146483e-7,0.0000020886803,0.00043786236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991386,0.00021322617,0.00015125258,0.00025703182,0.00008799146,0.00015187681],"domain_scores_gemma":[0.99878144,0.00015889734,0.00018636679,0.0007474837,0.000086746695,0.000039049402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025949796,0.00009556165,0.00013651323,0.000031382075,0.00031793164,0.00003695514,0.0010696993,0.000037172467,0.000008044342],"category_scores_gemma":[0.00006121623,0.000053909316,0.00009952117,0.0006906432,0.00068485446,0.00024477905,0.00034226713,0.000120520934,0.00000188029],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003099711,0.00022124672,0.31293568,0.00001707223,0.00005762124,0.000016495353,0.003115414,0.0053351335,0.0013999024,0.6648313,0.00038442665,0.011375739],"study_design_scores_gemma":[0.0007948507,0.00022192903,0.50451803,0.00012466777,0.00013447648,0.000019993447,0.00038376747,0.32047004,0.044017404,0.12771888,0.0012368767,0.00035910288],"about_ca_topic_score_codex":0.0005237181,"about_ca_topic_score_gemma":0.0017677911,"teacher_disagreement_score":0.5371124,"about_ca_system_score_codex":0.000053359196,"about_ca_system_score_gemma":0.00003356207,"threshold_uncertainty_score":0.2523375},"labels":[],"label_agreement":null},{"id":"W806588681","doi":"10.1007/978-3-319-19066-2_4","title":"Novel AI Strategies for Multi-Player Games at Intermediate Board States","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Heuristic; Variety (cybernetics); State (computer science); Sequential game; Field (mathematics); Process (computing); Theoretical computer science; Game theory; Artificial intelligence; Mathematical economics; Algorithm; Mathematics; Programming language","score_opus":0.0723738106742477,"score_gpt":0.3273671183907746,"score_spread":0.2549933077165269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W806588681","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021861763,0.0006635786,0.9927295,0.0009364868,0.0037511862,0.0008289022,0.00004642134,0.00029679388,0.00052855036],"genre_scores_gemma":[0.07800259,0.000076561366,0.9153326,0.0034068157,0.0009565376,0.00008822702,0.000026955382,0.00011764713,0.0019920408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461955,0.00003063401,0.0008975853,0.0021249386,0.0011734025,0.0011538774],"domain_scores_gemma":[0.99589574,0.00077605265,0.0004631308,0.0016030936,0.0009175111,0.00034446694],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011510977,0.0008422658,0.0008040332,0.0008208834,0.0003205065,0.0013282102,0.004921059,0.00045709792,0.000037901063],"category_scores_gemma":[0.00021806567,0.000746357,0.00023700023,0.00043245265,0.0015959465,0.001518206,0.0024734684,0.0007931803,0.00013965428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061271596,0.00013964123,0.00008294943,0.00013339268,0.000056281024,0.00008297896,0.008479811,0.15718754,0.0012772158,0.061939023,0.001360749,0.76919913],"study_design_scores_gemma":[0.0002449523,0.0002852731,0.000024012583,0.0002559265,0.000010658647,0.000034444438,0.0000035977225,0.7734397,0.003860123,0.21281162,0.008181863,0.0008478136],"about_ca_topic_score_codex":0.000089067,"about_ca_topic_score_gemma":0.0010618955,"teacher_disagreement_score":0.7683513,"about_ca_system_score_codex":0.00072366686,"about_ca_system_score_gemma":0.0012711491,"threshold_uncertainty_score":0.99970853},"labels":[],"label_agreement":null},{"id":"W81393103","doi":"","title":"On wins in round robin tournaments.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics; Combinatorics","score_opus":0.02188326442882334,"score_gpt":0.2799370934631654,"score_spread":0.2580538290343421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81393103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808433,0.00009463364,0.0027057815,0.0030594044,0.0021399362,0.00018856599,4.986125e-7,0.00014638944,0.010821475],"genre_scores_gemma":[0.9966131,0.000012595379,0.0020150165,0.0008312831,0.000016028602,0.000013340381,5.232849e-7,0.000010523709,0.0004875976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864525,0.00006635527,0.00029448312,0.00034556937,0.00030022656,0.00034813845],"domain_scores_gemma":[0.9990877,0.00015150405,0.00007170022,0.0005587113,0.000041768293,0.00008861366],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029824345,0.00014073224,0.00015193553,0.00015024624,0.00007725951,0.00015782214,0.0009832387,0.00009893494,0.00005087835],"category_scores_gemma":[0.00008951814,0.00014169754,0.000048696096,0.0004147999,0.00003937531,0.0006090297,0.00018160253,0.00032433745,0.0008280942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000485411,0.00022811168,0.0009978446,0.0000011852102,0.000004574719,0.00001907226,0.0006903027,0.0008859829,0.00022458617,0.9651773,0.0017925979,0.029973619],"study_design_scores_gemma":[0.00032681873,0.00021234898,0.0027186922,0.000048911963,0.0000020152834,0.000006239046,0.0000533567,0.023020629,0.013535929,0.94868594,0.01108357,0.0003055616],"about_ca_topic_score_codex":0.000072680734,"about_ca_topic_score_gemma":0.0000647583,"teacher_disagreement_score":0.029668057,"about_ca_system_score_codex":0.0002554125,"about_ca_system_score_gemma":0.0000515267,"threshold_uncertainty_score":0.9999499},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11313530516049855,"score_gpt":0.3519815830720948,"score_spread":0.23884627791159627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84074851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009182752,0.000025369576,0.98632205,0.0012895351,0.0002268213,0.00015889028,3.239008e-7,0.00020476014,0.00258948],"genre_scores_gemma":[0.90894943,0.0000011044834,0.0897879,0.00065169646,0.00007709032,0.000017373592,2.937618e-7,0.0000029115395,0.0005121716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993393,0.000011203744,0.0001665041,0.00020562352,0.0001053265,0.00017204233],"domain_scores_gemma":[0.99950016,0.000111173875,0.000040948806,0.00024461863,0.00005982759,0.00004330221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011736233,0.00007146821,0.00007502855,0.00004928817,0.0000924935,0.00014776239,0.00038781532,0.000031032436,0.0000050442286],"category_scores_gemma":[0.000097322074,0.00006411452,0.000036788482,0.000103125836,0.00001305576,0.0006708519,0.000026772246,0.000034348508,0.000044464065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017649756,0.00007081167,0.00017056403,0.000005724485,0.0000058514156,0.000014629079,0.0046216054,0.01487786,0.0017204672,0.18993464,0.005240322,0.7833199],"study_design_scores_gemma":[0.00004029629,0.0002653381,0.00022996546,0.000012174703,0.0000023853117,0.0000033677982,0.0001739778,0.9214515,0.013969151,0.060966067,0.0027434523,0.00014229688],"about_ca_topic_score_codex":0.000003864879,"about_ca_topic_score_gemma":0.0000037380255,"teacher_disagreement_score":0.90657365,"about_ca_system_score_codex":0.000016113338,"about_ca_system_score_gemma":0.000019760566,"threshold_uncertainty_score":0.26145142},"labels":[],"label_agreement":null},{"id":"W857330509","doi":"10.1609/aaai.v26i1.8447","title":"Interactive Narrative: A Novel Application of Artificial Intelligence for Computer 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":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Narrative; Computer science; Action (physics); Storytelling; Computer game; Game mechanics; Context (archaeology); Interactive storytelling; Multimedia; Character (mathematics); Video game design; Artificial intelligence; Metagaming; Human–computer interaction; Simultaneous game; Non-cooperative game; Game theory; Art","score_opus":0.080795233509761,"score_gpt":0.3375106080337602,"score_spread":0.2567153745239992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W857330509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037255906,0.00003843128,0.9555289,0.0038364974,0.00096104847,0.0010662414,0.00003177013,0.00011453382,0.0011666603],"genre_scores_gemma":[0.9154703,0.000026512953,0.08369236,0.0002685391,0.00021948716,0.0001789824,0.0000035164992,0.00003087164,0.00010943206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956253,0.000050148752,0.0017131439,0.0011869243,0.0008154587,0.00060899515],"domain_scores_gemma":[0.9931977,0.000740048,0.0012830613,0.00078951305,0.003839095,0.00015057654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085695024,0.00047871392,0.00070402067,0.00026948968,0.00032813204,0.00034408947,0.0030283032,0.00021915603,0.00006850911],"category_scores_gemma":[0.0012314338,0.00040860957,0.00042071313,0.0015832825,0.00078718853,0.00083338015,0.0008252199,0.0004809543,0.00005405656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012170593,0.00049294246,0.000040170038,0.000070192116,0.00004494949,4.314144e-7,0.005671228,0.00065469125,0.12371763,0.6378104,0.00006449314,0.23131117],"study_design_scores_gemma":[0.0000132863715,0.0002346961,0.000029852545,0.00019005818,0.000017901006,0.0000076136757,0.0028127197,0.2658023,0.5570595,0.17346688,0.00011890134,0.00024627763],"about_ca_topic_score_codex":0.000063398526,"about_ca_topic_score_gemma":0.000059021313,"teacher_disagreement_score":0.8782144,"about_ca_system_score_codex":0.000116618496,"about_ca_system_score_gemma":0.00036374398,"threshold_uncertainty_score":0.99983656},"labels":[],"label_agreement":null},{"id":"W93696524","doi":"10.1007/978-0-85729-341-1_11","title":"2006: Deep Fritz Clobbers Kramnik, 4–2","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Deep blue; Artificial intelligence; Set (abstract data type); Computer science; Art; History; Art history; Programming language","score_opus":0.04872673361901866,"score_gpt":0.2547742613215162,"score_spread":0.20604752770249754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93696524","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.000503e-7,0.0003791286,0.33202884,0.00020699424,0.0009514028,0.00015154845,0.000002658026,0.00033412236,0.66594464],"genre_scores_gemma":[0.0006628857,0.00018725859,0.038207408,0.0010769136,0.00031248483,0.0000088121205,0.000004099682,0.00005515726,0.959485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977827,0.000015835309,0.0005101888,0.0008032906,0.0004507585,0.0004372287],"domain_scores_gemma":[0.9978852,0.00010655039,0.00021720436,0.0014134428,0.00017969463,0.00019786511],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001996476,0.00043579275,0.00037842747,0.00021332726,0.00010808038,0.00017687878,0.002294897,0.00046600163,0.0046719527],"category_scores_gemma":[0.000025864576,0.00039913956,0.00024382272,0.000053559444,0.00020827343,0.00037027983,0.00062873453,0.0004641332,0.01267687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016563422,0.00000977592,0.0000034935947,0.00000540368,0.000028385164,0.00003864656,0.0003075467,0.000004641767,0.0000036074214,0.8484051,0.015144554,0.13604715],"study_design_scores_gemma":[0.000015997513,0.000052287898,0.0000019083307,0.00003494351,0.000012734327,0.000013244313,0.0000065314052,0.0010348273,0.00083797006,0.4383271,0.5592045,0.00045792718],"about_ca_topic_score_codex":0.0001701603,"about_ca_topic_score_gemma":0.00026355512,"teacher_disagreement_score":0.54406,"about_ca_system_score_codex":0.000076218545,"about_ca_system_score_gemma":0.00010257581,"threshold_uncertainty_score":0.99984604},"labels":[],"label_agreement":null},{"id":"W99943456","doi":"","title":"Dynamic control in path-planning with real-time heuristic search","year":2007,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Incremental heuristic search; Heuristic; Motion planning; Computation; Consistent heuristic; Path (computing); Mathematical optimization; Bidirectional search; Bounded function; Search algorithm; Quality (philosophy); Constant (computer programming); Control (management); Any-angle path planning; Beam search; Algorithm; Artificial intelligence; Mathematics; Robot","score_opus":0.016793368778764268,"score_gpt":0.30120179756224896,"score_spread":0.2844084287834847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99943456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2026951,0.000019542944,0.7835827,0.00022579798,0.00005141562,0.00014908488,4.3259723e-7,0.0001530736,0.013122868],"genre_scores_gemma":[0.9623335,0.0000028233862,0.036622748,0.00017270412,0.000015135043,0.000004039846,6.2313353e-7,0.000009312598,0.00083911006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985572,0.000051190225,0.00026492673,0.0003367505,0.00031101546,0.00047890565],"domain_scores_gemma":[0.99897355,0.00043351052,0.000039017963,0.00038055854,0.00007561052,0.000097754586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089078775,0.00011644306,0.00015624614,0.00017349712,0.00006043663,0.000092452334,0.00058401213,0.00004934595,0.000050271577],"category_scores_gemma":[0.000040831175,0.00009207935,0.000021635557,0.0004592168,0.00007747555,0.00024731067,0.000077619174,0.0001635461,0.00032422887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007468051,0.00094814174,0.29728502,0.00009488113,0.00012106623,0.0077967574,0.021988349,0.0752256,0.086859725,0.16876897,0.0018228828,0.33834177],"study_design_scores_gemma":[0.00019033573,0.00020267123,0.02349346,0.000054978904,0.0000024442022,0.0000331213,0.00027722536,0.97145706,0.0023116234,0.0016363967,0.000103520084,0.0002371582],"about_ca_topic_score_codex":0.00041758915,"about_ca_topic_score_gemma":0.00015196629,"teacher_disagreement_score":0.8962315,"about_ca_system_score_codex":0.000082938066,"about_ca_system_score_gemma":0.00006644829,"threshold_uncertainty_score":0.4167414},"labels":[],"label_agreement":null}]}